Carnation (Dianthus caryophylus L.).

PubMed

Nontaswatsri, Chalermsri; Fukai, Seiichi

2006-01-01

Carnation is a valuable crop for the cut flower industry and demand for new and improved varieties is growing. However, genetic transformation of carnations is currently limited because of a lack of efficient routine technique. In this chapter, we present an easy and effective protocol for gene transfer to carnation node explants and subsequent adventitious shoot regeneration. For high-adventitious shoot regeneration, node explants from first to third node of 5- to 8-cm long shoots were cultured on Murashige and Skoog (MS) medium, containing 1.0 mg/Lthidiazuron (TDZ), 0.1 mg/L alpha-napthalenoacetic acid (NAA), 20 g/L sucrose, and 2 g/L Gellan gum for 10 d. Then the explants were cut into 8 radial segments and subcultured onto MS medium, containing 1.0 mg/L BA, 0.1 mg/L NAA, 20 g/L sucrose and 2 g/L Gellan Gum. For effective genetic transformation, 3- to 5-d precultured node explants were submerged in an Agrobacerium suspension for 10 min, then cocultivated on filter paper soaked with water and 50 microM acetosyringone (AS). After cocultivation, the explants were cut into eight radial segments and subcultured onto selection medium until transformed shoots regenerated from the explants.

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

PubMed

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

2017-10-01

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

MIP models for connected facility location: A theoretical and computational study☆

PubMed Central

Gollowitzer, Stefan; Ljubić, Ivana

2011-01-01

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%. PMID:25009366

Ivanishin trims his hair in the Node 3

NASA Image and Video Library

2011-12-18

ISS030-E-012662 (18 Dec. 2011) --- Russian cosmonaut Anatoly Ivanishin, Expedition 30 flight engineer, trims his hair in the Tranquility node of the International Space Station. Ivanishin used hair clippers fashioned with a vacuum device to garner freshly cut hair.

CA19-9 serum levels predict micrometastases in patients with gastric cancer

PubMed Central

Potrc, Stojan; Mis, Katarina; Plankl, Mojca; Mars, Tomaz

2016-01-01

Abstract Background We explored the prognostic value of the up-regulated carbohydrate antigen (CA19-9) in node-negative patients with gastric cancer as a surrogate marker for micrometastases. Patients and methods Micrometastases were determined using reverse transcription quantitative polymerase chain reaction (RT-qPCR) for a subgroup of 30 node-negative patients. This group was used to determine the cut-off for preoperative CA19-9 serum levels as a surrogate marker for micrometastases. Then 187 node-negative T1 to T4 patients were selected to validate the predictive value of this CA19-9 threshold. Results Patients with micrometastases had significantly higher preoperative CA19-9 serum levels compared to patients without micrometastases (p = 0.046). CA19-9 serum levels were significantly correlated with tumour site, tumour diameter, and perineural invasion. Although not reaching significance, subgroup analysis showed better five-year survival rates for patients with CA19-9 serum levels below the threshold, compared to patients with CA19-9 serum levels above the cut-off. The cumulative survival for T2 to T4 node-negative patients was significantly better with CA19-9 serum levels below the cut-off (p = 0.04). Conclusions Preoperative CA19-9 serum levels can be used to predict higher risk for haematogenous spread and micrometastases in node-negative patients. However, CA19-9 serum levels lack the necessary sensitivity and specificity to reliably predict micrometastases. PMID:27247553

ILP-based co-optimization of cut mask layout, dummy fill, and timing for sub-14nm BEOL technology

NASA Astrophysics Data System (ADS)

Han, Kwangsoo; Kahng, Andrew B.; Lee, Hyein; Wang, Lutong

2015-10-01

Self-aligned multiple patterning (SAMP), due to its low overlay error, has emerged as the leading option for 1D gridded back-end-of-line (BEOL) in sub-14nm nodes. To form actual routing patterns from a uniform "sea of wires", a cut mask is needed for line-end cutting or realization of space between routing segments. Constraints on cut shapes and minimum cut spacing result in end-of-line (EOL) extensions and non-functional (i.e. dummy fill) patterns; the resulting capacitance and timing changes must be consistent with signoff performance analyses and their impacts should be minimized. In this work, we address the co-optimization of cut mask layout, dummy fill, and design timing for sub-14nm BEOL design. Our central contribution is an optimizer based on integer linear programming (ILP) to minimize the timing impact due to EOL extensions, considering (i) minimum cut spacing arising in sub-14nm nodes; (ii) cut assignment to different cut masks (color assignment); and (iii) the eligibility to merge two unit-size cuts into a bigger cut. We also propose a heuristic approach to remove dummy fills after the ILP-based optimization by extending the usage of cut masks. Our heuristic can improve critical path performance under minimum metal density and mask density constraints. In our experiments, we study the impact of number of cut masks, minimum cut spacing and metal density under various constraints. Our studies of optimized cut mask solutions in these varying contexts give new insight into the tradeoff of performance and cost that is afforded by cut mask patterning technology options.

Rapid detection of metastatic melanoma in lymph nodes using proton magnetic resonance spectroscopy of fine needle aspiration biopsy specimens.

PubMed

Lean, Cynthia L; Bourne, Roger; Thompson, John F; Scolyer, Richard A; Stretch, Jonathan; Li, Ling-Xi Lawrence; Russell, Peter; Mountford, Carolyn

2003-06-01

Accurate staging of patients with primary cutaneous melanoma includes assessment of regional lymph nodes for the presence of micrometastatic disease. Sentinel lymph node biopsy is highly accurate but is an invasive surgical procedure with a 5-10% complication rate, and requires labour-intensive and expensive histological examination to identify disease. A rapid, accurate and cost-effective non-surgical technique able to detect micrometastatic deposits of melanoma in regional lymph nodes would be of great benefit. Fine needle aspiration biopsies and tissue specimens were obtained from lymph nodes from 18 patients undergoing node resection for metastatic melanoma and five patients undergoing radical retropubic prostatectomy. One-dimensional proton magnetic resonance spectroscopy was undertaken at 360 MHz (8.5 T). Lymph nodes were cut into 3 mm thick slices and embedded. Four sequential 5 microm tissue sections were cut from each block and stained, with haematoxylin and eosin, for S100 protein, for HMB45, and again with haematoxylin and eosin, respectively. Proton magnetic resonance spectroscopy distinguished between benign and malignant lymph node tissue (P < 0.001, separate t-test) and benign and malignant lymph node fine needle aspiration biopsy (P < 0.012) based on the ratio of the integrals of resonances from lipid/other metabolites (1.8-2.5 p.p.m. region) and 'choline' (3.1-3.3 p.p.m. region). In conclusion, one-dimensional proton magnetic resonance spectroscopy on a simple fine needle aspiration biopsy can distinguish lymph nodes containing metastatic melanoma from uninvolved nodes, providing a rapid, accurate and cost-effective non-surgical technique to assess regional lymph nodes in patients with melanoma.

Kuipers trims his hair in the Node 3

NASA Image and Video Library

2011-12-30

ISS030-E-033523 (30 Dec. 2011) --- European Space Agency astronaut Andre Kuipers, Expedition 30 flight engineer, trims his hair in the Tranquility node of the International Space Station. Kuipers used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Whitson gives Tani a haircut in Node 2

NASA Image and Video Library

2007-12-01

ISS016-E-014192 (1 Dec. 2007) --- Astronaut Peggy A. Whitson, Expedition 16 commander, trims astronaut Daniel Tani's hair in the Harmony node of the International Space Station. Whitson used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Whitson gives Tani a haircut in Node 2

NASA Image and Video Library

2007-12-01

ISS016-E-014193 (1 Dec. 2007) --- Astronaut Peggy A. Whitson, Expedition 16 commander, trims astronaut Daniel Tani's hair in the Harmony node of the International Space Station. Whitson used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Kuipers trims his hair in the Node 3

NASA Image and Video Library

2011-12-30

ISS030-E-033548 (30 Dec. 2011) --- European Space Agency astronaut Andre Kuipers, Expedition 30 flight engineer, trims his hair in the Tranquility node of the International Space Station. Kuipers used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Reiter cuts Tyurins hair in the Zvezda Service module

NASA Image and Video Library

2006-11-05

ISS014-E-07174 (5 Nov. 2006) --- European Space Agency (ESA) astronaut Thomas Reiter, Expedition 14 flight engineer, cuts the hair of cosmonaut Mikhail Tyurin, flight engineer representing Russia's Federal Space Agency, in the Unity node of the International Space Station. Reiter used hair clippers fashioned with a vacuum device to prevent freshly cut hair from being scattered throughout the module.

Creamer gives Skvortsov a Haircut in Node 2

NASA Image and Video Library

2010-05-09

ISS023-E-036484 (9 May 2010) --- NASA astronaut T.J. Creamer, Expedition 23 flight engineer, trims Russian cosmonaut Alexander Skvortsov's hair in the Harmony node of the International Space Station. Creamer used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Creamer gives Skvortsov a Haircut in Node 2

NASA Image and Video Library

2010-05-09

ISS023-E-036485 (9 May 2010) --- NASA astronaut T.J. Creamer, Expedition 23 flight engineer, trims Russian cosmonaut Alexander Skvortsov's hair in the Harmony node of the International Space Station. Creamer used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Hair cut

NASA Image and Video Library

2012-11-10

ISS033-E-018991 (10 Nov. 2012) --- Russian cosmonaut Oleg Novitskiy, Expedition 33 flight engineer, trims the hair of Russian cosmonaut Evgeny Tarelkin, flight engineer, in the Tranquility node of the International Space Station. Novitskiy used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Identifying failure in a tree network of a parallel computer

DOEpatents

Archer, Charles J.; Pinnow, Kurt W.; Wallenfelt, Brian P.

2010-08-24

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

Burbank trims Shkaplero's hair in the Node 3

NASA Image and Video Library

2011-12-18

ISS030-E-012660 (18 Dec. 2011) --- NASA astronaut Dan Burbank, Expedition 30 commander, trims the hair of Russian cosmonaut Anton Shkaplerov, flight engineer, in the Tranquility node of the International Space Station. Burbank used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Burbank trims Shkaplerov's hair in the Node 3

NASA Image and Video Library

2012-03-18

ISS030-E-161707 (18 March 2012) --- NASA astronaut Dan Burbank, Expedition 30 commander, trims the hair of Russian cosmonaut Anton Shkaplerov, flight engineer, in the Tranquility node of the International Space Station. Burbank used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Shkaplerov trims Burbank's hair in the Node 3

NASA Image and Video Library

2011-12-18

ISS030-E-012655 (18 Dec. 2011) --- Russian cosmonaut Anton Shkaplerov, Expedition 30 flight engineer, trims the hair of NASA astronaut Dan Burbank, commander, in the Tranquility node of the International Space Station. Shkaplerov used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Whitson gives Tani a haircut in Node 2

NASA Image and Video Library

2007-12-30

ISS016-E-019457 (30 Dec. 2007) --- Astronaut Daniel Tani, Expedition 16 flight engineer, trims his hair in the Harmony node of the International Space Station. Tani used hair clippers fashioned with a vacuum device to garner freshly cut hair. Astronaut Peggy Whitson, commander, assisted Tani.

System for solving diagnosis and hitting set problems

NASA Technical Reports Server (NTRS)

Vatan, Farrokh (Inventor); Fijany, Amir (Inventor)

2007-01-01

The diagnosis problem arises when a system's actual behavior contradicts the expected behavior, thereby exhibiting symptoms (a collection of conflict sets). System diagnosis is then the task of identifying faulty components that are responsible for anomalous behavior. To solve the diagnosis problem, the present invention describes a method for finding the minimal set of faulty components (minimal diagnosis set) that explain the conflict sets. The method includes acts of creating a matrix of the collection of conflict sets, and then creating nodes from the matrix such that each node is a node in a search tree. A determination is made as to whether each node is a leaf node or has any children nodes. If any given node has children nodes, then the node is split until all nodes are leaf nodes. Information gathered from the leaf nodes is used to determine the minimal diagnosis set.

Chamitoff gives Volkov a haircut in the Node 2 during Expedition 17

NASA Image and Video Library

2008-07-20

ISS017-E-011556 (20 July 2008) --- NASA astronaut Greg Chamitoff, Expedition 17 flight engineer, trims Russian Federal Space Agency cosmonaut Sergei Volkov's hair in the Harmony node of the International Space Station. Chamitoff used hair clippers fashioned with a vacuum device to garner freshly cut hair.

View of Expedition 28 Crew Members giving and receiving a haircut in the Node 3

NASA Image and Video Library

2011-07-31

ISS028-E-019487 (31 July 2011) --- NASA astronaut Ron Garan, Expedition 28 flight engineer, trims astronaut Mike Fossum?s hair in the Tranquility node of the International Space Station. Garan used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Volkov gives Chamitoff a haircut in the Node 2 during Expedition 17

NASA Image and Video Library

2008-07-20

ISS017-E-011547 (20 July 2008) --- Russian Federal Space Agency cosmonaut Sergei Volkov, Expedition 17 commander, trims NASA astronaut Greg Chamitoff's hair in the Harmony node of the International Space Station. Volkov used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Tani trims his hair in Node 2

NASA Image and Video Library

2008-02-10

S122-E-007645 (10 Feb. 2008) --- Astronaut Daniel Tani, Expedition 16 flight engineer, trims his hair in the Harmony node of the International Space Station while Space Shuttle Atlantis is docked with the station. Tani used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Tani trims his hair in Node 2

NASA Image and Video Library

2008-02-10

S122-E-007643 (10 Feb. 2008) --- Astronaut Daniel Tani, Expedition 16 flight engineer, trims his hair in the Harmony node of the International Space Station while Space Shuttle Atlantis is docked with the station. Tani used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Efficient propagation of citrus rootstocks by stem cuttings

USDA-ARS?s Scientific Manuscript database

A simple multicomponent system is described that is effective for rapid propagation of a diversity of citrus rootstock genotypes by single node cuttings, including new hybrids and those that are most commonly used as rootstocks. Efficiency of this system for rooting shoot explants of six important r...

Blackberry propagation by non-leafy floricane cuttings

USDA-ARS?s Scientific Manuscript database

Propagation of 1- or 2-node hardwood cuttings from blackberry (Rubus sp.) floricanes can be an efficient and reliable source of rooted transplants but consistent rooting is needed. Floricanes were collected from 9-year-old ‘Triple Crown’ and ‘Siskiyou’ plants on 5 November 2009, 3 December 2009, an...

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.

Integrated manufacturing flow for selective-etching SADP/SAQP

NASA Astrophysics Data System (ADS)

Ali, Rehab Kotb; Fatehy, Ahmed Hamed; Word, James

2018-03-01

Printing cut mask in SAMP (Self Aligned Multi Patterning) is very challenging at advanced nodes. One of the proposed solutions is to print the cut shapes selectively. Which means the design is decomposed into mandrel tracks, Mandrel cuts and non-Mandrel cuts. The mandrel and non-Mandrel cuts are mutually independent which results in relaxing spacing constrains and as a consequence more dense metal lines. In this paper, we proposed the manufacturing flow of selective etching process. The results are quantified in terms of measuring PVBand, EPE and the number of hard bridging and pinching across the layout.

The value of naked eye examination of biopsied lymph nodes in the diagnosis of tuberculous lymphadenitis.

PubMed

Bem, C

1996-01-01

Tuberculous lymphadenitis is common in Central Africa, where diagnosis by histological examination of a biopsied node is often delayed. In the present study, the naked eye appearance of the cut surface of 306 consecutive biopsied lymph nodes was compared with the histological diagnosis. One hundred and eight-eight nodes showed tuberculosis on histology (including two with coexisting second pathology). One hundred and forty-eight (79%) cases of tuberculous lymphadenitis (including both with coexisting second pathology) showed noncaseating tuberculomata or caseation visible on naked eye examination. Such signs were not seen in other nodes. Other signs were seen in another 18 (10%) tuberculous nodes. It is concluded that naked eye examination of nodes provides useful information for the diagnosis of tuberculous lymphadenitis, pending confirmation by histology.

The value of preoperative 18F-FDG PET/CT for the assessing contralateral neck in head and neck cancer patients with unilateral node metastasis (N1-3).

PubMed

Joo, Y-H; Yoo, I-R; Cho, K-J; Park, J-O; Nam, I-C; Kim, C-S; Kim, S-Y; Kim, M-S

2014-12-01

The purpose of this study was to determine whether preoperative (18) F-FDG PET/CT is useful in assessing contralateral lymph node metastasis in the neck. A retrospective review of medical records was performed. Patients treated at a single institute. One hundred and fifty-seven patients whose pathology results were positive for unilateral node metastasis (N1-3) involvement and underwent preoperative (18) F-FDG PET/CT for head and neck squamous cell carcinoma (HNSCC) were reviewed. Prognostic factors and nodal SUVmax were studied to identify the risk of contralateral disease. Thirty-six (22.9%) patients had contralateral cervical lymph node metastases. The (18) F-FDG PET/CT had a sensitivity of 80% and a specificity of 96% in identifying the contralateral cervical lymph node metastases on a level-by-level basis. The median SUVmax values of the ipsilateral and contralateral lymph nodes were 3.99 ± 3.36 (range, 0-20.4) and 2.94 ± 2.04 (range, 0-8.7), respectively (P = 0.001). There was a significant difference in the median SUVmax of contralateral nodes between the benign and malignant cervical lymph nodes (2.31 ± 0.62 versus 3.28 ± 2.43, P = 0.014). The cut-off value of contralateral median SUVmax in the context of contralateral cervical metastasis was 2.5 with the sensitivity of 75% and the specificity of 94%. A median contralateral lymph node SUVmax  ≥ 2.5 was associated with 5-year disease-specific survival (P = 0.038). (18) F-FDG PET/CT median SUVmax cut-off values of contralateral lymph nodes ≥2.5 were associated with contralateral cervical lymph node metastases and 5-year disease-specific survival in HNSCC patients with unilateral metastases. © 2014 John Wiley & Sons Ltd.

Hair cut

NASA Image and Video Library

2012-11-10

ISS033-E-018986 (10 Nov. 2012) --- Russian cosmonaut Evgeny Tarelkin, Expedition 33 flight engineer, trims the hair of Russian cosmonaut Oleg Novitskiy, flight engineer, in the Tranquility node of the International Space Station. Tarelkin used hair clippers fashioned with a vacuum device to garner freshly cut hair. NASA astronaut Kevin Ford, flight engineer, is visible in the background.

CPU-GPU mixed implementation of virtual node method for real-time interactive cutting of deformable objects using OpenCL.

PubMed

Jia, Shiyu; Zhang, Weizhong; Yu, Xiaokang; Pan, Zhenkuan

2015-09-01

Surgical simulators need to simulate interactive cutting of deformable objects in real time. The goal of this work was to design an interactive cutting algorithm that eliminates traditional cutting state classification and can work simultaneously with real-time GPU-accelerated deformation without affecting its numerical stability. A modified virtual node method for cutting is proposed. Deformable object is modeled as a real tetrahedral mesh embedded in a virtual tetrahedral mesh, and the former is used for graphics rendering and collision, while the latter is used for deformation. Cutting algorithm first subdivides real tetrahedrons to eliminate all face and edge intersections, then splits faces, edges and vertices along cutting tool trajectory to form cut surfaces. Next virtual tetrahedrons containing more than one connected real tetrahedral fragments are duplicated, and connectivity between virtual tetrahedrons is updated. Finally, embedding relationship between real and virtual tetrahedral meshes is updated. Co-rotational linear finite element method is used for deformation. Cutting and collision are processed by CPU, while deformation is carried out by GPU using OpenCL. Efficiency of GPU-accelerated deformation algorithm was tested using block models with varying numbers of tetrahedrons. Effectiveness of our cutting algorithm under multiple cuts and self-intersecting cuts was tested using a block model and a cylinder model. Cutting of a more complex liver model was performed, and detailed performance characteristics of cutting, deformation and collision were measured and analyzed. Our cutting algorithm can produce continuous cut surfaces when traditional minimal element creation algorithm fails. Our GPU-accelerated deformation algorithm remains stable with constant time step under multiple arbitrary cuts and works on both NVIDIA and AMD GPUs. GPU-CPU speed ratio can be as high as 10 for models with 80,000 tetrahedrons. Forty to sixty percent real-time performance and 100-200 Hz simulation rate are achieved for the liver model with 3,101 tetrahedrons. Major bottlenecks for simulation efficiency are cutting, collision processing and CPU-GPU data transfer. Future work needs to improve on these areas.

Yurchikhin gives Kotov a haircut in the Node 1 during Expedition 15

NASA Image and Video Library

2007-05-13

ISS015-E-07565 (13 May 2007) --- Cosmonaut Fyodor N. Yurchikhin, Expedition 15 commander, trims cosmonaut Oleg V. Kotov's hair in the Unity node of the International Space Station. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair. Kotov, flight engineer, and Yurchikhin represent Russia's Federal Space Agency.

Yurchikhin gives Kotov a haircut in the Node 1 during Expedition 15

NASA Image and Video Library

2007-05-13

ISS015-E-07566 (13 May 2007) --- Cosmonaut Fyodor N. Yurchikhin, Expedition 15 commander, trims cosmonaut Oleg V. Kotov's hair in the Unity node of the International Space Station. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair. Kotov, flight engineer, and Yurchikhin represent Russia's Federal Space Agency.

Crewmembers in the Node 1/Unity during Expedition 13

NASA Image and Video Library

2006-07-29

ISS013-E-62373 (29 July 2006) --- Astronaut Jeffrey N. Williams, Expedition 13 NASA space station science officer and flight engineer, trims astronaut Thomas Reiter's hair in the Unity node of the International Space Station. Williams used hair clippers fashioned with a vacuum device to garner freshly cut hair. Reiter, flight engineer, represents the European Space Agency (ESA).

[The role of preoperative (18)F-FDG PET-CT in lymphatic metastasis diagnosis of cutaneous malignant melanoma on extremities and trunk].

PubMed

Zhang, X X; Fang, Y; Xu, L B; Xu, S F; Zhao, Z G; Sun, C; Ma, P Q; Liu, T; Yu, S J; Zhang, W J

2018-05-23

Objective: To evaluate the clinical value of preoperative (18)F-Fludeoxyglucose ((18)F-FDG PET-CT) in lymphatic metastasis diagnosis of cutaneous melanoma on extremities and trunk. Methods: 112 patients with cutaneous melanoma pathologically of extremities and trunk from January 2006 to December 2016, who received (18)F-FDG PET-CT examination preoperatively, were retrospectively reviewed. The correlations between the maximal diameters of lymph nodes, the maximal standard uptake value (SUV) and the diagnostic impression grades of PET-CT examination, and the final pathological diagnosis were analyzed. The correlations between Breslow thickness of primary lesions and the diagnostic impression of PET-CT examination were also analyzed. All the above were analyzed with Receiver Operating Characteristic (ROC) curve to get the cut-off value. Based on the final results of pathological diagnosis of lymph nodes as the golden standard, the statistically significant indicators of ROC curve analysis were used to evaluate the diagnostic effect, as well as to calculate the sensitivity, specificity and accuracy. With gender, age, maximal diameter of lymph nodes, maximal SUV, diagnosis impressions, and Breslow thickness as the independent variables and pathological diagnosis results of lymph nodes as the dependent variable, two-class stepwise Logistic regression analysis was used to determine the independence of diagnostic indicators. ROC curve analysis and log rank test were used to analyze the relationship between Breslow thickness and patient survival. Results: To evaluate melanoma patients' lymph node status, the results of ROC curve analysis showed that the area under the curve of lymph node maximal diameter, maximal SUV, diagnosis impression of PET-CT examinations were 0.789, 0.786 and 0.816, respectively (all P <0.05). The cut-off values were 0.85 cm, 1.45 and 2.5, respectively. The sensitivity of the cut-off values to determine the status of lymph nodes in melanoma patients were 71.4%, 64.9% and 72.1% respectively, and the specificities were 85.2%, 88.7% and 87.0% respectively. Multivariate Logistic regression analysis showed that PET-CT diagnosis impressions had independent diagnostic significance for the lymph node status of melanoma patients ( OR =11.296, 95% CI : 2.550~50.033). The area under the curve of Breslow thickness evaluating PET-CT diagnostic impression is 0.664 ( P =0.042) and the cut-off value was 4.25 mm. The survival rate of the patients with Breslow thickness ≥ 4.25 mm was lower than that in the group <4.25 mm ( P =0.006). Conclusions: (18)F-FDG PET-CT can help to evaluate metastases and make treatment decisions for cutaneous melanoma of extremities and trunk, especially for patients whose primary lesion's Breslow thickness has reached more than 4.25 mm. For the patients whose maximal SUV of regional lymph node is higher than 1.45 and short diameter of the largest lymph node is larger than 0.85cm, the possibility of metastases should be considered.

A Graph Summarization Algorithm Based on RFID Logistics

NASA Astrophysics Data System (ADS)

Sun, Yan; Hu, Kongfa; Lu, Zhipeng; Zhao, Li; Chen, Ling

Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. The volume of data generated by a typical RFID application will be enormous as each item will generate a complete history of all the individual locations that it occupied at every point in time. The movement trails of such RFID data form gigantic commodity flowgraph representing the locations and durations of the path stages traversed by each item. In this paper, we use graph to construct a warehouse of RFID commodity flows, and introduce a database-style operation to summarize graphs, which produces a summary graph by grouping nodes based on user-selected node attributes, further allows users to control the hierarchy of summaries. It can cut down the size of graphs, and provide convenience for users to study just on the shrunk graph which they interested. Through extensive experiments, we demonstrate the effectiveness and efficiency of the proposed method.

Lopez-Alegria gives Tyurin a haircut in the Node 1 /Unity module

NASA Image and Video Library

2007-01-11

ISS014-E-11687 (11 Jan. 2007) --- Astronaut Michael E. Lopez-Alegria, Expedition 14 commander and NASA space station science officer, trims cosmonaut Mikhail Tyurin's hair in the Unity node of the International Space Station. Lopez-Alegria used hair clippers fashioned with a vacuum device to garner freshly cut hair. Tyurin, flight engineer, represents Russia's Federal Space Agency.

Comparative study of three sonoelastographic scores for differentiation between benign and malignant cervical lymph nodes.

PubMed

Lenghel, Lavinia Manuela; Botar Jid, Carolina; Bolboaca, Sorana D; Ciortea, Cristiana; Vasilescu, Dan; Baciut, Grigore; Dudea, Sorin M

2015-06-01

The aim of the study was to explore the diagnostic value of three different sonoelastographic scoring systems (labeled S1-S3) for the differentiation between benign and malignant cervical lymph nodes. The authors propose a six pattern scoring system of the elastographic images with pattern 1 - representing purely soft nodes, pattern 2 - predominantly soft nodes, pattern 3 - predominantly soft nodes with focal had area, pattern 4 - predominantly hard node, pattern 5 - entirely hard node and pattern 6 - node with necrosis. The sonoelastographic images of 50 benign and 70 malignant lymph nodes were assessed. The area under the ROC curve (AUROC) for the differentiation between benign vs. malignant and benign vs. metastatic nodes were analyzed for the three scoring systems. When all the malignant lymph nodes were considered, the S1 score showed an AUROC=0.873 (95%CI [0.805-0.918], where CI=confidence interval; p<0.001), sensibility (Se)=58.57%, and specificity (Sp)=96%. For S2 score the AUROC was 0.890 (95%CI [0.824-0.933], p<0.001), Se=92.86%, and Sp=72%. For S3 score, the AUROC was 0.852 (95%CI [0.778-0.902], p<0.001), Se=64.29%, and Sp=94%). When lymphomatous nodes were excluded, for S1 the AUROC was 0.884 (95%CI [0.809-0.932], p<0.001), Se=64%, and Sp=96%. For S2 the AUROC was 0.894 (95%CI [0.818-0.939], p<0.001), Se=92%, and Sp=72%. For S3, the AUROC was 0.856 (95%CI [0.771-0.911], p<0.001), Se=66%, and Sp=94%. In the S3 scoring system, setting the benign vs. malignant cut off at pattern 3 increases the sensibility (41-65%) with minimal loss of specificity (96-94%). From the gray-scale and Doppler criteria, changes of the nodular margins and the presence of the vessels in the cortical part of the lymph node showed both very high sensibility and specificity, the others criteria taken into account had either very good sensibility with low specificity or high specificity and low sensibility. Our study suggests that there are no significant differences between the three scoring systems in terms of overall diagnostic value. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Enabling Secure High-Performance Wireless Ad Hoc Networking

DTIC Science & Technology

2003-05-29

destinations, consuming energy and available bandwidth. An attacker may similarly create a routing black hole, in which all packets are dropped: by sending...of the vertex cut, for example by forwarding only routing packets and not data packets, such that the nodes waste energy forwarding packets to the...with limited resources, including network bandwidth and the CPU processing capacity, memory, and battery power ( energy ) of each individual node in the

Radical lymph node dissection and assessment: Impact on gallbladder cancer prognosis

PubMed Central

Liu, Gui-Jie; Li, Xue-Hua; Chen, Yan-Xin; Sun, Hui-Dong; Zhao, Gui-Mei; Hu, San-Yuan

2013-01-01

AIM: To investigate the lymph node metastasis patterns of gallbladder cancer (GBC) and evaluate the optimal categorization of nodal status as a critical prognostic factor. METHODS: From May 1995 to December 2010, a total of 78 consecutive patients with GBC underwent a radical resection at Liaocheng People’s Hospital. A radical resection was defined as removing both the primary tumor and the regional lymph nodes of the gallbladder. Demographic, operative and pathologic data were recorded. The lymph nodes retrieved were examined histologically for metastases routinely from each node. The positive lymph node count (PLNC) as well as the total lymph node count (TLNC) was recorded for each patient. Then the metastatic to examined lymph nodes ratio (LNR) was calculated. Disease-specific survival (DSS) and predictors of outcome were analyzed. RESULTS: With a median follow-up time of 26.50 mo (range, 2-132 mo), median DSS was 29.00 ± 3.92 mo (5-year survival rate, 20.51%). Nodal disease was found in 37 patients (47.44%). DSS of node-negative patients was significantly better than that of node-positive patients (median DSS, 40 mo vs 17 mo, χ2 = 14.814, P < 0.001), while there was no significant difference between N1 patients and N2 patients (median DSS, 18 mo vs 13 mo, χ2 = 0.741, P = 0.389). Optimal TLNC was determined to be four. When node-negative patients were divided according to TLNC, there was no difference in DSS between TLNC < 4 subgroup and TLNC ≥ 4 subgroup (median DSS, 37 mo vs 54 mo, χ2 = 0.715, P = 0.398). For node-positive patients, DSS of TLNC < 4 subgroup was worse than that of TLNC ≥ 4 subgroup (median DSS, 13 mo vs 21 mo, χ2 = 11.035, P < 0.001). Moreover, for node-positive patients, a new cut-off value of six nodes was identified for the number of TLNC that clearly stratified them into 2 separate survival groups (< 6 or ≥ 6, respectively; median DSS, 15 mo vs 33 mo, χ2 = 11.820, P < 0.001). DSS progressively worsened with increasing PLNC and LNR, but no definite cut-off value could be identified. Multivariate analysis revealed histological grade, tumor node metastasis staging, TNLC and LNR to be independent predictors of DSS. Neither location of positive lymph nodes nor PNLC were identified as an independent variable by multivariate analysis. CONCLUSION: Both TLNC and LNR are strong predictors of outcome after curative resection for GBC. The retrieval and examination of at least 6 nodes can influence staging quality and DSS, especially in node-positive patients. PMID:23964151

Radical lymph node dissection and assessment: Impact on gallbladder cancer prognosis.

PubMed

Liu, Gui-Jie; Li, Xue-Hua; Chen, Yan-Xin; Sun, Hui-Dong; Zhao, Gui-Mei; Hu, San-Yuan

2013-08-21

To investigate the lymph node metastasis patterns of gallbladder cancer (GBC) and evaluate the optimal categorization of nodal status as a critical prognostic factor. From May 1995 to December 2010, a total of 78 consecutive patients with GBC underwent a radical resection at Liaocheng People's Hospital. A radical resection was defined as removing both the primary tumor and the regional lymph nodes of the gallbladder. Demographic, operative and pathologic data were recorded. The lymph nodes retrieved were examined histologically for metastases routinely from each node. The positive lymph node count (PLNC) as well as the total lymph node count (TLNC) was recorded for each patient. Then the metastatic to examined lymph nodes ratio (LNR) was calculated. Disease-specific survival (DSS) and predictors of outcome were analyzed. With a median follow-up time of 26.50 mo (range, 2-132 mo), median DSS was 29.00 ± 3.92 mo (5-year survival rate, 20.51%). Nodal disease was found in 37 patients (47.44%). DSS of node-negative patients was significantly better than that of node-positive patients (median DSS, 40 mo vs 17 mo, χ² = 14.814, P < 0.001), while there was no significant difference between N1 patients and N2 patients (median DSS, 18 mo vs 13 mo, χ² = 0.741, P = 0.389). Optimal TLNC was determined to be four. When node-negative patients were divided according to TLNC, there was no difference in DSS between TLNC < 4 subgroup and TLNC ≥ 4 subgroup (median DSS, 37 mo vs 54 mo, χ² = 0.715, P = 0.398). For node-positive patients, DSS of TLNC < 4 subgroup was worse than that of TLNC ≥ 4 subgroup (median DSS, 13 mo vs 21 mo, χ² = 11.035, P < 0.001). Moreover, for node-positive patients, a new cut-off value of six nodes was identified for the number of TLNC that clearly stratified them into 2 separate survival groups (< 6 or ≥ 6, respectively; median DSS, 15 mo vs 33 mo, χ² = 11.820, P < 0.001). DSS progressively worsened with increasing PLNC and LNR, but no definite cut-off value could be identified. Multivariate analysis revealed histological grade, tumor node metastasis staging, TNLC and LNR to be independent predictors of DSS. Neither location of positive lymph nodes nor PNLC were identified as an independent variable by multivariate analysis. Both TLNC and LNR are strong predictors of outcome after curative resection for GBC. The retrieval and examination of at least 6 nodes can influence staging quality and DSS, especially in node-positive patients.

[A Case of Lymph Node Metastasis of Rectal Laterally Spreading Tumor with Mucosal Cancer after Endoscopic Submucosal Dissection].

PubMed

Ushigome, Hajime; Fujimoto, Yoshiya; Suzuki, Shinsuke; Minami, Hironori; Miyanari, Shun; Murahashi, Satoshi; Fukuoka, Hironori; Nagasaki, Toshiya; Akiyoshi, Takashi; Konishi, Tsuyoshi; Nagayama, Satoshi; Fukunaga, Yosuke; Ueno, Masashi; Chino, Akiko; Igarashi, Masahiro

2017-11-01

A screening fecal occult blood test was positive in a 76-year-old female. Colonoscopy showed laterally spreading tumor (LST)over 15 cm at lower rectum. endoscopic submucosal dissection(ESD)was performed. Pathological findings showed LST-G, 150×100 mm, adenocarcinoma(tub1-tub2), tubular adenoma, moderate-severe atypia, Tis(M), ly(-), v(-), HMX, VMX. Two years later CT detected one swollen lymph node at mesorectum and PET-CT showed FDG up take at the lymph node. We diagnosed lymph node metastasis, performed laparoscopic very low anterior resection. Pathological findings showed one lymph node metastasis, but there were no residual cancer at rectum. We cut the surgical specimen at 5mm intervals because of it's big size. It might be impossible with this procedure to detect SM invasion at this specimen.

Ranking influential spreaders is an ill-defined problem

NASA Astrophysics Data System (ADS)

Gu, Jain; Lee, Sungmin; Saramäki, Jari; Holme, Petter

2017-06-01

Finding influential spreaders of information and disease in networks is an important theoretical problem, and one of considerable recent interest. It has been almost exclusively formulated as a node-ranking problem —methods for identifying influential spreaders output a ranking of the nodes. In this work, we show that such a greedy heuristic does not necessarily work: the set of most influential nodes depends on the number of nodes in the set. Therefore, the set of n most important nodes to vaccinate does not need to have any node in common with the set of n + 1 most important nodes. We propose a method for quantifying the extent and impact of this phenomenon. By this method, we show that it is a common phenomenon in both empirical and model networks.

A Simulation Program with Latency Exploitation and Node Tearing.

DTIC Science & Technology

1985-02-01

translation table JUNODE is constructed to give the relation between the user-defined node set and the node set used in the pro- gram. The ground node...90, 0, 45 and 80, then, user’s node renumbered node JUNODE table 0(ground) 1 nodplc(IUNODE+1)=O 10 2 ( +2)=10 45 3 ( +3)=45 80 4 ( +4)=80 90 5 ( +5

Monitoring of peri-distal gastrectomy carbohydrate antigen 19-9 level in gastric juice and its significance

PubMed Central

Xu, A-Man; Huang, Lei; Han, Wen-Xiu; Wei, Zhi-Jian

2014-01-01

Gastric carcinoma is one of the most common and deadly malignancies nowadays, and carbohydrate antigen 19-9 (CA 19-9) in gastric juice has been rarely studied. To compare peri-distal gastrectomy (DG) gastric juice and serum CA 19-9 and reveal its significance, we selected 67 patients diagnosed with gastric carcinoma who underwent DG, and collected their perioperative gastric juice whose CA 19-9 was detected, with serum CA 19-9 monitored as a comparison. We found that: gastric juice CA 19-9 pre-gastrectomy was significantly correlated with tumor TNM classification, regarding tumor size, level of gastric wall invaded, differentiated grade and number of metastatic lymph nodes as influencing factors, while serum CA 19-9 revealed little information; gastric juice CA 19-9 was significantly correlated with radical degree, and regarded number of resected lymph nodes and classification of cutting edge as impact factors; thirteen patients whose gastric juice CA 19-9 rose post-DG showed features indicating poor prognosis; the difference of gastric juice CA 19-9 between pre- and post-gastrectomy was correlated with tumor TNM classification and radical degree, and regarded tumor size, number of resected metastatic and normal lymph nodes, sum of distances from tumor to cutting edges and classification of cutting edge as influential factors. We conclude that peri-DG gastric juice CA 19-9 reveals much information about tumor and radical gastrectomy, and may indicate prognosis; while serum CA 19-9 has limited significance. PMID:24482710

CD-SEM metrology and OPC modeling for 2D patterning in advanced technology nodes (Conference Presentation)

NASA Astrophysics Data System (ADS)

Wallow, Thomas I.; Zhang, Chen; Fumar-Pici, Anita; Chen, Jun; Laenens, Bart; Spence, Christopher A.; Rio, David; van Adrichem, Paul; Dillen, Harm; Wang, Jing; Yang, Peng-Cheng; Gillijns, Werner; Jaenen, Patrick; van Roey, Frieda; van de Kerkhove, Jeroen; Babin, Sergey

2017-03-01

In the course of assessing OPC compact modeling capabilities and future requirements, we chose to investigate the interface between CD-SEM metrology methods and OPC modeling in some detail. Two linked observations motivated our study: 1) OPC modeling is, in principle, agnostic of metrology methods and best practice implementation. 2) Metrology teams across the industry use a wide variety of equipment, hardware settings, and image/data analysis methods to generate the large volumes of CD-SEM measurement data that are required for OPC in advanced technology nodes. Initial analyses led to the conclusion that many independent best practice metrology choices based on systematic study as well as accumulated institutional knowledge and experience can be reasonably made. Furthermore, these choices can result in substantial variations in measurement of otherwise identical model calibration and verification patterns. We will describe several experimental 2D test cases (i.e., metal, via/cut layers) that examine how systematic changes in metrology practice impact both the metrology data itself and the resulting full chip compact model behavior. Assessment of specific methodology choices will include: • CD-SEM hardware configurations and settings: these may range from SEM beam conditions (voltage, current, etc.,) to magnification, to frame integration optimizations that balance signal-to-noise vs. resist damage. • Image and measurement optimization: these may include choice of smoothing filters for noise suppression, threshold settings, etc. • Pattern measurement methodologies: these may include sampling strategies, CD- and contour- based approaches, and various strategies to optimize the measurement of complex 2D shapes. In addition, we will present conceptual frameworks and experimental methods that allow practitioners of OPC metrology to assess impacts of metrology best practice choices on model behavior. Finally, we will also assess requirements posed by node scaling on OPC model accuracy, and evaluate potential consequences for CD-SEM metrology capabilities and practices.

Metabolomics analysis: Finding out metabolic building blocks

PubMed Central

2017-01-01

In this paper we propose a new methodology for the analysis of metabolic networks. We use the notion of strongly connected components of a graph, called in this context metabolic building blocks. Every strongly connected component is contracted to a single node in such a way that the resulting graph is a directed acyclic graph, called a metabolic DAG, with a considerably reduced number of nodes. The property of being a directed acyclic graph brings out a background graph topology that reveals the connectivity of the metabolic network, as well as bridges, isolated nodes and cut nodes. Altogether, it becomes a key information for the discovery of functional metabolic relations. Our methodology has been applied to the glycolysis and the purine metabolic pathways for all organisms in the KEGG database, although it is general enough to work on any database. As expected, using the metabolic DAGs formalism, a considerable reduction on the size of the metabolic networks has been obtained, specially in the case of the purine pathway due to its relative larger size. As a proof of concept, from the information captured by a metabolic DAG and its corresponding metabolic building blocks, we obtain the core of the glycolysis pathway and the core of the purine metabolism pathway and detect some essential metabolic building blocks that reveal the key reactions in both pathways. Finally, the application of our methodology to the glycolysis pathway and the purine metabolism pathway reproduce the tree of life for the whole set of the organisms represented in the KEGG database which supports the utility of this research. PMID:28493998

Determination of Algorithm Parallelism in NP Complete Problems for Distributed Architectures

DTIC Science & Technology

1990-03-05

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

The appropriate number of ELNs for lymph node negative breast cancer patients underwent MRM: a population-based study.

PubMed

Chi, Huiying; Zhang, Chenyue; Wang, Haiyong; Wang, Zhehai

2017-09-12

Whether number of examed lymph nodes (ELNs) would bring survival benefit for patients with negative lymph nodes after modified radical mastectomy (MRM) is uncertain. In our study, using the Surveillance Epidemiology and End Results (SEER) database between 2004 and 2009, we screened the appropriate patients with negative lymph nodes underwent MRM. The Cox proportional hazard analysis was used to determine the effect of number of ELNs on cancer specific survival (CSS). The results showed that the number of ELNs was not an independent prognostic factor on CSS ( P = 0.940). Then the X-tile mode was used to determine the appropriate threshold for ELNs count. The results showed that 9 was the appropriate cut-off point. Next, the log-rank χ 2 test was used to analyze the CSS based on different subgroup variables. The results showed that some subgroup variables including age < 50/ ≥ 50, grade I/III, AJCC T1/T2, ER positive/negative and PR positive/negative ,demonstrated significant CSS benefits among the patients with the number of ELNs ≤ 9 (all, P < 0.05). However, three subgroup variables including grade II, AJCC T3 and AJCC T4, the patients with the number of ELNs ≤ 9 did not bring significant CSS benefits (all, P > 0.1). In conclusion, our study demonstrated that the number of ELNs was not an independent prognostic factor on CSS, and 9 can be selected as the appropriate cut-off point of ELNs for patients with negative lymph nodes who underwent MRM.

Three faces of node importance in network epidemiology: Exact results for small graphs

NASA Astrophysics Data System (ADS)

Holme, Petter

2017-12-01

We investigate three aspects of the importance of nodes with respect to susceptible-infectious-removed (SIR) disease dynamics: influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size), and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all connected graphs of three to seven nodes. We obtain the smallest graphs where the optimal node sets are not overlapping. We find that (i) node separation is more important than centrality for more than one active node, (ii) vaccination and influence maximization are the most different aspects of importance, and (iii) the three aspects are more similar when the infection rate is low.

Predicting drug-disease interactions by semi-supervised graph cut algorithm and three-layer data integration.

PubMed

Wu, Guangsheng; Liu, Juan; Wang, Caihua

2017-12-28

Prediction of drug-disease interactions is promising for either drug repositioning or disease treatment fields. The discovery of novel drug-disease interactions, on one hand can help to find novel indictions for the approved drugs; on the other hand can provide new therapeutic approaches for the diseases. Recently, computational methods for finding drug-disease interactions have attracted lots of attention because of their far more higher efficiency and lower cost than the traditional wet experiment methods. However, they still face several challenges, such as the organization of the heterogeneous data, the performance of the model, and so on. In this work, we present to hierarchically integrate the heterogeneous data into three layers. The drug-drug and disease-disease similarities are first calculated separately in each layer, and then the similarities from three layers are linearly fused into comprehensive drug similarities and disease similarities, which can then be used to measure the similarities between two drug-disease pairs. We construct a novel weighted drug-disease pair network, where a node is a drug-disease pair with known or unknown treatment relation, an edge represents the node-node relation which is weighted with the similarity score between two pairs. Now that similar drug-disease pairs are supposed to show similar treatment patterns, we can find the optimal graph cut of the network. The drug-disease pair with unknown relation can then be considered to have similar treatment relation with that within the same cut. Therefore, we develop a semi-supervised graph cut algorithm, SSGC, to find the optimal graph cut, based on which we can identify the potential drug-disease treatment interactions. By comparing with three representative network-based methods, SSGC achieves the highest performances, in terms of both AUC score and the identification rates of true drug-disease pairs. The experiments with different integration strategies also demonstrate that considering several sources of data can improve the performances of the predictors. Further case studies on four diseases, the top-ranked drug-disease associations have been confirmed by KEGG, CTD database and the literature, illustrating the usefulness of SSGC. The proposed comprehensive similarity scores from multi-views and multiple layers and the graph-cut based algorithm can greatly improve the prediction performances of drug-disease associations.

Indications for Pelvic Nodal Treatment in Prostate Cancer Should Change. Validation of the Roach Formula in a Large Extended Nodal Dissection Series

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

Abdollah, Firas; Cozzarini, Cesare; Suardi, Nazareno

2012-06-01

Purpose: Previous studies have criticized the predicting ability of the Roach formula in assessing the risk of lymph node invasion (LNI) in contemporary patients with prostate cancer (PCa) due to a significant overestimation of LNI rates. However, all those studies included patients treated with limited pelvic lymph node dissection (PLND), which is associated with high rates of false negative findings. We hypothesized that the Roach formula is still an accurate tool for LNI predictions if an extended PLND (ePLND) is performed. Methods and Materials: We included 3,115 consecutive patients treated with radical prostatectomy and ePLND between 2000 and 2010 atmore » a single tertiary referral center. Extended PLND consisted of removal of obturator, external iliac, and hypogastric lymph nodes. We externally validated the Roach formula by using the area under the receiver operating characteristics curve and calibration plot method. Moreover, we tested the performance characteristics of different formula-generated cutoff values ranging from 1% to 20%. Results: The accuracy of the Roach formula was 80.3%. The calibration showed only a minor underestimation of the LNI risk in high-risk patients (6.7%). According to the Roach formula, the use of 15% cut off would have allowed 74.2% (2,311/3,115) of patients to avoid nodal irradiation, while up to 32.7% (111/336) of all patients with LNI would have been missed. When the cut off was lowered to 6%, nodal treatment would have been spared in 1,541 (49.5%) patients while missing 41 LNI patients. The sensitivity, specificity, and negative predictive values associated with the 6% cut off were 87.9%, 54%, and 97.3%, respectively. Conclusions: The Roach formula is still accurate and does not overestimate the rate of LNI in contemporary prostate cancer patients if they are treated with ePLND. However, the recommended cut off of 15% would miss approximately one-third of patients with LNI. Based on our results, the cut off should be lowered to 6%.« less

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

[Comparison of two quantitative methods of endobronchial ultrasound real-time elastography for evaluating intrathoracic lymph nodes].

PubMed

Mao, X W; Yang, J Y; Zheng, X X; Wang, L; Zhu, L; Li, Y; Xiong, H K; Sun, J Y

2017-06-12

Objective: To compare the clinical value of two quantitative methods in analyzing endobronchial ultrasound real-time elastography (EBUS-RTE) images for evaluating intrathoracic lymph nodes. Methods: From January 2014 to April 2014, EBUS-RTE examination was performed in patients who received EBUS-TBNA examination in Shanghai Chest Hospital. Each intrathoracic lymph node had a selected EBUS-RTE image. Stiff area ratio and mean hue value of region of interest (ROI) in each image were calculated respectively. The final diagnosis of lymph node was based on the pathologic/microbiologic results of EBUS-TBNA, pathologic/microbiologic results of other examinations and clinical following-up. The sensitivity, specificity, positive predictive value, negative predictive value and accuracy were evaluated for distinguishing malignant and benign lesions. Results: Fifty-six patients and 68 lymph nodes were enrolled in this study, of which 35 lymph nodes were malignant and 33 lymph nodes were benign. The stiff area ratio and mean hue value of benign and malignant lesions were 0.32±0.29, 0.62±0.20 and 109.99±28.13, 141.62±17.52, respectively, and statistical differences were found in both of those two methods ( t =-5.14, P <0.01; t =-5.53, P <0.01). The area under curves was 0.813, 0.814 in stiff area ratio and mean hue value, respectively. The optimal diagnostic cut-off value of stiff area ratio was 0.48, and the sensitivity, specificity, positive predictive value, negative predictive value and accuracy were 82.86%, 81.82%, 82.86%, 81.82% and 82.35%, respectively. The optimal diagnostic cut-off value of mean hue value was 126.28, and the sensitivity, specificity, positive predictive value, negative predictive value and accuracy were 85.71%, 75.76%, 78.95%, 83.33% and 80.88%, respectively. Conclusion: Both the stiff area ratio and mean hue value methods can be used for analyzing EBUS-RTE images quantitatively, having the value of differentiating benign and malignant intrathoracic lymph nodes, and the stiff area ratio is better than the mean hue value between the two methods.

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

NASA Technical Reports Server (NTRS)

Shin, Kang G.; Chang, Yi-Chieh

1989-01-01

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

Determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation

DOEpatents

Blocksome, Michael A [Rochester, MN

2011-12-20

Methods, apparatus, and products are disclosed for determining when a set of compute nodes participating in a barrier operation on a parallel computer are ready to exit the barrier operation that includes, for each compute node in the set: initializing a barrier counter with no counter underflow interrupt; configuring, upon entering the barrier operation, the barrier counter with a value in dependence upon a number of compute nodes in the set; broadcasting, by a DMA engine on the compute node to each of the other compute nodes upon entering the barrier operation, a barrier control packet; receiving, by the DMA engine from each of the other compute nodes, a barrier control packet; modifying, by the DMA engine, the value for the barrier counter in dependence upon each of the received barrier control packets; exiting the barrier operation if the value for the barrier counter matches the exit value.

Lymph node hemangioma in one-humped camel

PubMed Central

Aljameel, M.A.; Halima, M.O.

2015-01-01

Hemangioma is a benign tumor of blood and lymphatic vessels. It is common in skin, mucosa and soft tissues, and its occurrence in lymph nodes is extremely rare. A 10 year-old she-camel was slaughtered at Nyala slaughterhouse, South Darfur State, Sudan. Grossly, the carcass was emaciated. The left ventral superficial cervical lymph node was enlarged, hard on palpation and protruded outside the body. Its cut surface was dark red in color and measured (18 cm) in diameter. Histopathologically, the sections revealed vascular masses were composed of non-encapsulated clusters of small and medium sized with thick and thin-walled, filled with blood, separated by courageous stroma and surrounded by closely packed proliferating capillaries. To the best of our knowledge, this is the first record of the left ventral superficial cervical lymph node hemangioma in a camel in the Sudan. PMID:26753134

iss028e035028

NASA Image and Video Library

2011-08-27

ISS028-E-035028 (27 Aug. 2011) --- NASA astronaut Mike Fossum, Expedition 28 flight engineer, trims astronaut Ron Garan's hair in the Tranquility node of the International Space Station. Fossum used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Garrett Reisman, Expedition 17 Haircut in Harmony

NASA Image and Video Library

2008-05-04

ISS017-E-006253 (4 May 2008) --- Astronaut Garrett Reisman, Expedition 17 flight engineer, trims his hair in the Harmony node of the International Space Station, using hair clippers fashioned with a vacuum device to garner freshly cut hair.

iss028e035053

NASA Image and Video Library

2011-08-27

ISS028-E-035053 (27 Aug. 2011) --- NASA astronaut Ron Garan, Expedition 28 flight engineer, trims astronaut Mike Fossum's hair in the Tranquility node of the International Space Station. Garan used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Radionavigated detection of sentinel nodes in breast carcinoma--first experiences of our department.

PubMed

Duchaj, B; Chvalny, P; Vesely, J; Makaiova, I; Durdik, S; Straka, V; Palaj, J; Procka, V; Aksamitova, K; Skraskova, S; Banki, P; Kovacova, S; Galbavy, S

2010-01-01

Biopsy and histological evaluation of sentinel lymphatic node limits the axillary node dissection only in cases of positive histological finding and decreases the occurrence of postoperative complications related to the axillary node dissection. We used radiotracer SentiScint, Medi-Radiopharma Ltd, Hungary and preoperatively administered blue dye--Blue Patenté V, Guebert, Aulnay-Sous-Bios, France. 11 (18%) patients were subdued to deep peritimorous application of radiotracer, 10 (16.4%) to sub/intradermal application over the lesions and n 40 (65.6%) patients the application was sub/intradermal and periareolar. The patients underwent an operation protocol of corresponding quadrantectomy, radionavigated blue-dye sentinel node biopsy and axillary dissection. From May 2006 to June 2008, we examined 61 patients with breast carcinoma. They underwent radionavigated and blue-dye sentinel node biopsy. We detected 57 (93.4%) sentinel nodes with preoperative scintigraphy, of which only 51 (83.6%) were detected peroperatively and underwent histological evaluation. In six (9.8%) cases, the "frozen cut" histology of the primary lesion had shown a benign lesion; hence no sentinel node biopsy or axillary disection was performed. 12 (19.7%) of 51 histologically evaluated sentinel nodes had metastatic invasion. We retrospectively compared the histological fund in sentinel and axillary nodes in patients with metastatic sentinel nodes. In 6 (16.6%) cases, the sentinel node was positive of metastatic invasion but axillary nodes were histologically negative, in 6 (16.6%) cases the sentinel node and axillary nodes were positive for metastatic invasion. We observed falsely negative findings in 3 (8.3%) patients with negative histological fund in the sentinel node, but positive axillary nodes (Tab. 3, Fig. 2, Ref. 11). Full Text (Free, PDF) www.bmj.sk.

Networks in plant epidemiology: from genes to landscapes, countries, and continents.

PubMed

Moslonka-Lefebvre, Mathieu; Finley, Ann; Dorigatti, Ilaria; Dehnen-Schmutz, Katharina; Harwood, Tom; Jeger, Michael J; Xu, Xiangming; Holdenrieder, Ottmar; Pautasso, Marco

2011-04-01

There is increasing use of networks in ecology and epidemiology, but still relatively little application in phytopathology. Networks are sets of elements (nodes) connected in various ways by links (edges). Network analysis aims to understand system dynamics and outcomes in relation to network characteristics. Many existing natural, social, and technological networks have been shown to have small-world (local connectivity with short-cuts) and scale-free (presence of super-connected nodes) properties. In this review, we discuss how network concepts can be applied in plant pathology from the molecular to the landscape and global level. Wherever disease spread occurs not just because of passive/natural dispersion but also due to artificial movements, it makes sense to superimpose realistic models of the trade in plants on spatially explicit models of epidemic development. We provide an example of an emerging pathosystem (Phytophthora ramorum) where a theoretical network approach has proven particularly fruitful in analyzing the spread of disease in the UK plant trade. These studies can help in assessing the future threat posed by similar emerging pathogens. Networks have much potential in plant epidemiology and should become part of the standard curriculum.

Algorithm for protecting light-trees in survivable mesh wavelength-division-multiplexing networks

NASA Astrophysics Data System (ADS)

Luo, Hongbin; Li, Lemin; Yu, Hongfang

2006-12-01

Wavelength-division-multiplexing (WDM) technology is expected to facilitate bandwidth-intensive multicast applications such as high-definition television. A single fiber cut in a WDM mesh network, however, can disrupt the dissemination of information to several destinations on a light-tree based multicast session. Thus it is imperative to protect multicast sessions by reserving redundant resources. We propose a novel and efficient algorithm for protecting light-trees in survivable WDM mesh networks. The algorithm is called segment-based protection with sister node first (SSNF), whose basic idea is to protect a light-tree using a set of backup segments with a higher priority to protect the segments from a branch point to its children (sister nodes). The SSNF algorithm differs from the segment protection scheme proposed in the literature in how the segments are identified and protected. Our objective is to minimize the network resources used for protecting each primary light-tree such that the blocking probability can be minimized. To verify the effectiveness of the SSNF algorithm, we conduct extensive simulation experiments. The simulation results demonstrate that the SSNF algorithm outperforms existing algorithms for the same problem.

Haircut for Hopkins

NASA Image and Video Library

2013-10-05

ISS037-E-006568 (5 Oct. 2013) --- Russian cosmonaut Fyodor Yurchikhin, Expedition 37 commander, trims the hair of NASA astronaut Michael Hopkins, flight engineer, in the Node 1 module, called Unity. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Chrysanthemum cutting productivity and rooting ability are improved by grafting.

PubMed

Zhang, Jing; Chen, Sumei; Liu, Ruixia; Jiang, Jiafu; Chen, Fadi; Fang, Weimin

2013-01-01

Chrysanthemum has been commercially propagated by rooting of cuttings, whereas the quality will decline over multiple collections from a single plant. Therefore, we compared the vigour, rooting ability, and some physiological parameters between cuttings harvested from nongrafted "Jinba" (non-grafted cuttings) with those collected from grafted "Jinba" plants onto Artemisia scoparia as a rootstock (grafted cuttings). The yield, length, node number, stem diameter, fresh weight, and dry weight of the grafted cuttings were superior to the non-grafted cuttings. Also grafted cuttings "Jinba" rooted 1 day earlier, but showing enhanced rooting quality including number, length, diameter, and dry weight of roots, where compared to the non-grafted. The physiological parameters that indicated contents of soluble protein, peroxidase activity, soluble sugar, and starch, ratios of soluble sugar/nitrogen ratio, and carbohydrate/nitrogen (C/N), as well as contents of indole-3-acetic acid (IAA) and abscisic acid (ABA), and IAA/ABA ratio were significantly increased in the grafted cuttings. This suggested their important parts in mediating rooting ability. Results from this study showed that grafting improved productivity and rooting ability related to an altered physiology, which provide a means to meet the increasing demand.

Preoperative prediction of lymph node metastasis and deep stromal invasion in women with invasive cervical cancer: prospective multicenter study using 2D and 3D ultrasound.

PubMed

Pálsdóttir, K; Fischerova, D; Franchi, D; Testa, A; Di Legge, A; Epstein, E

2015-04-01

To determine how various objective two-dimensional (2D) and three-dimensional (3D) ultrasound parameters allow prediction of deep stromal tumor invasion and lymph node involvement, in comparison to subjective ultrasound assessment, in women scheduled for surgery for cervical cancer. This was a prospective multicenter trial including 104 women with cervical cancer at FIGO Stages IA2-IIB, verified histologically. Patients scheduled for surgery underwent a preoperative ultrasound examination. The value of various 2D (size, color score) and 3D (volume, vascular indices) ultrasound parameters was compared to that of subjective assessment in the prediction of deep stromal tumor invasion and lymph node involvement. Histology obtained from radical hysterectomy or trachelectomy and pelvic lymphadenectomy was considered as the gold standard for assessment. All women underwent pelvic lymphadenectomy, with 99 (95%) undergoing subsequent radical surgery; five underwent only pelvic lymphadenectomy because of the presence of a positive sentinel lymph node. Women with deep stromal invasion or lymph node involvement had significantly larger tumors (diameter and volume) but there was no correlation with vascular indices measured on 3D ultrasound. Subjective evaluation was superior (AUC, 0.93; sensitivity, 90.5%; specificity, 97.2%) in the prediction of deep stromal invasion when compared to any objective measurement technique, with maximal tumor diameter at 20.5-mm cut-off (AUC, 0.83; sensitivity, 90.5%; specificity, 61.1%) and 3D tumor volume at 9.1-mm(3) cut-off (AUC, 0.85; sensitivity, 79.4%; specificity, 83.3%) providing the best performance among the objective parameters. Both subjective assessment and objective measurements were poorly predictive of lymph node involvement. In women with cervical cancer, subjective ultrasound evaluation allowed better prediction of deep stromal invasion than did objective measurements; however, neither subjective evaluation nor objective parameters were adequate to predict lymph node involvement. 3D vascular indices were ineffective in the prediction of advanced stages of the disease. Copyright © 2014 ISUOG. Published by John Wiley & Sons Ltd.

Topology control algorithm for wireless sensor networks based on Link forwarding

NASA Astrophysics Data System (ADS)

Pucuo, Cairen; Qi, Ai-qin

2018-03-01

The research of topology control could effectively save energy and increase the service life of network based on wireless sensor. In this paper, a arithmetic called LTHC (link transmit hybrid clustering) based on link transmit is proposed. It decreases expenditure of energy by changing the way of cluster-node’s communication. The idea is to establish a link between cluster and SINK node when the cluster is formed, and link-node must be non-cluster. Through the link, cluster sends information to SINK nodes. For the sake of achieving the uniform distribution of energy on the network, prolongate the network survival time, and improve the purpose of communication, the communication will cut down much more expenditure of energy for cluster which away from SINK node. In the two aspects of improving the traffic and network survival time, we find that the LTCH is far superior to the traditional LEACH by experiments.

Ultimate patterning limits for EUV at 5nm node and beyond

NASA Astrophysics Data System (ADS)

Ali, Rehab Kotb; Hamed Fatehy, Ahmed; Lafferty, Neal; Word, James

2018-03-01

The 5nm technology node introduces more aggressive geometries than previous nodes. In this paper, we are introducing a comprehensive study to examine the pattering limits of EUV at 0.33NA. The study is divided into two main approaches: (A) Exploring pattering limits of Single Exposure EUV Cut/Block mask in Self-Aligned-Multi-Patterning (SAMP) process, and (B) Exploring the pattering limits of a Single Exposure EUV printing of metal Layers. The printability of the resulted OPC masks is checked through a model based manufacturing flow for the two pattering approaches. The final manufactured patterns are quantified by Edge Placement Error (EPE), Process Variation Band (PVBand), soft/hard bridging and pinching, Image Log Slope (ILS) and Common Depth of Focus (CDOF)

Linear Transceiver Design for Interference Alignment: Complexity and Computation

DTIC Science & Technology

2010-07-01

restriction on the choice of beamforming vector of node b. Thus, for any fixed transmit node b in H , there are multiple restriction sets, each...signal space can be chosen. The receive nodes in H can achieve interference alignment if and only if these restricted sets of one-dimensional signal...total number of restriction sets is at most linear in the number of edges in H and each restriction set contains at most two one-dimensional

Haircut day

NASA Image and Video Library

2013-07-04

ISS036-E-014568 (4 July 2013) --- Russian cosmonaut Fyodor Yurchikhin, Expedition 36 flight engineer, trims the hair of Russian cosmonaut Alexander Misurkin, flight engineer, in the Unity node of the International Space Station. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Kotov receives haircut during Expedition 22

NASA Image and Video Library

2010-01-19

ISS022-E-030607 (19 Jan. 2010) --- NASA astronaut Jeffrey Williams, Expedition 22 commander, trims Russian cosmonaut Oleg Kotov’s hair in the Harmony node of the International Space Station. Williams used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Haircut for Hopkins

NASA Image and Video Library

2013-10-05

ISS037-E-006571 (5 Oct. 2013) --- Russian cosmonaut Fyodor Yurchikhin, Expedition 37 commander, trims the hair of NASA astronaut Michael Hopkins, flight engineer, in the Unity node of the International Space Station. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Haircut for Hopkins

NASA Image and Video Library

2013-10-05

ISS037-E-006565 (5 Oct. 2013) --- Russian cosmonaut Fyodor Yurchikhin, Expedition 37 commander, trims the hair of NASA astronaut Michael Hopkins, flight engineer, in the Unity node of the International Space Station. Yurchikhin used hair clippers fashioned with a vacuum device to garner freshly cut hair.

[Value of asymmetry criterion in MRI for the diagnosis of small pelvic lymphadenopathies (inferior or equal to 1 cm)].

PubMed

Roy, C; Le Bras, Y; Mangold, L; Tuchmann, C; Vasilescu, C; Saussine, C; Jacqmin, D

1996-12-01

The purpose of this study was to determine if lymph node asymmetry in small (< 1.0 cm) pelvic nodes was a significant prognostic feature in determining metastatic disease. 216 patients who presented pelvic carcinoma underwent MR imaging. They were correlated to pathological findings obtained by surgery. We considered on the axial plan the maximum diameter (MAD) of both round or oval-shaped suspicious masses. Two different cut-off values were determined: node diameter superior to 1.0 cm (criterion 1) and node diameter superior to 0.5 cm with asymmetry relative to the opposite side for nodes ranging from 0.5 cm to 1.0 cm (criterion 2). With criterion 1 MR Imaging had an accuracy of 88%, a sensitivity of 65%, a specificity of 96%, a PPV of 88% and a NPV of 88% in detection of pelvic node metastasis. By considering criterion 2, MR Imaging had an accuracy of 85%, a sensitivity of 75%, a specificity of 89%, a PPV of 71% and a NPV of 91%. Normal small asymmetric lymph nodes were present in 5.6% of cases. Asymmetry of normal or inflammatory pelvic nodes is not uncommon. It cannot be relied on to diagnose metastatic involvement in cases of small suspicious lymph nodes, especially because of its low specificity and positive predictive value.

Implementing asyncronous collective operations in a multi-node processing system

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

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

A method, system, and computer program product are disclosed for implementing an asynchronous collective operation in a multi-node data processing system. In one embodiment, the method comprises sending data to a plurality of nodes in the data processing system, broadcasting a remote get to the plurality of nodes, and using this remote get to implement asynchronous collective operations on the data by the plurality of nodes. In one embodiment, each of the nodes performs only one task in the asynchronous operations, and each nodes sets up a base address table with an entry for a base address of a memorymore » buffer associated with said each node. In another embodiment, each of the nodes performs a plurality of tasks in said collective operations, and each task of each node sets up a base address table with an entry for a base address of a memory buffer associated with the task.« less

Two Dimensional Linear Elastic Analysis of Fracture Specimens User’s Manual of a Finite Element Computer Program.

DTIC Science & Technology

1980-02-01

8 d. Data Set 4 8 e. Data Set 5 9 f. Data Set 6 9 g. Data Set 7 10 h. Data Set 8 10 i. Data Set 9 11 J. Data Set 10 12 k. Data...Coordinates NODE X Y NODE X Y NODE X Y 1 4.0 0.5 7 3.50 1.0 13 1.50 1.5 2 4.0 1.0 8 3.50 1.5 14 1.25 0.5 3 4.0 1.5 9 2.50 0.5 15 1.25 1.5 4 3.75 0.5 10 ...4 1+5 1+6 1+7 1 1 3 8 6 2 5 7 4 2 8 13 11 6 10 12 9 7 3 16 11 13 18 14 12 15 17 Note that I can be chosen to be any corner node. 6. PLOTTING THE

Anatomic-histologic study of the floor of the mouth: the lingual lymph nodes.

PubMed

Ananian, Sargis G; Gvetadze, Shalva R; Ilkaev, Konstantin D; Mochalnikova, Valeria V; Zayratiants, Georgiy O; Mkhitarov, Vladimir A; Yang, Xin; Ciciashvili, Aleksandr M

2015-06-01

The lingual lymph nodes are inconstant nodes located within the fascial/intermuscular spaces of the floor of the mouth. Oral tongue squamous cell carcinoma has been reported to recur and metastasize in lingual lymph nodes with poor prognosis. Lingual lymph nodes are not currently included in basic tongue squamous cell carcinoma surgery. Twenty-one cadavers (7 males, 14 females) were studied, aged from 57 to 94 years (mean age 76.3 years). The gross specimen of the floor of the mouth was divided into blocks: A (median nodes), B, B' (parahyoid), C, C' (paraglandular). Serial histological microslides were cut and stained with hematoxylin-eosin. Frequency of lingual lymph nodes in each block and their microscopic features were assessed. The lingual lymph nodes in overall number of 7 were detected in 5 of the 21 cadavers (23.8%). The total incidence of lingual lymph node was 33.3% (7 nodes/21 cadavers). Block A failed to demonstrate any lymph nodes (0%); Blocks B, B'-2 nodes (9.5%) and 2 nodes (9.5%), respectively; Blocks C, C'-1 node (4.8%) and 2 nodes (9.5%), respectively. The mean lingual lymph node length was 4.1 mm (from 1.4 to 8.7 mm), the mean thickness was 2.8 mm (from 0.8 to 7.5 mm). Five cadavers (23.8%) revealed mucosa-associated lymphoid tissue. Atrophic changes appeared in 4 (57.1%) lingual lymph nodes. The presence of lymph node-bearing tissue in the floor of the mouth is demonstrated. In account of resection radicalism and better local control the fat tissue of the floor of the mouth should be removed in conjunction to glossectomy. Further anatomic and clinical research is required to establish the role of lingual lymph node in oral squamous cell carcinoma recurrence and metastasis. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

iss028e035074

NASA Image and Video Library

2011-08-27

ISS028-E-035074 (27 Aug. 2011) --- NASA astronaut Mike Fossum, Expedition 28 flight engineer, trims the hair of Japan Aerospace Exploration Agency astronaut Satoshi Furukawa in the Tranquility node of the International Space Station. Fossum used hair clippers fashioned with a vacuum device to garner freshly cut hair.

iss028e035073

NASA Image and Video Library

2011-08-27

ISS028-E-035073 (27 Aug. 2011) --- NASA astronaut Mike Fossum, Expedition 28 flight engineer, trims the hair of Japan Aerospace Exploration Agency astronaut Satoshi Furukawa in the Tranquility node of the International Space Station. Fossum used hair clippers fashioned with a vacuum device to garner freshly cut hair.

iss028e035071

NASA Image and Video Library

2011-08-27

ISS028-E-035071 (27 Aug. 2011) --- NASA astronaut Mike Fossum, Expedition 28 flight engineer, trims the hair of Japan Aerospace Exploration Agency astronaut Satoshi Furukawa in the Tranquility node of the International Space Station. Fossum used hair clippers fashioned with a vacuum device to garner freshly cut hair.

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks

PubMed Central

Mahjoub, Reem K.; Elleithy, Khaled

2017-01-01

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation. PMID:28420102

Efficient Actor Recovery Paradigm for Wireless Sensor and Actor Networks.

PubMed

Mahjoub, Reem K; Elleithy, Khaled

2017-04-14

The actor nodes are the spine of wireless sensor and actor networks (WSANs) that collaborate to perform a specific task in an unverified and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power consumption of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. Therefore, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). In this paper, we propose an Efficient Actor Recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of a Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balancing the network performance. The packets are handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets; either from actor or sensor. This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for a longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, the proposed algorithms were tested using OMNET++ simulation.

iss038e054117

NASA Image and Video Library

2014-02-22

ISS038-E-054117 (22 Feb. 2014) --- Japan Aerospace Exploration Agency astronaut Koichi Wakata, Expedition 38 flight engineer, trims the hair of NASA astronaut Rick Mastracchio, flight engineer, in the Unity node of the International Space Station. Wakata used hair clippers fashioned with a vacuum device to garner freshly cut hair.

iss038e054116

NASA Image and Video Library

2014-02-22

ISS038-E-054116 (22 Feb. 2014) --- Japan Aerospace Exploration Agency astronaut Koichi Wakata, Expedition 38 flight engineer, trims the hair of NASA astronaut Rick Mastracchio, flight engineer, in the Unity node of the International Space Station. Wakata used hair clippers fashioned with a vacuum device to garner freshly cut hair.

A coherent Ising machine for 2000-node optimization problems

NASA Astrophysics Data System (ADS)

Inagaki, Takahiro; Haribara, Yoshitaka; Igarashi, Koji; Sonobe, Tomohiro; Tamate, Shuhei; Honjo, Toshimori; Marandi, Alireza; McMahon, Peter L.; Umeki, Takeshi; Enbutsu, Koji; Tadanaga, Osamu; Takenouchi, Hirokazu; Aihara, Kazuyuki; Kawarabayashi, Ken-ichi; Inoue, Kyo; Utsunomiya, Shoko; Takesue, Hiroki

2016-11-01

The analysis and optimization of complex systems can be reduced to mathematical problems collectively known as combinatorial optimization. Many such problems can be mapped onto ground-state search problems of the Ising model, and various artificial spin systems are now emerging as promising approaches. However, physical Ising machines have suffered from limited numbers of spin-spin couplings because of implementations based on localized spins, resulting in severe scalability problems. We report a 2000-spin network with all-to-all spin-spin couplings. Using a measurement and feedback scheme, we coupled time-multiplexed degenerate optical parametric oscillators to implement maximum cut problems on arbitrary graph topologies with up to 2000 nodes. Our coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020368 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Steve Swanson, commander, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020364 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Steve Swanson, commander, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020378 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Reid Wiseman, flight engineer, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020383 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Reid Wiseman, flight engineer, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020384 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Reid Wiseman, flight engineer, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

Constrained target controllability of complex networks

NASA Astrophysics Data System (ADS)

Guo, Wei-Feng; Zhang, Shao-Wu; Wei, Ze-Gang; Zeng, Tao; Liu, Fei; Zhang, Jingsong; Wu, Fang-Xiang; Chen, Luonan

2017-06-01

It is of great theoretical interest and practical significance to study how to control a system by applying perturbations to only a few driver nodes. Recently, a hot topic of modern network researches is how to determine driver nodes that allow the control of an entire network. However, in practice, to control a complex network, especially a biological network, one may know not only the set of nodes which need to be controlled (i.e. target nodes), but also the set of nodes to which only control signals can be applied (i.e. constrained control nodes). Compared to the general concept of controllability, we introduce the concept of constrained target controllability (CTC) of complex networks, which concerns the ability to drive any state of target nodes to their desirable state by applying control signals to the driver nodes from the set of constrained control nodes. To efficiently investigate the CTC of complex networks, we further design a novel graph-theoretic algorithm called CTCA to estimate the ability of a given network to control targets by choosing driver nodes from the set of constrained control nodes. We extensively evaluate the CTC of numerous real complex networks. The results indicate that biological networks with a higher average degree are easier to control than biological networks with a lower average degree, while electronic networks with a lower average degree are easier to control than web networks with a higher average degree. We also show that our CTCA can more efficiently produce driver nodes for target-controlling the networks than existing state-of-the-art methods. Moreover, we use our CTCA to analyze two expert-curated bio-molecular networks and compare to other state-of-the-art methods. The results illustrate that our CTCA can efficiently identify proven drug targets and new potentials, according to the constrained controllability of those biological networks.

The long and short of it: Sugarcane planting systems (whole stalks, billets, and single nodes)

USDA-ARS?s Scientific Manuscript database

Louisiana sugarcane (Saccharum spp.) producers use vegetative cuttings to plant their 100,000 plus acres of their sugarcane crop rotation each year. Researchers with USDA-ARS, LSU AgCenter, American Sugar Cane League, private industry, and producers have conducted cooperative and independent researc...

Staging of pelvic lymph nodes in patients with prostate cancer: Usefulness of multiple b value SE-EPI diffusion-weighted imaging on a 3.0 T MR system.

PubMed

Vallini, Valentina; Ortori, Simona; Boraschi, Piero; Manassero, Francesca; Gabelloni, Michela; Faggioni, Lorenzo; Selli, Cesare; Bartolozzi, Carlo

2016-01-01

To evaluate the usefulness of diffusion-weighted imaging (DWI) with a multiple b value SE-EPI sequence on a 3.0 T MR scanner for staging of pelvic lymph nodes in patients with prostate cancer candidate to radical prostatectomy and extended pelvic lymph node dissection (PLND). Institutional review board approval was obtained and written informed consent was taken from all enrolled subjects. A series of 26 patients with pathologically proven prostate cancer (high or intermediate risk according to D'Amico risk groups) scheduled for radical prostatectomy and PLND underwent 3 T MRI before surgery. DWI was performed using an axial respiratory-triggered spin-echo echo-planar sequence with multiple b values (500, 800, 1000, 1500 s/mm(2)) in all diffusion directions. ADC values were calculated by means of dedicated software fitting the curve obtained from the corresponding ADC for each b value. Fitted ADC measurements were performed at the level of proximal and distal external iliac, internal iliac, and obturator nodal stations bilaterally. Lymph node appearance was also assessed in terms of short axis, long-to-short axis ratio, node contour and intranodal heterogeneity of signal intensity. A total of 173 lymph nodes and 104 nodal stations were evaluated on DWI and pathologically analysed. Mean fitted ADC values were 0.79 ± 0.14 × 10(-3) mm(2)/s for metastatic lymph nodes and 1.13 ± 0.29 × 10(-3) mm(2)/s in non-metastatic ones (P < 0.0001). The cut-off for fitted ADC obtained by ROC curve analysis was 0.91 × 10(-3) mm(2)/s. A two-point-level score was assigned for each qualitative parameter, and the mean grading score was 6.09 ± 0.61 for metastastic lymph nodes and 5.42 ± 0.79 for non-metastatic ones, respectively (P = 0.001). Using a score threshold of 4 for morphological, structural, and dimensional MRI analysis and a cut--off value of 0.91 × 10(-3) mm(2)/s for fitted ADC measurements of pelvic lymph nodes, per--station sensitivity, specificity, PPV, NPV and diagnostic accuracy were 100%, 7.9%, 15.6%, 100% and 21.3%, and 84.6%, 89.5%, 57.9%, 97.1% and 88.8%, respectively. 3.0T DWI with a multiple b value SE-EPI sequence may help distinguish benign from malignant pelvic lymph nodes in patients with prostate cancer.

Association of maximum standardized uptake value with occult mediastinal lymph node metastases in cN0 non-small cell lung cancer.

PubMed

Lin, Jun-Tao; Yang, Xue-Ning; Zhong, Wen-Zhao; Liao, Ri-Qiang; Dong, Song; Nie, Qiang; Weng, Si-Xian; Fang, Xiao-Jing; Zheng, Jun-Yi; Wu, Yi-Long

2016-11-01

The management of non-small cell lung cancer (NSCLC) relies on the tumour-node-metastasis (TNM) stage, and the treatment regimen differs based on the N status. Positron emission tomography-computed tomography (PET-CT) has emerged as a powerful imaging tool for the detection of various cancers with a relatively low false-negative rate. We explored predictors to identify false-negative N2 disease in PET-CT. A total of 284 consecutive cN0 patients with peripheral NSCLC who underwent PET-CT scans followed by curative intent resections were enrolled as a training set to identify predictors of occult N2 metastases by multivariable analysis. The accuracy and cut-off values for the predictors were calculated using a receiver operating characteristic curve. Clinical and pathological data were analysed retrospectively. An additional 151 patients were collected as a test set to validate the results, including the occult N2 rate and accuracy. In total, 8.5% (24/284) PET-CT-diagnosed N0 NSCLC cases had pathologically diagnosed N2 metastases. The SUV max of the primary tumour was a unique independent risk factor for occult N2 NSCLC [P = 0.003, 95% confidence interval = 0.81-0.96, odds ratio (OR) = 0.88]. Occult N2 metastases occurred more frequently in the subcarinal (16/24) and right lower paratracheal lymph nodes (12/24). Accordingly, we divided the patients into two groups by SUV max : the occult N2 rates in the SUV max of <2.6 and SUV max of ≥2.6 groups were 1.0% (1/100) and 12.5% (23/184), respectively (P = 0.001). In the test set, the occult N2 incidence rate was 9.3% (14/151), with the highest rates occurring in the subcarinal (9/14) and right lower paratracheal lymph nodes (6/14). In the two groups defined by SUV max , the occult N2 rates were 4% (2/50) and 11.9% (12/101), respectively. The SUV max of the primary tumour was an independent risk factor for occult N2 metastases in NSCLC patients diagnosed as clinical N0 by PET-CT. SUV max of ≥2.6 of the primary tumour may indicate the risk of N2 metastases, and invasive mediastinal staging techniques or comprehensive therapy should not be ignored in these patients. © The Author 2016. Published by Oxford University Press on behalf of the European Association for Cardio-Thoracic Surgery. All rights reserved.

SU-E-J-238: Monitoring Lymph Node Volumes During Radiotherapy Using Semi-Automatic Segmentation of MRI Images

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

Veeraraghavan, H; Tyagi, N; Riaz, N

2014-06-01

Purpose: Identification and image-based monitoring of lymph nodes growing due to disease, could be an attractive alternative to prophylactic head and neck irradiation. We evaluated the accuracy of the user-interactive Grow Cut algorithm for volumetric segmentation of radiotherapy relevant lymph nodes from MRI taken weekly during radiotherapy. Method: The algorithm employs user drawn strokes in the image to volumetrically segment multiple structures of interest. We used a 3D T2-wturbo spin echo images with an isotropic resolution of 1 mm3 and FOV of 492×492×300 mm3 of head and neck cancer patients who underwent weekly MR imaging during the course of radiotherapy.more » Various lymph node (LN) levels (N2, N3, N4'5) were individually contoured on the weekly MR images by an expert physician and used as ground truth in our study. The segmentation results were compared with the physician drawn lymph nodes based on DICE similarity score. Results: Three head and neck patients with 6 weekly MR images were evaluated. Two patients had level 2 LN drawn and one patient had level N2, N3 and N4'5 drawn on each MR image. The algorithm took an average of a minute to segment the entire volume (512×512×300 mm3). The algorithm achieved an overall DICE similarity score of 0.78. The time taken for initializing and obtaining the volumetric mask was about 5 mins for cases with only N2 LN and about 15 mins for the case with N2,N3 and N4'5 level nodes. The longer initialization time for the latter case was due to the need for accurate user inputs to separate overlapping portions of the different LN. The standard deviation in segmentation accuracy at different time points was utmost 0.05. Conclusions: Our initial evaluation of the grow cut segmentation shows reasonably accurate and consistent volumetric segmentations of LN with minimal user effort and time.« less

Locating hardware faults in a parallel computer

DOEpatents

Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

2010-04-13

Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

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

PubMed

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

2006-01-01

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

Weighted compactness function based label propagation algorithm for community detection

NASA Astrophysics Data System (ADS)

Zhang, Weitong; Zhang, Rui; Shang, Ronghua; Jiao, Licheng

2018-02-01

Community detection in complex networks, is to detect the community structure with the internal structure relatively compact and the external structure relatively sparse, according to the topological relationship among nodes in the network. In this paper, we propose a compactness function which combines the weight of nodes, and use it as the objective function to carry out the node label propagation. Firstly, according to the node degree, we find the sets of core nodes which have great influence on the network. The more the connections between the core nodes and the other nodes are, the larger the amount of the information these kernel nodes receive and transform. Then, according to the similarity of the nodes between the core nodes sets and the nodes degree, we assign weights to the nodes in the network. So the label of the nodes with great influence will be the priority in the label propagation process, which effectively improves the accuracy of the label propagation. The compactness function between nodes and communities in this paper is based on the nodes influence. It combines the connections between nodes and communities with the degree of the node belongs to its neighbor communities based on calculating the node weight. The function effectively uses the information of nodes and connections in the network. The experimental results show that the proposed algorithm can achieve good results in the artificial network and large-scale real networks compared with the 8 contrast algorithms.

The Bookmark Procedure for Setting Cut-Scores and Finalizing Performance Standards: Strengths and Weaknesses

ERIC Educational Resources Information Center

Lin, Jie

2006-01-01

The Bookmark standard-setting procedure was developed to address the perceived problems with the most popular method for setting cut-scores: the Angoff procedure (Angoff, 1971). The purposes of this article are to review the Bookmark procedure and evaluate it in terms of Berk's (1986) criteria for evaluating cut-score setting methods. The…

Chapter 28: Theory SkyNode

NASA Astrophysics Data System (ADS)

Wagner, R.; Norman, M. L.

Here we present a working example of a Basic SkyNode serving theoretical data. The data is taken from the Simulated Cluster Archive (SCA), a set of simulated X-ray clusters, where each cluster was computed using four different physics models. The LCA Theory SkyNode (LCATheory) tables contain columns of the integrated physical properties of the clusters at various redshifts. The ease of setting up a Theory SkyNode is an important result, because it represents a clear way to present theory data to the Virtual Observatory. Also, our Theory SkyNode provides a prototype for additional simulated object catalogs, which will be created from other simulations by our group, and hopefully others.

Arterial spin labeling perfusion-weighted MR imaging: correlation of tumor blood flow with pathological degree of tumor differentiation, clinical stage and nodal metastasis of head and neck squamous cell carcinoma.

PubMed

Abdel Razek, Ahmed Abdel Khalek; Nada, Nadia

2018-05-01

The prognostic parameters of head and neck squamous cell carcinoma (HNSCC) include the pathological degree of tumor differentiation, clinical staging, and presence of metastatic cervical lymph nodes. To correlate tumor blood flow (TBF) acquired from arterial spin labeling (ASL) perfusion-weighted MR imaging with pathological degree of tumor differentiation, clinical stage, and nodal metastasis of HNSCC. Retrospective analysis of 43 patients (31 male, 12 female with a mean age of 65 years) with HNSCC that underwent ASL of head and neck and TBF of HNSCC was calculated. Tumor staging and metastatic lymph nodes were determined. The stages of HNSCC were stage 1 (n = 7), stage II (n = 12), stage III (n = 11) and stage IV (n = 13). Metastatic cervical lymph nodes were seen in 24 patients. The degree of tumor differentiation was determined through pathological examination. The mean TBF of poorly and undifferentiated HNSCC (157.4 ± 6.7 mL/100 g/min) was significantly different (P = 0.001) than that of well-to-moderately differentiated (142.5 ± 5.7 mL/100 g/min) HNSCC. The cut-off TBF used to differentiate well-moderately differentiated from poorly and undifferentiated HNSCC was 152 mL/100 g/min with an area under the curve of 0.658 and accuracy of 88.4%. The mean TBF of stages I, II (146.10 ± 9.1 mL/100 g/min) was significantly different (P = 0.014) than that of stages III, IV (153.33 ± 9.3 mL/100 g/min) HNSCC. The cut-off TBF used to differentiate stages I, II from stages III and IV was 148 mL/100 g/min with an area under the curve of 0.701 and accuracy of 69.8%. The TBF was higher in patients with metastatic cervical lymph nodes. The cut-off TBF suspect metastatic node was 147 mL/100 g/min with an area under the curve of 0.671 and accuracy of 67.4%. TBF is a non-invasive imaging parameter that well correlated with pathological degree of tumor differentiation, clinical stage of tumor and nodal metastasis of HNSCC.

Randomized comparison of power Doppler ultrasonography-guided core-needle biopsy with open surgical biopsy for the characterization of lymphadenopathies in patients with suspected lymphoma.

PubMed

Pugliese, Novella; Di Perna, M; Cozzolino, I; Ciancia, G; Pettinato, G; Zeppa, P; Varone, V; Masone, S; Cerchione, C; Della Pepa, R; Simeone, L; Giordano, C; Martinelli, V; Salvatore, C; Pane, F; Picardi, M

2017-04-01

The sensitivity of lymph node core-needle biopsy under imaging guidance requires validation. We employed power Doppler ultrasonography (PDUS) to select the lymph node most suspected of malignancy and to histologically characterize it through the use of large cutting needle. Institutional review board approval and informed consent were obtained for this randomized clinical trial. In a single center between 1 January 2009 and 31 December 2015, patients with lymph node enlargement suspected for lymphoma were randomly assigned (1:1) to biopsy with either standard surgery or PDUS-guided 16-gauge modified Menghini needle. The primary endpoint was the superiority of sensitivity for the diagnosis of malignancy for core-needle cutting biopsy (CNCB). Secondary endpoints were times to biopsy, complications, and costs. A total of 376 patients were randomized into the two arms and received allocated biopsy. However, four patients undergoing CNCB were excluded for inadequate samples; thus, 372 patients were analyzed. Sensitivity for the detection of malignancy was significantly better for PDUS-guided CNCB [98.8%; 95% confidence interval (CI), 95.9-99.9] than standard biopsy (88.7%; 95% CI, 82.9-93; P < 0.001). For all secondary endpoints, the comparison was significantly disadvantageous for conventional approach. In particular, estimated cost per biopsy performed with standard surgery was 24-fold higher compared with that performed with CNCB. The presence of satellite enlarged reactive and/or necrotic lymph nodes may impair the success of an open surgical biopsy (OSB). PDUS and CNCB with adequate gauge are diagnostic tools that enable effective, safe, fast, and low-cost routine biopsy for patients with suspected lymphoma, avoiding psychological and physical pain of an unnecessary surgical intervention.

Exploring anti-community structure in networks with application to incompatibility of traditional Chinese medicine

NASA Astrophysics Data System (ADS)

Zhu, Jiajing; Liu, Yongguo; Zhang, Yun; Liu, Xiaofeng; Xiao, Yonghua; Wang, Shidong; Wu, Xindong

2017-11-01

Community structure is one of the most important properties in networks, in which a node shares its most connections with the others in the same community. On the contrary, the anti-community structure means the nodes in the same group have few or no connections with each other. In Traditional Chinese Medicine (TCM), the incompatibility problem of herbs is a challenge to the clinical medication safety. In this paper, we propose a new anti-community detection algorithm, Random non-nEighboring nOde expansioN (REON), to find anti-communities in networks, in which a new evaluation criterion, anti-modularity, is designed to measure the quality of the obtained anti-community structure. In order to establish anti-communities in REON, we expand the node set by non-neighboring node expansion and regard the node set with the highest anti-modularity as an anti-community. Inspired by the phenomenon that the node with higher degree has greater contribution to the anti-modularity, an improved algorithm called REONI is developed by expanding node set by the non-neighboring node with the maximum degree, which greatly enhances the efficiency of REON. Experiments on synthetic and real-world networks demonstrate the superiority of the proposed algorithms over the existing methods. In addition, by applying REONI to the herb network, we find that it can discover incompatible herb combinations.

Subgrouping Automata: automatic sequence subgrouping using phylogenetic tree-based optimum subgrouping algorithm.

PubMed

Seo, Joo-Hyun; Park, Jihyang; Kim, Eun-Mi; Kim, Juhan; Joo, Keehyoung; Lee, Jooyoung; Kim, Byung-Gee

2014-02-01

Sequence subgrouping for a given sequence set can enable various informative tasks such as the functional discrimination of sequence subsets and the functional inference of unknown sequences. Because an identity threshold for sequence subgrouping may vary according to the given sequence set, it is highly desirable to construct a robust subgrouping algorithm which automatically identifies an optimal identity threshold and generates subgroups for a given sequence set. To meet this end, an automatic sequence subgrouping method, named 'Subgrouping Automata' was constructed. Firstly, tree analysis module analyzes the structure of tree and calculates the all possible subgroups in each node. Sequence similarity analysis module calculates average sequence similarity for all subgroups in each node. Representative sequence generation module finds a representative sequence using profile analysis and self-scoring for each subgroup. For all nodes, average sequence similarities are calculated and 'Subgrouping Automata' searches a node showing statistically maximum sequence similarity increase using Student's t-value. A node showing the maximum t-value, which gives the most significant differences in average sequence similarity between two adjacent nodes, is determined as an optimum subgrouping node in the phylogenetic tree. Further analysis showed that the optimum subgrouping node from SA prevents under-subgrouping and over-subgrouping. Copyright © 2013. Published by Elsevier Ltd.

Reinforcement Learning Trees

PubMed Central

Zhu, Ruoqing; Zeng, Donglin; Kosorok, Michael R.

2015-01-01

In this paper, we introduce a new type of tree-based method, reinforcement learning trees (RLT), which exhibits significantly improved performance over traditional methods such as random forests (Breiman, 2001) under high-dimensional settings. The innovations are three-fold. First, the new method implements reinforcement learning at each selection of a splitting variable during the tree construction processes. By splitting on the variable that brings the greatest future improvement in later splits, rather than choosing the one with largest marginal effect from the immediate split, the constructed tree utilizes the available samples in a more efficient way. Moreover, such an approach enables linear combination cuts at little extra computational cost. Second, we propose a variable muting procedure that progressively eliminates noise variables during the construction of each individual tree. The muting procedure also takes advantage of reinforcement learning and prevents noise variables from being considered in the search for splitting rules, so that towards terminal nodes, where the sample size is small, the splitting rules are still constructed from only strong variables. Last, we investigate asymptotic properties of the proposed method under basic assumptions and discuss rationale in general settings. PMID:26903687

Optical differentiation between malignant and benign lymphadenopathy by grey scale texture analysis of endobronchial ultrasound convex probe images.

PubMed

Nguyen, Phan; Bashirzadeh, Farzad; Hundloe, Justin; Salvado, Olivier; Dowson, Nicholas; Ware, Robert; Masters, Ian Brent; Bhatt, Manoj; Kumar, Aravind Ravi; Fielding, David

2012-03-01

Morphologic and sonographic features of endobronchial ultrasound (EBUS) convex probe images are helpful in predicting metastatic lymph nodes. Grey scale texture analysis is a well-established methodology that has been applied to ultrasound images in other fields of medicine. The aim of this study was to determine if this methodology could differentiate between benign and malignant lymphadenopathy of EBUS images. Lymph nodes from digital images of EBUS procedures were manually mapped to obtain a region of interest and were analyzed in a prediction set. The regions of interest were analyzed for the following grey scale texture features in MATLAB (version 7.8.0.347 [R2009a]): mean pixel value, difference between maximal and minimal pixel value, SEM pixel value, entropy, correlation, energy, and homogeneity. Significant grey scale texture features were used to assess a validation set compared with fluoro-D-glucose (FDG)-PET-CT scan findings where available. Fifty-two malignant nodes and 48 benign nodes were in the prediction set. Malignant nodes had a greater difference in the maximal and minimal pixel values, SEM pixel value, entropy, and correlation, and a lower energy (P < .0001 for all values). Fifty-one lymph nodes were in the validation set; 44 of 51 (86.3%) were classified correctly. Eighteen of these lymph nodes also had FDG-PET-CT scan assessment, which correctly classified 14 of 18 nodes (77.8%), compared with grey scale texture analysis, which correctly classified 16 of 18 nodes (88.9%). Grey scale texture analysis of EBUS convex probe images can be used to differentiate malignant and benign lymphadenopathy. Preliminary results are comparable to FDG-PET-CT scan.

Diamonds in the rough: key performance indicators for reticles and design sets

NASA Astrophysics Data System (ADS)

Ackmann, Paul

2008-10-01

The discussion on reticle cost continues to raise questions by many in the semiconductor industry. The diamond industry developed a method to judge and grade diamonds. [1, 11] The diamond-marketing tool of "The 4Cs of Diamonds" and other slogans help explain the multiple, complex variables that determine the value of a particular stone. Understanding the critical factors of Carat, Clarity, Color, and Cut allows all customers to choose a gem that matches their unique desires. I apply the same principles of "The 4Cs of Diamonds" to develop an analogous method for rating and tracking reticle performance. I introduced the first 3Cs of reticle manufacturing during my BACUS presentation panel at SPIE in February 2008. [2] To these first 3Cs (Capital, Complexity, and Content), I now add a fourth, Cycle time. I will look at how our use of reticles changes by node and use "The 4Cs of Reticles" to develop the key performance indicators (KPI) that will help our industry set standards for evaluating reticle technology. Capital includes both cost and utilization. This includes tools, people, facilities, and support systems required for building the most critical reticles. Tools have highest value in the first two years of use, and each new technology node will likely increase the Capital cost of reticles. New technologies, specifications, and materials drive Complexity for reticles, including smaller feature size, increased optical proximity correction (OPC), and more levels at sub-wavelength. The large data files needed to create finer features require the use of the newest tools for writing, inspection, and repair. Content encompasses the customer's specifications and requirements, which the mask shop must meet. The specifications are critical because they drive wafer yield. A clear increase of the number of masking levels has occurred since the 90 nm node. Cycle time starts when the design is finished and lasts until the mask house ships the reticle to the fab. Depending on the level of Complexity, a reticle can take from as few as one, to more than forty, days to build. By using the 4Cs, I can show how the reticle build has changed from the 90 nm technology node. I will begin by delineating proposed KPIs for reticles.

Assessment of freeze injury of grapevine green tissues in response to cultivars and a cryoprotectant product

USDA-ARS?s Scientific Manuscript database

Spring frosts and subsequent crop losses threaten the economic sustainability of fruit crop producers all over the world. This study used a controlled-freezing technique to impose a post-budbreak freezing stress to grapevine shoots forced from one-node cuttings ['Albariño', 'Cabernet Franc', 'Cabern...

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020361 (26 June 2014) --- NASA astronaut Steve Swanson (right), Expedition 40 commander; and European Space Agency astronaut Alexander Gerst, flight engineer, enjoy a light moment in the Unity node of the International Space Station. Gerst is holding hair clippers fashioned with a vacuum device to garner freshly cut hair. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

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

PubMed

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

2014-01-01

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

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

PubMed

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

2009-06-01

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

Prediction of Non-sentinel Node Status in Patients with Melanoma and Positive Sentinel Node Biopsy: An Italian Melanoma Intergroup (IMI) Study.

PubMed

Rossi, Carlo Riccardo; Mocellin, Simone; Campana, Luca Giovanni; Borgognoni, Lorenzo; Sestini, Serena; Giudice, Giuseppe; Caracò, Corrado; Cordova, Adriana; Solari, Nicola; Piazzalunga, Dario; Carcoforo, Paolo; Quaglino, Pietro; Caliendo, Virginia; Ribero, Simone

2018-01-01

Approximately 20% of melanoma patients harbor metastases in non-sentinel nodes (NSNs) after a positive sentinel node biopsy (SNB), and recent evidence questions the therapeutic benefit of completion lymph node dissection (CLND). We built a nomogram for prediction of NSN status in melanoma patients with positive SNB. Data on anthropometric and clinicopathological features of patients with cutaneous melanoma who underwent CLND after a positive SNB were collected from nine Italian centers. Multivariate logistic regression was utilized to identify predictors of NSN status in a training set, while model efficiency was validated in a validation set. Data were available for 1220 patients treated from 2000 through 2016. In the training set (n = 810), the risk of NSN involvement was higher when (1) the primary melanoma is thicker or (2) sited in the trunk/head and neck; (3) fewer nodes are excised and (4) more nodes are involved; and (5) the lymph node metastasis is larger or (6) is deeply located. The model showed high discrimination (area under the receiver operating characteristic curve 0.74, 95% confidence interval [CI] 0.70-0.79) and calibration (Brier score 0.16, 95% CI 0.15-0.17) performance in the validation set (n = 410). The nomogram including these six clinicopathological variables performed significantly better than five other previously published models in terms of both discrimination and calibration. Our nomogram could be useful for follow-up personalization in clinical practice, and for patient risk stratification while conducting clinical trials or analyzing their results.

Soybean fruit development and set at the node level under combined photoperiod and radiation conditions

PubMed Central

Nico, Magalí; Mantese, Anita I.; Miralles, Daniel J.; Kantolic, Adriana G.

2016-01-01

In soybean, long days during post-flowering increase seed number. This positive photoperiodic effect on seed number has been previously associated with increments in the amount of radiation accumulated during the crop cycle because long days extend the duration of the crop cycle. However, evidence of intra-nodal processes independent of the availability of assimilates suggests that photoperiodic effects at the node level might also contribute to pod set. This work aims to identify the main mechanisms responsible for the increase in pod number per node in response to long days; including the dynamics of flowering, pod development, growth and set at the node level. Long days increased pods per node on the main stems, by increasing pods on lateral racemes (usually dominated positions) at some main stem nodes. Long days lengthened the flowering period and thereby increased the number of opened flowers on lateral racemes. The flowering period was prolonged under long days because effective seed filling was delayed on primary racemes (dominant positions). Long days also delayed the development of flowers into pods with filling seeds, delaying the initiation of pod elongation without modifying pod elongation rate. The embryo development matched the external pod length irrespective of the pod’s chronological age. These results suggest that long days during post-flowering enhance pod number per node through a relief of the competition between pods of different hierarchy within the node. The photoperiodic effect on the development of dominant pods, delaying their elongation and therefore postponing their active growth, extends flowering and allows pod set at positions that are usually dominated. PMID:26512057

Self-aligned blocking integration demonstration for critical sub-40nm pitch Mx level patterning

NASA Astrophysics Data System (ADS)

Raley, Angélique; Mohanty, Nihar; Sun, Xinghua; Farrell, Richard A.; Smith, Jeffrey T.; Ko, Akiteru; Metz, Andrew W.; Biolsi, Peter; Devilliers, Anton

2017-04-01

Multipatterning has enabled continued scaling of chip technology at the 28nm node and beyond. Selfaligned double patterning (SADP) and self-aligned quadruple patterning (SAQP) as well as Litho- Etch/Litho-Etch (LELE) iterations are widely used in the semiconductor industry to enable patterning at sub 193 immersion lithography resolutions for layers such as FIN, Gate and critical Metal lines. Multipatterning requires the use of multiple masks which is costly and increases process complexity as well as edge placement error variation driven mostly by overlay. To mitigate the strict overlay requirements for advanced technology nodes (7nm and below), a self-aligned blocking integration is desirable. This integration trades off the overlay requirement for an etch selectivity requirement and enables the cut mask overlay tolerance to be relaxed from half pitch to three times half pitch. Selfalignement has become the latest trend to enable scaling and self-aligned integrations are being pursued and investigated for various critical layers such as contact, via, metal patterning. In this paper we propose and demonstrate a low cost flexible self-aligned blocking strategy for critical metal layer patterning for 7nm and beyond from mask assembly to low -K dielectric etch. The integration is based on a 40nm pitch SADP flow with 2 cut masks compatible with either cut or block integration and employs dielectric films widely used in the back end of the line. As a consequence this approach is compatible with traditional etch, deposition and cleans tools that are optimized for dielectric etches. We will review the critical steps and selectivities required to enable this integration along with bench-marking of each integration option (cut vs. block).

Evaluation of prognostic value and stage migration effect using positive lymph node ratio in gastric cancer.

PubMed

Komatsu, S; Ichikawa, D; Nishimura, M; Kosuga, T; Okamoto, K; Konishi, H; Shiozaki, A; Fujiwara, H; Otsuji, E

2017-01-01

To detect the best cut-off value of the positive lymph node ratio (PLNR) for stratifying the prognosis and analyzing its value with regard to stage migration effect using PLNR in gastric cancer. We retrospectively analyzed 1069 consecutive gastric cancer patients, who underwent curative gastrectomy with radical lymphadenectomy from 1997 through 2009. 1) The mean number of dissected lymph nodes was 42.6 in pStage I, 32.4 in pStage II and 37.1 in pStage III. The PLNR of 0.2 was proved to be the best cut-off value to stratify the prognosis of patients into two groups (P < 0.0001; PLNR <0.2 vs. PLNR ≥0.2), and patients were correctly classified into four groups: PLNR 0, PLNR 0-<0.2, PLNR 0.2-<0.4 and PLNR ≥0.4 by the Kaplan-Meier method. 2) Compared patients with the PLNR <0.2, those with the PLNR ≥0.2 had a significantly higher incidence of pT3 or greater, pN2 or greater, lymphatic invasion, vascular invasion and undifferentiated cancer. Multivariate analysis showed that the PLNR ≥0.2 was an independent prognostic factor [P < 0.0001, HR 2.77 (95% CI: 1.87-4.09)]. 2) The PLNR cut-off value of 0.2 could discriminate a stage migration effect in pN2-N3 and pStage II-III, which patients with PLNR ≥0.2 might be potentially diagnosed as a lower stage after gastrectomy. The PLNR contributes to evaluating prognosis and stage migration effect even in a single institute and enable to identify those who need meticulous treatments and follow-up in patients with gastric cancer. Copyright © 2016 Elsevier Ltd, BASO ~ The Association for Cancer Surgery, and the European Society of Surgical Oncology. All rights reserved.

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%).

CO 2 laser cutting of MDF . 1. Determination of process parameter settings

NASA Astrophysics Data System (ADS)

Lum, K. C. P.; Ng, S. L.; Black, I.

2000-02-01

This paper details an investigation into the laser processing of medium-density fibreboard (MDF). Part 1 reports on the determination of process parameter settings for the effective cutting of MDF by CO 2 laser, using an established experimental methodology developed to study the interrelationship between and effects of varying laser set-up parameters. Results are presented for both continuous wave (CW) and pulse mode (PM) cutting, and the associated cut quality effects have been commented on.

Comparison of axillary bud growth and patatin accumulation in potato leaf cuttings as assays for tuber induction

NASA Technical Reports Server (NTRS)

Wheeler, R. M.; Hannapel, D. J.; Tibbitts, T. W.

1988-01-01

Single-node leaf cuttings from potatoes (Solanum tuberosum L.) cvs. Norland, Superior, Norchip, and Kennebec, were used to assess tuber induction in plants grown under 12, 16, and 20 h daily irradiation (400 micromol s-1 m-2 PPF). Leaf cuttings were taken from plants at four, six and 15 weeks after planting and cultured for 14 d in sand trays in humid environments. Tuber induction was determined by visually rating the type of growth at the attached axillary bud, and by measuring the accumulation of the major tuber protein, patatin, in the base of the petioles. Axillary buds from leaf cuttings of plants grown under the 12 h photoperiod consistently formed round, sessile tubers at the axils for all four cultivars at all harvests. Buds from cuttings of plants grown under the 16 and 20 h photoperiods exhibited mixed tuber, stolon, and leafy shoot growth. Patatin accumulation was highest in petioles of cuttings taken from 12 h plants for all cultivars at all harvests, with levels in 16 and 20 h cuttings approx. one-half that of the 12 h cuttings. Trends, both in visual ratings of axillary buds and in petiole patatin accumulation, followed the harvest index (ratio of tuber to total plant dry matter), suggesting that either method is an acceptable assay for tuber induction in the potato.

Lymph nodes ratio based nomogram predicts survival of resectable gastric cancer regardless of the number of examined lymph nodes.

PubMed

Chen, Shangxiang; Rao, Huamin; Liu, Jianjun; Geng, Qirong; Guo, Jing; Kong, Pengfei; Li, Shun; Liu, Xuechao; Sun, Xiaowei; Zhan, Youqing; Xu, Dazhi

2017-07-11

To develop a nomogram to predict the prognosis of gastric cancer patients on the basis of metastatic lymph nodes ratio (mLNR), especially in the patients with total number of examined lymph nodes (TLN) less than 15. The nomogram was constructed based on a retrospective database that included 2,205 patients underwent curative resection in Cancer Center, Sun Yat-sen University (SYSUCC). Resectable gastric cancer (RGC) patients underwent curative resection before December 31, 2008 were assigned as the training set (n=1,470) and those between January 1, 2009 and December 31, 2012 were selected as the internal validation set (n=735). Additional external validations were also performed separately by an independent data set (n=602) from Jiangxi Provincial Cancer Hospital (JXCH) in Jiangxi, China and a data set (n=3,317) from the Surveillance, Epidemiology, and End Results (SEER) database. The Independent risk factors were identified by Multivariate Cox Regression. In the SYSUCC set, TNM (Tumor-node-metastasis) and TRM-based (Tumor-Positive Nodes Ratio-Metastasis) nomograms were constructed respectively. The TNM-based nomogram showed better discrimination than the AJCC-TNM staging system (C-index: 0.73 versus 0.69, p<0.01). When the mLNR was included in the nomogram, the C-index increased to 0.76. Furthermore, the C-index in the TRM-based nomogram was similar between TLN ≥16 (C-index: 0.77) and TLN ≤15 (C-index: 0.75). The discrimination was further ascertained by internal and external validations. We developed and validated a novel TRM-based nomogram that provided more accurate prediction of survival for gastric cancer patients who underwent curative resection, regardless of the number of examined lymph nodes.

A new centrality measure for identifying influential nodes in social networks

NASA Astrophysics Data System (ADS)

Rhouma, Delel; Ben Romdhane, Lotfi

2018-04-01

The identification of central nodes has been a key problem in the field of social network analysis. In fact, it is a measure that accounts the popularity or the visibility of an actor within a network. In order to capture this concept, various measures, either sample or more elaborate, has been developed. Nevertheless, many of "traditional" measures are not designed to be applicable to huge data. This paper sets out a new node centrality index suitable for large social network. It uses the amount of the neighbors of a node and connections between them to characterize a "pivot" node in the graph. We presented experimental results on real data sets which show the efficiency of our proposal.

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.

Random topologies and the emergence of cooperation: the role of short-cuts

NASA Astrophysics Data System (ADS)

Vilone, D.; Sánchez, A.; Gómez-Gardeñes, J.

2011-04-01

We study in detail the role of short-cuts in promoting the emergence of cooperation in a network of agents playing the Prisoner's Dilemma game (PDG). We introduce a model whose topology interpolates between the one-dimensional Euclidean lattice (a ring) and the complete graph by changing the value of one parameter (the probability p of adding a link between two nodes not already connected in the Euclidean configuration). We show that there is a region of values of p in which cooperation is greatly enhanced, whilst for smaller values of p only a few cooperators are present in the final state, and for p\\rightarrow 1^- cooperation is totally suppressed. We present analytical arguments that provide a very plausible interpretation of the simulation results, thus unveiling the mechanism by which short-cuts contribute to promoting (or suppressing) cooperation.

High Occurrence of Aberrant Lymph Node Spread on Magnetic Resonance Lymphography in Prostate Cancer Patients With a Biochemical Recurrence After Radical Prostatectomy

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

Meijer, Hanneke J.M., E-mail: H.Meijer@rther.umcn.nl; Lin, Emile N. van; Debats, Oscar A.

2012-03-15

Purpose: To investigate the pattern of lymph node spread in prostate cancer patients with a biochemical recurrence after radical prostatectomy, eligible for salvage radiotherapy; and to determine whether the clinical target volume (CTV) for elective pelvic irradiation in the primary setting can be applied in the salvage setting for patients with (a high risk of) lymph node metastases. Methods and Materials: The charts of 47 prostate cancer patients with PSA recurrence after prostatectomy who had positive lymph nodes on magnetic resonance lymphography (MRL) were reviewed. Positive lymph nodes were assigned to a lymph node region according to the guidelines ofmore » the Radiation Therapy Oncology Group (RTOG) for delineation of the CTV for pelvic irradiation (RTOG-CTV). We defined four lymph node regions for positive nodes outside this RTOG-CTV: the para-aortal, proximal common iliac, pararectal, and paravesical regions. They were referred to as aberrant lymph node regions. For each patient, clinical and pathologic features were recorded, and their association with aberrant lymph drainage was investigated. The distribution of positive lymph nodes was analyzed separately for patients with a prostate-specific antigen (PSA) <1.0 ng/mL. Results: MRL detected positive aberrant lymph nodes in 37 patients (79%). In 20 patients (43%) a positive lymph node was found in the pararectal region. Higher PSA at the time of MRL was associated with the presence of positive lymph nodes in the para-aortic region (2.49 vs. 0.82 ng/mL; p = 0.007) and in the proximal common iliac region (1.95 vs. 0.59 ng/mL; p = 0.009). There were 18 patients with a PSA <1.0 ng/mL. Ten of these patients (61%) had at least one aberrant positive lymph node. Conclusion: Seventy-nine percent of the PSA-recurrent patients had at least one aberrant positive lymph node. Application of the standard RTOG-CTV for pelvic irradiation in the salvage setting therefore seems to be inappropriate.« less

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

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

Chow, J

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

Towards a Methodology for Validation of Centrality Measures in Complex Networks

PubMed Central

2014-01-01

Background Living systems are associated with Social networks — networks made up of nodes, some of which may be more important in various aspects as compared to others. While different quantitative measures labeled as “centralities” have previously been used in the network analysis community to find out influential nodes in a network, it is debatable how valid the centrality measures actually are. In other words, the research question that remains unanswered is: how exactly do these measures perform in the real world? So, as an example, if a centrality of a particular node identifies it to be important, is the node actually important? Purpose The goal of this paper is not just to perform a traditional social network analysis but rather to evaluate different centrality measures by conducting an empirical study analyzing exactly how do network centralities correlate with data from published multidisciplinary network data sets. Method We take standard published network data sets while using a random network to establish a baseline. These data sets included the Zachary's Karate Club network, dolphin social network and a neural network of nematode Caenorhabditis elegans. Each of the data sets was analyzed in terms of different centrality measures and compared with existing knowledge from associated published articles to review the role of each centrality measure in the determination of influential nodes. Results Our empirical analysis demonstrates that in the chosen network data sets, nodes which had a high Closeness Centrality also had a high Eccentricity Centrality. Likewise high Degree Centrality also correlated closely with a high Eigenvector Centrality. Whereas Betweenness Centrality varied according to network topology and did not demonstrate any noticeable pattern. In terms of identification of key nodes, we discovered that as compared with other centrality measures, Eigenvector and Eccentricity Centralities were better able to identify important nodes. PMID:24709999

Cascade phenomenon against subsequent failures in complex networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liu, Zhi-Quan; He, Xuan; Ma, Jian-Feng

2018-06-01

Cascade phenomenon may lead to catastrophic disasters which extremely imperil the network safety or security in various complex systems such as communication networks, power grids, social networks and so on. In some flow-based networks, the load of failed nodes can be redistributed locally to their neighboring nodes to maximally preserve the traffic oscillations or large-scale cascading failures. However, in such local flow redistribution model, a small set of key nodes attacked subsequently can result in network collapse. Then it is a critical problem to effectively find the set of key nodes in the network. To our best knowledge, this work is the first to study this problem comprehensively. We first introduce the extra capacity for every node to put up with flow fluctuations from neighbors, and two extra capacity distributions including degree based distribution and average distribution are employed. Four heuristic key nodes discovering methods including High-Degree-First (HDF), Low-Degree-First (LDF), Random and Greedy Algorithms (GA) are presented. Extensive simulations are realized in both scale-free networks and random networks. The results show that the greedy algorithm can efficiently find the set of key nodes in both scale-free and random networks. Our work studies network robustness against cascading failures from a very novel perspective, and methods and results are very useful for network robustness evaluations and protections.

An Extraction Method of an Informative DOM Node from a Web Page by Using Layout Information

NASA Astrophysics Data System (ADS)

Tsuruta, Masanobu; Masuyama, Shigeru

We propose an informative DOM node extraction method from a Web page for preprocessing of Web content mining. Our proposed method LM uses layout data of DOM nodes generated by a generic Web browser, and the learning set consists of hundreds of Web pages and the annotations of informative DOM nodes of those Web pages. Our method does not require large scale crawling of the whole Web site to which the target Web page belongs. We design LM so that it uses the information of the learning set more efficiently in comparison to the existing method that uses the same learning set. By experiments, we evaluate the methods obtained by combining one that consists of the method for extracting the informative DOM node both the proposed method and the existing methods, and the existing noise elimination methods: Heur removes advertisements and link-lists by some heuristics and CE removes the DOM nodes existing in the Web pages in the same Web site to which the target Web page belongs. Experimental results show that 1) LM outperforms other methods for extracting the informative DOM node, 2) the combination method (LM, {CE(10), Heur}) based on LM (precision: 0.755, recall: 0.826, F-measure: 0.746) outperforms other combination methods.

The Cut-Score Operating Function: A New Tool to Aid in Standard Setting

ERIC Educational Resources Information Center

Grabovsky, Irina; Wainer, Howard

2017-01-01

In this essay, we describe the construction and use of the Cut-Score Operating Function in aiding standard setting decisions. The Cut-Score Operating Function shows the relation between the cut-score chosen and the consequent error rate. It allows error rates to be defined by multiple loss functions and will show the behavior of each loss…

Soybean fruit development and set at the node level under combined photoperiod and radiation conditions.

PubMed

Nico, Magalí; Mantese, Anita I; Miralles, Daniel J; Kantolic, Adriana G

2016-01-01

In soybean, long days during post-flowering increase seed number. This positive photoperiodic effect on seed number has been previously associated with increments in the amount of radiation accumulated during the crop cycle because long days extend the duration of the crop cycle. However, evidence of intra-nodal processes independent of the availability of assimilates suggests that photoperiodic effects at the node level might also contribute to pod set. This work aims to identify the main mechanisms responsible for the increase in pod number per node in response to long days; including the dynamics of flowering, pod development, growth and set at the node level. Long days increased pods per node on the main stems, by increasing pods on lateral racemes (usually dominated positions) at some main stem nodes. Long days lengthened the flowering period and thereby increased the number of opened flowers on lateral racemes. The flowering period was prolonged under long days because effective seed filling was delayed on primary racemes (dominant positions). Long days also delayed the development of flowers into pods with filling seeds, delaying the initiation of pod elongation without modifying pod elongation rate. The embryo development matched the external pod length irrespective of the pod's chronological age. These results suggest that long days during post-flowering enhance pod number per node through a relief of the competition between pods of different hierarchy within the node. The photoperiodic effect on the development of dominant pods, delaying their elongation and therefore postponing their active growth, extends flowering and allows pod set at positions that are usually dominated. © The Author 2015. Published by Oxford University Press on behalf of the Society for Experimental Biology.

A Comparison of Cut Scores Using Multiple Standard Setting Methods.

ERIC Educational Resources Information Center

Impara, James C.; Plake, Barbara S.

This paper reports the results of using several alternative methods of setting cut scores. The methods used were: (1) a variation of the Angoff method (1971); (2) a variation of the borderline group method; and (3) an advanced impact method (G. Dillon, 1996). The results discussed are from studies undertaken to set the cut scores for fourth grade…

Military Standard Common APSE (Ada Programming Support Environment) Interface Set (CAIS).

DTIC Science & Technology

1985-01-01

QUEUEASE. LAST-KEY (QUEENAME) . LASTREI.TIONI(QUEUE-NAME). FILE-NODE. PORN . ATTRIBUTTES. ACCESSCONTROL. LEVEL); CLOSE (QUEUE BASE); CLOSE(FILE NODE...PROPOSED XIIT-STD-C.4 31 J NNUAfY logs procedure zTERT (ITERATOR: out NODE ITERATON; MAMIE: NAME STRING.KIND: NODE KID : KEY : RELATIONSHIP KEY PA1TTE1 :R

Mining Top K Spread Sources for a Specific Topic and a Given Node.

PubMed

Liu, Weiwei; Deng, Zhi-Hong; Cao, Longbing; Xu, Xiaoran; Liu, He; Gong, Xiuwen

2015-11-01

In social networks, nodes (or users) interested in specific topics are often influenced by others. The influence is usually associated with a set of nodes rather than a single one. An interesting but challenging task for any given topic and node is to find the set of nodes that represents the source or trigger for the topic and thus identify those nodes that have the greatest influence on the given node as the topic spreads. We find that it is an NP-hard problem. This paper proposes an effective framework to deal with this problem. First, the topic propagation is represented as the Bayesian network. We then construct the propagation model by a variant of the voter model. The probability transition matrix (PTM) algorithm is presented to conduct the probability inference with the complexity O(θ(3)log2θ), while θ is the number nodes in the given graph. To evaluate the PTM algorithm, we conduct extensive experiments on real datasets. The experimental results show that the PTM algorithm is both effective and efficient.

Social network analysis for assessment of avian influenza spread and trading patterns of backyard chickens in Nakhon Pathom, Suphan Buri and Ratchaburi, Thailand.

PubMed

Poolkhet, C; Chairatanayuth, P; Thongratsakul, S; Yatbantoong, N; Kasemsuwan, S; Damchoey, D; Rukkwamsuk, T

2013-09-01

The aim of this study is to explain the social networks of the backyard chicken in Ratchaburi, Suphan Buri and Nakhon Pathom Provinces. In this study, we designed the nodes as groups of persons or places involved in activities relating to backyard chickens. The ties are all activities related to the nodes. The study applied a partial network approach to assess the spreading pattern of avian influenza. From 557 questionnaires collected from the nodes, the researchers found that the degree (the numbers of ties that a node has) and closeness (the distance from one node to the others) centralities of Nakhon Pathom were significantly higher than those of the others (P<0.001). The results show that compared with the remaining areas, this area is more quickly connected to many links. If the avian influenza virus subtype H5N1 was released into the network, the disease would spread throughout this province more rapidly than in Ratchaburi and Suphan Buri. The betweenness centrality in each of these provinces showed no differences (P>0.05). In this study, the nodes that play an important role in all networks are farmers who raise consumable chicken, farmers who raise both consumable chicken and fighting cocks, farmers' households that connect with dominant nodes, and the owners and observers of fighting cocks at arenas and training fields. In this study, we did not find cut points or blocks in the network. Moreover, we detected a random network in all provinces. Thus, connectivity between the nodes covers long or short distances, with less predictable behaviour. Finally, this study suggests that activities between the important nodes must receive special attention for disease control during future disease outbreaks. © 2012 Blackwell Verlag GmbH.

Effects of phyllotaxy on biomechanical properties of stems of Cercis occidentalis (Fabaceae).

PubMed

Caringella, Marissa A; Bergman, Brett A; Stanfield, Ryan C; Ewers, Madeleine M; Bobich, Edward G; Ewers, Frank W

2014-01-01

Phyllotaxy, the arrangement of leaves on a stem, may impact the mechanical properties of woody stems several years after the leaves have been shed. We explored mechanical properties of a plant with alternate distichous phyllotaxy, with a row of leaves produced on each side of the stem, to determine whether the nodes behave as spring-like joints. Flexural stiffness of 1 cm diameter woody stems was measured in four directions with an Instron mechanical testing system; the xylem of the stems was then cut into node (former leaf junction) and nonnode segments for measurement of xylem density. Stems had 20% greater flexural stiffness in the plane perpendicular to the original leaf placement than in the parallel plane. The xylem in the node region was more flexible, but it had significantly greater tissue density than adjacent regions, contradicting the usual correlation between wood density and stiffness. Nodes can behave as spring-like joints in woody plants. For plagiotropic shoots, distichous phyllotaxy results in stems that resist up-and-down bending more than lateral back-and-forth movement. Thus, they may more effectively absorb applied loads from fruits, animals, wind, rain, and snow and resist stresses due to gravity without cracking and breaking. Under windy conditions, nodes may improve damping by absorbing vibrational energy and thus reducing oscillation damage. The effect of plant nodes also has biomimetic design implications for architects and material engineers.

Towards Accurate Node-Based Detection of P2P Botnets

PubMed Central

2014-01-01

Botnets are a serious security threat to the current Internet infrastructure. In this paper, we propose a novel direction for P2P botnet detection called node-based detection. This approach focuses on the network characteristics of individual nodes. Based on our model, we examine node's flows and extract the useful features over a given time period. We have tested our approach on real-life data sets and achieved detection rates of 99-100% and low false positives rates of 0–2%. Comparison with other similar approaches on the same data sets shows that our approach outperforms the existing approaches. PMID:25089287

Exploring EUV and SAQP pattering schemes at 5nm technology node

NASA Astrophysics Data System (ADS)

Hamed Fatehy, Ahmed; Kotb, Rehab; Lafferty, Neal; Jiang, Fan; Word, James

2018-03-01

For years, Moore's law keeps driving the semiconductors industry towards smaller dimensions and higher density chips with more devices. Earlier, the correlation between exposure source's wave length and the smallest resolvable dimension, mandated the usage of Deep Ultra-Violent (DUV) optical lithography system which has been used for decades to sustain Moore's law, especially when immersion lithography was introduced with 193nm ArF laser sources. As dimensions of devices get smaller beyond Deep Ultra-Violent (DUV) optical resolution limits, the need for Extremely Ultra-Violent (EUV) optical lithography systems was a must. However, EUV systems were still under development at that time for the mass-production in semiconductors industry. Theretofore, Multi-Patterning (MP) technologies was introduced to swirl about DUV optical lithography limitations in advanced nodes beyond minimum dimension (CD) of 20nm. MP can be classified into two main categories; the first one is to split the target itself across multiple masks that give the original target patterns when they are printed. This category includes Double, Triple and Quadruple patterning (DP, TP, and QP). The second category is the Self-Aligned Patterning (SAP) where the target is divided into Mandrel patterns and non-Mandrel patterns. The Mandrel patterns get printed first, then a self-aligned sidewalls are grown around these printed patterns drawing the other non-Mandrel targets, afterword, a cut mask(s) is used to define target's line-ends. This approach contains Self-Aligned-Double Pattering (SADP) and Self-Aligned- Quadruple-Pattering (SAQP). DUV and MP along together paved the way for the industry down to 7nm. However, with the start of development at the 5nm node and the readiness of EUV, the differentiation question is aroused again, which pattering approach should be selected, direct printing using EUV or DUV with MP, or a hybrid flow that contains both DUV-MP and EUV. In this work we are comparing two potential pattering techniques for Back End Of Line (BEOL) metal layers in the 5nm technology node, the first technique is Single Exposure EUV (SE-EUV) with a Direct Patterning EUV lithography process, and the second one is Self-Aligned Quadruple Patterning (SAQP) with a hybrid lithography processes, where the drawn metal target layer is decomposed into a Mandrel mask and Blocks/Cut mask, Mandrel mask is printed using DUV 193i lithography process, while Block/Cut Mask is printed using SE-EUV lithography process. The pros and cons of each technique are quantified based on Edge-Placement-Error (EPE) and Process Variation Band (PVBand) measured at 1D and 2D edges. The layout used in this comparison is a candidate layout for Foundries 5nm process node.

Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support

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

Schumacher, Kathryn M.; Chen, Richard Li-Yang; Cohn, Amy E. M.

2016-04-15

Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less

Expedition 40 crew in Node 2 after German - U.S. soccer game

NASA Image and Video Library

2014-06-26

ISS040-E-020367 (26 June 2014) --- European Space Agency astronaut Alexander Gerst, Expedition 40 flight engineer, shaves the head of NASA astronaut Steve Swanson, commander, in the Unity node of the International Space Station. Gerst used hair clippers fashioned with a vacuum device to garner freshly cut hair. Russian cosmonaut Alexander Skvortsov, flight engineer, is visible in the background. A friendly World Cup Soccer-related agreement between the crew members representing the USA, and Gerst, a German citizen who represents the European Space Agency, called for the American losers of a German-USA match to have their heads shaved. The German team won the match 1-0.

A graph theoretic approach to scene matching

NASA Technical Reports Server (NTRS)

Ranganath, Heggere S.; Chipman, Laure J.

1991-01-01

The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

Synchronizing compute node time bases in a parallel computer

DOEpatents

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

2015-01-27

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

Synchronizing compute node time bases in a parallel computer

DOEpatents

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

2014-12-30

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

EXTENSIBLE DATABASE FRAMEWORK FOR MANAGEMENT OF UNSTRUCTURED AND SEMI-STRUCTURED DOCUMENTS

NASA Technical Reports Server (NTRS)

Gawdiak, Yuri O. (Inventor); La, Tracy T. (Inventor); Lin, Shu-Chun Y. (Inventor); Malof, David A. (Inventor); Tran, Khai Peter B. (Inventor)

2005-01-01

Method and system for querying a collection of Unstructured or semi-structured documents to identify presence of, and provide context and/or content for, keywords and/or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) is specified. and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context andor the content of the query node.

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

NASA Astrophysics Data System (ADS)

Fuhrmann, G.

2016-08-01

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

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

Adaptive multi-node multiple input and multiple output (MIMO) transmission for mobile wireless multimedia sensor networks.

PubMed

Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

2013-10-02

Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.

Adaptive Multi-Node Multiple Input and Multiple Output (MIMO) Transmission for Mobile Wireless Multimedia Sensor Networks

PubMed Central

Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

2013-01-01

Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase. PMID:24152920

Expert system for identification of simultaneous and sequential reactor fuel failures with gas tagging

DOEpatents

Gross, Kenny C.

1994-01-01

Failure of a fuel element in a nuclear reactor core is determined by a gas tagging failure detection system and method. Failures are catalogued and characterized after the event so that samples of the reactor's cover gas are taken at regular intervals and analyzed by mass spectroscopy. Employing a first set of systematic heuristic rules which are applied in a transformed node space allows the number of node combinations which must be processed within a barycentric algorithm to be substantially reduced. A second set of heuristic rules treats the tag nodes of the most recent one or two leakers as "background" gases, further reducing the number of trial node combinations. Lastly, a "fuzzy" set theory formalism minimizes experimental uncertainties in the identification of the most likely volumes of tag gases. This approach allows for the identification of virtually any number of sequential leaks and up to five simultaneous gas leaks from fuel elements.

Additive lattice kirigami

PubMed Central

Castle, Toen; Sussman, Daniel M.; Tanis, Michael; Kamien, Randall D.

2016-01-01

Kirigami uses bending, folding, cutting, and pasting to create complex three-dimensional (3D) structures from a flat sheet. In the case of lattice kirigami, this cutting and rejoining introduces defects into an underlying 2D lattice in the form of points of nonzero Gaussian curvature. A set of simple rules was previously used to generate a wide variety of stepped structures; we now pare back these rules to their minimum. This allows us to describe a set of techniques that unify a wide variety of cut-and-paste actions under the rubric of lattice kirigami, including adding new material and rejoining material across arbitrary cuts in the sheet. We also explore the use of more complex lattices and the different structures that consequently arise. Regardless of the choice of lattice, creating complex structures may require multiple overlapping kirigami cuts, where subsequent cuts are not performed on a locally flat lattice. Our additive kirigami method describes such cuts, providing a simple methodology and a set of techniques to build a huge variety of complex 3D shapes. PMID:27679822

Additive lattice kirigami.

PubMed

Castle, Toen; Sussman, Daniel M; Tanis, Michael; Kamien, Randall D

2016-09-01

Kirigami uses bending, folding, cutting, and pasting to create complex three-dimensional (3D) structures from a flat sheet. In the case of lattice kirigami, this cutting and rejoining introduces defects into an underlying 2D lattice in the form of points of nonzero Gaussian curvature. A set of simple rules was previously used to generate a wide variety of stepped structures; we now pare back these rules to their minimum. This allows us to describe a set of techniques that unify a wide variety of cut-and-paste actions under the rubric of lattice kirigami, including adding new material and rejoining material across arbitrary cuts in the sheet. We also explore the use of more complex lattices and the different structures that consequently arise. Regardless of the choice of lattice, creating complex structures may require multiple overlapping kirigami cuts, where subsequent cuts are not performed on a locally flat lattice. Our additive kirigami method describes such cuts, providing a simple methodology and a set of techniques to build a huge variety of complex 3D shapes.

Multiple-objective optimization in precision laser cutting of different thermoplastics

NASA Astrophysics Data System (ADS)

Tamrin, K. F.; Nukman, Y.; Choudhury, I. A.; Shirley, S.

2015-04-01

Thermoplastics are increasingly being used in biomedical, automotive and electronics industries due to their excellent physical and chemical properties. Due to the localized and non-contact process, use of lasers for cutting could result in precise cut with small heat-affected zone (HAZ). Precision laser cutting involving various materials is important in high-volume manufacturing processes to minimize operational cost, error reduction and improve product quality. This study uses grey relational analysis to determine a single optimized set of cutting parameters for three different thermoplastics. The set of the optimized processing parameters is determined based on the highest relational grade and was found at low laser power (200 W), high cutting speed (0.4 m/min) and low compressed air pressure (2.5 bar). The result matches with the objective set in the present study. Analysis of variance (ANOVA) is then carried out to ascertain the relative influence of process parameters on the cutting characteristics. It was found that the laser power has dominant effect on HAZ for all thermoplastics.

Infrequent Loss of Luminal Differentiation in Ductal Breast Cancer Metastasis

PubMed Central

Calvo, Julia; Sánchez-Cid, Lourdes; Muñoz, Montserrat; Lozano, Juan José; Thomson, Timothy M.; Fernández, Pedro L.

2013-01-01

Lymph node involvement is a major prognostic variable in breast cancer. Whether the molecular mechanisms that drive breast cancer cells to colonize lymph nodes are shared with their capacity to form distant metastases is yet to be established. In a transcriptomic survey aimed at identifying molecular factors associated with lymph node involvement of ductal breast cancer, we found that luminal differentiation, assessed by the expression of estrogen receptor (ER) and/or progesterone receptor (PR) and GATA3, was only infrequently lost in node-positive primary tumors and in matched lymph node metastases. The transcription factor GATA3 critically determines luminal lineage specification of mammary epithelium and is widely considered a tumor and metastasis suppressor in breast cancer. Strong expression of GATA3 and ER in a majority of primary node-positive ductal breast cancer was corroborated by quantitative RT-PCR and immunohistochemistry in the initial sample set, and by immunohistochemistry in an additional set from 167 patients diagnosed of node-negative and –positive primary infiltrating ductal breast cancer, including 102 samples from loco-regional lymph node metastases matched to their primary tumors, as well as 37 distant metastases. These observations suggest that loss of luminal differentiation is not a major factor driving the ability of breast cancer cells to colonize regional lymph nodes. PMID:24205108

Exact sampling of graphs with prescribed degree correlations

NASA Astrophysics Data System (ADS)

Bassler, Kevin E.; Del Genio, Charo I.; Erdős, Péter L.; Miklós, István; Toroczkai, Zoltán

2015-08-01

Many real-world networks exhibit correlations between the node degrees. For instance, in social networks nodes tend to connect to nodes of similar degree and conversely, in biological and technological networks, high-degree nodes tend to be linked with low-degree nodes. Degree correlations also affect the dynamics of processes supported by a network structure, such as the spread of opinions or epidemics. The proper modelling of these systems, i.e., without uncontrolled biases, requires the sampling of networks with a specified set of constraints. We present a solution to the sampling problem when the constraints imposed are the degree correlations. In particular, we develop an exact method to construct and sample graphs with a specified joint-degree matrix, which is a matrix providing the number of edges between all the sets of nodes of a given degree, for all degrees, thus completely specifying all pairwise degree correlations, and additionally, the degree sequence itself. Our algorithm always produces independent samples without backtracking. The complexity of the graph construction algorithm is {O}({NM}) where N is the number of nodes and M is the number of edges.

Network neighborhood analysis with the multi-node topological overlap measure.

PubMed

Li, Ai; Horvath, Steve

2007-01-15

The goal of neighborhood analysis is to find a set of genes (the neighborhood) that is similar to an initial 'seed' set of genes. Neighborhood analysis methods for network data are important in systems biology. If individual network connections are susceptible to noise, it can be advantageous to define neighborhoods on the basis of a robust interconnectedness measure, e.g. the topological overlap measure. Since the use of multiple nodes in the seed set may lead to more informative neighborhoods, it can be advantageous to define multi-node similarity measures. The pairwise topological overlap measure is generalized to multiple network nodes and subsequently used in a recursive neighborhood construction method. A local permutation scheme is used to determine the neighborhood size. Using four network applications and a simulated example, we provide empirical evidence that the resulting neighborhoods are biologically meaningful, e.g. we use neighborhood analysis to identify brain cancer related genes. An executable Windows program and tutorial for multi-node topological overlap measure (MTOM) based analysis can be downloaded from the webpage (http://www.genetics.ucla.edu/labs/horvath/MTOM/).

Error recovery to enable error-free message transfer between nodes of a computer network

DOEpatents

Blumrich, Matthias A.; Coteus, Paul W.; Chen, Dong; Gara, Alan; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Takken, Todd; Steinmacher-Burow, Burkhard; Vranas, Pavlos M.

2016-01-26

An error-recovery method to enable error-free message transfer between nodes of a computer network. A first node of the network sends a packet to a second node of the network over a link between the nodes, and the first node keeps a copy of the packet on a sending end of the link until the first node receives acknowledgment from the second node that the packet was received without error. The second node tests the packet to determine if the packet is error free. If the packet is not error free, the second node sets a flag to mark the packet as corrupt. The second node returns acknowledgement to the first node specifying whether the packet was received with or without error. When the packet is received with error, the link is returned to a known state and the packet is sent again to the second node.

Prototype ultra wideband-based wireless body area network--consideration of CAP and CFP slot allocation during human walking motion.

PubMed

Takei, Yuichiro; Katsuta, Hiroki; Takizawa, Kenichi; Ikegami, Tetsushi; Hamaguchi, Kiyoshi

2012-01-01

This paper presents an experimental evaluation of communication during human walking motion, using the medium access control (MAC) evaluation system for a prototype ultra-wideband (UWB) based wireless body area network for suitable MAC parameter settings for data transmission. Its physical layer and MAC specifications are based on the draft standard in IEEE802.15.6. This paper studies the effects of the number of retransmissions and the number of commands of GTS (guaranteed time slot) request packets in the CAP (contention access period) during human walking motion by varying the number of sensor nodes or the number of CFP (contention free period) slots in the superframe. The experiments were performed in an anechoic chamber. The number of packets received is decreased by packet loss caused by human walking motion in the case where 2 slots are set for CFP, regardless of the number of nodes, and this materially decreases the total number of packets received. The number of retransmissions and the GTS request commands increase according to increases in the number of nodes, largely reflecting the effects of the number of CFP slots in the case where 4 nodes are attached. In the cases where 2 or 3 nodes are attached and 4 slots are set for CFP, the packet transmission rate is more than 95%. In the case where 4 nodes are attached and 6 slots are set for CFP, the packet transmission rate is reduced to 88% at best.

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.

The Objective Borderline Method (OBM): A Probability-Based Model for Setting up an Objective Pass/Fail Cut-Off Score in Medical Programme Assessments

ERIC Educational Resources Information Center

Shulruf, Boaz; Turner, Rolf; Poole, Phillippa; Wilkinson, Tim

2013-01-01

The decision to pass or fail a medical student is a "high stakes" one. The aim of this study is to introduce and demonstrate the feasibility and practicality of a new objective standard-setting method for determining the pass/fail cut-off score from borderline grades. Three methods for setting up pass/fail cut-off scores were compared: the…

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.

Using LTI Dynamics to Identify the Influential Nodes in a Network

PubMed Central

Jorswieck, Eduard; Scheunert, Christian

2016-01-01

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

Road networks as collections of minimum cost paths

NASA Astrophysics Data System (ADS)

Wegner, Jan Dirk; Montoya-Zegarra, Javier Alexander; Schindler, Konrad

2015-10-01

We present a probabilistic representation of network structures in images. Our target application is the extraction of urban roads from aerial images. Roads appear as thin, elongated, partially curved structures forming a loopy graph, and this complex layout requires a prior that goes beyond standard smoothness and co-occurrence assumptions. In the proposed model the network is represented as a union of 1D paths connecting distant (super-)pixels. A large set of putative candidate paths is constructed in such a way that they include the true network as much as possible, by searching for minimum cost paths in the foreground (road) likelihood. Selecting the optimal subset of candidate paths is posed as MAP inference in a higher-order conditional random field. Each path forms a higher-order clique with a type of clique potential, which attracts the member nodes of cliques with high cumulative road evidence to the foreground label. That formulation induces a robust PN -Potts model, for which a global MAP solution can be found efficiently with graph cuts. Experiments with two road data sets show that the proposed model significantly improves per-pixel accuracies as well as the overall topological network quality with respect to several baselines.

Node, Node-Link, and Node-Link-Group Diagrams: An Evaluation.

PubMed

Saket, Bahador; Simonetto, Paolo; Kobourov, Stephen; Börner, Katy

2014-12-01

Effectively showing the relationships between objects in a dataset is one of the main tasks in information visualization. Typically there is a well-defined notion of distance between pairs of objects, and traditional approaches such as principal component analysis or multi-dimensional scaling are used to place the objects as points in 2D space, so that similar objects are close to each other. In another typical setting, the dataset is visualized as a network graph, where related nodes are connected by links. More recently, datasets are also visualized as maps, where in addition to nodes and links, there is an explicit representation of groups and clusters. We consider these three Techniques, characterized by a progressive increase of the amount of encoded information: node diagrams, node-link diagrams and node-link-group diagrams. We assess these three types of diagrams with a controlled experiment that covers nine different tasks falling broadly in three categories: node-based tasks, network-based tasks and group-based tasks. Our findings indicate that adding links, or links and group representations, does not negatively impact performance (time and accuracy) of node-based tasks. Similarly, adding group representations does not negatively impact the performance of network-based tasks. Node-link-group diagrams outperform the others on group-based tasks. These conclusions contradict results in other studies, in similar but subtly different settings. Taken together, however, such results can have significant implications for the design of standard and domain snecific visualizations tools.

Thoracic lymph node station recognition on CT images based on automatic anatomy recognition with an optimal parent strategy

NASA Astrophysics Data System (ADS)

Xu, Guoping; Udupa, Jayaram K.; Tong, Yubing; Cao, Hanqiang; Odhner, Dewey; Torigian, Drew A.; Wu, Xingyu

2018-03-01

Currently, there are many papers that have been published on the detection and segmentation of lymph nodes from medical images. However, it is still a challenging problem owing to low contrast with surrounding soft tissues and the variations of lymph node size and shape on computed tomography (CT) images. This is particularly very difficult on low-dose CT of PET/CT acquisitions. In this study, we utilize our previous automatic anatomy recognition (AAR) framework to recognize the thoracic-lymph node stations defined by the International Association for the Study of Lung Cancer (IASLC) lymph node map. The lymph node stations themselves are viewed as anatomic objects and are localized by using a one-shot method in the AAR framework. Two strategies have been taken in this paper for integration into AAR framework. The first is to combine some lymph node stations into composite lymph node stations according to their geometrical nearness. The other is to find the optimal parent (organ or union of organs) as an anchor for each lymph node station based on the recognition error and thereby find an overall optimal hierarchy to arrange anchor organs and lymph node stations. Based on 28 contrast-enhanced thoracic CT image data sets for model building, 12 independent data sets for testing, our results show that thoracic lymph node stations can be localized within 2-3 voxels compared to the ground truth.

A Structure-Adaptive Hybrid RBF-BP Classifier with an Optimized Learning Strategy

PubMed Central

Wen, Hui; Xie, Weixin; Pei, Jihong

2016-01-01

This paper presents a structure-adaptive hybrid RBF-BP (SAHRBF-BP) classifier with an optimized learning strategy. SAHRBF-BP is composed of a structure-adaptive RBF network and a BP network of cascade, where the number of RBF hidden nodes is adjusted adaptively according to the distribution of sample space, the adaptive RBF network is used for nonlinear kernel mapping and the BP network is used for nonlinear classification. The optimized learning strategy is as follows: firstly, a potential function is introduced into training sample space to adaptively determine the number of initial RBF hidden nodes and node parameters, and a form of heterogeneous samples repulsive force is designed to further optimize each generated RBF hidden node parameters, the optimized structure-adaptive RBF network is used for adaptively nonlinear mapping the sample space; then, according to the number of adaptively generated RBF hidden nodes, the number of subsequent BP input nodes can be determined, and the overall SAHRBF-BP classifier is built up; finally, different training sample sets are used to train the BP network parameters in SAHRBF-BP. Compared with other algorithms applied to different data sets, experiments show the superiority of SAHRBF-BP. Especially on most low dimensional and large number of data sets, the classification performance of SAHRBF-BP outperforms other training SLFNs algorithms. PMID:27792737

Accuracy of microRNAs as markers for the detection of neck lymph node metastases in patients with head and neck squamous cell carcinoma.

PubMed

de Carvalho, Ana Carolina; Scapulatempo-Neto, Cristovam; Maia, Danielle Calheiros Campelo; Evangelista, Adriane Feijó; Morini, Mariana Andozia; Carvalho, André Lopes; Vettore, André Luiz

2015-05-09

The presence of metastatic disease in cervical lymph nodes of head and neck squamous cell carcinoma (HNSCC) patients is a very important determinant in therapy choice and prognosis, with great impact in overall survival. Frequently, routine lymph node staging cannot detect occult metastases and the post-surgical histologic evaluation of resected lymph nodes is not sensitive in detecting small metastatic deposits. Molecular markers based on tissue-specific microRNA expression are alternative accurate diagnostic markers. Herein, we evaluated the feasibility of using the expression of microRNAs to detect metastatic cells in formalin-fixed paraffin-embedded (FFPE) lymph nodes and in fine-needle aspiration (FNA) biopsies of HNSCC patients. An initial screening compared the expression of 667 microRNAs in a discovery set comprised by metastatic and non-metastatic lymph nodes from HNSCC patients. The most differentially expressed microRNAs were validated by qRT-PCR in two independent cohorts: i) 48 FFPE lymph node samples, and ii) 113 FNA lymph node biopsies. The accuracy of the markers in identifying metastatic samples was assessed through the analysis of sensitivity, specificity, accuracy, negative predictive value, positive predictive value, and area under the curve values. Seven microRNAs highly expressed in metastatic lymph nodes from the discovery set were validated in FFPE lymph node samples. MiR-203 and miR-205 identified all metastatic samples, regardless of the size of the metastatic deposit. Additionally, these markers also showed high accuracy when FNA samples were examined. The high accuracy of miR-203 and miR-205 warrant these microRNAs as diagnostic markers of neck metastases in HNSCC. These can be evaluated in entire lymph nodes and in FNA biopsies collected at different time-points such as pre-treatment samples, intraoperative sentinel node biopsy, and during patient follow-up. These markers can be useful in a clinical setting in the management of HNSCC patients from initial disease staging and therapy planning to patient surveillance.

Generalised power graph compression reveals dominant relationship patterns in complex networks

PubMed Central

Ahnert, Sebastian E.

2014-01-01

We introduce a framework for the discovery of dominant relationship patterns in complex networks, by compressing the networks into power graphs with overlapping power nodes. When paired with enrichment analysis of node classification terms, the most compressible sets of edges provide a highly informative sketch of the dominant relationship patterns that define the network. In addition, this procedure also gives rise to a novel, link-based definition of overlapping node communities in which nodes are defined by their relationships with sets of other nodes, rather than through connections within the community. We show that this completely general approach can be applied to undirected, directed, and bipartite networks, yielding valuable insights into the large-scale structure of real-world networks, including social networks and food webs. Our approach therefore provides a novel way in which network architecture can be studied, defined and classified. PMID:24663099

An Investigation of Undefined Cut Scores with the Hofstee Standard-Setting Method

ERIC Educational Resources Information Center

Wyse, Adam E.; Babcock, Ben

2017-01-01

This article provides an overview of the Hofstee standard-setting method and illustrates several situations where the Hofstee method will produce undefined cut scores. The situations where the cut scores will be undefined involve cases where the line segment derived from the Hofstee ratings does not intersect the score distribution curve based on…

SIGPI. Fault Tree Cut Set System Performance

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

Patenaude, C.J.

1992-01-13

SIGPI computes the probabilistic performance of complex systems by combining cut set or other binary product data with probability information on each basic event. SIGPI is designed to work with either coherent systems, where the system fails when certain combinations of components fail, or noncoherent systems, where at least one cut set occurs only if at least one component of the system is operating properly. The program can handle conditionally independent components, dependent components, or a combination of component types and has been used to evaluate responses to environmental threats and seismic events. The three data types that can bemore » input are cut set data in disjoint normal form, basic component probabilities for independent basic components, and mean and covariance data for statistically dependent basic components.« less

SIGPI. Fault Tree Cut Set System Performance

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

Patenaude, C.J.

1992-01-14

SIGPI computes the probabilistic performance of complex systems by combining cut set or other binary product data with probability information on each basic event. SIGPI is designed to work with either coherent systems, where the system fails when certain combinations of components fail, or noncoherent systems, where at least one cut set occurs only if at least one component of the system is operating properly. The program can handle conditionally independent components, dependent components, or a combination of component types and has been used to evaluate responses to environmental threats and seismic events. The three data types that can bemore » input are cut set data in disjoint normal form, basic component probabilities for independent basic components, and mean and covariance data for statistically dependent basic components.« less

Lymph nodes fine needle cytology in the diagnosis of infectious diseases: clinical settings.

PubMed

Natella, Valentina; Cozzolino, Immacolata; Sosa Fernandez, Laura Virginia; Vigliar, Elena

2012-01-01

Lymph node reactive hyperplasia, caused by specific infectious etiologic factors, represents the most frequent cause of enlarged peripheral lymph nodes. The main infectious agents are viruses, pyogenic bacteria, mycobacteria, fungi and protozoa that may determine unspecific or specific pathological entities, such as cat-scratch disease, toxoplasmosis or infectious mononucleosis. Lymph node fine needle cytology (FNC) is a safe, simple, cost-effective and efficient technique that quickly provides information about the cell population and the nature of the process. FNC can also provide suitable material for ancillary techniques, such as flow cytometry, immunocytochemistry, molecular biology and microbiological examinations. This study focuses on the cytological features of benign lymphadenopathy of infectious origin and their possible contribution to the clinical setting definition of corresponding patients.

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

DOEpatents

Faraj, Ahmad

2013-07-09

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows.

PubMed

Moussawi, A; Derzsy, N; Lin, X; Szymanski, B K; Korniss, G

2017-09-15

Cascading failures are a critical vulnerability of complex information or infrastructure networks. Here we investigate the properties of load-based cascading failures in real and synthetic spatially-embedded network structures, and propose mitigation strategies to reduce the severity of damages caused by such failures. We introduce a stochastic method for optimal heterogeneous distribution of resources (node capacities) subject to a fixed total cost. Additionally, we design and compare the performance of networks with N-stable and (N-1)-stable network-capacity allocations by triggering cascades using various real-world node-attack and node-failure scenarios. We show that failure mitigation through increased node protection can be effectively achieved against single-node failures. However, mitigating against multiple node failures is much more difficult due to the combinatorial increase in possible sets of initially failing nodes. We analyze the robustness of the system with increasing protection, and find that a critical tolerance exists at which the system undergoes a phase transition, and above which the network almost completely survives an attack. Moreover, we show that cascade-size distributions measured in this region exhibit a power-law decay. Finally, we find a strong correlation between cascade sizes induced by individual nodes and sets of nodes. We also show that network topology alone is a weak predictor in determining the progression of cascading failures.

Expanding the printable design space for lithography processes utilizing a cut mask

NASA Astrophysics Data System (ADS)

Wandell, Jerome; Salama, Mohamed; Wilkinson, William; Curtice, Mark; Feng, Jui-Hsuan; Gao, Shao Wen; Asthana, Abhishek

2016-03-01

The utilization of a cut-mask in semiconductor patterning processes has been in practice for logic devices since the inception of 32nm-node devices, notably with unidirectional gate level printing. However, the microprocessor applications where cut-mask patterning methods are used are expanding as Self-Aligned Double Patterning (SADP) processes become mainstream for 22/14nm fin diffusion, and sub-14nm metal levels. One common weakness for these types of lithography processes is that the initial pattern requiring the follow-up cut-mask typically uses an extreme off-axis imaging source such as dipole to enhance the resolution and line-width roughness (LWR) for critical dense patterns. This source condition suffers from poor process margin in the semi-dense (forbidden pitch) realm and wrong-way directional design spaces. Common pattern failures in these limited design regions include bridging and extra-printing defects that are difficult to resolve with traditional mask improvement means. This forces the device maker to limit the allowable geometries that a designer may use on a device layer. This paper will demonstrate methods to expand the usable design space on dipole-like processes such as unidirectional gate and SADP processes by utilizing the follow-up cut mask to improve the process window. Traditional mask enhancement means for improving the process window in this design realm will be compared to this new cut-mask approach. The unique advantages and disadvantages of the cut-mask solution will be discussed in contrast to those customary methods.

Using Object-Oriented Databases for Implementation of Interactive Electronic Technical Manuals

DTIC Science & Technology

1992-03-01

analytical process applied throughout the system acquisition program in order to define supportability related design factors and to ensure development of a...Node Alternatives Node Alternatives (NODEALTS) is a list of mutually exclusive nodes, grouped together by the fact that they apply to different...contextual situations. The content specific layer NODEALTS element is a reference to a set of nodes that might apply in different situations. No hierarchy

Histopathological Parameters predicting Occult Nodal Metastases in Tongue Carcinoma Cases: An Indian Perspective.

PubMed

Jacob, Tina Elizabeth; Malathi, N; Rajan, Sharada T; Augustine, Dominic; Manish, N; Patil, Shankargouda

2016-01-01

It is a well-established fact that in squamous cell carcinoma cases, the presence of lymph node metastases decreased the 5-year survival rate by 50% and also caused the recurrence of the primary tumor with development of distant metastases. Till date, the predictive factors for occult cervical lymph nodes metastases in cases of tongue squamous cell carcinoma remain inconclusive. Therefore, it is imperative to identify patients who are at the greatest risk for occult cervical metastases. This study was thus performed with the aim to identify various histopathologic parameters of the primary tumor that predict occult nodal metastases. The clinicopathologic features of 56 cases of lateral tongue squamous cell carcinoma with cT1NoMo/cT2NoMo as the stage and without prior radiotherapy or chemotherapy were considered. The surgical excision of primary tumor was followed by elective neck dissection. The glossectomy specimen along with the neck nodes were fixed in formalin and 5 urn thick sections were obtained. The hematoxylin & eosin stained sections were then subjected to microscopic examination. The primary tumor characteristics that were analyzed include tumor grade, invading front, depth of tumor, lymphovascular invasion, perineural invasion and inflammatory response. The nodes were examined for possible metastases using hematoxylin & eosin followed by cytokeratin immunohistochemistry. A total of 12 cases were found with positive occult nodal metastases. On performing univariate analysis, the histopathologic parameters that were found to be statistically significant were lymphovascular invasion (p = 0.004) and perineural invasion (p = 0.003) along with a cut-off depth of infiltration more than 5 mm (p = 0.01). Histopathologic assessment of the primary tumor specimen therefore continues to provide information that is central to guide clinical management, particularly in cases of occult nodal metastases. Clinical significance The study highlights the importance of extensive histopathological screening, which holds the key for establishing occult metastases. Pathological upgrading of tumors is possible following histopathological studies similar to the present one. Presence of occult metastases justify neck dissection in these clinically N0 cases. In an Indian setting, histopathological evaluation assumes a bigger role than other expensive and advanced techniques.

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.

Node-based measures of connectivity in genetic networks.

PubMed

Koen, Erin L; Bowman, Jeff; Wilson, Paul J

2016-01-01

At-site environmental conditions can have strong influences on genetic connectivity, and in particular on the immigration and settlement phases of dispersal. However, at-site processes are rarely explored in landscape genetic analyses. Networks can facilitate the study of at-site processes, where network nodes are used to model site-level effects. We used simulated genetic networks to compare and contrast the performance of 7 node-based (as opposed to edge-based) genetic connectivity metrics. We simulated increasing node connectivity by varying migration in two ways: we increased the number of migrants moving between a focal node and a set number of recipient nodes, and we increased the number of recipient nodes receiving a set number of migrants. We found that two metrics in particular, the average edge weight and the average inverse edge weight, varied linearly with simulated connectivity. Conversely, node degree was not a good measure of connectivity. We demonstrated the use of average inverse edge weight to describe the influence of at-site habitat characteristics on genetic connectivity of 653 American martens (Martes americana) in Ontario, Canada. We found that highly connected nodes had high habitat quality for marten (deep snow and high proportions of coniferous and mature forest) and were farther from the range edge. We recommend the use of node-based genetic connectivity metrics, in particular, average edge weight or average inverse edge weight, to model the influences of at-site habitat conditions on the immigration and settlement phases of dispersal. © 2015 John Wiley & Sons Ltd.

Growth dominates choice in network percolation

NASA Astrophysics Data System (ADS)

Vijayaraghavan, Vikram S.; Noël, Pierre-André; Waagen, Alex; D'Souza, Raissa M.

2013-09-01

The onset of large-scale connectivity in a network (i.e., percolation) often has a major impact on the function of the system. Traditionally, graph percolation is analyzed by adding edges to a fixed set of initially isolated nodes. Several years ago, it was shown that adding nodes as well as edges to the graph can yield an infinite order transition, which is much smoother than the traditional second-order transition. More recently, it was shown that adding edges via a competitive process to a fixed set of initially isolated nodes can lead to a delayed, extremely abrupt percolation transition with a significant jump in large but finite systems. Here we analyze a process that combines both node arrival and edge competition. If started from a small collection of seed nodes, we show that the impact of node arrival dominates: although we can significantly delay percolation, the transition is of infinite order. Thus, node arrival can mitigate the trade-off between delay and abruptness that is characteristic of explosive percolation transitions. This realization may inspire new design rules where network growth can temper the effects of delay, creating opportunities for network intervention and control.

Automatic localization of IASLC-defined mediastinal lymph node stations on CT images using fuzzy models

NASA Astrophysics Data System (ADS)

Matsumoto, Monica M. S.; Beig, Niha G.; Udupa, Jayaram K.; Archer, Steven; Torigian, Drew A.

2014-03-01

Lung cancer is associated with the highest cancer mortality rates among men and women in the United States. The accurate and precise identification of the lymph node stations on computed tomography (CT) images is important for staging disease and potentially for prognosticating outcome in patients with lung cancer, as well as for pretreatment planning and response assessment purposes. To facilitate a standard means of referring to lymph nodes, the International Association for the Study of Lung Cancer (IASLC) has recently proposed a definition of the different lymph node stations and zones in the thorax. However, nodal station identification is typically performed manually by visual assessment in clinical radiology. This approach leaves room for error due to the subjective and potentially ambiguous nature of visual interpretation, and is labor intensive. We present a method of automatically recognizing the mediastinal IASLC-defined lymph node stations by modifying a hierarchical fuzzy modeling approach previously developed for body-wide automatic anatomy recognition (AAR) in medical imagery. Our AAR-lymph node (AAR-LN) system follows the AAR methodology and consists of two steps. In the first step, the various lymph node stations are manually delineated on a set of CT images following the IASLC definitions. These delineations are then used to build a fuzzy hierarchical model of the nodal stations which are considered as 3D objects. In the second step, the stations are automatically located on any given CT image of the thorax by using the hierarchical fuzzy model and object recognition algorithms. Based on 23 data sets used for model building, 22 independent data sets for testing, and 10 lymph node stations, a mean localization accuracy of within 1-6 voxels has been achieved by the AAR-LN system.

A model and nomogram to predict tumor site origin for squamous cell cancer confined to cervical lymph nodes.

PubMed

Ali, Arif N; Switchenko, Jeffrey M; Kim, Sungjin; Kowalski, Jeanne; El-Deiry, Mark W; Beitler, Jonathan J

2014-11-15

The current study was conducted to develop a multifactorial statistical model to predict the specific head and neck (H&N) tumor site origin in cases of squamous cell carcinoma confined to the cervical lymph nodes ("unknown primaries"). The Surveillance, Epidemiology, and End Results (SEER) database was analyzed for patients with an H&N tumor site who were diagnosed between 2004 and 2011. The SEER patients were identified according to their H&N primary tumor site and clinically positive cervical lymph node levels at the time of presentation. The SEER patient data set was randomly divided into 2 data sets for the purposes of internal split-sample validation. The effects of cervical lymph node levels, age, race, and sex on H&N primary tumor site were examined using univariate and multivariate analyses. Multivariate logistic regression models and an associated set of nomograms were developed based on relevant factors to provide probabilities of tumor site origin. Analysis of the SEER database identified 20,011 patients with H&N disease with both site-level and lymph node-level data. Sex, race, age, and lymph node levels were associated with primary H&N tumor site (nasopharynx, hypopharynx, oropharynx, and larynx) in the multivariate models. Internal validation techniques affirmed the accuracy of these models on separate data. The incorporation of epidemiologic and lymph node data into a predictive model has the potential to provide valuable guidance to clinicians in the treatment of patients with squamous cell carcinoma confined to the cervical lymph nodes. © 2014 The Authors. Cancer published by Wiley Periodicals, Inc. on behalf of American Cancer Society.

Suggestions for getting more forestry in the logging plan.

Treesearch

Robert H. Ruth; Roy R. Silen

1950-01-01

The staggered-setting system of clear-cutting is fast becoming prevailing practice in the Douglas-fir region. The trend is away from large, continuous clear cuts to clear-cutting smaller units of timber of less than 80 acres. These are called staggered settings because the surrounding stand is left uncut to provide seed and serve as a firebreak. Major aims of this...

Teacher Judgment and Mastery Score Setting for Nebraska's Local Assessment Reporting System: Efficacy and Appropriateness.

ERIC Educational Resources Information Center

Giraud, Gerald T.; Buckendahl, Chad; Lucas, Mike

This study examined the efficacy of teacher judgment in the process of setting mastery scores (cut scores) for fourth-grade mathematics in local school districts in Nebraska in terms of agreement between teacher classification of students and classification by the cut score obtained by this classification. The study also examined cut scores in…

Adopting Cut Scores: Post-Standard-Setting Panel Considerations for Decision Makers

ERIC Educational Resources Information Center

Geisinger, Kurt F.; McCormick, Carina M.

2010-01-01

Standard-setting studies utilizing procedures such as the Bookmark or Angoff methods are just one component of the complete standard-setting process. Decision makers ultimately must determine what they believe to be the most appropriate standard or cut score to use, employing the input of the standard-setting panelists as one piece of information…

Expert system for identification of simultaneous and sequential reactor fuel failures with gas tagging

DOEpatents

Gross, K.C.

1994-07-26

Failure of a fuel element in a nuclear reactor core is determined by a gas tagging failure detection system and method. Failures are catalogued and characterized after the event so that samples of the reactor's cover gas are taken at regular intervals and analyzed by mass spectroscopy. Employing a first set of systematic heuristic rules which are applied in a transformed node space allows the number of node combinations which must be processed within a barycentric algorithm to be substantially reduced. A second set of heuristic rules treats the tag nodes of the most recent one or two leakers as background'' gases, further reducing the number of trial node combinations. Lastly, a fuzzy'' set theory formalism minimizes experimental uncertainties in the identification of the most likely volumes of tag gases. This approach allows for the identification of virtually any number of sequential leaks and up to five simultaneous gas leaks from fuel elements. 14 figs.

Maxwell Strata and Cut Locus in the Sub-Riemannian Problem on the Engel Group

NASA Astrophysics Data System (ADS)

Ardentov, Andrei A.; Sachkov, Yuri L.

2017-12-01

We consider the nilpotent left-invariant sub-Riemannian structure on the Engel group. This structure gives a fundamental local approximation of a generic rank 2 sub-Riemannian structure on a 4-manifold near a generic point (in particular, of the kinematic models of a car with a trailer). On the other hand, this is the simplest sub-Riemannian structure of step three. We describe the global structure of the cut locus (the set of points where geodesics lose their global optimality), the Maxwell set (the set of points that admit more than one minimizer), and the intersection of the cut locus with the caustic (the set of conjugate points along all geodesics). The group of symmetries of the cut locus is described: it is generated by a one-parameter group of dilations R+ and a discrete group of reflections Z2 × Z2 × Z2. The cut locus admits a stratification with 6 three-dimensional strata, 12 two-dimensional strata, and 2 one-dimensional strata. Three-dimensional strata of the cut locus are Maxwell strata of multiplicity 2 (for each point there are 2 minimizers). Two-dimensional strata of the cut locus consist of conjugate points. Finally, one-dimensional strata are Maxwell strata of infinite multiplicity, they consist of conjugate points as well. Projections of sub-Riemannian geodesics to the 2-dimensional plane of the distribution are Euler elasticae. For each point of the cut locus, we describe the Euler elasticae corresponding to minimizers coming to this point. Finally, we describe the structure of the optimal synthesis, i. e., the set of minimizers for each terminal point in the Engel group.

MIRAP, microcomputer reliability analysis program

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

Jehee, J.N.T.

1989-01-01

A program for a microcomputer is outlined that can determine minimal cut sets from a specified fault tree logic. The speed and memory limitations of the microcomputers on which the program is implemented (Atari ST and IBM) are addressed by reducing the fault tree's size and by storing the cut set data on disk. Extensive well proven fault tree restructuring techniques, such as the identification of sibling events and of independent gate events, reduces the fault tree's size but does not alter its logic. New methods are used for the Boolean reduction of the fault tree logic. Special criteria formore » combining events in the 'AND' and 'OR' logic avoid the creation of many subsuming cut sets which all would cancel out due to existing cut sets. Figures and tables illustrates these methods. 4 refs., 5 tabs.« less

Patterns of Recurrence in Electively Irradiated Lymph Node Regions After Definitive Accelerated Intensity Modulated Radiation Therapy for Head and Neck Squamous Cell Carcinoma

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

Bosch, Sven van den, E-mail: sven.vandenbosch@radboudumc.nl; Dijkema, Tim; Verhoef, Lia C.G.

Purpose: To provide a comprehensive risk assessment on the patterns of recurrence in electively irradiated lymph node regions after definitive radiation therapy for head and neck cancer. Methods and Materials: Two hundred sixty-four patients with stage cT2-4N0-2M0 squamous cell carcinoma of the oropharynx, larynx, or hypopharynx treated with accelerated intensity modulated radiation therapy between 2008 and 2012 were included. On the radiation therapy planning computed tomography (CT) scans from all patients, 1166 lymph nodes (short-axis diameter ≥5 mm) localized in the elective volume were identified and delineated. The exact sites of regional recurrences were reconstructed and projected on the initial radiationmore » therapy planning CT scan by performing coregistration with diagnostic imaging of the recurrence. Results: The actuarial rate of recurrence in electively irradiated lymph node regions at 2 years was 5.1% (95% confidence interval 2.4%-7.8%). Volumetric analysis showed an increased risk of recurrence with increasing nodal volume. Receiver operating characteristic analysis demonstrated that the summed long- and short-axis diameter is a good alternative for laborious volume calculations, using ≥17 mm as cut-off (hazard ratio 17.8; 95% confidence interval 5.7-55.1; P<.001). Conclusions: An important risk factor was identified that can help clinicians in the pretreatment risk assessment of borderline-sized lymph nodes. Not overtly pathologic nodes with a summed diameter ≥17 mm may require a higher than elective radiation therapy dose. For low-risk elective regions (all nodes <17 mm), the safety of dose de-escalation below the traditional 45 to 50 Gy should be investigated.« less

Glide dislocation nucleation from dislocation nodes at semi-coherent {111} Cu–Ni interfaces

DOE PAGES

Shao, Shuai; Wang, Jian; Beyerlein, Irene J.; ...

2015-07-23

Using atomistic simulations and dislocation theory on a model system of semi-coherent {1 1 1} interfaces, we show that misfit dislocation nodes adopt multiple atomic arrangements corresponding to the creation and redistribution of excess volume at the nodes. We identified four distinctive node structures: volume-smeared nodes with (i) spiral or (ii) straight dislocation patterns, and volume-condensed nodes with (iii) triangular or (iv) hexagonal dislocation patterns. Volume-smeared nodes contain interfacial dislocations lying in the Cu–Ni interface but volume-condensed nodes contain two sets of interfacial dislocations in the two adjacent interfaces and jogs across the atomic layer between the two adjacent interfaces.more » Finally, under biaxial tension/compression applied parallel to the interface, we show that the nucleation of lattice dislocations is preferred at the nodes and is correlated with the reduction of excess volume at the nodes.« less

Cross-Disciplinary Analysis of Lymph Node Classification in Lung Cancer on CT Scanning.

PubMed

El-Sherief, Ahmed H; Lau, Charles T; Obuchowski, Nancy A; Mehta, Atul C; Rice, Thomas W; Blackstone, Eugene H

2017-04-01

Accurate and consistent regional lymph node classification is an important element in the staging and multidisciplinary management of lung cancer. Regional lymph node definition sets-lymph node maps-have been created to standardize regional lymph node classification. In 2009, the International Association for the Study of Lung Cancer (IASLC) introduced a lymph node map to supersede all preexisting lymph node maps. Our aim was to study if and how lung cancer specialists apply the IASLC lymph node map when classifying thoracic lymph nodes encountered on CT scans during lung cancer staging. From April 2013 through July 2013, invitations were distributed to all members of the Fleischner Society, Society of Thoracic Radiology, General Thoracic Surgical Club, and the American Association of Bronchology and Interventional Pulmonology to participate in an anonymous online image-based and text-based 20-question survey regarding lymph node classification for lung cancer staging on CT imaging. Three hundred thirty-seven people responded (approximately 25% participation). Respondents consisted of self-reported thoracic radiologists (n = 158), thoracic surgeons (n = 102), and pulmonologists who perform endobronchial ultrasonography (n = 77). Half of the respondents (50%; 95% CI, 44%-55%) reported using the IASLC lymph node map in daily practice, with no significant differences between subspecialties. A disparity was observed between the IASLC definition sets and their interpretation and application on CT scans, in particular for lymph nodes near the thoracic inlet, anterior to the trachea, anterior to the tracheal bifurcation, near the ligamentum arteriosum, between the bronchus intermedius and esophagus, in the internal mammary space, and adjacent to the heart. Use of older lymph node maps and inconsistencies in interpretation and application of definitions in the IASLC lymph node map may potentially lead to misclassification of stage and suboptimal management of lung cancer in some patients. Published by Elsevier Inc.

The local lymph node assay and skin sensitization: a cut-down screen to reduce animal requirements?

PubMed

Kimber, Ian; Dearman, Rebecca J; Betts, Catherine J; Gerberick, G Frank; Ryan, Cindy A; Kern, Petra S; Patlewicz, Grace Y; Basketter, David A

2006-04-01

The local lymph node assay (LLNA), an alternative approach to skin-sensitizing testing, has made a significant contribution to animal welfare by permitting a reduction and refinement of animal use. Although there is clearly an aspiration to eliminate the use of animals in such tests, it is appropriate also to consider other opportunities for refinement and reduction of animal use. We have therefore explored the use of a modified version of the LLNA for screening purposes when there is a need to evaluate the sensitizing activity of a large number of chemicals, as will be the case under the auspices of registration, evaluation and authorization of chemicals (REACH). Using an existing LLNA database of 211 chemicals, we have examined whether a cut-down assay comprising a single high-dose group and a concurrent vehicle control would provide a realistic approach for screening chemicals for sensitizing potential. The analyses reported here suggest this is the case. We speculate that the animal welfare benefits may be enhanced further by reducing the number of animals per experimental group. However, a detailed evaluation will be necessary to provide reassurance that a reduction in group size would provide adequate sensitivity across a range of skin sensitization potencies.

Making the Cut: Lattice Kirigami Rules

NASA Astrophysics Data System (ADS)

Castle, Toen; Cho, Yigil; Gong, Xingting; Jung, Euiyeon; Sussman, Daniel M.; Yang, Shu; Kamien, Randall D.

2014-12-01

In this Letter we explore and develop a simple set of rules that apply to cutting, pasting, and folding honeycomb lattices. We consider origami-like structures that are extrinsically flat away from zero-dimensional sources of Gaussian curvature and one-dimensional sources of mean curvature, and our cutting and pasting rules maintain the intrinsic bond lengths on both the lattice and its dual lattice. We find that a small set of rules is allowed providing a framework for exploring and building kirigami—folding, cutting, and pasting the edges of paper.

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.

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

Embedding global barrier and collective in torus network with each node combining input from receivers according to class map for output to senders

DOEpatents

Chen, Dong; Coteus, Paul W; Eisley, Noel A; Gara, Alan; Heidelberger, Philip; Senger, Robert M; Salapura, Valentina; Steinmacher-Burow, Burkhard; Sugawara, Yutaka; Takken, Todd E

2013-08-27

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

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

Evaluation of 18F-FDG PET/CT Parameters for Detection of Lymph Node Metastasis in Cutaneous Melanoma.

PubMed

Cha, Jongtae; Kim, Soyoung; Wang, Jiyoung; Yun, Mijin; Cho, Arthur

2018-02-01

The purpose of this study was to investigate the value of 18 F-fluorodeoxyglucose positron emission tomography/computed tomography (FDG PET/CT) parameters in the detection of regional lymph node (LN) metastasis in patients with cutaneous melanoma. We evaluated patients with cutaneous melanoma who underwent FDG PET/CT for initial staging or recurrence evaluation. A total of 103 patients were enrolled, and 165 LNs were evaluated. LNs that were confirmed pathologically or by follow-up imaging were included in this study. PET parameters, including maximum standardized uptake value (SUVmax), total lesion glycolysis and tumour-to-liver ratio, were used to determine the presence of metastases, and the results were compared with CT-determined LN metastasis. Receiver operating characteristic (ROC) curve analysis was used to determine the optimal cut-off values of the FDG PET parameters. A total of 93 LNs were malignant, and 84 LNs were smaller than 10 mm. In all 165 LNs, an SUVmax of >2.51 showed a sensitivity of 73.1%, a specificity of 88.9%, and an accuracy of 80.0% in detecting metastatic LNs. CT showed a higher specificity (87.3%) and lower accuracy (65.5%). For non-enlarged regional LNs (<10 mm), an SUVmax cut-off value of 1.4 showed the highest negative predictive value (81.3%). For enlarged LNs (≥10 mm), an SUVmax cut-off value of 2.4 showed the highest sensitivity (90.7%) and accuracy (88.9%) in detecting metastatic LNs. In patients with cutaneous melanoma, an SUVmax of >2.4 showed a high sensitivity (91%) and accuracy (89%) in detecting metastasis in LNs ≥1 cm, and LNs <1 cm with an SUVmax <1.4 were likely to be benign.

Image sensor with motion artifact supression and anti-blooming

NASA Technical Reports Server (NTRS)

Pain, Bedabrata (Inventor); Wrigley, Chris (Inventor); Yang, Guang (Inventor); Yadid-Pecht, Orly (Inventor)

2006-01-01

An image sensor includes pixels formed on a semiconductor substrate. Each pixel includes a photoactive region in the semiconductor substrate, a sense node, and a power supply node. A first electrode is disposed near a surface of the semiconductor substrate. A bias signal on the first electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the sense node. A second electrode is disposed near the surface of the semiconductor substrate. A bias signal on the second electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the power supply node. The image sensor includes a controller that causes bias signals to be provided to the electrodes so that photocharges generated in the photoactive region are accumulated in the photoactive region during a pixel integration period, the accumulated photocharges are transferred to the sense node during a charge transfer period, and photocharges generated in the photoactive region are transferred to the power supply node during a third period without passing through the sense node. The imager can operate at high shutter speeds with simultaneous integration of pixels in the array. High quality images can be produced free from motion artifacts. High quantum efficiency, good blooming control, low dark current, low noise and low image lag can be obtained.

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

High speed CMOS imager with motion artifact supression and anti-blooming

NASA Technical Reports Server (NTRS)

Pain, Bedabrata (Inventor); Wrigley, Chris (Inventor); Yang, Guang (Inventor); Yadid-Pecht, Orly (Inventor)

2001-01-01

An image sensor includes pixels formed on a semiconductor substrate. Each pixel includes a photoactive region in the semiconductor substrate, a sense node, and a power supply node. A first electrode is disposed near a surface of the semiconductor substrate. A bias signal on the first electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the sense node. A second electrode is disposed near the surface of the semiconductor substrate. A bias signal on the second electrode sets a potential in a region of the semiconductor substrate between the photoactive region and the power supply node. The image sensor includes a controller that causes bias signals to be provided to the electrodes so that photocharges generated in the photoactive region are accumulated in the photoactive region during a pixel integration period, the accumulated photocharges are transferred to the sense node during a charge transfer period, and photocharges generated in the photoactive region are transferred to the power supply node during a third period without passing through the sense node. The imager can operate at high shutter speeds with simultaneous integration of pixels in the array. High quality images can be produced free from motion artifacts. High quantum efficiency, good blooming control, low dark current, low noise and low image lag can be obtained.

Comprehensive vulnerability assessment method for nodes considering anti-interference ability and influence

NASA Astrophysics Data System (ADS)

LUO, Jianchun; WANG, Yunyu; YANG, Jun; RAN, hong; PENG, Xiaodong; HUANG, Ming; FENG, Hao; LIU, Meijun

2018-03-01

The vulnerability assessment of power grid is of great significance in the current research. Power system faces many kinds of uncertainty factors, and the disturbance caused by them has become one of the main factors which restrict the safe operation of power grid. To solve this problem, considering the anti-interference ability of the system when the system is disturbed and the effect of the system when the node is out of operation, a set of index to reflect the anti-interference ability and the influence of nodes are set up. On this basis, a new comprehensive vulnerability assessment method of nodes is put forward by using super efficiency data envelopment analysis to scientific integration. Finally, the simulative results of IEEE30-bus system indicated that the proposed model is rational and valid.

Characterization and evaluation of a modified local lymph node assay using ATP content as a non-radio isotopic endpoint.

PubMed

Idehara, Kenji; Yamagishi, Gaku; Yamashita, Kunihiko; Ito, Michio

2008-01-01

The murine local lymph node assay (LLNA) is an accepted and widely used method for assessing the skin-sensitizing potential of chemicals. Here, we describe a non-radio isotopic modified LLNA in which adenosine triphosphate (ATP) content is used as an endpoint instead of radioisotope (RI); the method is termed LLNA modified by Daicel based on ATP content (LLNA-DA). Groups of female CBA/JNCrlj mice were treated topically on the dorsum of both ears with test chemicals or a vehicle control on days 1, 2, and 3; an additional fourth application was conducted on day 7. Pretreatment with 1% sodium lauryl sulfate solution was performed 1 h before each application. On day 8, the amount of ATP in the draining auricular lymph nodes was measured as an alternative endpoint by the luciferin-luciferase assay in terms of bioluminescence (relative light units, RLU). A stimulation index (SI) relative to the concurrent vehicle control was derived based on the RLU value, and an SI of 3 was set as the cut-off value. Using the LLNA-DA method, 31 chemicals were tested and the results were compared with those of other test methods. The accuracy of LLNA-DA vs LLNA, guinea pig tests, and human tests was 93% (28/30), 80% (20/25), and 79% (15/19), respectively. The estimated concentration (EC) 3 value was calculated and compared with that of the original LLNA. It was found that the EC3 values obtained by LLNA-DA were almost equal to those obtained by the original LLNA. The SI value based on ATP content is similar to that of the original LLNA as a result of the modifications in the chemical treatment procedure, which contribute to improving the SI value. It is concluded that LLNA-DA is a promising non-RI alternative method for evaluating the skin-sensitizing potential of chemicals.

Method and apparatus for analyzing error conditions in a massively parallel computer system by identifying anomalous nodes within a communicator set

DOEpatents

Gooding, Thomas Michael [Rochester, MN

2011-04-19

An analytical mechanism for a massively parallel computer system automatically analyzes data retrieved from the system, and identifies nodes which exhibit anomalous behavior in comparison to their immediate neighbors. Preferably, anomalous behavior is determined by comparing call-return stack tracebacks for each node, grouping like nodes together, and identifying neighboring nodes which do not themselves belong to the group. A node, not itself in the group, having a large number of neighbors in the group, is a likely locality of error. The analyzer preferably presents this information to the user by sorting the neighbors according to number of adjoining members of the group.

Lack of an Association between Neutrophil-to-Lymphocyte Ratio and PSA Failure of Prostate Cancer Patients Who Underwent Radical Prostatectomy.

PubMed

Maeda, Yoko; Kawahara, Takashi; Koizumi, Mitsuyuki; Ito, Hiroki; Kumano, Yohei; Ohtaka, Mari; Kondo, Takuya; Mochizuki, Taku; Hattori, Yusuke; Teranishi, Jun-Ichi; Yumura, Yasushi; Miyoshi, Yasuhide; Yao, Masahiro; Miyamoto, Hiroshi; Uemura, Hiroji

2016-01-01

Introduction. The neutrophil-to-lymphocyte ratio (NLR), which can be easily calculated from routine complete blood counts of the peripheral blood, has been suggested to serve as a prognostic factor for some solid malignancies. In the present study, we aimed to determine the relationship between NLR in prostate cancer patients undergoing radical prostatectomy (RP) and their prognosis. Materials and Methods. We assessed NLR in 73 men (patients) who received RP for their prostate cancer. We also performed immunohistochemistry for CD8 and CD66b in a separate set of RP specimens. Results. The median NLR in the 73 patients was 1.85. There were no significant correlations of NLR with tumor grade (p = 0.834), pathological T stage (p = 0.082), lymph node metastasis (p = 0.062), or resection margin status (p = 0.772). Based on the area under the receiver operator characteristic curve (AUROC) to predict biochemical recurrence after RP, potential NLR cut-off point was determined to be 2.88 or 3.88. However, both of these cut-off points did not precisely predict the prognosis. There were no statistically significant differences in the number of CD66b-positive neutrophils or CD8-positive lymphocytes between stromal tissues adjacent to cancer glands and stromal tissues away from cancer glands and between different grades or stages of tumors. Conclusions. There was no association between NLR and biochemical failure after prostatectomy.

Fractal Stiffening

NASA Technical Reports Server (NTRS)

Harper, David William (Inventor)

2017-01-01

A structural support having fractal-stiffening and method of fabricating the support is presented where an optimized location of at least three nodes is predetermined prior to fabricating the structural support where a first set of webs is formed on one side of the support and joined to the nodes to form a first pocket region. A second set of webs is formed within the first pocket region forming a second pocket region where the height of the first set of webs extending orthogonally from the side of the support is greater than the second set of webs extending orthogonally from the support.

Database Design for Structural Analysis and Design Optimization.

DTIC Science & Technology

1984-10-01

2) . Element number of nodes IELT NPAR(2) " Stress printing flag IPST NPAR(2) Element material angle BETA NPAR(2) Element thickness THICK NPAR(2...number LM 3*NPAR(17)*NPAR(2) Element nodal coordinates XYZ 3*NPAR(17)*NPAR(2) Element number of nodes IELT NPAR(2) Element geometry number of nodes IELTX...D.O.F. number LM 6*NPAR(7)*NPAR(2) Element number of nodes IELT NPAR(2) Material property set number MATP NPAR(2) Material constants PROP NPAR(17

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

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.

Patterns of regional head and neck lymph node metastasis in primary conjunctival malignant melanoma

PubMed Central

Lim, M; Tatla, T; Hersh, D; Hungerford, J

2006-01-01

Objective To correlate patterns of regional lymph node metastasis with the site of origin in primary conjunctival malignant melanoma. Design Retrospective analysis (1990–2003) of clinical data. Setting Two London tertiary referral centres. Participants 12 patients presenting with regional metastases after failed local treatment for conjunctival malignant melanoma. Results 6 cases predominantly involving the temporal conjunctiva metastasised to the pre‐auricular lymph nodes. Two cases predominantly involving the nasal conjunctiva metastasised to the submandibular nodes. Of the two cases with purely multifocal disease, one metastasised to the pre‐auricular nodes and another to both submandibular and parotid nodes. One primary conjunctival malignant melanoma had its origin in temporal conjunctiva but metastasised to submandibular nodes, and another case originating from nasal conjunctiva metastasised to pre‐auricular nodes. Conclusions Temporal conjunctival melanotic lesions tend to metastasise clinically to pre‐auricular lymph nodes and nasal conjunctival melanotic lesions metastasise to the submandibular lymph nodes. Patterns appear consistent with laboratory‐based anatomically mapped lymphatic drainage basins of the conjunctiva. PMID:16928703

Learning Collocations: Do the Number of Collocates, Position of the Node Word, and Synonymy Affect Learning?

ERIC Educational Resources Information Center

Webb, Stuart; Kagimoto, Eve

2011-01-01

This study investigated the effects of three factors (the number of collocates per node word, the position of the node word, synonymy) on learning collocations. Japanese students studying English as a foreign language learned five sets of 12 target collocations. Each collocation was presented in a single glossed sentence. The number of collocates…

Data Summarization in the Node by Parameters (DSNP): Local Data Fusion in an IoT Environment.

PubMed

Maschi, Luis F C; Pinto, Alex S R; Meneguette, Rodolfo I; Baldassin, Alexandro

2018-03-07

With the advent of the Internet of Things, billions of objects or devices are inserted into the global computer network, generating and processing data at a volume never imagined before. This paper proposes a way to collect and process local data through a data fusion technology called summarization. The main feature of the proposal is the local data fusion, through parameters provided by the application, ensuring the quality of data collected by the sensor node. In the evaluation, the sensor node was compared when performing the data summary with another that performed a continuous recording of the collected data. Two sets of nodes were created, one with a sensor node that analyzed the luminosity of the room, which in this case obtained a reduction of 97% in the volume of data generated, and another set that analyzed the temperature of the room, obtaining a reduction of 80% in the data volume. Through these tests, it has been proven that the local data fusion at the node can be used to reduce the volume of data generated, consequently decreasing the volume of messages generated by IoT environments.

Historical Building Monitoring Using an Energy-Efficient Scalable Wireless Sensor Network Architecture

PubMed Central

Capella, Juan V.; Perles, Angel; Bonastre, Alberto; Serrano, Juan J.

2011-01-01

We present a set of novel low power wireless sensor nodes designed for monitoring wooden masterpieces and historical buildings, in order to perform an early detection of pests. Although our previous star-based system configuration has been in operation for more than 13 years, it does not scale well for sensorization of large buildings or when deploying hundreds of nodes. In this paper we demonstrate the feasibility of a cluster-based dynamic-tree hierarchical Wireless Sensor Network (WSN) architecture where realistic assumptions of radio frequency data transmission are applied to cluster construction, and a mix of heterogeneous nodes are used to minimize economic cost of the whole system and maximize power saving of the leaf nodes. Simulation results show that the specialization of a fraction of the nodes by providing better antennas and some energy harvesting techniques can dramatically extend the life of the entire WSN and reduce the cost of the whole system. A demonstration of the proposed architecture with a new routing protocol and applied to termite pest detection has been implemented on a set of new nodes and should last for about 10 years, but it provides better scalability, reliability and deployment properties. PMID:22346630

Historical building monitoring using an energy-efficient scalable wireless sensor network architecture.

PubMed

Capella, Juan V; Perles, Angel; Bonastre, Alberto; Serrano, Juan J

2011-01-01

We present a set of novel low power wireless sensor nodes designed for monitoring wooden masterpieces and historical buildings, in order to perform an early detection of pests. Although our previous star-based system configuration has been in operation for more than 13 years, it does not scale well for sensorization of large buildings or when deploying hundreds of nodes. In this paper we demonstrate the feasibility of a cluster-based dynamic-tree hierarchical Wireless Sensor Network (WSN) architecture where realistic assumptions of radio frequency data transmission are applied to cluster construction, and a mix of heterogeneous nodes are used to minimize economic cost of the whole system and maximize power saving of the leaf nodes. Simulation results show that the specialization of a fraction of the nodes by providing better antennas and some energy harvesting techniques can dramatically extend the life of the entire WSN and reduce the cost of the whole system. A demonstration of the proposed architecture with a new routing protocol and applied to termite pest detection has been implemented on a set of new nodes and should last for about 10 years, but it provides better scalability, reliability and deployment properties.

Node-Based Learning of Multiple Gaussian Graphical Models

PubMed Central

Mohan, Karthik; London, Palma; Fazel, Maryam; Witten, Daniela; Lee, Su-In

2014-01-01

We consider the problem of estimating high-dimensional Gaussian graphical models corresponding to a single set of variables under several distinct conditions. This problem is motivated by the task of recovering transcriptional regulatory networks on the basis of gene expression data containing heterogeneous samples, such as different disease states, multiple species, or different developmental stages. We assume that most aspects of the conditional dependence networks are shared, but that there are some structured differences between them. Rather than assuming that similarities and differences between networks are driven by individual edges, we take a node-based approach, which in many cases provides a more intuitive interpretation of the network differences. We consider estimation under two distinct assumptions: (1) differences between the K networks are due to individual nodes that are perturbed across conditions, or (2) similarities among the K networks are due to the presence of common hub nodes that are shared across all K networks. Using a row-column overlap norm penalty function, we formulate two convex optimization problems that correspond to these two assumptions. We solve these problems using an alternating direction method of multipliers algorithm, and we derive a set of necessary and sufficient conditions that allows us to decompose the problem into independent subproblems so that our algorithm can be scaled to high-dimensional settings. Our proposal is illustrated on synthetic data, a webpage data set, and a brain cancer gene expression data set. PMID:25309137

Community detection for networks with unipartite and bipartite structure

NASA Astrophysics Data System (ADS)

Chang, Chang; Tang, Chao

2014-09-01

Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

Prognostic value of lymph nodes count on survival of patients with distal cholangiocarcinomas

PubMed Central

Lin, Hua-Peng; Li, Sheng-Wei; Liu, Ye; Zhou, Shi-Ji

2018-01-01

AIM To evaluate the prognostic value of the number of retrieved lymph nodes (LNs) and other prognostic factors for patients with distal cholangiocarcinomas, and to determine the optimal retrieved LNs cut-off number. METHODS The Surveillance, Epidemiology and End Results database was used to screen for patients with distal cholangiocarcinoma. Patients with different numbers of retrieved LNs were divided into three groups by the X-tile program. X-tile from Yale University is a useful tool for outcome-based cut-point optimization. The Kaplan-Meier method and Cox regression analysis were utilized for survival analysis. RESULTS A total of 449 patients with distal cholangiocarcinoma met the inclusion criteria. The Kaplan-Meier survival analysis for all patients and for N1 patients revealed no significant differences among patients with different retrieved LN counts in terms of overall and cancer-specific survival. In patients with node-negative distal cholangiocarcinoma, patients with four to nine retrieved LNs had a significantly better overall (P = 0.026) and cancer-specific survival (P = 0.039) than others. In the subsequent multivariate analysis, the number of retrieved LNs was evaluated to be independently associated with survival. Additionally, patients with four to nine retrieved LNs had a significantly lower overall mortality risk [hazard ratio (HR) = 0.39; 95% confidence interval (CI): 0.20-0.74] and cancer cause-specific mortality risk (HR = 0.32; 95%CI: 0.15-0.66) than other patients. Additionally, stratified survival analyses showed persistently better overall and cancer-specific survival when retrieving four to nine LNs in patients with any T stage of tumor, a tumor between 20 and 50 mm in diameter, or a poorly differentiated or undifferentiated tumor, and in patients who were ≤ 70-years-old. CONCLUSION The number of retrieved LNs was an important independent prognostic factor for patients with node-negative distal cholangiocarcinoma. Additionally, patients with four to nine retrieved LNs had better overall and cancer-specific survival rates than others, but the reason and mechanism were unclear. This conclusion should be validated in future studies. PMID:29531466

Efficient Interconnection Schemes for VLSI and Parallel Computation

DTIC Science & Technology

1989-08-01

Definition: Let R be a routing network. A set S of wires in R is a (directed) cut if it partitions the network into two sets of processors A and B ...such that every path from a processor in A to a processor in B contains a wire in S. The capacity cap(S) is the number of wires in the cut. For a set of...messages M, define the load load(M, S) of M on a cut S to be the number of messages in M from a processor in A to a processor in B . The load factor

Ultrasound-based clinical prediction rule model for detecting papillary thyroid cancer in cervical lymph nodes: A pilot study.

PubMed

Patel, Nayana U; McKinney, Kristin; Kreidler, Sarah M; Bieker, Teresa M; Russ, Paul; Roberts, Katherine; Glueck, Deborah H; Albuja-Cruz, Maria; Klopper, Joshua; Haugen, Bryan R

2016-01-01

To identify sonographic features of cervical lymph nodes (LNs) that are associated with papillary thyroid cancer (PTC) and to develop a prediction model for classifying nodes as metastatic or benign. This retrospective study included the records of postthyroidectomy patients with PTC who had undergone cervical ultrasound and LN biopsy. LN location, size, shape, hilum, echopattern, Doppler flow, and microcalcifications were assessed. Model selection was used to identify features associated with malignant LNs and to build a predictive, binary-outcome, generalized linear mixed model. A cross-validated receiver operating characteristic analysis was conducted to assess the accuracy of the model for classifying metastatic nodes. We analyzed records from 71 LNs (23 metastatic) in 44 patients (16 with PTC). The predictive model included a nonhomogeneous echopattern (odds ratio [OR], 5.73; 95% confidence interval [CI], 1.07-30.74; p = 0.04), microcalcifications (OR, 4.91; 95% CI, 0.91-26.54; p = 0.06), and volume (OR, 2.57; 95% CI, 0.66-9.99; p = 0.16) as predictors. The model had an area under the curve of 0.74 (95% CI, 0.60-0.85), sensitivity of 65% (95% CI, 50% to 78%), and specificity of 85% (95% CI, 73% to 94%) at the Youden optimal cut point of 0.38. Nonhomogeneous echopattern, microcalcifications, and node volume were predictive of malignant LNs in patients with PTC. A larger sample is needed to validate this model. © 2015 Wiley Periodicals, Inc.

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.

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.

Establishment of performance standards and a cut-score for the Canadian Forces firefighter physical fitness maintenance evaluation (FF PFME).

PubMed

Todd Rogers, W; Docherty, David; Petersen, Stewart

2014-01-01

The bookmark method for setting cut-scores was used to re-set the cut-score for the Canadian Forces Firefighter Physical Fitness Maintenance Evaluation (FF PFME). The time required to complete 10 tasks that together simulate a first-response firefighting emergency was accepted as a measure of work capacity. A panel of 25 Canadian Forces firefighter supervisors set cut-scores in three rounds. Each round involved independent evaluation of nine video work samples, where the times systematically increased from 400 seconds to 560 seconds. Results for Round 1 were discussed before moving to Round 2 and results for Round 2 were discussed before moving to Round 3. Accounting for the variability among panel members at the end of Round 3, a cut-score of 481 seconds (mean Round 3 plus 2 SEM) was recommended. Firefighters who complete the FF PFME in 481 seconds or less have the physical capacity to complete first-response firefighting work.

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.

Influence maximization in complex networks through optimal percolation

NASA Astrophysics Data System (ADS)

Morone, Flaviano; Makse, Hernán A.

2015-08-01

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Influence maximization in complex networks through optimal percolation.

PubMed

Morone, Flaviano; Makse, Hernán A

2015-08-06

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

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

Influence maximization in complex networks through optimal percolation

NASA Astrophysics Data System (ADS)

Morone, Flaviano; Makse, Hernan; CUNY Collaboration; CUNY Collaboration

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. Reference: F. Morone, H. A. Makse, Nature 524,65-68 (2015)

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.

Method, systems, and computer program products for implementing function-parallel network firewall

DOEpatents

Fulp, Errin W [Winston-Salem, NC; Farley, Ryan J [Winston-Salem, NC

2011-10-11

Methods, systems, and computer program products for providing function-parallel firewalls are disclosed. According to one aspect, a function-parallel firewall includes a first firewall node for filtering received packets using a first portion of a rule set including a plurality of rules. The first portion includes less than all of the rules in the rule set. At least one second firewall node filters packets using a second portion of the rule set. The second portion includes at least one rule in the rule set that is not present in the first portion. The first and second portions together include all of the rules in the rule set.

Supporting Adaptive Ubiquitous Applications With the Solar System

DTIC Science & Technology

2001-05-31

stackable operators to manage ubiqui- tous information sources. After developing a set of di - verse adaptive applications, we expect to identify fun...performance. Solar provides flexibility by allowing applications to define and interconnect op- erator objects. Solar provides scalability by dis ...children by publishing events. (Static directory nodes are sources and dynamic di - rectory nodes are operators.) Alias nodes are pub- lishers that announce

Picoradio: Communication/Computation Piconodes for Sensor Networks

DTIC Science & Technology

2003-01-02

diagram of PicoNode III, or Quark node. It is made from two custom chips, Strange RF and Charm digital processor , and is complemented by a set of...the chipset comprising of Strange (analog OOK transceiver) and Charm (digital processor ) chips. 44 Figure 33: System block diagram of the Quark node...19 2.B PICONODE II - TWO-CHIP PICONODE IMPLEMENTATION ......................................... 21 2.B.1 Baseband processor (BBP

Postoperative staging of the neck dissection using extracapsular spread and lymph node ratio as prognostic factors in HPV-negative head and neck squamous cell carcinoma patients.

PubMed

Majercakova, Katarina; Valero, Cristina; López, Montserrat; García, Jacinto; Farré, Nuria; Quer, Miquel; León, Xavier

2018-02-01

The presence of nodes with extracapsular spread (ECS) and the lymph node ratio (LNR) have prognostic competence in the pathologic evaluation of patients with a head and neck squamous cell carcinoma (HNSCC) treated with a neck dissection. The purpose of this study is to assess the effect of ECS & LNR on prognosis of HPV negative HNSCC patients treated with neck dissection and to compare to 8th edition TNM/AJCC classification. We carried out a retrospective study of 1383 patients with HNSCC treated with a neck dissection between 1985 and 2013. We developed a classification of the patients according to the presence of nodes with ECS and the LNR value with a recursive partitioning analysis (RPA) model. We obtained a classification tree with four terminal nodes: for patients without ECS (including patients pN0) the cut-off point for LNR was 1.6%, while for patients with lymph nodes with ECS it was 11.4%. The 5-year disease-specific survival for patients without ECS/LNR < 1.6% was 83.3%; for patients without ECS/LNR ≥ 1.6% it was 61.5%; for patients with ECS/LNR < 11.4% it was 33.7%; and for patients with ECS/LNR ≥ 11.4% it was 18.5%. The classification obtained with RPA had better discrimination between categories than the 8th edition of the TNM/AJCC classification. ECS status and LNR value proved high prognostic capacity in the pathological evaluation of the neck dissection. The combination of ECS and LNR improved the predictive capacity of the 8th edition of the TNM/AJCC classification in HPV-negative HNSCC patients. Copyright © 2017 Elsevier Ltd. All rights reserved.

Prognostic significance of the total number of harvested lymph nodes for lymph node-negative gastric cancer patients.

PubMed

Ji, Xin; Bu, Zhao-De; Li, Zi-Yu; Wu, Ai-Wen; Zhang, Lian-Hai; Zhang, Ji; Wu, Xiao-Jiang; Zong, Xiang-Long; Li, Shuang-Xi; Shan, Fei; Jia, Zi-Yu; Ji, Jia-Fu

2017-08-22

The relationship between the number of harvested lymph nodes (HLNs) and prognosis of gastric cancer patients without an involvement of lymph nodes has not been well-evaluated. The objective of this study is to further explore this issue. We collected data from 399 gastric cancer patients between November 2006 and October 2011. All of them were without metastatic lymph nodes. Survival analyses showed that statistically significant differences existed in the survival outcomes between the two groups allocated by the total number of HLNs ranging from 16 to 22. Therefore, we adopted 22 as the cut-off value of the total number of HLNs for grouping (group A: HLNs <22; group B: HLNs≥22). The intraoperative and postoperative characteristics, including operative blood loss (P=0.096), operation time (P=0.430), postoperative hospital stay (P=0.142), complications (P=0.552), rate of reoperation (P=0.966) and postoperative mortality (P=1.000), were comparable between the two groups. T-stage-stratified Kaplan-Meier analyses revealed that the 5-year survival rate of patients at the T4 stage was better in group B than in group A (76.9% vs. 58.5%; P=0.004). An analysis of multiple factors elucidated that the total number of HLNs, T stage, operation time and age were independently correlated factors of prognosis. Regarding gastric cancer patients without the involvement of lymph nodes, an HLN number ≥22 would be helpful in prolonging their overall survival, especially for those at T4 stage. The total number of HLNs was an independent prognostic factor for this population of patients.

SU-E-T-206: Improving Radiotherapy Toxicity Based On Artificial Neural Network (ANN) for Head and Neck Cancer Patients

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

Cho, Daniel D; Wernicke, A Gabriella; Nori, Dattatreyudu

Purpose/Objective(s): The aim of this study is to build the estimator of toxicity using artificial neural network (ANN) for head and neck cancer patients Materials/Methods: An ANN can combine variables into a predictive model during training and considered all possible correlations of variables. We constructed an ANN based on the data from 73 patients with advanced H and N cancer treated with external beam radiotherapy and/or chemotherapy at our institution. For the toxicity estimator we defined input data including age, sex, site, stage, pathology, status of chemo, technique of external beam radiation therapy (EBRT), length of treatment, dose of EBRT,more » status of post operation, length of follow-up, the status of local recurrences and distant metastasis. These data were digitized based on the significance and fed to the ANN as input nodes. We used 20 hidden nodes (for the 13 input nodes) to take care of the correlations of input nodes. For training ANN, we divided data into three subsets such as training set, validation set and test set. Finally, we built the estimator for the toxicity from ANN output. Results: We used 13 input variables including the status of local recurrences and distant metastasis and 20 hidden nodes for correlations. 59 patients for training set, 7 patients for validation set and 7 patients for test set and fed the inputs to Matlab neural network fitting tool. We trained the data within 15% of errors of outcome. In the end we have the toxicity estimation with 74% of accuracy. Conclusion: We proved in principle that ANN can be a very useful tool for predicting the RT outcomes for high risk H and N patients. Currently we are improving the results using cross validation.« less

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

Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks.

PubMed

Chen, Wanming; Mei, Tao; Meng, Max Q-H; Liang, Huawei; Liu, Yumei; Li, Yangming; Li, Shuai

2008-03-15

A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM) method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1) for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.

Machining of bone: Analysis of cutting force and surface roughness by turning process.

PubMed

Noordin, M Y; Jiawkok, N; Ndaruhadi, P Y M W; Kurniawan, D

2015-11-01

There are millions of orthopedic surgeries and dental implantation procedures performed every year globally. Most of them involve machining of bones and cartilage. However, theoretical and analytical study on bone machining is lagging behind its practice and implementation. This study views bone machining as a machining process with bovine bone as the workpiece material. Turning process which makes the basis of the actually used drilling process was experimented. The focus is on evaluating the effects of three machining parameters, that is, cutting speed, feed, and depth of cut, to machining responses, that is, cutting forces and surface roughness resulted by the turning process. Response surface methodology was used to quantify the relation between the machining parameters and the machining responses. The turning process was done at various cutting speeds (29-156 m/min), depths of cut (0.03 -0.37 mm), and feeds (0.023-0.11 mm/rev). Empirical models of the resulted cutting force and surface roughness as the functions of cutting speed, depth of cut, and feed were developed. Observation using the developed empirical models found that within the range of machining parameters evaluated, the most influential machining parameter to the cutting force is depth of cut, followed by feed and cutting speed. The lowest cutting force was obtained at the lowest cutting speed, lowest depth of cut, and highest feed setting. For surface roughness, feed is the most significant machining condition, followed by cutting speed, and with depth of cut showed no effect. The finest surface finish was obtained at the lowest cutting speed and feed setting. © IMechE 2015.

Predicted yields from selected cutting prescriptions in northern Minnesota.

Treesearch

Pamela J. Jakes; W. Brad Smith

1980-01-01

Includes predicted yields based on two sets of cutting prescriptions in northern Minnesota. Indicates that given a specific set of assumptions, average annual growing-stock removals for the decade 1977-1986 would be from 69% to 124% higher than 1976 growing-stock removals.

Performance Evaluation of AODV with Blackhole Attack

NASA Astrophysics Data System (ADS)

Dara, Karuna

2010-11-01

A Mobile Ad Hoc Network (MANET) is a temporary network set up by a wireless mobile computers moving arbitrary in the places that have no network infrastructure. These nodes maintain connectivity in a decentralized manner. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network. Thus the nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, mobile ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper, we simulated the black hole attack in various mobile ad-hoc network scenarios using AODV routing protocol of MANET and have tried to find a effect if number of nodes are increased with increase in malicious nodes.

Electrical contact tool set station

DOEpatents

Byers, M.E.

1988-02-22

An apparatus is provided for the precise setting to zero of electrically conductive cutting tools used in the machining of work pieces. An electrically conductive cylindrical pin, tapered at one end to a small flat, rests in a vee-shaped channel in a base so that its longitudinal axis is parallel to the longitudinal axis of the machine's spindle. Electronic apparatus is connected between the cylindrical pin and the electrically conductive cutting tool to produce a detectable signal when contact between tool and pin is made. The axes of the machine are set to zero by contact between the cutting tool and the sides, end or top of the cylindrical pin. Upon contact, an electrical circuit is completed, and the detectable signal is produced. The tool can then be set to zero for that axis. Should the tool contact the cylindrical pin with too much force, the cylindrical pin would be harmlessly dislodged from the vee-shaped channel, preventing damage either to the cutting tool or the cylindrical pin. 5 figs.

A fast bottom-up algorithm for computing the cut sets of noncoherent fault trees

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

Corynen, G.C.

1987-11-01

An efficient procedure for finding the cut sets of large fault trees has been developed. Designed to address coherent or noncoherent systems, dependent events, shared or common-cause events, the method - called SHORTCUT - is based on a fast algorithm for transforming a noncoherent tree into a quasi-coherent tree (COHERE), and on a new algorithm for reducing cut sets (SUBSET). To assure sufficient clarity and precision, the procedure is discussed in the language of simple sets, which is also developed in this report. Although the new method has not yet been fully implemented on the computer, we report theoretical worst-casemore » estimates of its computational complexity. 12 refs., 10 figs.« less

A note on subtrees rooted along the primary path of a binary tree

USGS Publications Warehouse

Troutman, B.M.; Karlinger, M.R.

1993-01-01

Let Fn denote the set of rooted binary plane trees with n external nodes, for given T???Fn let ui(T) be the altitude i node along the primary path of T, and let ??i(T) denote the number of external nodes in the induced subtree rooted at ui(T). We set ??i(T) = 0 if i is greater than the length of the primary path of T. We prove limn?????? ???i???x/n En{??i}/???i

A Parallel Multiclassification Algorithm for Big Data Using an Extreme Learning Machine.

PubMed

Duan, Mingxing; Li, Kenli; Liao, Xiangke; Li, Keqin

2018-06-01

As data sets become larger and more complicated, an extreme learning machine (ELM) that runs in a traditional serial environment cannot realize its ability to be fast and effective. Although a parallel ELM (PELM) based on MapReduce to process large-scale data shows more efficient learning speed than identical ELM algorithms in a serial environment, some operations, such as intermediate results stored on disks and multiple copies for each task, are indispensable, and these operations create a large amount of extra overhead and degrade the learning speed and efficiency of the PELMs. In this paper, an efficient ELM based on the Spark framework (SELM), which includes three parallel subalgorithms, is proposed for big data classification. By partitioning the corresponding data sets reasonably, the hidden layer output matrix calculation algorithm, matrix decomposition algorithm, and matrix decomposition algorithm perform most of the computations locally. At the same time, they retain the intermediate results in distributed memory and cache the diagonal matrix as broadcast variables instead of several copies for each task to reduce a large amount of the costs, and these actions strengthen the learning ability of the SELM. Finally, we implement our SELM algorithm to classify large data sets. Extensive experiments have been conducted to validate the effectiveness of the proposed algorithms. As shown, our SELM achieves an speedup on a cluster with ten nodes, and reaches a speedup with 15 nodes, an speedup with 20 nodes, a speedup with 25 nodes, a speedup with 30 nodes, and a speedup with 35 nodes.

Assessment of nodal involvement in non-small-cell lung cancer with 18F-FDG-PET/CT: mediastinal blood pool cut-off has the highest sensitivity and tumour SUVmax/2 has the highest specificity.

PubMed

Mallorie, Amy; Goldring, James; Patel, Anant; Lim, Eric; Wagner, Thomas

2017-08-01

Lymph node involvement in non-small-cell lung cancer (NSCLC) is a major factor in determining management and prognosis. We aimed to evaluate the accuracy of fluorine-18-fluorodeoxyglucose-PET/computed tomography (CT) for the assessment of nodal involvement in patients with NSCLC. In this retrospective study, we included 61 patients with suspected or confirmed resectable NSCLC over a 2-year period from April 2013 to April 2015. 221 nodes with pathological staging from surgery or endobronchial ultrasound-guided transbronchial needle aspiration were assessed using a nodal station-based analysis with original clinical reports and three different cut-offs: mediastinal blood pool (MBP), liver background and tumour standardized uptake value maximal (SUVmax)/2. Using nodal station-based analysis for activity more than tumour SUVmax/2, the sensitivity was 45%, the specificity was 89% and the negative predictive value (NPV) was 87%. For activity more than MBP, the sensitivity was 93%, the specificity was 72% and NPV was 98%. For activity more than liver background, the sensitivity was 83%, the specificity was 84% and NPV was 96%. Using a nodal staging-based analysis for accuracy at detecting N2/3 disease, for activity more than tumour SUVmax/2, the sensitivity was 59%, the specificity was 85% and NPV was 80%. For activity more than MBP, the sensitivity was 95%, the specificity was 61% and NPV was 96%. For activity more than liver background, the sensitivity was 86%, the specificity was 81% and NPV was 92%. Receiver-operating characteristic analysis showed the optimal nodal SUVmax to be more than 6.4 with a sensitivity of 45% and a specificity of 95%, with an area under the curve of 0.85. Activity more than MBP was the most sensitive cut-off with the highest sensitivity and NPV. Activity more than primary tumour SUVmax/2 was the most specific cut-off. Nodal SUVmax more than 6.4 has a high specificity of 95%.

Engineering the shape and structure of materials by fractal cut.

PubMed

Cho, Yigil; Shin, Joong-Ho; Costa, Avelino; Kim, Tae Ann; Kunin, Valentin; Li, Ju; Lee, Su Yeon; Yang, Shu; Han, Heung Nam; Choi, In-Suk; Srolovitz, David J

2014-12-09

In this paper we discuss the transformation of a sheet of material into a wide range of desired shapes and patterns by introducing a set of simple cuts in a multilevel hierarchy with different motifs. Each choice of hierarchical cut motif and cut level allows the material to expand into a unique structure with a unique set of properties. We can reverse-engineer the desired expanded geometries to find the requisite cut pattern to produce it without changing the physical properties of the initial material. The concept was experimentally realized and applied to create an electrode that expands to >800% the original area with only very minor stretching of the underlying material. The generality of our approach greatly expands the design space for materials so that they can be tuned for diverse applications.

Joint Force Quarterly. Issue 52, 1st Quarter, January 2009

DTIC Science & Technology

2009-01-01

hazard potential n self -contained operations with minimal heat or waste effluents n largely robotic operation n inherently safe operation volume...Moreover, even if a node is destroyed or a link cut, these systems are self - healing , allowing them to continue functioning with no apparent degra...Maxie Y. Davis, and Lee T. Wight 97 Irregular Warfare Is Warfare By Kenneth C. Coons, Jr., and Glenn M. Harned 104 Wired for War? Robots and Military

Fat water decomposition using globally optimal surface estimation (GOOSE) algorithm.

PubMed

Cui, Chen; Wu, Xiaodong; Newell, John D; Jacob, Mathews

2015-03-01

This article focuses on developing a novel noniterative fat water decomposition algorithm more robust to fat water swaps and related ambiguities. Field map estimation is reformulated as a constrained surface estimation problem to exploit the spatial smoothness of the field, thus minimizing the ambiguities in the recovery. Specifically, the differences in the field map-induced frequency shift between adjacent voxels are constrained to be in a finite range. The discretization of the above problem yields a graph optimization scheme, where each node of the graph is only connected with few other nodes. Thanks to the low graph connectivity, the problem is solved efficiently using a noniterative graph cut algorithm. The global minimum of the constrained optimization problem is guaranteed. The performance of the algorithm is compared with that of state-of-the-art schemes. Quantitative comparisons are also made against reference data. The proposed algorithm is observed to yield more robust fat water estimates with fewer fat water swaps and better quantitative results than other state-of-the-art algorithms in a range of challenging applications. The proposed algorithm is capable of considerably reducing the swaps in challenging fat water decomposition problems. The experiments demonstrate the benefit of using explicit smoothness constraints in field map estimation and solving the problem using a globally convergent graph-cut optimization algorithm. © 2014 Wiley Periodicals, Inc.

Lunar Data Node: Apollo Data Restoration and Archiving Update

NASA Technical Reports Server (NTRS)

Williams, David R.; Hills, Howard K.; Guiness, Edward A.; Taylor, Patrick T.; McBride, Marie Julia

2013-01-01

The Lunar Data Node (LDN) of the Planetary Data System (PDS) is responsible for the restoration and archiving of Apollo data. The LDN is located at the National Space Science Data Center (NSSDC), which holds much of the extant Apollo data on microfilm, microfiche, hard-copy documents, and magnetic tapes in older formats. The goal of the restoration effort is to convert the data into user-accessible PDS formats, create a full set of explanatory supporting data (metadata), archive the full data sets through PDS, and post the data online at the PDS Geosciences Node. This will both enable easy use of the data by current researchers and ensure that the data and metadata are securely preserved for future use. We are also attempting to locate and preserve Apollo data which were never archived at NSSDC. We will give a progress report on the data sets we have been restoring and future work.

A Novel Coarsening Method for Scalable and Efficient Mesh Generation

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

Yoo, A; Hysom, D; Gunney, B

2010-12-02

In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicatemore » that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size blocks called bricks. These brick are then laid in a way similar to conventional brick laying technique, which reduces the number of neighboring blocks each block needs to communicate. Contributions of this research are as follows: (1) We have developed a novel method that scales to a really large problem size while producing high quality mesh partitions; (2) We measured the performance and scalability of the proposed method on a machine of massive size using a set of actual large complex data sets, where we have scaled to a mesh with 110 million zones using our method. To the best of our knowledge, this is the largest complex mesh that a partitioning method is successfully applied to; and (3) We have shown that proposed method can reduce the number of edge cuts by as much as 65%.« less

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.

Setting Cut Scores on an EFL Placement Test Using the Prototype Group Method: A Receiver Operating Characteristic (ROC) Analysis

ERIC Educational Resources Information Center

Eckes, Thomas

2017-01-01

This paper presents an approach to standard setting that combines the prototype group method (PGM; Eckes, 2012) with a receiver operating characteristic (ROC) analysis. The combined PGM-ROC approach is applied to setting cut scores on a placement test of English as a foreign language (EFL). To implement the PGM, experts first named learners whom…

Lithography alternatives meet design style reality: How do they "line" up?

NASA Astrophysics Data System (ADS)

Smayling, Michael C.

2016-03-01

Optical lithography resolution scaling has stalled, giving innovative alternatives a window of opportunity. One important factor that impacts these lithographic approaches is the transition in design style from 2D to 1D for advanced CMOS logic. Just as the transition from 3D circuits to 2D fabrication 50 years ago created an opportunity for a new breed of electronics companies, the transition today presents exciting and challenging time for lithographers. Today, we are looking at a range of non-optical lithography processes. Those considered here can be broadly categorized: self-aligned lithography, self-assembled lithography, deposition lithography, nano-imprint lithography, pixelated e-beam lithography, shot-based e-beam lithography .Do any of these alternatives benefit from or take advantage of 1D layout? Yes, for example SAPD + CL (Self Aligned Pitch Division combined with Complementary Lithography). This is a widely adopted process for CMOS nodes at 22nm and below. Can there be additional design / process co-optimization? In spite of the simple-looking nature of 1D layout, the placement of "cut" in the lines and "holes" for interlayer connections can be tuned for a given process capability. Examples of such optimization have been presented at this conference, typically showing a reduction of at least one in the number of cut or hole patterns needed.[1,2] Can any of the alternatives complement each other or optical lithography? Yes.[3] For example, DSA (Directed Self Assembly) combines optical lithography with self-assembly. CEBL (Complementary e-Beam Lithography) combines optical lithography with SAPD for lines with shot-based e-beam lithography for cuts and holes. Does one (shrinking) size fit all? No, that's why we have many alternatives. For example NIL (Nano-imprint Lithography) has been introduced for NAND Flash patterning where the (trending lower) defectivity is acceptable for the product. Deposition lithography has been introduced in 3D NAND Flash to set the channel length of select and memory transistors.

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2007-08-01

rates in mobile ad hoc networks. In addition, he has considered the design of a cross-layer multi-user resource allocation framework using a... framework for many-to-one communication. In this context, multiple nodes cooperate to transmit their packets simultaneously to a single node using multi...spatially multiplexed signals transmitted from multiple nodes. Our goal is to form a framework that activates different sets of communication links

Rooting Cuttings of Cottonwood, WilIow, and Sycamore

Treesearch

Charles B. Briscoe

1963-01-01

Cuttings of cottonwood, willow, and sycamore were collectd monthly through the year and set in nursery beds. Every species yield an appreciable percentage of rooted cuttings every month. The best month was March; the worst month was June. Willow rooted more cuttings than cottonwood or sycamore, and those which rooted grew faster. Cottonwood grew faster than sycamore....

A random approach of test macro generation for early detection of hotspots

NASA Astrophysics Data System (ADS)

Lee, Jong-hyun; Kim, Chin; Kang, Minsoo; Hwang, Sungwook; Yang, Jae-seok; Harb, Mohammed; Al-Imam, Mohamed; Madkour, Kareem; ElManhawy, Wael; Kwan, Joe

2016-03-01

Multiple-Patterning Technology (MPT) is still the preferred choice over EUV for the advanced technology nodes, starting the 20nm node. Down the way to 7nm and 5nm nodes, Self-Aligned Multiple Patterning (SAMP) appears to be one of the effective multiple patterning techniques in terms of achieving small pitch of printed lines on wafer, yet its yield is in question. Predicting and enhancing the yield in the early stages of technology development are some of the main objectives for creating test macros on test masks. While conventional yield ramp techniques for a new technology node have relied on using designs from previous technology nodes as a starting point to identify patterns for Design of Experiment (DoE) creation, these techniques are challenging to apply in the case of introducing an MPT technique like SAMP that did not exist in previous nodes. This paper presents a new strategy for generating test structures based on random placement of unit patterns that can construct more meaningful bigger patterns. Specifications governing the relationships between those unit patterns can be adjusted to generate layout clips that look like realistic SAMP designs. A via chain can be constructed to connect the random DoE of SAMP structures through a routing layer to external pads for electrical measurement. These clips are decomposed according to the decomposition rules of the technology into the appropriate mandrel and cut masks. The decomposed clips can be tested through simulations, or electrically on silicon to discover hotspots. The hotspots can be used in optimizing the fabrication process and models to fix them. They can also be used as learning patterns for DFM deck development. By expanding the size of the randomly generated test structures, more hotspots can be detected. This should provide a faster way to enhance the yield of a new technology node.

Setting Meaningful Criterion-Reference Cut Scores as an Effective Professional Development

ERIC Educational Resources Information Center

Munyofu, Paul

2010-01-01

The state of Pennsylvania, like many organizations interested in performance improvement, routinely engages in professional development activities. Educators in this hands-on activity engaged in setting meaningful criterion-referenced cut scores for career and technical education assessments using two methods. The main purposes of this study were…

Study on design and cutting parameters of rotating needles for core biopsy.

PubMed

Giovannini, Marco; Ren, Huaqing; Cao, Jian; Ehmann, Kornel

2018-06-15

Core needle biopsies are widely adopted medical procedures that consist in the removal of biological tissue to better identify a lesion or an abnormality observed through a physical exam or a radiology scan. These procedures can provide significantly more information than most medical tests and they are usually performed on bone lesions, breast masses, lymph nodes and the prostate. The quality of the samples mainly depends on the forces exerted by the needle during the cutting process. The reduction of these forces is critical to extract high-quality tissue samples. The most critical factors that affect the cutting forces are the geometry of the needle tip and its motion while it is penetrating the tissue. However, optimal needle tip configurations and cutting parameters are not well established for rotating insertions. In this paper, the geometry and cutting forces of hollow needles are investigated. The fundamental goal of this study is to provide a series of guidelines for clinicians and surgeons to properly select the optimal tip geometries and speeds. Analytical models related to the cutting angles of several needle tip designs are presented and compared. Several needle tip geometries were manufactured from a 14-gauge cannula, commonly adopted during breast biopsies. The needles were then tested at different speeds and on different phantom tissues. According to these experimental measurements recommendations were formulated for rotating needle insertions. The findings of this study can be applied and extended to several biopsy procedures in which a cannula is used to extract tissue samples. Copyright © 2018 Elsevier Ltd. All rights reserved.

Effect of CRC::etr1-1 transgene expression on ethylene production, sex expression, fruit set and fruit ripening in transgenic melon (Cucumis melo L.).

PubMed

Switzenberg, Jessica A; Beaudry, Randy M; Grumet, Rebecca

2015-06-01

Ethylene is a key factor regulating sex expression in cucurbits. Commercial melons (Cucumis melo L.) are typically andromonoecious, producing male and bisexual flowers. Our prior greenhouse studies of transgenic melon plants expressing the dominant negative ethylene perception mutant gene, etr1-1, under control of the carpel- and nectary-primordia targeted CRAB'S CLAW (CRC) promoter showed increased number and earlier appearance of carpel-bearing flowers. To further investigate this phenomenon which could be potentially useful for earlier fruit production, we observed CRC::etr1-1 plants in the field for sex expression, fruit set, fruit development, and ripening. CRC::etr1-1 melon plants showed increased number of carpel-bearing open flowers on the main stem and earlier onset by 7-10 nodes. Additional phenotypes observed in the greenhouse and field were conversion of approximately 50% of bisexual buds to female, and elongated ovaries and fruits. Earlier and greater fruit set occurred on the transgenic plants. However, CRC::etr1-1 plants had greater abscission of young fruit, and smaller fruit, so that final yield (kg/plot) was equivalent to wild type. Earlier fruit set in line M5 was accompanied by earlier appearance of ripe fruit. Fruit from line M15 frequently did not exhibit external ripening processes of rind color change and abscission, but when cut open, the majority showed a ripe or overripe interior accompanied by elevated internal ethylene. The non-ripening external phenotype in M15 fruit corresponded with elevated etr1-1 transgene expression in the exocarp. These results provide insight into the role of ethylene perception in carpel-bearing flower production, fruit set, and ripening.

Finding the Optimal Nets for Self-Folding Kirigami

NASA Astrophysics Data System (ADS)

Araújo, N. A. M.; da Costa, R. A.; Dorogovtsev, S. N.; Mendes, J. F. F.

2018-05-01

Three-dimensional shells can be synthesized from the spontaneous self-folding of two-dimensional templates of interconnected panels, called nets. However, some nets are more likely to self-fold into the desired shell under random movements. The optimal nets are the ones that maximize the number of vertex connections, i.e., vertices that have only two of its faces cut away from each other in the net. Previous methods for finding such nets are based on random search, and thus, they do not guarantee the optimal solution. Here, we propose a deterministic procedure. We map the connectivity of the shell into a shell graph, where the nodes and links of the graph represent the vertices and edges of the shell, respectively. Identifying the nets that maximize the number of vertex connections corresponds to finding the set of maximum leaf spanning trees of the shell graph. This method allows us not only to design the self-assembly of much larger shell structures but also to apply additional design criteria, as a complete catalog of the maximum leaf spanning trees is obtained.

Sequoia Messaging Rate Benchmark

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

Friedley, Andrew

2008-01-22

The purpose of this benchmark is to measure the maximal message rate of a single compute node. The first num_cores ranks are expected to reside on the 'core' compute node for which message rate is being tested. After that, the next num_nbors ranks are neighbors for the first core rank, the next set of num_nbors ranks are neighbors for the second core rank, and so on. For example, testing an 8-core node (num_cores = 8) with 4 neighbors (num_nbors = 4) requires 8 + 8 * 4 - 40 ranks. The first 8 of those 40 ranks are expected tomore » be on the 'core' node being benchmarked, while the rest of the ranks are on separate nodes.« less

Factors affecting microcuttings of Stevia using a mist-chamber propagation box.

PubMed

Osman, Mohamad; Samsudin, Nur Syamimi; Faruq, Golam; Nezhadahmadi, Arash

2013-01-01

Stevia rebaudiana Bertoni is a member of Compositae family. Stevia plant has zero calorie content and its leaves are estimated to be 300 times sweeter than sugar. This plant is believed to be the most ideal substitute for sugar and important to assist in medicinal value especially for diabetic patients. In this study, microcutting techniques using a mist-chamber propagation box were used as it was beneficial for propagation of Stevia and gave genetic uniformity to the plant. The effects of different treatments on root stimulation of Stevia in microcuttings technique were evaluated. Treatments studied were different sizes of shoot cuttings, plant growth regulators, lights, and shades. Data logger was used to record the mean value of humidity (>90% RH), light intensity (673-2045 lx), and temperature (28.6-30.1°C) inside the mist-chamber propagation box. From analysis of variance, there were significant differences between varieties and treatments in parameters studied (P < 0.05). For the size of shoot cuttings treatment, 6 nodes cuttings were observed to increase root number. As compared to control, shoot cuttings treated with indole butyric acid (IBA) had better performance regarding root length. Yellow light and 50% shade treatments showed higher root and leaf number and these conditions can be considered as crucial for potential propagation of Stevia.

Supervoxels for graph cuts-based deformable image registration using guided image filtering

NASA Astrophysics Data System (ADS)

Szmul, Adam; Papież, Bartłomiej W.; Hallack, Andre; Grau, Vicente; Schnabel, Julia A.

2017-11-01

We propose combining a supervoxel-based image representation with the concept of graph cuts as an efficient optimization technique for three-dimensional (3-D) deformable image registration. Due to the pixels/voxels-wise graph construction, the use of graph cuts in this context has been mainly limited to two-dimensional (2-D) applications. However, our work overcomes some of the previous limitations by posing the problem on a graph created by adjacent supervoxels, where the number of nodes in the graph is reduced from the number of voxels to the number of supervoxels. We demonstrate how a supervoxel image representation combined with graph cuts-based optimization can be applied to 3-D data. We further show that the application of a relaxed graph representation of the image, followed by guided image filtering over the estimated deformation field, allows us to model "sliding motion." Applying this method to lung image registration results in highly accurate image registration and anatomically plausible estimations of the deformations. Evaluation of our method on a publicly available computed tomography lung image dataset leads to the observation that our approach compares very favorably with state of the art methods in continuous and discrete image registration, achieving target registration error of 1.16 mm on average per landmark.

Supervoxels for Graph Cuts-Based Deformable Image Registration Using Guided Image Filtering.

PubMed

Szmul, Adam; Papież, Bartłomiej W; Hallack, Andre; Grau, Vicente; Schnabel, Julia A

2017-10-04

In this work we propose to combine a supervoxel-based image representation with the concept of graph cuts as an efficient optimization technique for 3D deformable image registration. Due to the pixels/voxels-wise graph construction, the use of graph cuts in this context has been mainly limited to 2D applications. However, our work overcomes some of the previous limitations by posing the problem on a graph created by adjacent supervoxels, where the number of nodes in the graph is reduced from the number of voxels to the number of supervoxels. We demonstrate how a supervoxel image representation, combined with graph cuts-based optimization can be applied to 3D data. We further show that the application of a relaxed graph representation of the image, followed by guided image filtering over the estimated deformation field, allows us to model 'sliding motion'. Applying this method to lung image registration, results in highly accurate image registration and anatomically plausible estimations of the deformations. Evaluation of our method on a publicly available Computed Tomography lung image dataset (www.dir-lab.com) leads to the observation that our new approach compares very favorably with state-of-the-art in continuous and discrete image registration methods achieving Target Registration Error of 1.16mm on average per landmark.

Supervoxels for Graph Cuts-Based Deformable Image Registration Using Guided Image Filtering

PubMed Central

Szmul, Adam; Papież, Bartłomiej W.; Hallack, Andre; Grau, Vicente; Schnabel, Julia A.

2017-01-01

In this work we propose to combine a supervoxel-based image representation with the concept of graph cuts as an efficient optimization technique for 3D deformable image registration. Due to the pixels/voxels-wise graph construction, the use of graph cuts in this context has been mainly limited to 2D applications. However, our work overcomes some of the previous limitations by posing the problem on a graph created by adjacent supervoxels, where the number of nodes in the graph is reduced from the number of voxels to the number of supervoxels. We demonstrate how a supervoxel image representation, combined with graph cuts-based optimization can be applied to 3D data. We further show that the application of a relaxed graph representation of the image, followed by guided image filtering over the estimated deformation field, allows us to model ‘sliding motion’. Applying this method to lung image registration, results in highly accurate image registration and anatomically plausible estimations of the deformations. Evaluation of our method on a publicly available Computed Tomography lung image dataset (www.dir-lab.com) leads to the observation that our new approach compares very favorably with state-of-the-art in continuous and discrete image registration methods achieving Target Registration Error of 1.16mm on average per landmark. PMID:29225433

The Objective Borderline method (OBM): a probability-based model for setting up an objective pass/fail cut-off score in medical programme assessments.

PubMed

Shulruf, Boaz; Turner, Rolf; Poole, Phillippa; Wilkinson, Tim

2013-05-01

The decision to pass or fail a medical student is a 'high stakes' one. The aim of this study is to introduce and demonstrate the feasibility and practicality of a new objective standard-setting method for determining the pass/fail cut-off score from borderline grades. Three methods for setting up pass/fail cut-off scores were compared: the Regression Method, the Borderline Group Method, and the new Objective Borderline Method (OBM). Using Year 5 students' OSCE results from one medical school we established the pass/fail cut-off scores by the abovementioned three methods. The comparison indicated that the pass/fail cut-off scores generated by the OBM were similar to those generated by the more established methods (0.840 ≤ r ≤ 0.998; p < .0001). Based on theoretical and empirical analysis, we suggest that the OBM has advantages over existing methods in that it combines objectivity, realism, robust empirical basis and, no less importantly, is simple to use.

Constraints and entropy in a model of network evolution

NASA Astrophysics Data System (ADS)

Tee, Philip; Wakeman, Ian; Parisis, George; Dawes, Jonathan; Kiss, István Z.

2017-11-01

Barabási-Albert's "Scale Free" model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the "Scale Free" model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the "Scale Free" and "constraints" model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.

X-tile: a new bio-informatics tool for biomarker assessment and outcome-based cut-point optimization.

PubMed

Camp, Robert L; Dolled-Filhart, Marisa; Rimm, David L

2004-11-01

The ability to parse tumors into subsets based on biomarker expression has many clinical applications; however, there is no global way to visualize the best cut-points for creating such divisions. We have developed a graphical method, the X-tile plot that illustrates the presence of substantial tumor subpopulations and shows the robustness of the relationship between a biomarker and outcome by construction of a two dimensional projection of every possible subpopulation. We validate X-tile plots by examining the expression of several established prognostic markers (human epidermal growth factor receptor-2, estrogen receptor, p53 expression, patient age, tumor size, and node number) in cohorts of breast cancer patients and show how X-tile plots of each marker predict population subsets rooted in the known biology of their expression.

Interactive Planning for Capability Driven Air & Space Operations

DTIC Science & Technology

2008-04-30

Time, Routledge and Kegan , London, UK, 1980. [5] A. Bochman, Concerted instant–interval temporal semantics I: Temporal ontologies, Notre Dame Journal...then return true else deleteStatement (X, rj , Y ) end if end for return false Figure 8 shows the search space for instance in Table 2. The green ...nodes are those for which the set of relations cor- responding to the path from the root form a consistent set. A path from root to a green leaf node

Prognostic relevance of lymph node ratio and total lymph node count for small bowel adenocarcinoma.

PubMed

Tran, Thuy B; Qadan, Motaz; Dua, Monica M; Norton, Jeffrey A; Poultsides, George A; Visser, Brendan C

2015-08-01

Nodal metastasis is a known prognostic factor for small bowel adenocarcinoma. The goals of this study were to evaluate the number of lymph nodes (LNs) that should be retrieved and the impact of lymph node ratio (LNR) on survival. Surveillance, Epidemiology, and End Results was queried to identify patients with small bowel adenocarcinoma who underwent resection from 1988 to 2010. Survival was calculated with the Kaplan-Meier method. Multivariate analysis identified predictors of survival. A total of 2,772 patients underwent resection with at least one node retrieved, and this sample included equal numbers of duodenal (n = 1,387) and jejunoileal (n = 1,386) adenocarcinomas. There were 1,371 patients with no nodal metastasis (N0, 49.4%), 928 N1 (33.5%), and 474 N2 (17.1%). The median numbers of LNs examined for duodenal and jejunoileal cancers were 9 and 8, respectively. Cut-point analysis demonstrated that harvesting at least 9 for jejunoileal and 5 LN for duodenal cancers resulted in the greatest survival difference. Increasing LNR at both sites was associated with decreased overall median survival (LNR = 0, 71 months; LNR 0-0.02, 35 months; LNR 0.21-0.4, 25 months; and LNR >0.4, 16 months; P < .001). Multivariate analysis confirmed number of LNs examined, T-stage, LN positivity, and LNR were independent predictors of survival. LNR has a profound impact on survival in patients with small bowel adenocarcinoma. To achieve adequate staging, we recommend retrieving a minimum of 5 LN for duodenal and 9 LN for jejunoileal adenocarcinomas. Copyright © 2015 Elsevier Inc. All rights reserved.

PSMA PET/CT with Glu-urea-Lys-(Ahx)-[⁶⁸Ga(HBED-CC)] versus 3D CT volumetric lymph node assessment in recurrent prostate cancer.

PubMed

Giesel, Frederik L; Fiedler, H; Stefanova, M; Sterzing, F; Rius, M; Kopka, K; Moltz, J H; Afshar-Oromieh, A; Choyke, P L; Haberkorn, U; Kratochwil, C

2015-11-01

PET/CT with the PSMA ligand is a powerful new method for the early detection of nodal metastases in patients with biochemical relapse. The purpose of this retrospective investigation was to evaluate the volume and dimensions of nodes identified by Glu-urea-Lys-(Ahx)-[(68)Ga(HBED-CC)] ((68)Ga-PSMA-11) in the setting of recurrent prostate cancer. All PET/CT images were acquired 60 ± 10 min after intravenous injection of (68)Ga-PSMA-11 (mean dose 176 MBq). In 21 patients with recurrent prostate cancer and rising PSA, 49 PSMA-positive lymph nodes were identified. Using semiautomated lymph node segmentation software, node volume and short-axis and long-axis dimensions were measured and compared with the maximum standardized uptake values (SUVmax). Round nodes greater than or equal to 8 mm were considered positive by morphological criteria alone. The percentage of nodes identified by elevated SUVmax but not by conventional morphological criteria was determined. The mean volume of (68)Ga-PSMA-11-positive nodes was 0.5 ml (range 0.2 - 2.3 ml), and the mean short-axis diameter was 5.8 mm (range 2.4 - 13.3 mm). In 7 patients (33.3 %) with 31 PSMA-positive nodes only 11 (36 %) were morphologically positive based on diameters >8 mm on CT. In the remaining 14 patients (66.7 %), 18 (37 %) of PSMA positive lymph nodes had short-axis diameters <8 mm with a mean short-axis diameter of 5.0 mm (range 2.4 - 7.9 mm). Thus, in this population, (68)Ga-PSMA-11 PET/CT detected nodal recurrence in two-thirds of patients who would have been missed using conventional morphological criteria. (68)Ga-PSMA-11 PET/CT is more sensitive than CT based 3D volumetric lymph node evaluation in determining the node status of patients with recurrent prostate cancer, and is a promising method of restaging prostate cancers in this setting.

Analysis of 2014 Post UTME Score of Candidates in the University of Ibadan with Two Methods of Standard Setting to Set Cut Off Points

ERIC Educational Resources Information Center

Oladele, Babatunde

2017-01-01

The aim of the current study is to analyse the 2014 Post UTME scores of candidates in the university of Ibadan towards the establishment of cut off using two methods of standard settings. Prospective candidates who seek admission to higher institution are often denied admission through the Post UTME exercise. There is no single recommended…

Automatic detection of axillary lymphadenopathy on CT scans of untreated chronic lymphocytic leukemia patients

NASA Astrophysics Data System (ADS)

Liu, Jiamin; Hua, Jeremy; Chellappa, Vivek; Petrick, Nicholas; Sahiner, Berkman; Farooqui, Mohammed; Marti, Gerald; Wiestner, Adrian; Summers, Ronald M.

2012-03-01

Patients with chronic lymphocytic leukemia (CLL) have an increased frequency of axillary lymphadenopathy. Pretreatment CT scans can be used to upstage patients at the time of presentation and post-treatment CT scans can reduce the number of complete responses. In the current clinical workflow, the detection and diagnosis of lymph nodes is usually performed manually by examining all slices of CT images, which can be time consuming and highly dependent on the observer's experience. A system for automatic lymph node detection and measurement is desired. We propose a computer aided detection (CAD) system for axillary lymph nodes on CT scans in CLL patients. The lung is first automatically segmented and the patient's body in lung region is extracted to set the search region for lymph nodes. Multi-scale Hessian based blob detection is then applied to detect potential lymph nodes within the search region. Next, the detected potential candidates are segmented by fast level set method. Finally, features are calculated from the segmented candidates and support vector machine (SVM) classification is utilized for false positive reduction. Two blobness features, Frangi's and Li's, are tested and their free-response receiver operating characteristic (FROC) curves are generated to assess system performance. We applied our detection system to 12 patients with 168 axillary lymph nodes measuring greater than 10 mm. All lymph nodes are manually labeled as ground truth. The system achieved sensitivities of 81% and 85% at 2 false positives per patient for Frangi's and Li's blobness, respectively.

Element fracture technique for hypervelocity impact simulation

NASA Astrophysics Data System (ADS)

Zhang, Xiao-tian; Li, Xiao-gang; Liu, Tao; Jia, Guang-hui

2015-05-01

Hypervelocity impact dynamics is the theoretical support of spacecraft shielding against space debris. The numerical simulation has become an important approach for obtaining the ballistic limits of the spacecraft shields. Currently, the most widely used algorithm for hypervelocity impact is the smoothed particle hydrodynamics (SPH). Although the finite element method (FEM) is widely used in fracture mechanics and low-velocity impacts, the standard FEM can hardly simulate the debris cloud generated by hypervelocity impact. This paper presents a successful application of the node-separation technique for hypervelocity impact debris cloud simulation. The node-separation technique assigns individual/coincident nodes for the adjacent elements, and it applies constraints to the coincident node sets in the modeling step. In the explicit iteration, the cracks are generated by releasing the constrained node sets that meet the fracture criterion. Additionally, the distorted elements are identified from two aspects - self-piercing and phase change - and are deleted so that the constitutive computation can continue. FEM with the node-separation technique is used for thin-wall hypervelocity impact simulations. The internal structures of the debris cloud in the simulation output are compared with that in the test X-ray graphs under different material fracture criteria. It shows that the pressure criterion is more appropriate for hypervelocity impact. The internal structures of the debris cloud are also simulated and compared under different thickness-to-diameter ratios (t/D). The simulation outputs show the same spall pattern with the tests. Finally, the triple-plate impact case is simulated with node-separation FEM.

A Hybrid Memetic Framework for Coverage Optimization in Wireless Sensor Networks.

PubMed

Chen, Chia-Pang; Mukhopadhyay, Subhas Chandra; Chuang, Cheng-Long; Lin, Tzu-Shiang; Liao, Min-Sheng; Wang, Yung-Chung; Jiang, Joe-Air

2015-10-01

One of the critical concerns in wireless sensor networks (WSNs) is the continuous maintenance of sensing coverage. Many particular applications, such as battlefield intrusion detection and object tracking, require a full-coverage at any time, which is typically resolved by adding redundant sensor nodes. With abundant energy, previous studies suggested that the network lifetime can be maximized while maintaining full coverage through organizing sensor nodes into a maximum number of disjoint sets and alternately turning them on. Since the power of sensor nodes is unevenly consumed over time, and early failure of sensor nodes leads to coverage loss, WSNs require dynamic coverage maintenance. Thus, the task of permanently sustaining full coverage is particularly formulated as a hybrid of disjoint set covers and dynamic-coverage-maintenance problems, and both have been proven to be nondeterministic polynomial-complete. In this paper, a hybrid memetic framework for coverage optimization (Hy-MFCO) is presented to cope with the hybrid problem using two major components: 1) a memetic algorithm (MA)-based scheduling strategy and 2) a heuristic recursive algorithm (HRA). First, the MA-based scheduling strategy adopts a dynamic chromosome structure to create disjoint sets, and then the HRA is utilized to compensate the loss of coverage by awaking some of the hibernated nodes in local regions when a disjoint set fails to maintain full coverage. The results obtained from real-world experiments using a WSN test-bed and computer simulations indicate that the proposed Hy-MFCO is able to maximize sensing coverage while achieving energy efficiency at the same time. Moreover, the results also show that the Hy-MFCO significantly outperforms the existing methods with respect to coverage preservation and energy efficiency.

Raise cutting diameters for increased returns

Treesearch

H. Clay Smith; G. R., Jr. Trimble; Paul S. DeBald

1979-01-01

Diameter-limit cutting is widely used to harvest logs in eastern hardwoods. Studies show that cutting limits are often set so low that they sacrifice financial returns. The value of lumber cut from logs is largely dependent on the diameter, grade, and tree species. As tree size increases so does the proportion of higher grade lumber, and this is reflected in improved...

International Lunar Network (ILN) Anchor Nodes

NASA Technical Reports Server (NTRS)

Cohen, Barbara A.

2008-01-01

This slide presentation reviews what we know about the interior and surface of the moon and the need to establish a robotic set of geophysical monitoring stations on the surface of the Moon for the purpose of providing significant scientific value to the exploration of the Moon. The ILN Anchor Nodes will provide the backbone of the network in a way that accomplishes new science and allows other nodes to be flexible contributors to the network.

Collaborative Clustering for Sensor Networks

NASA Technical Reports Server (NTRS)

Wagstaff. Loro :/; Green Jillian; Lane, Terran

2011-01-01

Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events, as well as faster responses such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if individual nodes can communicate directly with their neighbors. Previously, a method was developed by which machine learning classification algorithms could collaborate to achieve high performance autonomously (without requiring human intervention). This method worked for supervised learning algorithms, in which labeled data is used to train models. The learners collaborated by exchanging labels describing the data. The new advance enables clustering algorithms, which do not use labeled data, to also collaborate. This is achieved by defining a new language for collaboration that uses pair-wise constraints to encode useful information for other learners. These constraints specify that two items must, or cannot, be placed into the same cluster. Previous work has shown that clustering with these constraints (in isolation) already improves performance. In the problem formulation, each learner resides at a different node in the sensor network and makes observations (collects data) independently of the other learners. Each learner clusters its data and then selects a pair of items about which it is uncertain and uses them to query its neighbors. The resulting feedback (a must and cannot constraint from each neighbor) is combined by the learner into a consensus constraint, and it then reclusters its data while incorporating the new constraint. A strategy was also proposed for cleaning the resulting constraint sets, which may contain conflicting constraints; this improves performance significantly. This approach has been applied to collaborative clustering of seismic and infrasonic data collected by the Mount Erebus Volcano Observatory in Antarctica. Previous approaches to distributed clustering cannot readily be applied in a sensor network setting, because they assume that each node has the same view of the data set. A view is the set of features used to represent each object. When a single data set is partitioned across several computational nodes, distributed clustering works; all objects have the same view. But when the data is collected from different locations, using different sensors, a more flexible approach is needed. This approach instead operates in situations where the data collected at each node has a different view (e.g., seismic vs. infrasonic sensors), but they observe the same events. This enables them to exchange information about the likely cluster membership relations between objects, even if they do not use the same features to represent the objects.

Tissue to tissue symplastic communication in the shoots of etiolated corn seedlings

NASA Technical Reports Server (NTRS)

Epel, B. L.; Bandurski, R. S.

1990-01-01

Carboxyfluorescein, a symplastic probe, was applied to the cut mesocotyl base or coleoptile apex of etiolated Zea mays cv. Silver Queen seedlings and its transport measured and tissue distribution determined. Long-distance longitudinal symplastic transport of the carboxyfluorescein was mainly in the vascular stele. It moved laterally from the mesocotyl stele to the mesocotyl cortex but the presence of a weak barrier limited the movement. A partial symplastic barrier was also present near the coleoptile-mesocotyl node.

Relationship between phenotype, carcass characteristics and the incidence of dark cutting in heifers.

PubMed

Mahmood, S; Basarab, J A; Dixon, W T; Bruce, H L

2016-11-01

Previous research has suggested that cattle predisposed to dark cutting can be identified from live animal or carcass characteristics. This hypothesis was tested using production and phenotype data from an existing data set collected from heifers (n=467) on study at three farms. Carcasses in the data set graded Canada AAA (n=136), AA (n=296), A (n=14), and B4 (dark cutting, n=21). Farm was identified as significant (P=0.0268) by CATMOD analysis and slaughter weight and carcass weight accounted for the variation in dark cutting frequency across the farms. Analysis of variance indicated that dark cutting heifers had reduced weight at weaning (P<0.0001) and at slaughter (P<0.0001), and produced reduced weight carcasses (P<0.0001). Results of logistic regression indicated that the probability of dark cutting was decreased in heifers slaughtered at live weight greater than 550kg and in carcasses weighing greater than 325kg. Copyright © 2016 Elsevier Ltd. All rights reserved.

An Ultralow-Dose 1-Day Protocol With Activities Lower Than 20 MBq for the Detection of Sentinel Lymph Nodes in Breast Cancer-Experiences After 150 Cases.

PubMed

Kolberg, Hans-Christian; Afsah, Shabnam; Kuehn, Thorsten; Winzer, Ute; Akpolat-Basci, Leyla; Stephanou, Miltiades; Wetzig, Sarah; Hoffmann, Oliver; Liedtke, Cornelia

2017-01-01

Common protocols for the detection of sentinel lymph nodes in early breast cancer often include the injection of the tracer 1 day before surgery. In order to detect enough activity on the day of surgery, the applied activity in many protocols is as high as several hundred MBq. So far, very few protocols with an activity below 20 MBq have been reported. We developed an ultralow-dose 1-day protocol with a mean activity lower than 20 MBq in order to reduce radiation exposure for patients and staff. Here, we are presenting our experiences in 150 consecutive cases. A total of 150 patients with clinically and sonographically negative axilla and no multicentricity underwent a sentinel lymph node biopsy using an ultralow-dose protocol performed on the day of surgery. No patient received systemic therapy prior to sentinel node biopsy. After peritumoral injection of the tracer Technetium-99m, a lymphoscintigraphy was performed in all cases. Seven minutes before the first cut, we injected 5 mL of blue dye in the region of the areola. In 148 (98.7%) of 150 patients, at least 1 sentinel lymph node could be identified by lymphoscintigraphy; the detection rate during surgery with combined tracers Technetium-99m and blue dye was 100%. The mean applied activity was 17.8 MBq (9-20). A mean number of 1.3 (0-5) sentinel lymph nodes were identified by lymphoscintigraphy and a mean number of 1.8 (1-5) sentinel lymph nodes were removed during sentinel lymph node biopsy. Ultralow-dose 1-day protocols with an activity lower than 20 MBq are a safe alternative to 1-day or 2-day protocols with significantly higher radiation doses in primary surgery for early breast cancer. Using Technetium-99m and blue dye in a dual tracer approach, detection rates of 100% are possible in clinical routine in order to reduce radiation exposure for patients and staff.

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

A Component-Based Diffusion Model With Structural Diversity for Social Networks.

PubMed

Qing Bao; Cheung, William K; Yu Zhang; Jiming Liu

2017-04-01

Diffusion on social networks refers to the process where opinions are spread via the connected nodes. Given a set of observed information cascades, one can infer the underlying diffusion process for social network analysis. The independent cascade model (IC model) is a widely adopted diffusion model where a node is assumed to be activated independently by any one of its neighbors. In reality, how a node will be activated also depends on how its neighbors are connected and activated. For instance, the opinions from the neighbors of the same social group are often similar and thus redundant. In this paper, we extend the IC model by considering that: 1) the information coming from the connected neighbors are similar and 2) the underlying redundancy can be modeled using a dynamic structural diversity measure of the neighbors. Our proposed model assumes each node to be activated independently by different communities (or components) of its parent nodes, each weighted by its effective size. An expectation maximization algorithm is derived to infer the model parameters. We compare the performance of the proposed model with the basic IC model and its variants using both synthetic data sets and a real-world data set containing news stories and Web blogs. Our empirical results show that incorporating the community structure of neighbors and the structural diversity measure into the diffusion model significantly improves the accuracy of the model, at the expense of only a reasonable increase in run-time.

[Definition of nodal volumes in breast cancer treatment and segmentation guidelines].

PubMed

Kirova, Y M; Castro Pena, P; Dendale, R; Campana, F; Bollet, M A; Fournier-Bidoz, N; Fourquet, A

2009-06-01

To assist in the determination of breast and nodal volumes in the setting of radiotherapy for breast cancer and establish segmentation guidelines. Materials and methods. Contrast metarial enhanced CT examinations were obtained in the treatment position in 25 patients to clearly define the target volumes. The clinical target volume (CTV) including the breast, internal mammary nodes, supraclavicular and subclavicular regions and axxilary region were segmented along with the brachial plexus and interpectoral nodes. The following critical organs were also segmented: heart, lungs, contralateral breast, thyroid, esophagus and humeral head. A correlation between clinical and imaging findings and meeting between radiation oncologists and breast specialists resulted in a better definition of irradiation volumes for breast and nodes with establishement of segmentation guidelines and creation of an anatomical atlas. A practical approach, based on anatomical criteria, is proposed to assist in the segmentation of breast and node volumes in the setting of breast cancer treatment along with a definition of irradiation volumes.

Localization with a mobile beacon in underwater acoustic sensor networks.

PubMed

Lee, Sangho; Kim, Kiseon

2012-01-01

Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals.

Localization with a Mobile Beacon in Underwater Acoustic Sensor Networks

PubMed Central

Lee, Sangho; Kim, Kiseon

2012-01-01

Localization is one of the most important issues associated with underwater acoustic sensor networks, especially when sensor nodes are randomly deployed. Given that it is difficult to deploy beacon nodes at predetermined locations, localization schemes with a mobile beacon on the sea surface or along the planned path are inherently convenient, accurate, and energy-efficient. In this paper, we propose a new range-free Localization with a Mobile Beacon (LoMoB). The mobile beacon periodically broadcasts a beacon message containing its location. Sensor nodes are individually localized by passively receiving the beacon messages without inter-node communications. For location estimation, a set of potential locations are obtained as candidates for a node's location and then the node's location is determined through the weighted mean of all the potential locations with the weights computed based on residuals. PMID:22778597

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.

The Context Dependency of the Self-Report Version of the Strength and Difficulties Questionnaire (SDQ): A Cross-Sectional Study between Two Administration Settings

PubMed Central

Hoofs, H.; Jansen, N. W. H.; Mohren, D. C. L.; Jansen, M. W. J.; Kant, I. J.

2015-01-01

Background The Strength and Difficulties Questionnaire (SDQ) is a screening instrument for psychosocial problems in children and adolescents, which is applied in “individual” and “collective” settings. Assessment in the individual setting is confidential for clinical applications, such as preventive child healthcare, while assessment in the collective setting is anonymous and applied in (epidemiological) research. Due to administration differences between the settings it remains unclear whether results and conclusions actually can be used interchangeably. This study therefore aims to investigate whether the SDQ is invariant across settings. Methods Two independent samples were retrieved (mean age = 14.07 years), one from an individual setting (N = 6,594) and one from a collective setting (N = 4,613). The SDQ was administered in the second year of secondary school in both settings. Samples come from the same socio-geographic population in the Netherlands. Results Confirmatory factor analysis showed that the SDQ was measurement invariant/equivalent across settings and gender. On average, children in the individual setting scored lower on total difficulties (mean difference = 2.05) and the psychosocial problems subscales compared to those in the collective setting. This was also reflected in the cut-off points for caseness, defined by the 90th percentiles, which were lower in the individual setting. Using cut-off points from the collective in the individual setting therefore resulted in a small number of cases, 2 to 3%, while ∼10% is expected. Conclusion The SDQ has the same connotation across the individual and collective setting. The observed structural differences regarding the mean scores, however, undermine the validity of the cross-use of absolute SDQ-scores between these settings. Applying cut-off scores from the collective setting in the individual setting could, therefore, result in invalid conclusions and potential misuse of the instrument. To correctly apply cut-off scores these should be retrieved from the applied setting. PMID:25886464

Interface quality of different corneal lamellar–cut depths for femtosecond laser–assisted lamellar anterior keratoplasty

PubMed Central

Zhang, Chenxing; Bald, Matthew; Tang, Maolong; Li, Yan; Huang, David

2015-01-01

PURPOSE To evaluate interface quality of different corneal lamellar–cut depths with the femtosecond laser and determine a feasible range of depth for femtosecond laser–assisted lamellar anterior keratoplasty. SETTING Casey Eye Institute, Portland, Oregon, USA. DESIGN Experimental study. METHODS Full lamellar cuts were made on 20 deepithelialized human cadaver corneas using the femtosecond laser. The cut depth was 17% to 21% (100 μm), 31%, 35%, 38% to 40%, and 45% to 48% of the central stromal thickness. Scanning electron microscopy images of cap and bed surfaces were subjectively graded for ridge and roughness using a scale of 1 to 5 (1 = best). The graft–host match was evaluated by photography and optical coherence tomography in a simulated procedure. RESULTS The ridge score was correlated with the cut depth (P = .0078, R = 0.58) and better correlated with the percentage cut depth (P = .00024, R = 0.73). The shallowest cuts had the least ridges (score 1.25). The 31% cut depth produced significantly less ridges (score 2.15) than deeper cuts. The roughness score ranged from 2.19 to 3.08 for various depths. A simulated procedure using a 100 μm host cut and a 177 μm (31%) graft had a smooth interface and flush anterior junction using an inverted side-cut design. CONCLUSIONS The femtosecond laser produced more ridges in deeper lamellar cuts. A depth setting of 31% stromal thickness might produce adequate surface quality for femtosecond laser–assisted lamellar anterior keratoplasty. The inverted side-cut design produced good edge apposition even when the graft was thicker than the host lamellar–cut depth. PMID:25747165

IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong

2017-10-01

Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.

Reputation-Based Secure Sensor Localization in Wireless Sensor Networks

PubMed Central

He, Jingsha; Xu, Jing; Zhu, Xingye; Zhang, Yuqiang; Zhang, Ting; Fu, Wanqing

2014-01-01

Location information of sensor nodes in wireless sensor networks (WSNs) is very important, for it makes information that is collected and reported by the sensor nodes spatially meaningful for applications. Since most current sensor localization schemes rely on location information that is provided by beacon nodes for the regular sensor nodes to locate themselves, the accuracy of localization depends on the accuracy of location information from the beacon nodes. Therefore, the security and reliability of the beacon nodes become critical in the localization of regular sensor nodes. In this paper, we propose a reputation-based security scheme for sensor localization to improve the security and the accuracy of sensor localization in hostile or untrusted environments. In our proposed scheme, the reputation of each beacon node is evaluated based on a reputation evaluation model so that regular sensor nodes can get credible location information from highly reputable beacon nodes to accomplish localization. We also perform a set of simulation experiments to demonstrate the effectiveness of the proposed reputation-based security scheme. And our simulation results show that the proposed security scheme can enhance the security and, hence, improve the accuracy of sensor localization in hostile or untrusted environments. PMID:24982940

a Super Voxel-Based Riemannian Graph for Multi Scale Segmentation of LIDAR Point Clouds

NASA Astrophysics Data System (ADS)

Li, Minglei

2018-04-01

Automatically segmenting LiDAR points into respective independent partitions has become a topic of great importance in photogrammetry, remote sensing and computer vision. In this paper, we cast the problem of point cloud segmentation as a graph optimization problem by constructing a Riemannian graph. The scale space of the observed scene is explored by an octree-based over-segmentation with different depths. The over-segmentation produces many super voxels which restrict the structure of the scene and will be used as nodes of the graph. The Kruskal coordinates are used to compute edge weights that are proportional to the geodesic distance between nodes. Then we compute the edge-weight matrix in which the elements reflect the sectional curvatures associated with the geodesic paths between super voxel nodes on the scene surface. The final segmentation results are generated by clustering similar super voxels and cutting off the weak edges in the graph. The performance of this method was evaluated on LiDAR point clouds for both indoor and outdoor scenes. Additionally, extensive comparisons to state of the art techniques show that our algorithm outperforms on many metrics.

Canonical Probability Distributions for Model Building, Learning, and Inference

DTIC Science & Technology

2006-07-14

hand , are for Ranked nodes set at Unobservable and Auxiliary nodes. The value of alpha is set in the diagnostic window by moving the slider in the upper...right hand side of the window. The upper bound of alpha can be modified by typing the new value in the small edit box to the right of the slider. f...TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT NUMBER University of Pittsburgh

Gap structure in Fe-based superconductors with accidental nodes: The role of hybridization

NASA Astrophysics Data System (ADS)

Hinojosa, Alberto; Chubukov, Andrey V.

2015-06-01

We study the effects of hybridization between the two electron pockets in Fe-based superconductors with s -wave gap with accidental nodes. We argue that hybridization reconstructs the Fermi surfaces and also induces an additional interpocket pairing component. We analyze how these two effects modify the gap structure by tracing the position of the nodal points of the energy dispersions in the superconducting state. We find three possible outcomes. In the first, the nodes simply shift their positions in the Brillouin zone; in the second, the nodes merge and disappear, in which case the gap function has either equal or opposite signs on the electron pockets; in the third, a new set of nodal points emerges, doubling the original number of nodes.

Empirical Research of Micro-blog Information Transmission Range by Guard nodes

NASA Astrophysics Data System (ADS)

Chen, Shan; Ji, Ling; Li, Guang

2018-03-01

The prediction and evaluation of information transmission in online social networks is a challenge. It is significant to solve this issue for monitoring public option and advertisement communication. First, the prediction process is described by a set language. Then with Sina Microblog system as used as the case object, the relationship between node influence and coverage rate is analyzed by using the topology structure of information nodes. A nonlinear model is built by a statistic method in a specific, bounded and controlled Microblog network. It can predict the message coverage rate by guard nodes. The experimental results show that the prediction model has higher accuracy to the source nodes which have lower influence in social network and practical application.

Node Deployment with k-Connectivity in Sensor Networks for Crop Information Full Coverage Monitoring

PubMed Central

Liu, Naisen; Cao, Weixing; Zhu, Yan; Zhang, Jingchao; Pang, Fangrong; Ni, Jun

2016-01-01

Wireless sensor networks (WSNs) are suitable for the continuous monitoring of crop information in large-scale farmland. The information obtained is great for regulation of crop growth and achieving high yields in precision agriculture (PA). In order to realize full coverage and k-connectivity WSN deployment for monitoring crop growth information of farmland on a large scale and to ensure the accuracy of the monitored data, a new WSN deployment method using a genetic algorithm (GA) is here proposed. The fitness function of GA was constructed based on the following WSN deployment criteria: (1) nodes must be located in the corresponding plots; (2) WSN must have k-connectivity; (3) WSN must have no communication silos; (4) the minimum distance between node and plot boundary must be greater than a specific value to prevent each node from being affected by the farmland edge effect. The deployment experiments were performed on natural farmland and on irregular farmland divided based on spatial differences of soil nutrients. Results showed that both WSNs gave full coverage, there were no communication silos, and the minimum connectivity of nodes was equal to k. The deployment was tested for different values of k and transmission distance (d) to the node. The results showed that, when d was set to 200 m, as k increased from 2 to 4 the minimum connectivity of nodes increases and is equal to k. When k was set to 2, the average connectivity of all nodes increased in a linear manner with the increase of d from 140 m to 250 m, and the minimum connectivity does not change. PMID:27941704

Prediction of lymph node involvement in patients with breast tumors measuring 3-5 cm in a middle-income setting: the role of CancerMath.

PubMed

Pijnappel, E N; Bhoo-Pathy, N; Suniza, J; See, M H; Tan, G H; Yip, C H; Hartman, M; Taib, N A; Verkooijen, H M

2014-12-01

In settings with limited resources, sentinel lymph node biopsy (SNB) is only offered to breast cancer patients with small tumors and a low a priori risk of axillary metastases. We investigated whether CancerMath, a free online prediction tool for axillary lymph node involvement, is able to identify women at low risk of axillary lymph node metastases in Malaysian women with 3-5 cm tumors, with the aim to offer SNB in a targeted, cost-effective way. Women with non-metastatic breast cancers, measuring 3-5 cm were identified within the University Malaya Medical Centre (UMMC) breast cancer registry. We compared CancerMath-predicted probabilities of lymph node involvement between women with versus without lymph node metastases. The discriminative performance of CancerMath was tested using receiver operating characteristic (ROC) analysis. Out of 1,017 patients, 520 (51 %) had axillary involvement. Tumors of women with axillary involvement were more often estrogen-receptor positive, progesterone-receptor positive, and human epidermal growth factor receptor (HER)-2 positive. The mean CancerMath score was higher in women with axillary involvement than in those without (53.5 vs. 51.3, p = 0.001). In terms of discrimination, CancerMath performed poorly, with an area under the ROC curve of 0.553 (95 % confidence interval CI 0.518-0.588). Attempts to optimize the CancerMath model by adding ethnicity and HER2 to the model did not improve discriminatory performance. For Malaysian women with tumors measuring 3-5 cm, CancerMath is unable to accurately predict lymph node involvement and is therefore not helpful in the identification of women at low risk of node-positive disease who could benefit from SNB.

SiBIC: a web server for generating gene set networks based on biclusters obtained by maximal frequent itemset mining.

PubMed

Takahashi, Kei-ichiro; Takigawa, Ichigaku; Mamitsuka, Hiroshi

2013-01-01

Detecting biclusters from expression data is useful, since biclusters are coexpressed genes under only part of all given experimental conditions. We present a software called SiBIC, which from a given expression dataset, first exhaustively enumerates biclusters, which are then merged into rather independent biclusters, which finally are used to generate gene set networks, in which a gene set assigned to one node has coexpressed genes. We evaluated each step of this procedure: 1) significance of the generated biclusters biologically and statistically, 2) biological quality of merged biclusters, and 3) biological significance of gene set networks. We emphasize that gene set networks, in which nodes are not genes but gene sets, can be more compact than usual gene networks, meaning that gene set networks are more comprehensible. SiBIC is available at http://utrecht.kuicr.kyoto-u.ac.jp:8080/miami/faces/index.jsp.

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

PubMed

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

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

PubMed

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-08

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

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

PubMed Central

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-01

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

A minimization method on the basis of embedding the feasible set and the epigraph

NASA Astrophysics Data System (ADS)

Zabotin, I. Ya; Shulgina, O. N.; Yarullin, R. S.

2016-11-01

We propose a conditional minimization method of the convex nonsmooth function which belongs to the class of cutting-plane methods. During constructing iteration points a feasible set and an epigraph of the objective function are approximated by the polyhedral sets. In this connection, auxiliary problems of constructing iteration points are linear programming problems. In optimization process there is some opportunity of updating sets which approximate the epigraph. These updates are performed by periodically dropping of cutting planes which form embedding sets. Convergence of the proposed method is proved, some realizations of the method are discussed.

Proficiency Standards and Cut-Scores for Language Proficiency Tests.

ERIC Educational Resources Information Center

Moy, Raymond H.

1984-01-01

Discusses the problems associated with "grading on a curve," the approach often used for standard setting on language proficiency tests. Proposes four main steps presented in the setting of a non-arbitrary cut-score. These steps not only establish a proficiency standard checked by external criteria, but also check to see that the test covers the…

Bovine tuberculosis at a cattle-small ruminant-human interface in Meskan, Gurage region, Central Ethiopia.

PubMed

Tschopp, Rea; Bobosha, Kidist; Aseffa, Abraham; Schelling, Esther; Habtamu, Meseret; Iwnetu, Rahel; Hailu, Elena; Firdessa, Rebuma; Hussein, Jemal; Young, Douglas; Zinsstag, Jakob

2011-11-15

Bovine tuberculosis (BTB) is endemic in Ethiopian cattle. The aim of this study was to assess BTB prevalence at an intensive contact interface in Meskan Woreda (district) in cattle, small ruminants and suspected TB-lymphadenitis (TBLN) human patients. The comparative intradermal test (CIDT) was carried out for all animals involved in the cross-sectional study and results interpreted using a > 4 mm and a > 2 mm cut-off. One PPD positive goat was slaughtered and lymph nodes subjected to culture and molecular typing. In the same villages, people with lymphadenitis were subjected to clinical examination. Fine needle aspirates (FNA) were taken from suspected TBLN and analyzed by smear microscopy and molecular typing. A total of 1214 cattle and 406 small ruminants were tested for BTB. In cattle, overall individual prevalence (> 2 mm cut-off) was 6.8% (CI: 5.4-8.5%) with 100% herd prevalence. Only three small ruminants (2 sheep and 1 goat) were reactors. The overall individual prevalence in small ruminants (> 2 mm cut-off) was 0.4% (CI: 0.03-5.1%) with 25% herd prevalence. Cattle from owners with PPD positive small ruminants were all PPD negative. 83% of the owners kept their sheep and goats inside their house at night and 5% drank regularly goat milk.FNAs were taken from 33 TBLN suspected cases out of a total of 127 screened individuals with lymph node swellings. Based on cytology results, 12 were confirmed TBLN cases. Nine out of 33 cultures were AFB positive. Culture positive samples were subjected to molecular typing and they all yielded M. tuberculosis. M. tuberculosis was also isolated from the goat that was slaughtered. This study highlighted a low BTB prevalence in sheep and goats despite intensive contact with cattle reactors. TBLN in humans was caused entirely by M. tuberculosis, the human pathogen. M. tuberculosis seems to circulate also in livestock but their role at the interface is unknown.

Bovine tuberculosis at a cattle-small ruminant-human interface in Meskan, Gurage region, Central Ethiopia

PubMed Central

2011-01-01

Background Bovine tuberculosis (BTB) is endemic in Ethiopian cattle. The aim of this study was to assess BTB prevalence at an intensive contact interface in Meskan Woreda (district) in cattle, small ruminants and suspected TB-lymphadenitis (TBLN) human patients. Methods The comparative intradermal test (CIDT) was carried out for all animals involved in the cross-sectional study and results interpreted using a > 4 mm and a > 2 mm cut-off. One PPD positive goat was slaughtered and lymph nodes subjected to culture and molecular typing. In the same villages, people with lymphadenitis were subjected to clinical examination. Fine needle aspirates (FNA) were taken from suspected TBLN and analyzed by smear microscopy and molecular typing. Results A total of 1214 cattle and 406 small ruminants were tested for BTB. In cattle, overall individual prevalence (> 2 mm cut-off) was 6.8% (CI: 5.4-8.5%) with 100% herd prevalence. Only three small ruminants (2 sheep and 1 goat) were reactors. The overall individual prevalence in small ruminants (> 2 mm cut-off) was 0.4% (CI: 0.03-5.1%) with 25% herd prevalence. Cattle from owners with PPD positive small ruminants were all PPD negative. 83% of the owners kept their sheep and goats inside their house at night and 5% drank regularly goat milk. FNAs were taken from 33 TBLN suspected cases out of a total of 127 screened individuals with lymph node swellings. Based on cytology results, 12 were confirmed TBLN cases. Nine out of 33 cultures were AFB positive. Culture positive samples were subjected to molecular typing and they all yielded M. tuberculosis. M. tuberculosis was also isolated from the goat that was slaughtered. Conclusions This study highlighted a low BTB prevalence in sheep and goats despite intensive contact with cattle reactors. TBLN in humans was caused entirely by M. tuberculosis, the human pathogen. M. tuberculosis seems to circulate also in livestock but their role at the interface is unknown. PMID:22085784

Viewing socio-affective stimuli increases connectivity within an extended default mode network.

PubMed

Göttlich, Martin; Ye, Zheng; Rodriguez-Fornells, Antoni; Münte, Thomas F; Krämer, Ulrike M

2017-03-01

Empathy is an essential ability for prosocial behavior. Previous imaging studies identified a number of brain regions implicated in affective and cognitive aspects of empathy. In this study, we investigated the neural correlates of empathy from a network perspective using graph theory and beta-series correlations. Two independent data sets were acquired using the same paradigm that elicited empathic responses to socio-affective stimuli. One data set was used to define the network nodes and modular structure, the other data set was used to investigate the effects of emotional versus neutral stimuli on network connectivity. Emotional relative to neutral stimuli increased connectivity between 74 nodes belonging to different networks. Most of these nodes belonged to an extended default mode network (eDMN). The other nodes belonged to a cognitive control network or visual networks. Within the eDMN, posterior STG/TPJ regions were identified as provincial hubs. The eDMN also showed stronger connectivity to the cognitive control network encompassing lateral PFC regions. Connector hubs between the two networks were posterior cingulate cortex and ventrolateral PFC. This stresses the advantage of a network approach as regions similarly modulated by task conditions can be dissociated into distinct networks and regions crucial for network integration can be identified. Copyright © 2017 Elsevier Inc. All rights reserved.

Analytical Study of different types Of network failure detection and possible remedies

NASA Astrophysics Data System (ADS)

Saxena, Shikha; Chandra, Somnath

2012-07-01

Faults in a network have various causes,such as the failure of one or more routers, fiber-cuts, failure of physical elements at the optical layer, or extraneous causes like power outages. These faults are usually detected as failures of a set of dependent logical entities and the links affected by the failed components. A reliable control plane plays a crucial role in creating high-level services in the next-generation transport network based on the Generalized Multiprotocol Label Switching (GMPLS) or Automatically Switched Optical Networks (ASON) model. In this paper, approaches to control-plane survivability, based on protection and restoration mechanisms, are examined. Procedures for the control plane state recovery are also discussed, including link and node failure recovery and the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure is a failure of multiple links due to a failure of a common resource. MCs (MPs) start and end at same (distinct) monitoring location(s). They are constructed such that any SRLG failure results in the failure of a unique combination of paths and cycles. We derive necessary and sufficient conditions on the set of MCs and MPs needed for localizing an SRLG failure in an arbitrary graph. Procedure of Protection and Restoration of the SRLG failure by backup re-provisioning algorithm have also been discussed.

The imaging node for the Planetary Data System

USGS Publications Warehouse

Eliason, E.M.; LaVoie, S.K.; Soderblom, L.A.

1996-01-01

The Planetary Data System Imaging Node maintains and distributes the archives of planetary image data acquired from NASA's flight projects with the primary goal of enabling the science community to perform image processing and analysis on the data. The Node provides direct and easy access to the digital image archives through wide distribution of the data on CD-ROM media and on-line remote-access tools by way of Internet services. The Node provides digital image processing tools and the expertise and guidance necessary to understand the image collections. The data collections, now approaching one terabyte in volume, provide a foundation for remote sensing studies for virtually all the planetary systems in our solar system (except for Pluto). The Node is responsible for restoring data sets from past missions in danger of being lost. The Node works with active flight projects to assist in the creation of their archive products and to ensure that their products and data catalogs become an integral part of the Node's data collections.

Thermographic measurements of high-speed metal cutting

NASA Astrophysics Data System (ADS)

Mueller, Bernhard; Renz, Ulrich

2002-03-01

Thermographic measurements of a high-speed cutting process have been performed with an infrared camera. To realize images without motion blur the integration times were reduced to a few microseconds. Since the high tool wear influences the measured temperatures a set-up has been realized which enables small cutting lengths. Only single images have been recorded because the process is too fast to acquire a sequence of images even with the frame rate of the very fast infrared camera which has been used. To expose the camera when the rotating tool is in the middle of the camera image an experimental set-up with a light barrier and a digital delay generator with a time resolution of 1 ns has been realized. This enables a very exact triggering of the camera at the desired position of the tool in the image. Since the cutting depth is between 0.1 and 0.2 mm a high spatial resolution was also necessary which was obtained by a special close-up lens allowing a resolution of app. 45 microns. The experimental set-up will be described and infrared images and evaluated temperatures of a titanium alloy and a carbon steel will be presented for cutting speeds up to 42 m/s.

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 Design and Development of the SMEX-Lite Power System

NASA Technical Reports Server (NTRS)

Rakow, Glenn P.; Schnurr, Richard G., Jr.; Solly, Michael A.

1998-01-01

This paper describes the design and development of a 250W orbit average electrical power system electronic Power Node and software for use in Low Earth Orbit missions. The mass of the Power Node is 3.6 Kg (8 lb.). The dimensions of the Power Node are 30cm x 26cm x 7.9cm (11 in. x 10.25 in x 3.1 in.) The design was realized using software, Field Programmable Gate Array (FPGA) digital logic and surface mount technology. The design is generic enough to reduce the non-recurring engineering for different mission configurations. The Power Node charges one to five, low cost, 22-cell 4 AH D-cell battery packs independently. The battery charging algorithms are executed in the power software to reduce the mass and size of the power electronic. The Power Node implements a peak-power tracking algorithm using an innovative hardware/software approach. The power software task is hosted on the spacecraft processor. The power software task generates a MIL-STD-1553 command packet to update the Power Node control settings. The settings for the battery voltage and current limits, as well as minimum solar array voltage used to implement peak power tracking are contained in this packet. Several advanced topologies are used in the Power Node. These include synchronous rectification in the bus regulators, average current control in the battery chargers and quasi-resonant converters for the Field Effect Transistor (FET) transistor drive electronics. Lastly, the main bus regulator uses a feed-forward topology with the PWM implemented in an FPGA.

Fast Inbound Top-K Query for Random Walk with Restart.

PubMed

Zhang, Chao; Jiang, Shan; Chen, Yucheng; Sun, Yidan; Han, Jiawei

2015-09-01

Random walk with restart (RWR) is widely recognized as one of the most important node proximity measures for graphs, as it captures the holistic graph structure and is robust to noise in the graph. In this paper, we study a novel query based on the RWR measure, called the inbound top-k (Ink) query. Given a query node q and a number k , the Ink query aims at retrieving k nodes in the graph that have the largest weighted RWR scores to q . Ink queries can be highly useful for various applications such as traffic scheduling, disease treatment, and targeted advertising. Nevertheless, none of the existing RWR computation techniques can accurately and efficiently process the Ink query in large graphs. We propose two algorithms, namely Squeeze and Ripple, both of which can accurately answer the Ink query in a fast and incremental manner. To identify the top- k nodes, Squeeze iteratively performs matrix-vector multiplication and estimates the lower and upper bounds for all the nodes in the graph. Ripple employs a more aggressive strategy by only estimating the RWR scores for the nodes falling in the vicinity of q , the nodes outside the vicinity do not need to be evaluated because their RWR scores are propagated from the boundary of the vicinity and thus upper bounded. Ripple incrementally expands the vicinity until the top- k result set can be obtained. Our extensive experiments on real-life graph data sets show that Ink queries can retrieve interesting results, and the proposed algorithms are orders of magnitude faster than state-of-the-art method.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

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

PubMed

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

2010-01-01

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

Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R. (Inventor)

2014-01-01

A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K-1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (gamma) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (T(sub S)). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.

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

PubMed

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

2018-02-08

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

Locating influential nodes in complex networks

PubMed Central

Malliaros, Fragkiskos D.; Rossi, Maria-Evgenia G.; Vazirgiannis, Michalis

2016-01-01

Understanding and controlling spreading processes in networks is an important topic with many diverse applications, including information dissemination, disease propagation and viral marketing. It is of crucial importance to identify which entities act as influential spreaders that can propagate information to a large portion of the network, in order to ensure efficient information diffusion, optimize available resources or even control the spreading. In this work, we capitalize on the properties of the K-truss decomposition, a triangle-based extension of the core decomposition of graphs, to locate individual influential nodes. Our analysis on real networks indicates that the nodes belonging to the maximal K-truss subgraph show better spreading behavior compared to previously used importance criteria, including node degree and k-core index, leading to faster and wider epidemic spreading. We further show that nodes belonging to such dense subgraphs, dominate the small set of nodes that achieve the optimal spreading in the network. PMID:26776455

26 CFR 1.585-7 - Elective cut-off method of changing from the reserve method of section 585.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 26 Internal Revenue 7 2011-04-01 2009-04-01 true Elective cut-off method of changing from the... § 1.585-7 Elective cut-off method of changing from the reserve method of section 585. (a) General rule...)) may elect to use the cut-off method set forth in this section. Any such election must be made at the...

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

A sensitive assay for urinary cocaine metabolite benzoylecgonine shows more positive results and longer half-lives than those using traditional cut-offs.

PubMed

Nickley, Joyce; Pesce, Amadeo J; Krock, Kevin

2017-08-01

Cocaine is a common drug of abuse. To detect its use, a screening detection concentration for the cocaine metabolite benzoylecgonine is commonly set at 150 ng/mL and its confirmatory cut-off is set at 100 ng/mL. Studies have suggested that these cut-offs may be set too high, allowing some patients with this substance abuse problem to be missed or improperly monitored. With the advent of liquid chromatography-tandem mass spectrometry (LC-MS/MS) technology it is possible to reliably detect and quantify lower concentrations of its metabolite benzoylecgonine as part of a larger drug panel. One purpose of the study was to establish if there was a significant increase in detection of cocaine use with a ten-fold more sensitive cut-off. A very sensitive dilute and shoot assay for benzoylecgonine was developed with a lower limit of quantitation of 5 ng/mL. Validation of the 5 ng/mL cut-off was achieved by plotting all the positive cocaine observations as a frequency distribution on a logarithmic scale. The number of positive results with measurable concentrations below the typical industry 100 ng/mL cut-off level but above the high sensitivity 5 ng/mL cut-off level was observed to be 51.9% of the observed positives. The lower cut-off also allowed a re-evaluation of the window of detection after cessation of use. It was observed to be between 17 and 22 days. © 2016 Precision Diagnostics, LLC. Drug Testing and Analysis published by John Wiley & Sons, Ltd. © 2016 Precision Diagnostics, LLC. Drug Testing and Analysis published by John Wiley & Sons, Ltd.

Epidemic spreading on preferred degree adaptive networks.

PubMed

Jolad, Shivakumar; Liu, Wenjia; Schmittmann, B; Zia, R K P

2012-01-01

We study the standard SIS model of epidemic spreading on networks where individuals have a fluctuating number of connections around a preferred degree κ. Using very simple rules for forming such preferred degree networks, we find some unusual statistical properties not found in familiar Erdös-Rényi or scale free networks. By letting κ depend on the fraction of infected individuals, we model the behavioral changes in response to how the extent of the epidemic is perceived. In our models, the behavioral adaptations can be either 'blind' or 'selective'--depending on whether a node adapts by cutting or adding links to randomly chosen partners or selectively, based on the state of the partner. For a frozen preferred network, we find that the infection threshold follows the heterogeneous mean field result λ(c)/μ = <κ>/<κ2> and the phase diagram matches the predictions of the annealed adjacency matrix (AAM) approach. With 'blind' adaptations, although the epidemic threshold remains unchanged, the infection level is substantially affected, depending on the details of the adaptation. The 'selective' adaptive SIS models are most interesting. Both the threshold and the level of infection changes, controlled not only by how the adaptations are implemented but also how often the nodes cut/add links (compared to the time scales of the epidemic spreading). A simple mean field theory is presented for the selective adaptations which capture the qualitative and some of the quantitative features of the infection phase diagram.

Solo-Surgeon Single-Port Laparoscopic Anterior Resection for Sigmoid Colon Cancer: Comparative Study.

PubMed

Choi, Byung Jo; Jeong, Won Jun; Kim, Say-June; Lee, Sang Chul

2018-03-01

To report our experience with solo-surgeon, single-port laparoscopic anterior resection (solo SPAR) for sigmoid colon cancer. Data from sigmoid colon cancer patients who underwent anterior resections (ARs) using the single-port, solo surgery technique (n = 31) or the conventional single-port laparoscopic technique (n = 45), between January 2011 and July 2016, were retrospectively analyzed. In the solo surgeries, making the transumbilical incision into the peritoneal cavity was facilitated through the use of a self-retaining retractor system. After establishing a single port through the umbilicus, an adjustable mechanical camera holder replaced the human scope assistant. Patient and tumor characteristics and operative, pathologic, and postoperative outcomes were compared. The operative times and estimated blood losses were similar for the patients in both treatment groups. In addition, most of the postoperative variables were comparable between the two groups, including postoperative complications and hospital stays. In the solo SPAR group, comparable lymph nodes were attained, and sufficient proximal and distal cut margins were obtained. The difference in the proximal cut margin significantly favored the solo SPAR, compared with the conventional AR group (P = .000). This study shows that solo SPAR, using a passive camera system, is safe and feasible for use in sigmoid colon cancer surgery, if performed by an experienced laparoscopic surgeon. In addition to reducing the need for a surgical assistant, the oncologic requirements, including adequate margins and sufficient lymph node harvesting, could be fulfilled. Further evaluations, including prospective randomized studies, are warranted.

Single-port gynecologic surgery with a novel surgical platform.

PubMed

Knight, Jason; Tunitsky-Britton, Elena; Muffly, Tyler; Michener, Chad M; Escobar, Pedro F

2012-09-01

Laparoendoscopic single-site surgery (LESS) allows better cosmesis and decreased pain when compared with traditional laparoscopy (TL). Instrument crowding and diminished triangulation are limitations. This study evaluates a novel single-port surgical platform (NSP) designed to facilitate the transition from TL to LESS (TransEnterix SPIDER, Durham, NC). NSP and TL were compared using standardized dry lab tasks. Feasibility of NSP in gynecology was assessed using the porcine model. Completion times with NSP were longer for ring transfer (P = .025) and trended longer for disc cutting (P = .074). Disc cutting accuracy was lower with NSP versus TL (P = .008). NSP operative times for hysterectomy, pelvic and para-aortic node dissection were 22.3, 13.3, and 26 minutes, respectively, without complications. Fatigue and lack of integrated bipolar cautery were limitations of NSP. While application of NSP to gynecology appears feasible, lower performance when compared with TL underscores the need for caution when applying NSP to humans.

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

Learnable Models for Information Diffusion and its Associated User Behavior in Micro-blogosphere

DTIC Science & Technology

2012-08-30

According to the work of Even-Dar and Shapira (2007), we recall the definition of the ba- sic voter model on network G. In the model, each node of G...reason as follows. We started with the K distinct initial nodes and all the other nodes were neutral in the beginning. Recall that we set the average time... memory , running under Linux. Learning to predict opinion share and detect anti-majority opinionists in social networks 29 7 Conclusion Unlike the popular

Complex network construction based on user group attention sequence

NASA Astrophysics Data System (ADS)

Zhang, Gaowei; Xu, Lingyu; Wang, Lei

2018-04-01

In the traditional complex network construction, it is often to use the similarity between nodes, build the weight of the network, and finally build the network. However, this approach tends to focus only on the coupling between nodes, while ignoring the information transfer between nodes and the transfer of directionality. In the network public opinion space, based on the set of stock series that the network groups pay attention to within a certain period of time, we vectorize the different stocks and build a complex network.

Generation of distributed W-states over long distances

NASA Astrophysics Data System (ADS)

Li, Yi

2017-08-01

Ultra-secure quantum communication between distant locations requires distributed entangled states between nodes. Various methodologies have been proposed to tackle this technological challenge, of which the so-called DLCZ protocol is the most promising and widely adopted scheme. This paper aims to extend this well-known protocol to a multi-node setting where the entangled W-state is generated between nodes over long distances. The generation of multipartite W-states is the foundation of quantum networks, paving the way for quantum communication and distributed quantum computation.

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.

Locoregional treatment of early breast cancer with isolated tumor cells or micrometastases on sentinel lymph node biopsy

PubMed Central

Tallet, Agnès; Lambaudie, Eric; Cohen, Monique; Minsat, Mathieu; Bannier, Marie; Resbeut, Michel; Houvenaeghel, Gilles

2016-01-01

The advent of sentinel lymph-node technique has led to a shift in lymph-node staging, due to the emergence of new entities namely micrometastases (pN1mi) and isolated tumor cells [pN0(i+)]. The prognostic significance of this low positivity in axillary lymph nodes is currently debated, as is, therefore its management. This article provides updates evidence-based medicine data to take into account for treatment decision-making in this setting, discussing the locoregional treatment in pN0(i+) and pN1mi patients (completion axillary dissection, axillary irradiation with or without regional nodes irradiation, or observation), according to systemic treatment, with the goal to help physicians in their daily practice. PMID:27081647

Smart-Home Architecture Based on Bluetooth mesh Technology

NASA Astrophysics Data System (ADS)

Wan, Qing; Liu, Jianghua

2018-03-01

This paper describes the smart home network system based on Nordic nrf52832 device. Nrf52832 is new generation RF SOC device focus on sensor monitor and low power Bluetooth connection applications. In this smart home system, we set up a self-organizing network system which consists of one control node and a lot of monitor nodes. The control node manages the whole network works; the monitor nodes collect the sensor information such as light intensity, temperature, humidity, PM2.5, etc. Then update to the control node by Bluetooth mesh network. The design results show that the Bluetooth mesh wireless network system is flexible and construction cost is low, which is suitable for the communication characteristics of a smart home network. We believe it will be wildly used in the future.

[Discussion on standardized implementation of laparoscopic radical lymphadenectomy for distal gastric cancer].

PubMed

Lyu, Zejian; Wang, Junjiang; Li, Yong

2017-08-25

Laparoscopic radical gastrectomy for gastric cancer has been widely applied in clinical practice, and its indications have been extended from early gastric cancer to advanced gastric cancer. It is acknowledged that laparoscopic radical gastrectomy is technically challenging because of the complexity of anatomy, rich blood supply, and extensive lymph node dissection. This paper primarily intends to share the experience of laparoscopic radical D2 gastrectomy for distal gastric cancer with details of choosing the location of Trocar, surgical approaches and the sequence of lymph node dissection. All the surgeries were performed at Department of General Surgery and Gastrointestinal Surgery, Guangdong General Hospital. The finding suggests that a correct laparoscopic Trocar placement is the foundation of adequate surgical field visualization. Under most circumstances, the observation hole should be around 2 cm below the umbilicus and the operating hole should be close to the bilateral clavicle midline. Furthermore, proper surgical approach and sequence of lymph node dissection are the prerequisites for successful laparoscopic radical D2 gastrectomy, as well as the reassurance of dissecting lymph node safely and comprehensively. The position of surgical team adopted in our center is that the surgeon stands to the left of the patient, with laparoscope operator stands in between patient's legs while the first assistant positions himself opposite the surgeon on the right side of the patient. This position correlates to the rules of sequential lymph node dissection, which is "from left to right", "from proximal to distal" and "from inferior to superior". Therefore, it is conductive to inferior and superior pylorus region dissection and it can effectively prevent subsidiary-injury. In our center, the procedure of lymph node dissection has been standardized: the initial step is to undergo station 4sb dissection and greater gastric curvature clearance; then change the patient's position to clean the sub-pyloric lymph node region and cut off the duodenum by linear stapler; followed by the clearance of inferior region of the pylorus and the upper margin of the pancreas; in the final step, the first and the third groups of lymph node dissection is performed. Although varied surgical approaches and sequences of lymph node dissection are applied in different hospitals, the techniques required for laparoscopic D2 radical gastrectomy for gastric cancer are sophisticated and advanced in general. Radical lymph node dissection is complicated, urging surgeons to familiarize themselves with the anatomy of gastric peripheral vascular system and characteristics of lymph node drainage. By designing and implementing effective strategies, such as formulating a regular team, positioning surgical team reasonably, changing a patient's posture during operation, choosing an appropriate surgical approach and following a logically sequence of lymph node dissection, surgeons can standardize the complete surgical procedure, which ultimately reduces bleeding during surgery and shortens the operative time.

Cross-layer design for intrusion detection and data security in wireless ad hoc sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2007-09-01

A wireless ad hoc sensor network is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. The nodes are severely resource-constrained, with limited processing, memory and power capacities and must operate cooperatively to fulfill a common mission in typically unattended modes. In a wireless sensor network (WSN), each sensor at a node can observe locally some underlying physical phenomenon and sends a quantized version of the observation to sink (destination) nodes via wireless links. Since the wireless medium can be easily eavesdropped, links can be compromised by intrusion attacks from nodes that may mount denial-of-service attacks or insert spurious information into routing packets, leading to routing loops, long timeouts, impersonation, and node exhaustion. A cross-layer design based on protocol-layer interactions is proposed for detection and identification of various intrusion attacks on WSN operation. A feature set is formed from selected cross-layer parameters of the WSN protocol to detect and identify security threats due to intrusion attacks. A separate protocol is not constructed from the cross-layer design; instead, security attributes and quantified trust levels at and among nodes established during data exchanges complement customary WSN metrics of energy usage, reliability, route availability, and end-to-end quality-of-service (QoS) provisioning. Statistical pattern recognition algorithms are applied that use observed feature-set patterns observed during network operations, viewed as security audit logs. These algorithms provide the "best" network global performance in the presence of various intrusion attacks. A set of mobile (software) agents distributed at the nodes implement the algorithms, by moving among the layers involved in the network response at each active node and trust neighborhood, collecting parametric information and executing assigned decision tasks. The communications overhead due to security mechanisms and the latency in network response are thus minimized by reducing the need to move large amounts of audit data through resource-limited nodes and by locating detection/identification programs closer to audit data. If network partitioning occurs due to uncoordinated node exhaustion, data compromise or other effects of the attacks, the mobile agents can continue to operate, thereby increasing fault tolerance in the network response to intrusions. Since the mobile agents behave like an ant colony in securing the WSN, published ant colony optimization (ACO) routines and other evolutionary algorithms are adapted to protect network security, using data at and through nodes to create audit records to detect and respond to denial-of-service attacks. Performance evaluations of algorithms are performed by simulation of a few intrusion attacks, such as black hole, flooding, Sybil and others, to validate the ability of the cross-layer algorithms to enable WSNs to survive the attacks. Results are compared for the different algorithms.

Design and optimization of all-optical networks

NASA Astrophysics Data System (ADS)

Xiao, Gaoxi

1999-10-01

In this thesis, we present our research results on the design and optimization of all-optical networks. We divide our results into the following four parts: 1.In the first part, we consider broadcast-and-select networks. In our research, we propose an alternative and cheaper network configuration to hide the tuning time. In addition, we derive lower bounds on the optimal schedule lengths and prove that they are tighter than the best existing bounds. 2.In the second part, we consider all-optical wide area networks. We propose a set of algorithms for allocating a given number of WCs to the nodes. We adopt a simulation-based optimization approach, in which we collect utilization statistics of WCs from computer simulation and then perform optimization to allocate the WCs. Therefore, our algorithms are widely applicable and they are not restricted to any particular model and assumption. We have conducted extensive computer simulation on regular and irregular networks under both uniform and non-uniform traffic. We see that our method can get nearly the same performance as that of full wavelength conversion by using a much smaller number of WCs. Compared with the best existing method, the results show that our algorithms can significantly reduce (1)the overall blocking probability (i.e., better mean quality of service) and (2)the maximum of the blocking probabilities experienced at all the source nodes (i.e., better fairness). Equivalently, for a given performance requirement on blocking probability, our algorithms can significantly reduce the number of WCs required. 3.In the third part, we design and optimize the physical topology of all-optical wide area networks. We show that the design problem is NP-complete and we propose a heuristic algorithm called two-stage cut saturation algorithm for this problem. Simulation results show that (1)the proposed algorithm can efficiently design networks with low cost and high utilization, and (2)if wavelength converters are available to support full wavelength conversion, the cost of the links can be significantly reduced. 4.In the fourth part, we consider all-optical wide area networks with multiple fibers per link. We design a node configuration for all-optical networks. We exploit the flexibility that, to establish a lightpath across a node, we can select any one of the available channels in the incoming link and any one of the available channels in the outgoing link. As a result, the proposed node configuration requires a small number of small optical switches while it can achieve nearly the same performance as the existing one. And there is no additional crosstalk other than the intrinsic crosstalk within each single-chip optical switch.* (Abstract shortened by UMI.) *Originally published in DAI Vol. 60, No. 2. Reprinted here with corrected author name.

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

Consistency of Standard Setting in an Augmented State Testing System

ERIC Educational Resources Information Center

Lissitz, Robert W.; Wei, Hua

2008-01-01

In this article we address the issue of consistency in standard setting in the context of an augmented state testing program. Information gained from the external NRT scores is used to help make an informed decision on the determination of cut scores on the state test. The consistency of cut scores on the CRT across grades is maintained by forcing…

Setting Cut-Scores: A Critical Review of the Angoff and Modified Angoff Methods

ERIC Educational Resources Information Center

Ricker, Kathryn L.

2006-01-01

The purpose of this article is to review critically the Angoff (1971) and modified Angoff methods for setting cut-scores. The criteria used in this review were originally proposed by Berk (1986). The assumptions of the Angoff method and other current issues surrounding this method are also discussed. Recommendations are made for using the Angoff…

Investigation of tool wear and surface roughness on machining of titanium alloy with MT-CVD cutting tool

NASA Astrophysics Data System (ADS)

Maity, Kalipada; Pradhan, Swastik

2018-04-01

In this study, machining of titanium alloy (grade 5) is carried out using MT-CVD coated cutting tool. Titanium alloys possess superior strength-to-weight ratio with good corrosion resistance. Most of the industries used titanium alloy for the manufacturing of various types of lightweight components. The parts made from Ti-6Al-4V largely used in aerospace, biomedical, automotive and marine sectors. The conventional machining of this material is very difficult, due to low thermal conductivity and high chemical reactivity properties. To achieve a good surface finish with minimum tool wear of cutting tool, the machining is carried out using MT-CVD coated cutting tool. The experiment is carried out using of Taguchi L27 array layout with three cutting variables and levels. To find out the optimum parametric setting desirability function analysis (DFA) approach is used. The analysis of variance is studied to know the percentage contribution of each cutting variables. The optimum parametric setting results calculated from DFA were validated through the confirmation test.

Lymph node ratio predicts disease-specific survival in melanoma patients.

PubMed

Xing, Yan; Badgwell, Brian D; Ross, Merrick I; Gershenwald, Jeffrey E; Lee, Jeffrey E; Mansfield, Paul F; Lucci, Anthony; Cormier, Janice N

2009-06-01

The objectives of this analysis were to compare various measures associated with lymph node (LN) dissection and to identify threshold values associated with disease-specific survival (DSS) outcomes in patients with melanoma. Patients with lymph node-positive melanoma who underwent therapeutic LN dissection of the neck, axilla, and inguinal region were identified from the SEER database (1988-2005). We performed Cox multivariate analyses to determine the impact of the total number of LNs removed, number of negative LNs removed, and LN ratio on DSS. Multivariate cut-point analyses were conducted for each anatomic region to identify the threshold values associated with the largest improvement in DSS. The LN ratio was significantly associated with DSS for all LN regions. The LN ratio thresholds resulting in the greatest difference in 5-year DSS were .07, .13, and .18 for neck, axillary, and inguinal regions, respectively, corresponding to 15, 8, and 6 LNs removed per positive lymph node. After adjustment for other clinicopathologic factors, the hazard ratios (HRs) were .53 (95% confidence interval [CI], .40 to .71) in the neck, .52 (95% CI, .42 to .65) in the axillary, and .47 (95% CI, .36 to .61) in the inguinal regions for patients who met the LN ratio threshold. Among the prognostic factors examined, LN ratio was the best indicator of the extent of LN dissection, regardless of anatomic nodal region. These data provide evidence-based guidelines for defining adequate LN dissections in melanoma patients. (c) 2009 American Cancer Society.

Evaluating the predictive accuracy and the clinical benefit of a nomogram aimed to predict survival in node-positive prostate cancer patients: External validation on a multi-institutional database.

PubMed

Bianchi, Lorenzo; Schiavina, Riccardo; Borghesi, Marco; Bianchi, Federico Mineo; Briganti, Alberto; Carini, Marco; Terrone, Carlo; Mottrie, Alex; Gacci, Mauro; Gontero, Paolo; Imbimbo, Ciro; Marchioro, Giansilvio; Milanese, Giulio; Mirone, Vincenzo; Montorsi, Francesco; Morgia, Giuseppe; Novara, Giacomo; Porreca, Angelo; Volpe, Alessandro; Brunocilla, Eugenio

2018-04-06

To assess the predictive accuracy and the clinical value of a recent nomogram predicting cancer-specific mortality-free survival after surgery in pN1 prostate cancer patients through an external validation. We evaluated 518 prostate cancer patients treated with radical prostatectomy and pelvic lymph node dissection with evidence of nodal metastases at final pathology, at 10 tertiary centers. External validation was carried out using regression coefficients of the previously published nomogram. The performance characteristics of the model were assessed by quantifying predictive accuracy, according to the area under the curve in the receiver operating characteristic curve and model calibration. Furthermore, we systematically analyzed the specificity, sensitivity, positive predictive value and negative predictive value for each nomogram-derived probability cut-off. Finally, we implemented decision curve analysis, in order to quantify the nomogram's clinical value in routine practice. External validation showed inferior predictive accuracy as referred to in the internal validation (65.8% vs 83.3%, respectively). The discrimination (area under the curve) of the multivariable model was 66.7% (95% CI 60.1-73.0%) by testing with receiver operating characteristic curve analysis. The calibration plot showed an overestimation throughout the range of predicted cancer-specific mortality-free survival rates probabilities. However, in decision curve analysis, the nomogram's use showed a net benefit when compared with the scenarios of treating all patients or none. In an external setting, the nomogram showed inferior predictive accuracy and suboptimal calibration characteristics as compared to that reported in the original population. However, decision curve analysis showed a clinical net benefit, suggesting a clinical implication to correctly manage pN1 prostate cancer patients after surgery. © 2018 The Japanese Urological Association.

Inter-laboratory validation of the modified murine local lymph node assay based on 5-bromo-2'-deoxyuridine incorporation.

PubMed

Kojima, Hajime; Takeyoshi, Masahiro; Sozu, Takashi; Awogi, Takumi; Arima, Kazunori; Idehara, Kenji; Ikarashi, Yoshiaki; Kanazawa, Yukiko; Maki, Eiji; Omori, Takashi; Yuasa, Atsuko; Yoshimura, Isao

2011-01-01

The murine local lymph node assay (LLNA) is a well-established alternative to the guinea pig maximization test (GPMT) or Buehler test (BT) for the assessment of the skin sensitizing ability of a drug, cosmetic material, pesticide or industrial chemical. Instead of radioisotope using in this method, Takeyoshi M. et al. (2001) has developed a modified LLNA based on the 5-bromo-2'-deoxyuridine (BrdU) incorporation (LLNA:BrdU-ELISA). The LLNA:BrdU-ELISA is practically identical to the LLNA methodology excluding the use of BrdU, for which a single intraperitoneal injection of BrdU is made on day 4, and colorimetric detection of cell turnover. We conducted the validation study to evaluate the reliability and relevance of LLNA:BrdU-ELISA. The experiment involved 7 laboratories, wherein 10 chemicals were examined under blinded conditions. In this study, 3 chemicals were examined in all laboratories and the remaining 7 were examined in 3 laboratories. The data were expressed as the BrdU incorporation using an ELISA method for each group, and the stimulation index (SI) for each chemical-treated group was determined as the increase in the BrdU incorporation relative to the concurrent vehicle control group. An SI of 2 was set as the cut-off value for exhibiting skin sensitization activity. The results obtained in the experiments conducted for all 10 chemicals were sufficiently consistent with small variations in their SI values. The sensitivity, specificity, and accuracy of LLNA:BrdU-ELISA against those of GPMT/BT were 7/7 (100%), 3/3 (100%), and 10/10 (100%), respectively. Copyright © 2010 John Wiley & Sons, Ltd.

Factors Affecting Microcuttings of Stevia Using a Mist-Chamber Propagation Box

PubMed Central

Osman, Mohamad; Samsudin, Nur Syamimi; Faruq, Golam

2013-01-01

Stevia rebaudiana Bertoni is a member of Compositae family. Stevia plant has zero calorie content and its leaves are estimated to be 300 times sweeter than sugar. This plant is believed to be the most ideal substitute for sugar and important to assist in medicinal value especially for diabetic patients. In this study, microcutting techniques using a mist-chamber propagation box were used as it was beneficial for propagation of Stevia and gave genetic uniformity to the plant. The effects of different treatments on root stimulation of Stevia in microcuttings technique were evaluated. Treatments studied were different sizes of shoot cuttings, plant growth regulators, lights, and shades. Data logger was used to record the mean value of humidity (>90% RH), light intensity (673–2045 lx), and temperature (28.6–30.1°C) inside the mist-chamber propagation box. From analysis of variance, there were significant differences between varieties and treatments in parameters studied (P < 0.05). For the size of shoot cuttings treatment, 6 nodes cuttings were observed to increase root number. As compared to control, shoot cuttings treated with indole butyric acid (IBA) had better performance regarding root length. Yellow light and 50% shade treatments showed higher root and leaf number and these conditions can be considered as crucial for potential propagation of Stevia. PMID:24470797

GPS-Free Localization Algorithm for Wireless Sensor Networks

PubMed Central

Wang, Lei; Xu, Qingzheng

2010-01-01

Localization is one of the most fundamental problems in wireless sensor networks, since the locations of the sensor nodes are critical to both network operations and most application level tasks. A GPS-free localization scheme for wireless sensor networks is presented in this paper. First, we develop a standardized clustering-based approach for the local coordinate system formation wherein a multiplication factor is introduced to regulate the number of master and slave nodes and the degree of connectivity among master nodes. Second, using homogeneous coordinates, we derive a transformation matrix between two Cartesian coordinate systems to efficiently merge them into a global coordinate system and effectively overcome the flip ambiguity problem. The algorithm operates asynchronously without a centralized controller; and does not require that the location of the sensors be known a priori. A set of parameter-setting guidelines for the proposed algorithm is derived based on a probability model and the energy requirements are also investigated. A simulation analysis on a specific numerical example is conducted to validate the mathematical analytical results. We also compare the performance of the proposed algorithm under a variety multiplication factor, node density and node communication radius scenario. Experiments show that our algorithm outperforms existing mechanisms in terms of accuracy and convergence time. PMID:22219694

A characterization of linearly repetitive cut and project sets

NASA Astrophysics Data System (ADS)

Haynes, Alan; Koivusalo, Henna; Walton, James

2018-02-01

For the development of a mathematical theory which can be used to rigorously investigate physical properties of quasicrystals, it is necessary to understand regularity of patterns in special classes of aperiodic point sets in Euclidean space. In one dimension, prototypical mathematical models for quasicrystals are provided by Sturmian sequences and by point sets generated by substitution rules. Regularity properties of such sets are well understood, thanks mostly to well known results by Morse and Hedlund, and physicists have used this understanding to study one dimensional random Schrödinger operators and lattice gas models. A key fact which plays an important role in these problems is the existence of a subadditive ergodic theorem, which is guaranteed when the corresponding point set is linearly repetitive. In this paper we extend the one-dimensional model to cut and project sets, which generalize Sturmian sequences in higher dimensions, and which are frequently used in mathematical and physical literature as models for higher dimensional quasicrystals. By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with cubical windows. We also prove that these are precisely the collection of such sets which satisfy subadditive ergodic theorems. The results are explicit enough to allow us to apply them to known classical models, and to construct linearly repetitive cut and project sets in all pairs of dimensions and codimensions in which they exist. Research supported by EPSRC grants EP/L001462, EP/J00149X, EP/M023540. HK also gratefully acknowledges the support of the Osk. Huttunen foundation.

An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network.

PubMed

Liu, Jing; Huang, Kaiyu; Zhang, Guoxian

2017-04-20

We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is proposed to exploit the computational and communication capabilities of the sensor nodes. In contrast to the conventional distributed compressed sensing algorithms adopting a random sensing matrix, the proposed algorithm focuses on the deterministic sensing matrices built directly on the real acquisition systems. The proposed DCSMP algorithm can be divided into two independent parts, the common and innovation support set estimation processes. The goal of the common support set estimation process is to obtain an estimated common support set by fusing the candidate support set information from an individual node and its neighboring nodes. In the following innovation support set estimation process, the measurement vector is projected into a subspace that is perpendicular to the subspace spanned by the columns indexed by the estimated common support set, to remove the impact of the estimated common support set. We can then search the innovation support set using an orthogonal matching pursuit (OMP) algorithm based on the projected measurement vector and projected sensing matrix. In the proposed DCSMP algorithm, the process of estimating the common component/support set is decoupled with that of estimating the innovation component/support set. Thus, the inaccurately estimated common support set will have no impact on estimating the innovation support set. It is proven that under the condition the estimated common support set contains the true common support set, the proposed algorithm can find the true innovation set correctly. Moreover, since the innovation support set estimation process is independent of the common support set estimation process, there is no requirement for the cardinality of both sets; thus, the proposed DCSMP algorithm is capable of tackling the unknown sparsity problem successfully.

Extending the granularity of representation and control for the MIL-STD CAIS 1.0 node model

NASA Technical Reports Server (NTRS)

Rogers, Kathy L.

1986-01-01

The Common APSE (Ada 1 Program Support Environment) Interface Set (CAIS) (DoD85) node model provides an excellent baseline for interfaces in a single-host development environment. To encompass the entire spectrum of computing, however, the CAIS model should be extended in four areas. It should provide the interface between the engineering workstation and the host system throughout the entire lifecycle of the system. It should provide a basis for communication and integration functions needed by distributed host environments. It should provide common interfaces for communications mechanisms to and among target processors. It should provide facilities for integration, validation, and verification of test beds extending to distributed systems on geographically separate processors with heterogeneous instruction set architectures (ISAS). Additions to the PROCESS NODE model to extend the CAIS into these four areas are proposed.

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks

PubMed Central

Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Li, Baoqing; Yuan, Xiaobing

2017-01-01

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum–minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms. PMID:28753962

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.

Implementation of Steiner point of fuzzy set.

PubMed

Liang, Jiuzhen; Wang, Dejiang

2014-01-01

This paper deals with the implementation of Steiner point of fuzzy set. Some definitions and properties of Steiner point are investigated and extended to fuzzy set. This paper focuses on establishing efficient methods to compute Steiner point of fuzzy set. Two strategies of computing Steiner point of fuzzy set are proposed. One is called linear combination of Steiner points computed by a series of crisp α-cut sets of the fuzzy set. The other is an approximate method, which is trying to find the optimal α-cut set approaching the fuzzy set. Stability analysis of Steiner point of fuzzy set is also studied. Some experiments on image processing are given, in which the two methods are applied for implementing Steiner point of fuzzy image, and both strategies show their own advantages in computing Steiner point of fuzzy set.

Networks, Netwar, and Information-Age Terrorism

DTIC Science & Technology

1999-01-01

intermediate nodes. • The star, hub, or wheel network, as in a franchise or a cartel structure where a set of actors is tied to a central node or actor...Aviv and Jerusalem. On March 21, a Hamas satchel bomb exploded at a Tel Aviv cafe , killing three persons and injuring 48; on July 30, two Hamas

Indentations and Starting Points in Traveling Sales Tour Problems: Implications for Theory

ERIC Educational Resources Information Center

MacGregor, James N.

2012-01-01

A complete, non-trivial, traveling sales tour problem contains at least one "indentation", where nodes in the interior of the point set are connected between two adjacent nodes on the boundary. Early research reported that human tours exhibited fewer such indentations than expected. A subsequent explanation proposed that this was because…

Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypically broad spectrum of network topologies. Such dynamical outputs are highly designable, much like certain protein structures can be designed by an unusually broad spectrum of sequences. The network topologies that encode a highly designable dynamical phenotype possess two classes of connections: a fully conserved core of dedicated connections that encodes the stable dynamical phenotype and a partially conserved set of variable connections that controls the transient dynamical flow. By comparing the topologies and dynamics of the three- and four-node network ensembles, we observe a large number of instances of the phenomenon of "mutational buffering," whereby addition of a fourth node suppresses phenotypic variation amongst a set of three-node networks.

Risk factors and the preoperative assessment of right para-oesophageal lymph node metastasis in right lobe papillary thyroid carcinoma: A case series.

PubMed

Qu, You; Zhang, Hao; Zhang, Ping; Dong, Wenwu; He, Liang; Sun, Wei; Liu, Jinhao

2017-06-01

Right para-oesophageal lymph nodes (RPELN) are included among the right central compartment lymph nodes (rCLN) and located behind right recurrent laryngeal nerve (rRLN). However, due to the likelihood of increasing postoperative complications, and the extremely difficulties of RPELN dissection, the decision to perform RPELN dissection remains controversial. The aim of this study was to explore the risk factors of RPELN metastasis and evaluate RPELN metastasis by preoperative examination. We reviewed the medical records of 163 consecutive papillary thyroid carcinoma (PTC) patients (125 females and 38 males) who underwent right lobe plus isthmic resection (91 patients) or total thyroidectomy (72 patients) with right or bilateral central compartment lymph node dissection. The RPELN dissections were performed in all patients and were individually dissected and recorded intraoperatively. All patients underwent thyroid ultrasound and enhanced neck computed tomography (CT) routinely during preoperative examination. RPELN metastasis was detected in 20 patients (12.3%), among whom 6 (3.7%) had RPELN metastasis without rCLN metastasis. Total rCLN metastasis and lateral compartment lymph node metastasis were confirmed in 57 (35.0%) and 24 (14.7%) patients, respectively. The tumour diameter, number of metastatic rCLN and lateral compartment lymph nodes, RPELN visible on CT, and enhanced CT value of RPELN were confirmed significantly associated with RPELN metastasis by univariate analysis (P < 0.05). The area under the ROC curve of CT values was 0.77 (95% CI, 0.59-0.95; P = 0.003). The CT value of 132.0 was used as the cut-off point, and the specificity and sensitivity were 84.1% and 71.4%, respectively. PTC patients with a large tumour (>1 cm) in the right lobe or suspected rCLN metastasis were recommended to undergo prophylactic RPELN dissection, particularly in those with a high enhanced CT value (>132) of RPELN or those with the copresence of lateral compartment lymph node metastasis. Copyright © 2017 IJS Publishing Group Ltd. Published by Elsevier Ltd. All rights reserved.

Exact analytical solution of irreversible binary dynamics on networks.

PubMed

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

2018-03-01

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

Exact analytical solution of irreversible binary dynamics on networks

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

A collaborative comparison of objective structured clinical examination (OSCE) standard setting methods at Australian medical schools.

PubMed

Malau-Aduli, Bunmi Sherifat; Teague, Peta-Ann; D'Souza, Karen; Heal, Clare; Turner, Richard; Garne, David L; van der Vleuten, Cees

2017-12-01

A key issue underpinning the usefulness of the OSCE assessment to medical education is standard setting, but the majority of standard-setting methods remain challenging for performance assessment because they produce varying passing marks. Several studies have compared standard-setting methods; however, most of these studies are limited by their experimental scope, or use data on examinee performance at a single OSCE station or from a single medical school. This collaborative study between 10 Australian medical schools investigated the effect of standard-setting methods on OSCE cut scores and failure rates. This research used 5256 examinee scores from seven shared OSCE stations to calculate cut scores and failure rates using two different compromise standard-setting methods, namely the Borderline Regression and Cohen's methods. The results of this study indicate that Cohen's method yields similar outcomes to the Borderline Regression method, particularly for large examinee cohort sizes. However, with lower examinee numbers on a station, the Borderline Regression method resulted in higher cut scores and larger difference margins in the failure rates. Cohen's method yields similar outcomes as the Borderline Regression method and its application for benchmarking purposes and in resource-limited settings is justifiable, particularly with large examinee numbers.

SU-E-T-628: A Cloud Computing Based Multi-Objective Optimization Method for Inverse Treatment Planning.

PubMed

Na, Y; Suh, T; Xing, L

2012-06-01

Multi-objective (MO) plan optimization entails generation of an enormous number of IMRT or VMAT plans constituting the Pareto surface, which presents a computationally challenging task. The purpose of this work is to overcome the hurdle by developing an efficient MO method using emerging cloud computing platform. As a backbone of cloud computing for optimizing inverse treatment planning, Amazon Elastic Compute Cloud with a master node (17.1 GB memory, 2 virtual cores, 420 GB instance storage, 64-bit platform) is used. The master node is able to scale seamlessly a number of working group instances, called workers, based on the user-defined setting account for MO functions in clinical setting. Each worker solved the objective function with an efficient sparse decomposition method. The workers are automatically terminated if there are finished tasks. The optimized plans are archived to the master node to generate the Pareto solution set. Three clinical cases have been planned using the developed MO IMRT and VMAT planning tools to demonstrate the advantages of the proposed method. The target dose coverage and critical structure sparing of plans are comparable obtained using the cloud computing platform are identical to that obtained using desktop PC (Intel Xeon® CPU 2.33GHz, 8GB memory). It is found that the MO planning speeds up the processing of obtaining the Pareto set substantially for both types of plans. The speedup scales approximately linearly with the number of nodes used for computing. With the use of N nodes, the computational time is reduced by the fitting model, 0.2+2.3/N, with r̂2>0.99, on average of the cases making real-time MO planning possible. A cloud computing infrastructure is developed for MO optimization. The algorithm substantially improves the speed of inverse plan optimization. The platform is valuable for both MO planning and future off- or on-line adaptive re-planning. © 2012 American Association of Physicists in Medicine.

LEGION: Lightweight Expandable Group of Independently Operating Nodes

NASA Technical Reports Server (NTRS)

Burl, Michael C.

2012-01-01

LEGION is a lightweight C-language software library that enables distributed asynchronous data processing with a loosely coupled set of compute nodes. Loosely coupled means that a node can offer itself in service to a larger task at any time and can withdraw itself from service at any time, provided it is not actively engaged in an assignment. The main program, i.e., the one attempting to solve the larger task, does not need to know up front which nodes will be available, how many nodes will be available, or at what times the nodes will be available, which is normally the case in a "volunteer computing" framework. The LEGION software accomplishes its goals by providing message-based, inter-process communication similar to MPI (message passing interface), but without the tight coupling requirements. The software is lightweight and easy to install as it is written in standard C with no exotic library dependencies. LEGION has been demonstrated in a challenging planetary science application in which a machine learning system is used in closed-loop fashion to efficiently explore the input parameter space of a complex numerical simulation. The machine learning system decides which jobs to run through the simulator; then, through LEGION calls, the system farms those jobs out to a collection of compute nodes, retrieves the job results as they become available, and updates a predictive model of how the simulator maps inputs to outputs. The machine learning system decides which new set of jobs would be most informative to run given the results so far; this basic loop is repeated until sufficient insight into the physical system modeled by the simulator is obtained.

Analyzing the effect of cutting parameters on surface roughness and tool wear when machining nickel based hastelloy - 276

NASA Astrophysics Data System (ADS)

Khidhir, Basim A.; Mohamed, Bashir

2011-02-01

Machining parameters has an important factor on tool wear and surface finish, for that the manufacturers need to obtain optimal operating parameters with a minimum set of experiments as well as minimizing the simulations in order to reduce machining set up costs. The cutting speed is one of the most important cutting parameter to evaluate, it clearly most influences on one hand, tool life, tool stability, and cutting process quality, and on the other hand controls production flow. Due to more demanding manufacturing systems, the requirements for reliable technological information have increased. For a reliable analysis in cutting, the cutting zone (tip insert-workpiece-chip system) as the mechanics of cutting in this area are very complicated, the chip is formed in the shear plane (entrance the shear zone) and is shape in the sliding plane. The temperature contributed in the primary shear, chamfer and sticking, sliding zones are expressed as a function of unknown shear angle on the rake face and temperature modified flow stress in each zone. The experiments were carried out on a CNC lathe and surface finish and tool tip wear are measured in process. Machining experiments are conducted. Reasonable agreement is observed under turning with high depth of cut. Results of this research help to guide the design of new cutting tool materials and the studies on evaluation of machining parameters to further advance the productivity of nickel based alloy Hastelloy - 276 machining.

7 CFR 28.908 - Samples.

Code of Federal Regulations, 2011 CFR

2011-01-01

.... (1) Each cut sample shall be drawn from the bale after it is tied out following the ginning process.... (2) Where it is necessary to draw two sets of samples, a single cut should be made in each side of the bale, and the portion of cotton removed from each cut should be broken in half across the layers...

An improved network model for railway traffic

NASA Astrophysics Data System (ADS)

Li, Keping; Ma, Xin; Shao, Fubo

In railway traffic, safety analysis is a key issue for controlling train operation. Here, the identification and order of key factors are very important. In this paper, a new network model is constructed for analyzing the railway safety, in which nodes are regarded as causation factors and links represent possible relationships among those factors. Our aim is to give all these nodes an importance order, and to find the in-depth relationship among these nodes including how failures spread among them. Based on the constructed network model, we propose a control method to ensure the safe state by setting each node a threshold. As the results, by protecting the Hub node of the constructed network, the spreading of railway accident can be controlled well. The efficiency of such a method is further tested with the help of numerical example.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

PubMed

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

Graphical Methods for Reducing, Visualizing and Analyzing Large Data Sets Using Hierarchical Terminologies

PubMed Central

Jing, Xia; Cimino, James J.

2011-01-01

Objective: To explore new graphical methods for reducing and analyzing large data sets in which the data are coded with a hierarchical terminology. Methods: We use a hierarchical terminology to organize a data set and display it in a graph. We reduce the size and complexity of the data set by considering the terminological structure and the data set itself (using a variety of thresholds) as well as contributions of child level nodes to parent level nodes. Results: We found that our methods can reduce large data sets to manageable size and highlight the differences among graphs. The thresholds used as filters to reduce the data set can be used alone or in combination. We applied our methods to two data sets containing information about how nurses and physicians query online knowledge resources. The reduced graphs make the differences between the two groups readily apparent. Conclusions: This is a new approach to reduce size and complexity of large data sets and to simplify visualization. This approach can be applied to any data sets that are coded with hierarchical terminologies. PMID:22195119

Fractal and multifractal analyses of bipartite networks

NASA Astrophysics Data System (ADS)

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-03-01

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

Fractal and multifractal analyses of bipartite networks.

PubMed

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-03-31

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

Clustering network layers with the strata multilayer stochastic block model.

PubMed

Stanley, Natalie; Shai, Saray; Taylor, Dane; Mucha, Peter J

2016-01-01

Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the "strata multilayer stochastic block model" (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called "strata", which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project.

Fractal and multifractal analyses of bipartite networks

PubMed Central

Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

2017-01-01

Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions. PMID:28361962

Clustering network layers with the strata multilayer stochastic block model

PubMed Central

Stanley, Natalie; Shai, Saray; Taylor, Dane; Mucha, Peter J.

2016-01-01

Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the “strata multilayer stochastic block model” (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called “strata”, which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project. PMID:28435844

The robustness of multiplex networks under layer node-based attack

PubMed Central

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-01-01

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology. PMID:27075870

The robustness of multiplex networks under layer node-based attack.

PubMed

Zhao, Da-wei; Wang, Lian-hai; Zhi, Yong-feng; Zhang, Jun; Wang, Zhen

2016-04-14

From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology.

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.

Murine chronic lymph node window for longitudinal intravital lymph node imaging.

PubMed

Meijer, Eelco F J; Jeong, Han-Sin; Pereira, Ethel R; Ruggieri, Thomas A; Blatter, Cedric; Vakoc, Benjamin J; Padera, Timothy P

2017-08-01

Chronic imaging windows in mice have been developed to allow intravital microscopy of many different organs and have proven to be of paramount importance in advancing our knowledge of normal and disease processes. A model system that allows long-term intravital imaging of lymph nodes would facilitate the study of cell behavior in lymph nodes during the generation of immune responses in a variety of disease settings and during the formation of metastatic lesions in cancer-bearing mice. We describe a chronic lymph node window (CLNW) surgical preparation that allows intravital imaging of the inguinal lymph node in mice. The CLNW is custom-made from titanium and incorporates a standard coverslip. It allows stable longitudinal imaging without the need for serial surgeries while preserving lymph node blood and lymph flow. We also describe how to build and use an imaging stage specifically designed for the CLNW to prevent (large) rotational changes as well as respiratory movement during imaging. The entire procedure takes approximately half an hour per mouse, and subsequently allows for longitudinal intravital imaging of the murine lymph node and surrounding structures for up to 14 d. Small-animal surgery experience is required to successfully carry out the protocol.

Preliminary study on the diagnostic value of single-source dual-energy CT in diagnosing cervical lymph node metastasis of thyroid carcinoma

PubMed Central

Zhao, Yanfeng; Li, Xiaolu; Wang, Xiaoyi; Lin, Meng; Zhao, Xinming; Luo, Dehong; Li, Jianying

2017-01-01

Background To investigate the value of single-source dual-energy spectral CT imaging in improving the accuracy of preoperative diagnosis of lymph node metastasis of thyroid carcinoma. Methods Thirty-four thyroid carcinoma patients were enrolled and received spectral CT scanning before thyroidectomy and cervical lymph node dissection surgery. Iodine-based material decomposition (MD) images and 101 sets of monochromatic images from 40 to 140 keV were reconstructed after CT scans. The iodine concentrations (IC) of lymph nodes were measured on the MD images and was normalized to that of common carotid artery to obtain the normalized iodine concentration (NIC). The CT number of lymph nodes as function of photon energy was measured on the 101 sets of images to generate a spectral HU curve and to calculate its slope λHU. The measurements between the metastatic and non-metastatic lymph nodes were statistically compared and receiver operating characteristic (ROC) curves were used to determine the optimal thresholds of these measurements for diagnosing lymph nodes metastasis. Results There were 136 lymph nodes that were pathologically confirmed. Among them, 102 (75%) were metastatic and 34 (25%) were non-metastatic. The IC, NIC and the slope λHU of the metastatic lymph nodes were 3.93±1.58 mg/mL, 0.70±0.55 and 4.63±1.91, respectively. These values were statistically higher than the respective values of 1.77±0.71 mg/mL, 0.29±0.16 and 2.19±0.91 for the non-metastatic lymph nodes (all P<0.001). ROC analysis determined the optimal diagnostic threshold for IC as 2.56 mg/mL, with the sensitivity, specificity and accuracy of 83.3%, 91.2% and 85.3%, respectively. The optimal threshold for NIC was 0.289, with the sensitivity, specificity and accuracy of 96.1%, 76.5% and 91.2%, respectively. The optimal threshold for the spectral curve slope λHU was 2.692, with the sensitivity, specificity and accuracy of 88.2%, 82.4% and 86.8%, respectively. Conclusions The measurements obtained in dual-energy spectral CT improve the sensitivity and accuracy for preoperatively diagnosing lymph node metastasis in thyroid carcinoma. PMID:29268547

Rapid identifying high-influence nodes in complex networks

NASA Astrophysics Data System (ADS)

Song, Bo; Jiang, Guo-Ping; Song, Yu-Rong; Xia, Ling-Ling

2015-10-01

A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method (RIM) to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered (SIR) model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness, and eigenvector centrality methods. Project supported by the National Natural Science Foundation of China (Grant Nos. 61374180 and 61373136), the Ministry of Education Research in the Humanities and Social Sciences Planning Fund Project, China (Grant No. 12YJAZH120), and the Six Projects Sponsoring Talent Summits of Jiangsu Province, China (Grant No. RLD201212).

Synchronous Parallel Emulation and Discrete Event Simulation System with Self-Contained Simulation Objects and Active Event Objects

NASA Technical Reports Server (NTRS)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.

Improvement to visualization of nodes in breast cancer patients following audit: are we seeing the problem?

PubMed

Paterson, Carolyn L; Hendry, Fraser R; Bolster, Alison A

2018-06-01

Successful localization of nodes in breast cancer patients depends upon the effectiveness of the lymphoscintigraphy technique employed. A benefit of performing imaging as part of this procedure is that it allows sites to audit their technique. An audit of breast cancer patients at the Glasgow Royal Infirmary (GRI) hospital showed nodes to be visualized in only 81% of patients. Current guidelines state that nodes should be seen in more than 95% of patients. A period of investigation and review led to changes being made to the injection and imaging technique employed at the GRI site. Following these changes a re-audit was performed that showed that the node visualization rate has successfully been increased to 97%, thereby meeting the standards set in the guidelines. This technical note details the results of the initial audit and re-audit, and explains the investigation and changes made to clinical procedures at the GRI site to improve the node visualization rate. The challenges that can occur when performing breast sentinel node procedures are also discussed.

Proactive schema based link lifetime estimation and connectivity ratio.

PubMed

Bachir, Bouamoud; Ali, Ouacha; Ahmed, Habbani; Mohamed, Elkoutbi

2014-01-01

The radio link between a pair of wireless nodes is affected by a set of random factors such as transmission range, node mobility, and environment conditions. The properties of such radio links are continually experienced when nodes status balances between being reachable and being unreachable; thereby on completion of each experience the statistical distribution of link lifetime is updated. This aspect is emphasized in mobile ad hoc network especially when it is deployed in some fields that require intelligent processing of data information such as aerospace domain.

3D segmentation of lung CT data with graph-cuts: analysis of parameter sensitivities

NASA Astrophysics Data System (ADS)

Cha, Jung won; Dunlap, Neal; Wang, Brian; Amini, Amir

2016-03-01

Lung boundary image segmentation is important for many tasks including for example in development of radiation treatment plans for subjects with thoracic malignancies. In this paper, we describe a method and parameter settings for accurate 3D lung boundary segmentation based on graph-cuts from X-ray CT data1. Even though previously several researchers have used graph-cuts for image segmentation, to date, no systematic studies have been performed regarding the range of parameter that give accurate results. The energy function in the graph-cuts algorithm requires 3 suitable parameter settings: K, a large constant for assigning seed points, c, the similarity coefficient for n-links, and λ, the terminal coefficient for t-links. We analyzed the parameter sensitivity with four lung data sets from subjects with lung cancer using error metrics. Large values of K created artifacts on segmented images, and relatively much larger value of c than the value of λ influenced the balance between the boundary term and the data term in the energy function, leading to unacceptable segmentation results. For a range of parameter settings, we performed 3D image segmentation, and in each case compared the results with the expert-delineated lung boundaries. We used simple 6-neighborhood systems for n-link in 3D. The 3D image segmentation took 10 minutes for a 512x512x118 ~ 512x512x190 lung CT image volume. Our results indicate that the graph-cuts algorithm was more sensitive to the K and λ parameter settings than to the C parameter and furthermore that amongst the range of parameters tested, K=5 and λ=0.5 yielded good results.

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

PubMed Central

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

2014-01-01

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

Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability.

PubMed

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

2018-02-01

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

Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment

PubMed Central

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment. PMID:22163678

IEEE-802.15.4-based low-power body sensor node with RF energy harvester.

PubMed

Tran, Thang Viet; Chung, Wan-Young

2014-01-01

This paper proposes the design and implementation of a low-voltage and low-power body sensor node based on the IEEE 802.15.4 standard to collect electrocardiography (ECG) and photoplethysmography (PPG) signals. To achieve compact size, low supply voltage, and low power consumption, the proposed platform is integrated into a ZigBee mote, which contains a DC-DC booster, a PPG sensor interface module, and an ECG front-end circuit that has ultra-low current consumption. The input voltage of the proposed node is very low and has a wide range, from 0.65 V to 3.3 V. An RF energy harvester is also designed to charge the battery during the working mode or standby mode of the node. The power consumption of the proposed node reaches 14 mW in working mode to prolong the battery lifetime. The software is supported by the nesC language under the TinyOS environment, which enables the proposed node to be easily configured to function as an individual health monitoring node or a node in a wireless body sensor network (BSN). The proposed node is used to set up a wireless BSN that can simultaneously collect ECG and PPG signals and monitor the results on the personal computer.

Automated construction of node software using attributes in a ubiquitous sensor network environment.

PubMed

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric-the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.

A trust evaluation algorithm for wireless sensor networks based on node behaviors and D-S evidence theory.

PubMed

Feng, Renjian; Xu, Xiaofeng; Zhou, Xiang; Wan, Jiangwen

2011-01-01

For wireless sensor networks (WSNs), many factors, such as mutual interference of wireless links, battlefield applications and nodes exposed to the environment without good physical protection, result in the sensor nodes being more vulnerable to be attacked and compromised. In order to address this network security problem, a novel trust evaluation algorithm defined as NBBTE (Node Behavioral Strategies Banding Belief Theory of the Trust Evaluation Algorithm) is proposed, which integrates the approach of nodes behavioral strategies and modified evidence theory. According to the behaviors of sensor nodes, a variety of trust factors and coefficients related to the network application are established to obtain direct and indirect trust values through calculating weighted average of trust factors. Meanwhile, the fuzzy set method is applied to form the basic input vector of evidence. On this basis, the evidence difference is calculated between the indirect and direct trust values, which link the revised D-S evidence combination rule to finally synthesize integrated trust value of nodes. The simulation results show that NBBTE can effectively identify malicious nodes and reflects the characteristic of trust value that 'hard to acquire and easy to lose'. Furthermore, it is obvious that the proposed scheme has an outstanding advantage in terms of illustrating the real contribution of different nodes to trust evaluation.

Anomalous DC Hall response in noncentrosymmetric tilted Weyl semimetals

NASA Astrophysics Data System (ADS)

Mukherjee, S. P.; Carbotte, J. P.

2018-03-01

Weyl nodes come in pairs of opposite chirality. For broken time reversal symmetry (TR) they are displaced in momentum space by {Q} and the anomalous DC Hall conductivity σxy is proportional to {Q} at charge neutrality. For finite doping there are additive corrections to σxy which depend on the chemical potential as well as on the tilt (C ) of the Dirac cones and on their relative orientation. If inversion symmetry (I) is also broken the Weyl nodes are shifted in energy by an amount Q0 . This introduces further changes in σxy and we provide simple analytic formulas for these modifications for both type I (C<1 ) and type II (C>1 , overtilted) Weyl. For type I when the Weyl nodes have equal magnitude but oppositely directed tilts, the correction to σxy is proportional to the chemical potential μ and completely independent of the energy shift Q0 . When instead the tilts are parallel, the correction is linear in Q0 and μ drops out. For type II the corrections involve both μ and Q0 , are nonlinear and also involve a momentum cut off. We discuss the implied changes to the Nernst coefficient and to the thermal Hall effect of a finite Q0 .

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.

Optical Circuit Switched Protocol

NASA Technical Reports Server (NTRS)

Monacos, Steve P. (Inventor)

2000-01-01

The present invention is a system and method embodied in an optical circuit switched protocol for the transmission of data through a network. The optical circuit switched protocol is an all-optical circuit switched network and includes novel optical switching nodes for transmitting optical data packets within a network. Each optical switching node comprises a detector for receiving the header, header detection logic for translating the header into routing information and eliminating the header, and a controller for receiving the routing information and configuring an all optical path within the node. The all optical path located within the node is solely an optical path without having electronic storage of the data and without having optical delay of the data. Since electronic storage of the header is not necessary and the initial header is eliminated by the first detector of the first switching node. multiple identical headers are sent throughout the network so that subsequent switching nodes can receive and read the header for setting up an optical data path.

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.

Riemannian and Lorentzian flow-cut theorems

NASA Astrophysics Data System (ADS)

Headrick, Matthew; Hubeny, Veronika E.

2018-05-01

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut (MFMC) theorem for boundary regions, applied recently to develop a ‘bit-thread’ interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous MFMC theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field with norm at least 1. This theorem includes as a special case a continuum version of Dilworth’s theorem from the theory of partially ordered sets. We include a brief review of the necessary tools from the theory of convex optimization, in particular Lagrangian duality and convex relaxation.

Large scale cardiac modeling on the Blue Gene supercomputer.

PubMed

Reumann, Matthias; Fitch, Blake G; Rayshubskiy, Aleksandr; Keller, David U; Weiss, Daniel L; Seemann, Gunnar; Dössel, Olaf; Pitman, Michael C; Rice, John J

2008-01-01

Multi-scale, multi-physical heart models have not yet been able to include a high degree of accuracy and resolution with respect to model detail and spatial resolution due to computational limitations of current systems. We propose a framework to compute large scale cardiac models. Decomposition of anatomical data in segments to be distributed on a parallel computer is carried out by optimal recursive bisection (ORB). The algorithm takes into account a computational load parameter which has to be adjusted according to the cell models used. The diffusion term is realized by the monodomain equations. The anatomical data-set was given by both ventricles of the Visible Female data-set in a 0.2 mm resolution. Heterogeneous anisotropy was included in the computation. Model weights as input for the decomposition and load balancing were set to (a) 1 for tissue and 0 for non-tissue elements; (b) 10 for tissue and 1 for non-tissue elements. Scaling results for 512, 1024, 2048, 4096 and 8192 computational nodes were obtained for 10 ms simulation time. The simulations were carried out on an IBM Blue Gene/L parallel computer. A 1 s simulation was then carried out on 2048 nodes for the optimal model load. Load balances did not differ significantly across computational nodes even if the number of data elements distributed to each node differed greatly. Since the ORB algorithm did not take into account computational load due to communication cycles, the speedup is close to optimal for the computation time but not optimal overall due to the communication overhead. However, the simulation times were reduced form 87 minutes on 512 to 11 minutes on 8192 nodes. This work demonstrates that it is possible to run simulations of the presented detailed cardiac model within hours for the simulation of a heart beat.

International Lunar Network (ILN) Anchor Nodes

NASA Technical Reports Server (NTRS)

Cohen, Barbara A.

2009-01-01

This slide presentation reviews the United States' contribution to the International Lunar Network (ILN) project, the Anchor Nodes project. The ILN is an initiative of 9 national space agencies to establish a set of robotic geophysical monitoring stations on the surface of the Moon. The project is aimed at furthering the understanding of the lunar composition, and interior structure.

Hermite-Birkhoff interpolation in the nth roots of unity

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

Cavaretta, A.S. Jr.; Sharma, A.; Varga, R.S.

1980-06-01

Consider, as nodes for polynomial interpolation, the nth roots of unity. For a sufficiently smooth function f(z), we require a polynomial p(z) to interpolate f and certain of its derivatives at each node. It is shown that the so-called Polya conditions, which are necessary for unique interpolation, are in this setting also sufficient.

Optimal stabilization of Boolean networks through collective influence

NASA Astrophysics Data System (ADS)

Wang, Jiannan; Pei, Sen; Wei, Wei; Feng, Xiangnan; Zheng, Zhiming

2018-03-01

Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

Natural regeneration of Douglas-fir and associated species using modified clear-cutting systems in the Oregon Cascades.

Treesearch

Jerry F. Franklin

1963-01-01

Clear cutting is the standard harvesting system in old-growth Douglas-fir (Pseudotsuga menziesii) forests in the Pacific Northwest. Usually these clear cuts are in "staggered settings" of 15 to 80 acres with the surrounding stand left uncut to provide seed and serve as a firebreak. However, satisfactory natural regeneration of Douglas-fir...

Cutting edge of endoscopic full-thickness resection for gastric tumor

PubMed Central

Maehata, Tadateru; Goto, Osamu; Takeuchi, Hiroya; Kitagawa, Yuko; Yahagi, Naohisa

2015-01-01

Recently, several studies have reported local full-thickness resection techniques using flexible endoscopy for gastric tumors, such as gastrointestinal stromal tumors, gastric carcinoid tumors, and early gastric cancer (EGC). These techniques have the advantage of allowing precise resection lines to be determined using intraluminal endoscopy. Thus, it is possible to minimize the resection area and subsequent deformity. Some of these methods include: (1) classical laparoscopic and endoscopic cooperative surgery (LECS); (2) inverted LECS; (3) combination of laparoscopic and endoscopic approaches to neoplasia with non-exposure technique; and (4) non-exposed endoscopic wall-inversion surgery. Furthermore, a recent prospective multicenter trial of the sentinel node navigation surgery (SNNS) for EGC has shown acceptable results in terms of sentinel node detection rate and the accuracy of nodal metastasis. Endoscopic full-thickness resection with SNNS is expected to become a treatment option that bridges the gap between endoscopic submucosal dissection and standard surgery for EGC. In the future, the indications for these procedures for gastric tumors could be expanded. PMID:26566427

Stereological Cell Morphometry In Right Atrium Myocardium Of Primates

NASA Astrophysics Data System (ADS)

Mandarim-De-Lacerda, Carlos A...; Hureau, Jacques

1986-07-01

The mechanism by which the cardiac impulse is propagated in normal hearts from its origin in the sinus node to the atrio-ventricular node has not been agreed on fully. We studied the "internodal posterior tract" through the crista terminalis by light microscopy and stereological morphometry. The hearts of 12 Papio cynocephalus were perfused , after sacrifice,with phosphate-buffered formol saline. The regions of the crista terminalis (CT), interatrial septum (IAS), atrioventricular bundle (AVB) and interventricular septum (IVS) were cut off and embedded in paraplast and sectioned (10 4m). The multipurpose test system M 42 was superimposed over the photomicrographs (1,890 points test, ESR = 2%) to the stereological computing. The quantitative results show that the cells from CT were more closely relationed with IAS cells than others cells (IVS and AVB cells). This results are not a morphological evidence to establish the specificity of the "internodal posterior tract". The cellular arrangement and anatomical variation in CT myocardium is very important.

Modelling high data rate communication network access protocol

NASA Technical Reports Server (NTRS)

Khanna, S.; Foudriat, E. C.; Paterra, Frank; Maly, Kurt J.; Overstreet, C. Michael

1990-01-01

Modeling of high data rate communication systems is different from the low data rate systems. Three simulations were built during the development phase of Carrier Sensed Multiple Access/Ring Network (CSMA/RN) modeling. The first was a model using SIMCRIPT based upon the determination and processing of each event at each node. The second simulation was developed in C based upon isolating the distinct object that can be identified as the ring, the message, the node, and the set of critical events. The third model further identified the basic network functionality by creating a single object, the node which includes the set of critical events which occur at the node. The ring structure is implicit in the node structure. This model was also built in C. Each model is discussed and their features compared. It should be stated that the language used was mainly selected by the model developer because of his past familiarity. Further the models were not built with the intent to compare either structure or language but because the complexity of the problem and initial results contained obvious errors, so alternative models were built to isolate, determine, and correct programming and modeling errors. The CSMA/RN protocol is discussed in sufficient detail to understand modeling complexities. Each model is described along with its features and problems. The models are compared and concluding observations and remarks are presented.

Contextual analysis of immunological response through whole-organ fluorescent imaging.

PubMed

Woodruff, Matthew C; Herndon, Caroline N; Heesters, B A; Carroll, Michael C

2013-09-01

As fluorescent microscopy has developed, significant insights have been gained into the establishment of immune response within secondary lymphoid organs, particularly in draining lymph nodes. While established techniques such as confocal imaging and intravital multi-photon microscopy have proven invaluable, they provide limited insight into the architectural and structural context in which these responses occur. To interrogate the role of the lymph node environment in immune response effectively, a new set of imaging tools taking into account broader architectural context must be implemented into emerging immunological questions. Using two different methods of whole-organ imaging, optical clearing and three-dimensional reconstruction of serially sectioned lymph nodes, fluorescent representations of whole lymph nodes can be acquired at cellular resolution. Using freely available post-processing tools, images of unlimited size and depth can be assembled into cohesive, contextual snapshots of immunological response. Through the implementation of robust iterative analysis techniques, these highly complex three-dimensional images can be objectified into sortable object data sets. These data can then be used to interrogate complex questions at the cellular level within the broader context of lymph node biology. By combining existing imaging technology with complex methods of sample preparation and capture, we have developed efficient systems for contextualizing immunological phenomena within lymphatic architecture. In combination with robust approaches to image analysis, these advances provide a path to integrating scientific understanding of basic lymphatic biology into the complex nature of immunological response.

Anchor Node Localization for Wireless Sensor Networks Using Video and Compass Information Fusion

PubMed Central

Pescaru, Dan; Curiac, Daniel-Ioan

2014-01-01

Distributed sensing, computing and communication capabilities of wireless sensor networks require, in most situations, an efficient node localization procedure. In the case of random deployments in harsh or hostile environments, a general localization process within global coordinates is based on a set of anchor nodes able to determine their own position using GPS receivers. In this paper we propose another anchor node localization technique that can be used when GPS devices cannot accomplish their mission or are considered to be too expensive. This novel technique is based on the fusion of video and compass data acquired by the anchor nodes and is especially suitable for video- or multimedia-based wireless sensor networks. For these types of wireless networks the presence of video cameras is intrinsic, while the presence of digital compasses is also required for identifying the cameras' orientations. PMID:24594614

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

NASA Technical Reports Server (NTRS)

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

1998-01-01

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

Parameterized centrality metric for network analysis

NASA Astrophysics Data System (ADS)

Ghosh, Rumi; Lerman, Kristina

2011-06-01

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [P. Bonacich, Am. J. Sociol.0002-960210.1086/228631 92, 1170 (1987)], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, for example, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network analysis, since it contains a tunable parameter that sets the length scale of interactions. Studying how rankings and discovered communities change when this parameter is varied allows us to identify locally and globally important nodes and structures. We apply the proposed metric to several benchmark networks and show that it leads to better insights into network structure than alternative metrics.

Magnetic sensor nodes for enhanced situational awareness in urban settings

NASA Astrophysics Data System (ADS)

Trammell, Hoke; Shelby, Richard; Mathis, Kevin; Dalichaouch, Yacine; Kumar, Sankaran

2005-05-01

Military forces conducting urban operations are in need of non-line-of-sight sensor technologies for enhanced situational awareness. Disposable sensors ought to be able to detect and track targets through walls and within rooms in a building and relay that information in real-time to the soldier. We have recently developed magnetic sensor nodes aimed towards low cost, small size, low power consumption, and wireless communication. The current design uses a three-axis thin-film magnetoresistive sensor for low bandwidth B-field monitoring of magnetic targets such as vehicles and weapons carried by personnel. These sensor nodes are battery operated and use IEEE 802.15.4 communication link for control and data transmission. Power consumption during signal acquisition and communication is approximately 300 mW per channel. We will present and discuss node array performance, future node development and sensor fusion concepts.

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.

On the mixing time of geographical threshold graphs

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

Bradonjic, Milan

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

Implementation of pattern generation algorithm in forming Gilmore and Gomory model for two dimensional cutting stock problem

NASA Astrophysics Data System (ADS)

Octarina, Sisca; Radiana, Mutia; Bangun, Putra B. J.

2018-01-01

Two dimensional cutting stock problem (CSP) is a problem in determining the cutting pattern from a set of stock with standard length and width to fulfill the demand of items. Cutting patterns were determined in order to minimize the usage of stock. This research implemented pattern generation algorithm to formulate Gilmore and Gomory model of two dimensional CSP. The constraints of Gilmore and Gomory model was performed to assure the strips which cut in the first stage will be used in the second stage. Branch and Cut method was used to obtain the optimal solution. Based on the results, it found many patterns combination, if the optimal cutting patterns which correspond to the first stage were combined with the second stage.

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

Node Deployment Algorithm Based on Connected Tree for Underwater Sensor Networks

PubMed Central

Jiang, Peng; Wang, Xingmin; Jiang, Lurong

2015-01-01

Designing an efficient deployment method to guarantee optimal monitoring quality is one of the key topics in underwater sensor networks. At present, a realistic approach of deployment involves adjusting the depths of nodes in water. One of the typical algorithms used in such process is the self-deployment depth adjustment algorithm (SDDA). This algorithm mainly focuses on maximizing network coverage by constantly adjusting node depths to reduce coverage overlaps between two neighboring nodes, and thus, achieves good performance. However, the connectivity performance of SDDA is irresolute. In this paper, we propose a depth adjustment algorithm based on connected tree (CTDA). In CTDA, the sink node is used as the first root node to start building a connected tree. Finally, the network can be organized as a forest to maintain network connectivity. Coverage overlaps between the parent node and the child node are then reduced within each sub-tree to optimize coverage. The hierarchical strategy is used to adjust the distance between the parent node and the child node to reduce node movement. Furthermore, the silent mode is adopted to reduce communication cost. Simulations show that compared with SDDA, CTDA can achieve high connectivity with various communication ranges and different numbers of nodes. Moreover, it can realize coverage as high as that of SDDA with various sensing ranges and numbers of nodes but with less energy consumption. Simulations under sparse environments show that the connectivity and energy consumption performances of CTDA are considerably better than those of SDDA. Meanwhile, the connectivity and coverage performances of CTDA are close to those depth adjustment algorithms base on connected dominating set (CDA), which is an algorithm similar to CTDA. However, the energy consumption of CTDA is less than that of CDA, particularly in sparse underwater environments. PMID:26184209

Racking Response of Reinforced Concrete Cut and Cover Tunnel

DOT National Transportation Integrated Search

2016-01-01

Currently, the knowledge base and quantitative data sets concerning cut and cover tunnel seismic response are scarce. In this report, a large-scale experimental program is conducted to assess: i) stiffness, capacity, and potential seismically-induced...

Method and system for assigning a confidence metric for automated determination of optic disc location

DOEpatents

Karnowski, Thomas P [Knoxville, TN; Tobin, Jr., Kenneth W.; Muthusamy Govindasamy, Vijaya Priya [Knoxville, TN; Chaum, Edward [Memphis, TN

2012-07-10

A method for assigning a confidence metric for automated determination of optic disc location that includes analyzing a retinal image and determining at least two sets of coordinates locating an optic disc in the retinal image. The sets of coordinates can be determined using first and second image analysis techniques that are different from one another. An accuracy parameter can be calculated and compared to a primary risk cut-off value. A high confidence level can be assigned to the retinal image if the accuracy parameter is less than the primary risk cut-off value and a low confidence level can be assigned to the retinal image if the accuracy parameter is greater than the primary risk cut-off value. The primary risk cut-off value being selected to represent an acceptable risk of misdiagnosis of a disease having retinal manifestations by the automated technique.

Derivation & validation of glycosylated haemoglobin (HbA1c) cut-off value as a diagnostic test for type 2 diabetes in south Indian population

PubMed Central

Mohan, Alladi; Reddy, S. Aparna; Sachan, Alok; Sarma, K.V.S.; Kumar, D. Prabath; Panchagnula, Mahesh V.; Rao, P.V.L.N. Srinivasa; Kumar, B. Siddhartha; Krishnaprasanthi, P.

2016-01-01

Background & Objectives: Glycosylated haemoglobin (HbA1c) has been in use for more than a decade, as a diagnostic test for type 2 diabetes. Validity of HbA1c needs to be established in the ethnic population in which it is intended to be used. The objective of this study was to derive and validate a HbA1c cut-off value for the diagnosis of type 2 diabetes in the ethnic population of Rayalaseema area of south India. Methods: In this cross-sectional study, consecutive patients suspected to have type 2 diabetes underwent fasting plasma glucose (FPG) and 2 h post-load plasma glucose (2 h-PG) measurements after a 75 g glucose load and HbA1c estimation. They were classified as having diabetes as per the American Diabetes Association criteria [(FPG ≥7 mmol/l (≥126 mg/dl) and/or 2 h-PG ≥11.1 mmol/l (≥200 mg/dl)]. In the training data set (n = 342), optimum cut-off value of HbA1c for defining type 2 diabetes was derived by receiver-operator characteristic (ROC) curve method using oral glucose tolerance test results as gold standard. This cut-off was validated in a validation data set (n = 341). Results: On applying HbA1c cut-off value of >6.3 per cent (45 mmol/mol) to the training data set, sensitivity, specificity, positive predictive value (PPV) and negative predictive value (NPV) for diagnosing type 2 diabetes were calculated to be 90.6, 85.2, 80.8 and 93.0 per cent, respectively. When the same cut-off value was applied to the validation data set, sensitivity, specificity, PPV and NPV were 88.8, 81.9, 74.0 and 92.7 per cent, respectively, although the latter were consistently smaller than the proportions for the training data set, the differences being not significant. Interpretation & conclusions: HbA1c >6.3 per cent (45 mmol/mol) appears to be the optimal cut-off value for the diagnosis of type 2 diabetes applicable to the ethnic population of Rayalaseema area of Andhra Pradesh state in south India. PMID:27934801

Intraoperative analysis of sentinel lymph nodes by imprint cytology for cancer of the breast.

PubMed

Shiver, Stephen A; Creager, Andrew J; Geisinger, Kim; Perrier, Nancy D; Shen, Perry; Levine, Edward A

2002-11-01

The utilization of lymphatic mapping techniques for breast carcinoma has made intraoperative evaluation of sentinel lymph nodes (SLN) attractive, because axillary lymph node dissection can be performed during the initial surgery if the SLN is positive. The optimal technique for rapid SLN assessment has not been determined. Both frozen sectioning and imprint cytology are used for rapid intraoperative SLN evaluation. A retrospective review of the intraoperative imprint cytology results of 133 SLN mapping procedures from 132 breast carcinoma patients was performed. SLN were evaluated intraoperatively by bisecting the lymph node and making imprints of each cut surface. Imprints were stained with hematoxylin and eosin (H&E) and Diff-Quik. Permanent sections were evaluated with up to four H&E stained levels and cytokeratin immunohistochemistry. Imprint cytology results were compared with final histologic results. Sensitivity and specificity of imprint cytology were 56% and 100%, respectively, producing a 100% positive predictive value and 88% negative predictive value. Imprint cytology was significantly more sensitive for macrometastasis than micrometastasis 87% versus 22% (P = 0.00007). Of 13 total false negatives, 11 were found to be due to sampling error and 2 due to errors in intraoperative interpretation. Both intraoperative interpretation errors involved a diagnosis of lobular breast carcinoma. The sensitivity and specificity of imprint cytology are similar to that of frozen section evaluation. Imprint cytology is therefore a viable alternative to frozen sectioning when intraoperative evaluation is required. If SLN micrometastasis is used to determine the need for further lymphadenectomy, more sensitive intraoperative methods will be needed to avoid a second operation.

Greater vertical spot spacing to improve femtosecond laser capsulotomy quality.

PubMed

Schultz, Tim; Joachim, Stephanie C; Noristani, Rozina; Scott, Wendell; Dick, H Burkhard

2017-03-01

To evaluate the effect of adapted capsulotomy laser settings on the cutting quality in femtosecond laser-assisted cataract surgery. Ruhr-University Eye Clinic, Bochum, Germany. Prospective randomized case series. Eyes were treated with 1 of 2 laser settings. In Group 1, the regular standard settings were used (incisional depth 600 μm, pulse energy 4 μJ, horizontal spot spacing 5 μm, vertical spot spacing 10 μm, treatment time 1.2 seconds). In Group 2, vertical spot spacing was increased to 15 μm and the treatment time was 1.0 seconds. Light microscopy was used to evaluate the cut quality of the capsule edge. The size and number of tags (misplaced laser spots, which form a second cut of the capsule with high tear risk) were evaluated in a blinded manner. Groups were compared using the Mann-Whitney U test. The study comprised 100 eyes (50 eyes in each group). Cataract surgery was successfully completed in all eyes, and no anterior capsule tear occurred during the treatment. Histologically, significant fewer tags were observed with the new capsulotomy laser setting. The mean score for the number and size of free tags was significantly lower in this group than with the standard settings (P < .001). The new laser settings improved cut quality and reduced the number of tags. The modification has the potential to reduce the risk for radial capsule tears in femtosecond laser-assisted cataract surgery. With the new settings, no tags and no capsule tears were observed under the operating microscope in any eye. Copyright © 2017 ASCRS and ESCRS. Published by Elsevier Inc. All rights reserved.

The alarming problems of confounding equivalence using logistic regression models in the perspective of causal diagrams.

PubMed

Yu, Yuanyuan; Li, Hongkai; Sun, Xiaoru; Su, Ping; Wang, Tingting; Liu, Yi; Yuan, Zhongshang; Liu, Yanxun; Xue, Fuzhong

2017-12-28

Confounders can produce spurious associations between exposure and outcome in observational studies. For majority of epidemiologists, adjusting for confounders using logistic regression model is their habitual method, though it has some problems in accuracy and precision. It is, therefore, important to highlight the problems of logistic regression and search the alternative method. Four causal diagram models were defined to summarize confounding equivalence. Both theoretical proofs and simulation studies were performed to verify whether conditioning on different confounding equivalence sets had the same bias-reducing potential and then to select the optimum adjusting strategy, in which logistic regression model and inverse probability weighting based marginal structural model (IPW-based-MSM) were compared. The "do-calculus" was used to calculate the true causal effect of exposure on outcome, then the bias and standard error were used to evaluate the performances of different strategies. Adjusting for different sets of confounding equivalence, as judged by identical Markov boundaries, produced different bias-reducing potential in the logistic regression model. For the sets satisfied G-admissibility, adjusting for the set including all the confounders reduced the equivalent bias to the one containing the parent nodes of the outcome, while the bias after adjusting for the parent nodes of exposure was not equivalent to them. In addition, all causal effect estimations through logistic regression were biased, although the estimation after adjusting for the parent nodes of exposure was nearest to the true causal effect. However, conditioning on different confounding equivalence sets had the same bias-reducing potential under IPW-based-MSM. Compared with logistic regression, the IPW-based-MSM could obtain unbiased causal effect estimation when the adjusted confounders satisfied G-admissibility and the optimal strategy was to adjust for the parent nodes of outcome, which obtained the highest precision. All adjustment strategies through logistic regression were biased for causal effect estimation, while IPW-based-MSM could always obtain unbiased estimation when the adjusted set satisfied G-admissibility. Thus, IPW-based-MSM was recommended to adjust for confounders set.

Pheromone-based coordination strategy to static sensors on the ground and unmanned aerial vehicles carried sensors

NASA Astrophysics Data System (ADS)

Pignaton de Freitas, Edison; Heimfarth, Tales; Pereira, Carlos Eduardo; Morado Ferreira, Armando; Rech Wagner, Flávio; Larsson, Tony

2010-04-01

A current trend that is gaining strength in the wireless sensor network area is the use of heterogeneous sensor nodes in one coordinated overall network, needed to fulfill the requirements of sophisticated emerging applications, such as area surveillance systems. One of the main concerns when developing such sensor networks is how to provide coordination among the heterogeneous nodes, in order to enable them to efficiently respond the user needs. This study presents an investigation of strategies to coordinate a set of static sensor nodes on the ground cooperating with wirelessly connected Unmanned Aerial Vehicles (UAVs) carrying a variety of sensors, in order to provide efficient surveillance over an area of interest. The sensor nodes on the ground are set to issue alarms on the occurrence of a given event of interest, e.g. entrance of a non-authorized vehicle in the area, while the UAVs receive the issued alarms and have to decide which of them is the most suitable to handle the issued alarm. A bio-inspired coordination strategy based on the concept of pheromones is presented. As a complement of this strategy, a utility-based decision making approach is proposed.

Investigation of the Lack of Angiogenesis in the Formation of Lymph Node Metastases

PubMed Central

Jeong, Han-Sin; Jones, Dennis; Liao, Shan; Wattson, Daniel A.; Cui, Cheryl H.; Duda, Dan G.; Willett, Christopher G.; Jain, Rakesh K.

2015-01-01

Background: To date, antiangiogenic therapy has failed to improve overall survival in cancer patients when used in the adjuvant setting (local-regional disease with no detectable systemic metastasis). The presence of lymph node metastases worsens prognosis, however their reliance on angiogenesis for growth has not been reported. Methods: Here, we introduce a novel chronic lymph node window (CLNW) model to facilitate new discoveries in the growth and spread of lymph node metastases. We use the CLNW in multiple models of spontaneous lymphatic metastases in mice to study the vasculature of metastatic lymph nodes (n = 9–12). We further test our results in patient samples (n = 20 colon cancer patients; n = 20 head and neck cancer patients). Finally, we test the ability of antiangiogenic therapy to inhibit metastatic growth in the CLNW. All statistical tests were two-sided. Results: Using the CLNW, we reveal the surprising lack of sprouting angiogenesis during metastatic growth, despite the presence of hypoxia in some lesions. Treatment with two different antiangiogenic therapies showed no effect on the growth or vascular density of lymph node metastases (day 10: untreated mean = 1.2%, 95% confidence interval [CI] = 0.7% to 1.7%; control mean = 0.7%, 95% CI = 0.1% to 1.3%; DC101 mean = 0.4%, 95% CI = 0.0% to 3.3%; sunitinib mean = 0.5%, 95% CI = 0.0% to 1.0%, analysis of variance P = .34). We confirmed these findings in clinical specimens, including the lack of reduction in blood vessel density in lymph node metastases in patients treated with bevacizumab (no bevacizumab group mean = 257 vessels/mm2, 95% CI = 149 to 365 vessels/mm2; bevacizumab group mean = 327 vessels/mm2, 95% CI = 140 to 514 vessels/mm2, P = .78). Conclusion: We provide preclinical and clinical evidence that sprouting angiogenesis does not occur during the growth of lymph node metastases, and thus reveals a new mechanism of treatment resistance to antiangiogenic therapy in adjuvant settings. The targets of clinically approved angiogenesis inhibitors are not active during early cancer progression in the lymph node, suggesting that inhibitors of sprouting angiogenesis as a class will not be effective in treating lymph node metastases. PMID:26063793

Efficient bone cutting with the novel diode pumped Er:YAG laser system: in vitro investigation and optimization of the treatment parameters

NASA Astrophysics Data System (ADS)

Stock, Karl; Diebolder, Rolf; Hausladen, Florian; Hibst, Raimund

2014-03-01

It is well known that flashlamp pumped Er:YAG lasers allow efficient bone ablation due to strong absorption at 3μm by water. Preliminary experiments revealed also a newly developed diode pumped Er:YAG laser system (Pantec Engineering AG) to be an efficient tool for use for bone surgery. The aim of the present in vitro study is the investigation of a new power increased version of the laser system with higher pulse energy and optimization of the treatment set-up to get high cutting quality, efficiency, and ablation depth. Optical simulations were performed to achieve various focus diameters and homogeneous beam profile. An appropriate experimental set-up with two different focusing units, a computer controlled linear stage with sample holder, and a shutter unit was realized. By this we are able to move the sample (slices of pig bone) with a defined velocity during the irradiation. Cutting was performed under appropriate water spray by moving the sample back and forth. After each path the ablation depth was measured and the focal plane was tracked to the actual bottom of the groove. Finally, the cuts were analyzed by light microcopy regarding the ablation quality and geometry, and thermal effects. In summary, the results show that with carefully adapted irradiation parameters narrow and deep cuts (ablation depth > 6mm, aspect ratio approx. 20) are possible without carbonization. In conclusion, these in vitro investigations demonstrate that high efficient bone cutting is possible with the diode pumped Er:YAG laser system using appropriate treatment set-up and parameters.

Risk of Subclinical Micrometastatic Disease in the Supraclavicular Nodal Bed According to the Anatomic Distribution in Patients With Advanced Breast Cancer

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

Reed, Valerie K.; Cavalcanti, Jose L.; Strom, Eric A.

Purpose: To determine the anatomic distribution of gross supraclavicular nodes within the supraclavicular fossa using 2-deoxy-2-[F-18] fluoro-d-glucose (FDG) positron emission tomography/computed tomography (PET/CT) scans, and to evaluate likely coverage of specific regions of the supraclavicular fossa using standard radiation fields. Methods and Materials: We identified 33 patients with advanced or metastatic breast cancer who had a PET/CT scan demonstrating hypermetabolic supraclavicular lymph nodes in 2005. The locations of the involved lymph nodes were mapped onto a single CT set of images of the supraclavicular fossa. These lymph nodes were also mapped onto the treatment-planning CT dataset of 4 patients treatedmore » in our institution (2 patients with biopsy-proven supraclavicular nodes and 2 patients with clinically negative supraclavicular nodes). Results: We were able to determine the distribution of 52 supraclavicular lymph nodes in 32 patients. Of 32 patients, 28 (87%) had a history of metastatic disease, and 2 patients had isolated nodal recurrences. Five patients had supraclavicular nodes posterior to the vertebral body transverse process, and several lymph nodes were in close proximity to the medial field border, raising the possibility of geographic miss in these areas. Conclusions: In patients with locally advanced disease, increased coverage of the supraclavicular fossa medially and posteriorly may be warranted.« less

Evolvable Neural Software System

NASA Technical Reports Server (NTRS)

Curtis, Steven A.

2009-01-01

The Evolvable Neural Software System (ENSS) is composed of sets of Neural Basis Functions (NBFs), which can be totally autonomously created and removed according to the changing needs and requirements of the software system. The resulting structure is both hierarchical and self-similar in that a given set of NBFs may have a ruler NBF, which in turn communicates with other sets of NBFs. These sets of NBFs may function as nodes to a ruler node, which are also NBF constructs. In this manner, the synthetic neural system can exhibit the complexity, three-dimensional connectivity, and adaptability of biological neural systems. An added advantage of ENSS over a natural neural system is its ability to modify its core genetic code in response to environmental changes as reflected in needs and requirements. The neural system is fully adaptive and evolvable and is trainable before release. It continues to rewire itself while on the job. The NBF is a unique, bilevel intelligence neural system composed of a higher-level heuristic neural system (HNS) and a lower-level, autonomic neural system (ANS). Taken together, the HNS and the ANS give each NBF the complete capabilities of a biological neural system to match sensory inputs to actions. Another feature of the NBF is the Evolvable Neural Interface (ENI), which links the HNS and ANS. The ENI solves the interface problem between these two systems by actively adapting and evolving from a primitive initial state (a Neural Thread) to a complicated, operational ENI and successfully adapting to a training sequence of sensory input. This simulates the adaptation of a biological neural system in a developmental phase. Within the greater multi-NBF and multi-node ENSS, self-similar ENI s provide the basis for inter-NBF and inter-node connectivity.

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

NASA Technical Reports Server (NTRS)

Mengshoel, Ole J.

2010-01-01

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

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.

Use of multi-node wells in the Groundwater-Management Process of MODFLOW-2005 (GWM-2005)

USGS Publications Warehouse

Ahlfeld, David P.; Barlow, Paul M.

2013-01-01

Many groundwater wells are open to multiple aquifers or to multiple intervals within a single aquifer. These types of wells can be represented in numerical simulations of groundwater flow by use of the Multi-Node Well (MNW) Packages developed for the U.S. Geological Survey’s MODFLOW model. However, previous versions of the Groundwater-Management (GWM) Process for MODFLOW did not allow the use of multi-node wells in groundwater-management formulations. This report describes modifications to the MODFLOW–2005 version of the GWM Process (GWM–2005) to provide for such use with the MNW2 Package. Multi-node wells can be incorporated into a management formulation as flow-rate decision variables for which optimal withdrawal or injection rates will be determined as part of the GWM–2005 solution process. In addition, the heads within multi-node wells can be used as head-type state variables, and, in that capacity, be included in the objective function or constraint set of a management formulation. Simple head bounds also can be defined to constrain water levels at multi-node wells. The report provides instructions for including multi-node wells in the GWM–2005 data-input files and a sample problem that demonstrates use of multi-node wells in a typical groundwater-management problem.

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

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

PubMed Central

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

PubMed

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

Summarisation of weighted networks

NASA Astrophysics Data System (ADS)

Zhou, Fang; Qu, Qiang; Toivonen, Hannu

2017-09-01

Networks often contain implicit structure. We introduce novel problems and methods that look for structure in networks, by grouping nodes into supernodes and edges to superedges, and then make this structure visible to the user in a smaller generalised network. This task of finding generalisations of nodes and edges is formulated as 'network Summarisation'. We propose models and algorithms for networks that have weights on edges, on nodes or on both, and study three new variants of the network summarisation problem. In edge-based weighted network summarisation, the summarised network should preserve edge weights as well as possible. A wider class of settings is considered in path-based weighted network summarisation, where the resulting summarised network should preserve longer range connectivities between nodes. Node-based weighted network summarisation in turn allows weights also on nodes and summarisation aims to preserve more information related to high weight nodes. We study theoretical properties of these problems and show them to be NP-hard. We propose a range of heuristic generalisation algorithms with different trade-offs between complexity and quality of the result. Comprehensive experiments on real data show that weighted networks can be summarised efficiently with relatively little error.

High-precision micro/nano-scale machining system

DOEpatents

Kapoor, Shiv G.; Bourne, Keith Allen; DeVor, Richard E.

2014-08-19

A high precision micro/nanoscale machining system. A multi-axis movement machine provides relative movement along multiple axes between a workpiece and a tool holder. A cutting tool is disposed on a flexible cantilever held by the tool holder, the tool holder being movable to provide at least two of the axes to set the angle and distance of the cutting tool relative to the workpiece. A feedback control system uses measurement of deflection of the cantilever during cutting to maintain a desired cantilever deflection and hence a desired load on the cutting tool.

Next-to-leading order γ γ + 2 - jet production at the LHC

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

Bern, Z.; Dixon, L. J.; Febres Cordero, F.

We present next-to-leading-order QCD predictions for cross sections and for a comprehensive set of distributions in γγ+2-jet production at the Large Hadron Collider. We consider the contributions from loop amplitudes for two photons and four gluons, but we neglect top quarks. We use BlackHat together with SHERPA to carry out the computation. We use a Frixione cone isolation for the photons. We study standard sets of cuts on the jets and the photons and also sets of cuts appropriate for studying backgrounds to Higgs-boson production via vector-boson fusion.

Extracting spatial information from networks with low-order eigenvectors

NASA Astrophysics Data System (ADS)

Cucuringu, Mihai; Blondel, Vincent D.; Van Dooren, Paul

2013-03-01

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low-order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower-order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

Kidney segmentation in CT sequences using graph cuts based active contours model and contextual continuity.

PubMed

Zhang, Pin; Liang, Yanmei; Chang, Shengjiang; Fan, Hailun

2013-08-01

Accurate segmentation of renal tissues in abdominal computed tomography (CT) image sequences is an indispensable step for computer-aided diagnosis and pathology detection in clinical applications. In this study, the goal is to develop a radiology tool to extract renal tissues in CT sequences for the management of renal diagnosis and treatments. In this paper, the authors propose a new graph-cuts-based active contours model with an adaptive width of narrow band for kidney extraction in CT image sequences. Based on graph cuts and contextual continuity, the segmentation is carried out slice-by-slice. In the first stage, the middle two adjacent slices in a CT sequence are segmented interactively based on the graph cuts approach. Subsequently, the deformable contour evolves toward the renal boundaries by the proposed model for the kidney extraction of the remaining slices. In this model, the energy function combining boundary with regional information is optimized in the constructed graph and the adaptive search range is determined by contextual continuity and the object size. In addition, in order to reduce the complexity of the min-cut computation, the nodes in the graph only have n-links for fewer edges. The total 30 CT images sequences with normal and pathological renal tissues are used to evaluate the accuracy and effectiveness of our method. The experimental results reveal that the average dice similarity coefficient of these image sequences is from 92.37% to 95.71% and the corresponding standard deviation for each dataset is from 2.18% to 3.87%. In addition, the average automatic segmentation time for one kidney in each slice is about 0.36 s. Integrating the graph-cuts-based active contours model with contextual continuity, the algorithm takes advantages of energy minimization and the characteristics of image sequences. The proposed method achieves effective results for kidney segmentation in CT sequences.

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest design strategies for novel RNA motifs. PMID:25188578

Efficient computation of k-Nearest Neighbour Graphs for large high-dimensional data sets on GPU clusters.

PubMed

Dashti, Ali; Komarov, Ivan; D'Souza, Roshan M

2013-01-01

This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between different GPUs on a single node, and within a GPU). The method is applicable to homogeneous computing clusters with a varying number of nodes and GPUs per node. We achieve a 6-fold speedup in data processing as compared with an optimized method running on a cluster of CPUs and bring a hitherto impossible [Formula: see text]-NNG generation for a dataset of twenty million images with 15 k dimensionality into the realm of practical possibility.

SpicyNodes Radial Map Engine

NASA Astrophysics Data System (ADS)

Douma, M.; Ligierko, G.; Angelov, I.

2008-10-01

The need for information has increased exponentially over the past decades. The current systems for constructing, exploring, classifying, organizing, and searching information face the growing challenge of enabling their users to operate efficiently and intuitively in knowledge-heavy environments. This paper presents SpicyNodes, an advanced user interface for difficult interaction contexts. It is based on an underlying structure known as a radial map, which allows users to manipulate and interact in a natural manner with entities called nodes. This technology overcomes certain limitations of existing solutions and solves the problem of browsing complex sets of linked information. SpicyNodes is also an organic system that projects users into a living space, stimulating exploratory behavior and fostering creative thought. Our interactive radial layout is used for educational purposes and has the potential for numerous other applications.

Hierarchical Learning of Tree Classifiers for Large-Scale Plant Species Identification.

PubMed

Fan, Jianping; Zhou, Ning; Peng, Jinye; Gao, Ling

2015-11-01

In this paper, a hierarchical multi-task structural learning algorithm is developed to support large-scale plant species identification, where a visual tree is constructed for organizing large numbers of plant species in a coarse-to-fine fashion and determining the inter-related learning tasks automatically. For a given parent node on the visual tree, it contains a set of sibling coarse-grained categories of plant species or sibling fine-grained plant species, and a multi-task structural learning algorithm is developed to train their inter-related classifiers jointly for enhancing their discrimination power. The inter-level relationship constraint, e.g., a plant image must first be assigned to a parent node (high-level non-leaf node) correctly if it can further be assigned to the most relevant child node (low-level non-leaf node or leaf node) on the visual tree, is formally defined and leveraged to learn more discriminative tree classifiers over the visual tree. Our experimental results have demonstrated the effectiveness of our hierarchical multi-task structural learning algorithm on training more discriminative tree classifiers for large-scale plant species identification.

Photovoltaic Hosting Capacity of Feeders with Reactive Power Control and Tap Changers

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

Ceylan, Oğuzhan; Paudyal, Sumit; Bhattarai, Bishnu P.

This paper proposes an algorithm to determine photovoltaic (PV) hosting capacity of power distribution networks as a function of number of PV injection nodes, reactive power support from the PVs, and the sub-station load tap changers (LTCs). In the proposed method, several minute by minute simulations are run based on randomly chosen PV injection nodes, daily PV output profiles, and daily load profiles from a pool of high-resolution realistic data set. The simulation setup is built using OpenDSS and MATLAB. The performance of the proposed method is investigated in the IEEE 123-node distribution feeder for multiple scenarios. The case studiesmore » are performed particularly for one, two, five and ten PV injection nodes, and looking at the maximum voltage deviations. Case studies show that the PV hosting capacity of the 123-node feeder greatly differs with the number of PV injection nodes. We have also observed that the PV hosting capacity increases with reactive power support and higher tap position of sub-station LTC.« less

Matching-centrality decomposition and the forecasting of new links in networks.

PubMed

Rohr, Rudolf P; Naisbit, Russell E; Mazza, Christian; Bersier, Louis-Félix

2016-02-10

Networks play a prominent role in the study of complex systems of interacting entities in biology, sociology, and economics. Despite this diversity, we demonstrate here that a statistical model decomposing networks into matching and centrality components provides a comprehensive and unifying quantification of their architecture. The matching term quantifies the assortative structure in which node makes links with which other node, whereas the centrality term quantifies the number of links that nodes make. We show, for a diverse set of networks, that this decomposition can provide a tight fit to observed networks. Then we provide three applications. First, we show that the model allows very accurate prediction of missing links in partially known networks. Second, when node characteristics are known, we show how the matching-centrality decomposition can be related to this external information. Consequently, it offers us a simple and versatile tool to explore how node characteristics explain network architecture. Finally, we demonstrate the efficiency and flexibility of the model to forecast the links that a novel node would create if it were to join an existing network. © 2016 The Author(s).

Matching–centrality decomposition and the forecasting of new links in networks

PubMed Central

Rohr, Rudolf P.; Naisbit, Russell E.; Mazza, Christian; Bersier, Louis-Félix

2016-01-01

Networks play a prominent role in the study of complex systems of interacting entities in biology, sociology, and economics. Despite this diversity, we demonstrate here that a statistical model decomposing networks into matching and centrality components provides a comprehensive and unifying quantification of their architecture. The matching term quantifies the assortative structure in which node makes links with which other node, whereas the centrality term quantifies the number of links that nodes make. We show, for a diverse set of networks, that this decomposition can provide a tight fit to observed networks. Then we provide three applications. First, we show that the model allows very accurate prediction of missing links in partially known networks. Second, when node characteristics are known, we show how the matching–centrality decomposition can be related to this external information. Consequently, it offers us a simple and versatile tool to explore how node characteristics explain network architecture. Finally, we demonstrate the efficiency and flexibility of the model to forecast the links that a novel node would create if it were to join an existing network. PMID:26842568

Western Wind Data Set | Grid Modernization | NREL

Science.gov Websites

replicates the stochastic nature of wind power plant output. NREL modeled hysteresis around wind turbine cut where wind speeds are often near wind turbine cut-out (~25 m/s), SCORE output does not replicate the Vestas V90). The hysteresis-corrected SCORE is an attempt to put the wind turbine hysteresis at cut-out

3. Oblique view of building in setting; view to northwest, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

3. Oblique view of building in setting; view to northwest, 65mm lens. Railroad cut in foreground was made in 1928 when Southern Pacific Railroad realigned its main line in connection with the construction of its Martinez-Benicia Bridge. It was this cut which led to continual settlement of the southeast corner of the building, resulting in its structural failure. - Benicia Arsenal, Powder Magazine No. 5, Junction of Interstate Highways 680 & 780, Benicia, Solano County, CA

Evolving Expert Knowledge Bases: Applications of Crowdsourcing and Serious Gaming to Advance Knowledge Development for Intelligent Tutoring Systems

ERIC Educational Resources Information Center

Floryan, Mark

2013-01-01

This dissertation presents a novel effort to develop ITS technologies that adapt by observing student behavior. In particular, we define an evolving expert knowledge base (EEKB) that structures a domain's information as a set of nodes and the relationships that exist between those nodes. The structure of this model is not the particularly novel…

The Added Value of a Single-photon Emission Computed Tomography-Computed Tomography in Sentinel Lymph Node Mapping in Patients with Breast Cancer and Malignant Melanoma.

PubMed

Bennie, George; Vorster, Mariza; Buscombe, John; Sathekge, Mike

2015-01-01

Single-photon emission computed tomography-computed tomography (SPECT-CT) allows for physiological and anatomical co-registration in sentinel lymph node (SLN) mapping and offers additional benefits over conventional planar imaging. However, the clinical relevance when considering added costs and radiation burden of these reported benefits remains somewhat uncertain. This study aimed to evaluate the possible added value of SPECT-CT and intra-operative gamma-probe use over planar imaging alone in the South African setting. 80 patients with breast cancer or malignant melanoma underwent both planar and SPECT-CT imaging for SLN mapping. We assessed and compared the number of nodes detected on each study, false positive and negative findings, changes in surgical approach and or patient management. In all cases where a sentinel node was identified, SPECT-CT was more accurate anatomically. There was a significant change in surgical approach in 30 cases - breast cancer (n = 13; P 0.001) and malignant melanoma (n = 17; P 0.0002). In 4 cases a node not identified on planar imaging was seen on SPECT-CT. In 16 cases additional echelon nodes were identified. False positives were excluded by SPECT-CT in 12 cases. The addition of SPECT-CT and use of intra-operative gamma-probe to planar imaging offers important benefits in patients who present with breast cancer and melanoma. These benefits include increased nodal detection, elimination of false positives and negatives and improved anatomical localization that ultimately aids and expedites surgical management. This has been demonstrated in the context of industrialized country previously and has now also been confirmed in the setting of a emerging-market nation.

Inhibitory effects of sevoflurane on pacemaking activity of sinoatrial node cells in guinea-pig heart

PubMed Central

Kojima, Akiko; Kitagawa, Hirotoshi; Omatsu-Kanbe, Mariko; Matsuura, Hiroshi; Nosaka, Shuichi

2012-01-01

BACKGROUND AND PURPOSE The volatile anaesthetic sevoflurane affects heart rate in clinical settings. The present study investigated the effect of sevoflurane on sinoatrial (SA) node automaticity and its underlying ionic mechanisms. EXPERIMENTAL APPROACH Spontaneous action potentials and four ionic currents fundamental for pacemaking, namely, the hyperpolarization-activated cation current (If), T-type and L-type Ca2+ currents (ICa,T and ICa,L, respectively), and slowly activating delayed rectifier K+ current (IKs), were recorded in isolated guinea-pig SA node cells using perforated and conventional whole-cell patch-clamp techniques. Heart rate in guinea-pigs was recorded ex vivo in Langendorff mode and in vivo during sevoflurane inhalation. KEY RESULTS In isolated SA node cells, sevoflurane (0.12–0.71 mM) reduced the firing rate of spontaneous action potentials and its electrical basis, diastolic depolarization rate, in a qualitatively similar concentration-dependent manner. Sevoflurane (0.44 mM) reduced spontaneous firing rate by approximately 25% and decreased If, ICa,T, ICa,L and IKs by 14.4, 31.3, 30.3 and 37.1%, respectively, without significantly affecting voltage dependence of current activation. The negative chronotropic effect of sevoflurane was partly reproduced by a computer simulation of SA node cell electrophysiology. Sevoflurane reduced heart rate in Langendorff-perfused hearts, but not in vivo during sevoflurane inhalation in guinea-pigs. CONCLUSIONS AND IMPLICATIONS Sevoflurane at clinically relevant concentrations slowed diastolic depolarization and thereby reduced pacemaking activity in SA node cells, at least partly due to its inhibitory effect on If, ICa,T and ICa,L. These findings provide an important electrophysiological basis of alterations in heart rate during sevoflurane anaesthesia in clinical settings. PMID:22356456

Rapid in vitro multiplication and restoration of Celastrus paniculatus Willd. sub sp. paniculatus (Celastraceae), a medicinal woody climber.

PubMed

Nair, L G; Seeni, S

2001-07-01

Nodes, shoot tips, internodes and leaf bases (approximately 1.0 cm) excised from young vines of the flowering woody climber, Celastrus paniculatus WilId. sub. sp. paniculatus (Celastraceae) were cultured in Murashige and Skoog (MS) medium containing agar (0.6%), sucrose (3%) and varied concentrations of 6-benzyl aminopurine (BAP) and kinetin. All the explant types were regenerative and maximum number (3.6) and frequency (94%) of axillary shoot formation of (5.08 cm long) was recorded in the nodes cultured in BAP (1 mg L(-1)) after 6 weeks. Combinations of BAP (1 mg L(-1)) and indole-3-acetic acid/l-naphthalene acetic acid (0.01-1 mg L(-1); IAA/NAA) tested with nodes induced formation of less number (3 and 2.2) of shoots at same frequency (94%). All the explant types viz. node, shoot tip, internode and leaf base of in vitro derived shoots responded earlier and better in lower concentrations of BAP (0.5-2 mg L(-1)) with formation of 8, 3.1, 6.4 and 1.8 shoots respectively during the same period. In spite of the advanced and increased caulogenic responses, differences in cytokinin requirements between different explants observed during culture initiation still persisted with the nodes, shoot tips, internodes and petiole segments responding best at 0.5, 1 and 2 mg L(-1) BAP, respectively. The repeated reculture up to 10 cycles of the nodes from the shoot cultures each at 6-week intervals enabled multiplication and stocking of shoots without decline. Rooting of 3-7 cm shoot cuttings was induced in half-strength MS liquid medium containing IAA (1 mg L(-1)) with formation of 7.25 roots of 2.41 cm length within 6 weeks. Rooted plants were established at 84-96% rate in community pots without hardening, the least value (84%) being obtained with NAA- induced thick and calloid rooted plants. Four month old community potted plants were reintroduced into native forest habitats at 95% efficiency and 8 months after restoration, the plants were uniform in morphological, growth, cytological and peroxidase and esterase isozyme characteristics.

Ratio between maximum standardized uptake value of N1 lymph nodes and tumor predicts N2 disease in patients with non-small cell lung cancer in 18F-FDG PET-CT scan.

PubMed

Honguero Martínez, A F; García Jiménez, M D; García Vicente, A; López-Torres Hidalgo, J; Colon, M J; van Gómez López, O; Soriano Castrejón, Á M; León Atance, P

2016-01-01

F-18 fluorodeoxyglucose integrated PET-CT scan is commonly used in the work-up of lung cancer to improve preoperative disease stage. The aim of the study was to analyze the ratio between SUVmax of N1 lymph nodes and primary lung cancer to establish prediction of mediastinal disease (N2) in patients operated on non-small cell lung cancer. This is a retrospective study of a prospective database. Patients operated on non-small cell lung cancer (NSCLC) with N1 disease by PET-CT scan were included. None of them had previous induction treatment, but they underwent standard surgical resection plus systematic lymphadenectomy. There were 51 patients with FDG-PET-CT scan N1 disease. 44 (86.3%) patients were male with a mean age of 64.1±10.8 years. Type of resection: pneumonectomy=4 (7.9%), lobectomy/bilobectomy=44 (86.2%), segmentectomy=3 (5.9%). adenocarcinoma=26 (51.0%), squamous=23 (45.1%), adenosquamous=2 (3.9%). Lymph nodes after surgical resection: N0=21 (41.2%), N1=12 (23.5%), N2=18 (35.3%). Mean ratio of the SUVmax of N1 lymph node to the SUVmax of the primary lung tumor (SUVmax N1/T ratio) was 0.60 (range 0.08-2.80). ROC curve analysis to obtain the optimal cut-off value of SUVmax N1/T ratio to predict N2 disease was performed. At multivariate analysis, we found that a ratio of 0.46 or greater was an independent predictor factor of N2 mediastinal lymph node metastases with a sensitivity and specificity of 77.8% and 69.7%, respectively. SUVmax N1/T ratio in NSCLC patients correlates with mediastinal lymph node metastasis (N2 disease) after surgical resection. When SUVmax N1/T ratio on integrated PET-CT scan is equal or superior to 0.46, special attention should be paid on higher probability of N2 disease. Copyright © 2015 Elsevier España, S.L.U. and SEMNIM. All rights reserved.

The Ratio Between Metastatic and Examined Lymph Nodes (N Ratio) Is an Independent Prognostic Factor in Gastric Cancer Regardless of the Type of Lymphadenectomy

PubMed Central

Marchet, Alberto; Mocellin, Simone; Ambrosi, Alessandro; Morgagni, Paolo; Garcea, Domenico; Marrelli, Daniele; Roviello, Franco; de Manzoni, Giovanni; Minicozzi, Annamaria; Natalini, Giovanni; De Santis, Francesco; Baiocchi, Luca; Coniglio, Arianna; Nitti, Donato

2007-01-01

Purpose: To investigate whether the ratio between metastatic and examined lymph nodes (N ratio) is a better prognostic factor as compared with traditional staging systems in patients with gastric cancer regardless of the extension of lymph node dissection. Patients & Methods: We retrospectively reviewed the data of 1853 patients who underwent radical resection for gastric carcinoma at 6 Italian centers. Patients with >15 (group 1, n = 1421) and those with ≤15 (group 2, n = 432) lymph nodes examined were separately analyzed. N ratio categories (N ratio 0, 0%; N ratio 1, 1%–9%; N ratio 2, 10%–25%; N ratio 3, >25%) were determined by the best cut-off approach. Results: After a median follow-up of 45.5 months (range, 4–182 months), the 5-year overall survival of N0, N1, and N2 patients of group 1 versus group 2 was 83.4% versus 74.2% (P = 0.0026), 54.3% versus 44.3% (P = 0.018), and 32.7% versus 14.7% (P = 0.004), respectively, suggesting that a low number of excised lymph nodes can lead to the understaging of patients. N ratio identified subsets of patients with significantly different survival rates within N1 and N2 stages in both groups. At multivariate analysis, the N ratio (but not N stage) was retained as an independent prognostic factor both in group 1 and group 2 (HR for N ratio 1, N ratio 2, and N ratio 3 = 1.67, 2.96, and 6.59, and 1.56, 2.68, and 4.28, respectively). In our series, the implementation of N ratio led to the identification of subgroups of patients prognostically more homogeneous than those classified by the TNM system. Conclusion: N ratio is a simple and reproducible prognostic tool that can stratify patients with gastric cancer also in case of limited lymph node dissection. These data may represent the rational for improving the prognostic power of current UICC TNM staging system and ultimately the selection of patients who may most benefit from adjuvant treatments. PMID:17414602

Cubature versus Fekete-Gauss nodes for spectral element methods on simplicial meshes

NASA Astrophysics Data System (ADS)

Pasquetti, Richard; Rapetti, Francesca

2017-10-01

In a recent JCP paper [9], a higher order triangular spectral element method (TSEM) is proposed to address seismic wave field modeling. The main interest of this TSEM is that the mass matrix is diagonal, so that an explicit time marching becomes very cheap. This property results from the fact that, similarly to the usual SEM (say QSEM), the basis functions are Lagrange polynomials based on a set of points that shows both nice interpolation and quadrature properties. In the quadrangle, i.e. for the QSEM, the set of points is simply obtained by tensorial product of Gauss-Lobatto-Legendre (GLL) points. In the triangle, finding such an appropriate set of points is however not trivial. Thus, the work of [9] follows anterior works that started in 2000's [2,6,11] and now provides cubature nodes and weights up to N = 9, where N is the total degree of the polynomial approximation. Here we wish to evaluate the accuracy of this cubature nodes TSEM with respect to the Fekete-Gauss one, see e.g.[12], that makes use of two sets of points, namely the Fekete points and the Gauss points of the triangle for interpolation and quadrature, respectively. Because the Fekete-Gauss TSEM is in the spirit of any nodal hp-finite element methods, one may expect that the conclusions of this Note will remain relevant if using other sets of carefully defined interpolation points.

A Multi-Purpose Modular Electronics Integration Node for Exploration Extravehicular Activity

NASA Technical Reports Server (NTRS)

Hodgson, Edward; Papale, William; Wichowski, Robert; Rosenbush, David; Hawes, Kevin; Stankiewicz, Tom

2013-01-01

As NASA works to develop an effective integrated portable life support system design for exploration Extravehicular activity (EVA), alternatives to the current system s electrical power and control architecture are needed to support new requirements for flexibility, maintainability, reliability, and reduced mass and volume. Experience with the current Extravehicular Mobility Unit (EMU) has demonstrated that the current architecture, based in a central power supply, monitoring and control unit, with dedicated analog wiring harness connections to active components in the system has a significant impact on system packaging and seriously constrains design flexibility in adapting to component obsolescence and changing system needs over time. An alternative architecture based in the use of a digital data bus offers possible wiring harness and system power savings, but risks significant penalties in component complexity and cost. A hybrid architecture that relies on a set of electronic and power interface nodes serving functional models within the Portable Life Support System (PLSS) is proposed to minimize both packaging and component level penalties. A common interface node hardware design can further reduce penalties by reducing the nonrecurring development costs, making miniaturization more practical, maximizing opportunities for maturation and reliability growth, providing enhanced fault tolerance, and providing stable design interfaces for system components and a central control. Adaptation to varying specific module requirements can be achieved with modest changes in firmware code within the module. A preliminary design effort has developed a common set of hardware interface requirements and functional capabilities for such a node based on anticipated modules comprising an exploration PLSS, and a prototype node has been designed assembled, programmed, and tested. One instance of such a node has been adapted to support testing the swingbed carbon dioxide and humidity control element in NASA s advanced PLSS 2.0 test article. This paper will describe the common interface node design concept, results of the prototype development and test effort, and plans for use in NASA PLSS 2.0 integrated tests.

Complex Network Analysis of CA3 Transcriptome Reveals Pathogenic and Compensatory Pathways in Refractory Temporal Lobe Epilepsy

PubMed Central

Bando, Silvia Yumi; Silva, Filipi Nascimento; Costa, Luciano da Fontoura; Silva, Alexandre V.; Pimentel-Silva, Luciana R.; Castro, Luiz HM.; Wen, Hung-Tzu; Amaro, Edson; Moreira-Filho, Carlos Alberto

2013-01-01

We previously described – studying transcriptional signatures of hippocampal CA3 explants – that febrile (FS) and afebrile (NFS) forms of refractory mesial temporal lobe epilepsy constitute two distinct genomic phenotypes. That network analysis was based on a limited number (hundreds) of differentially expressed genes (DE networks) among a large set of valid transcripts (close to two tens of thousands). Here we developed a methodology for complex network visualization (3D) and analysis that allows the categorization of network nodes according to distinct hierarchical levels of gene-gene connections (node degree) and of interconnection between node neighbors (concentric node degree). Hubs are highly connected nodes, VIPs have low node degree but connect only with hubs, and high-hubs have VIP status and high overall number of connections. Studying the whole set of CA3 valid transcripts we: i) obtained complete transcriptional networks (CO) for FS and NFS phenotypic groups; ii) examined how CO and DE networks are related; iii) characterized genomic and molecular mechanisms underlying FS and NFS phenotypes, identifying potential novel targets for therapeutic interventions. We found that: i) DE hubs and VIPs are evenly distributed inside the CO networks; ii) most DE hubs and VIPs are related to synaptic transmission and neuronal excitability whereas most CO hubs, VIPs and high hubs are related to neuronal differentiation, homeostasis and neuroprotection, indicating compensatory mechanisms. Complex network visualization and analysis is a useful tool for systems biology approaches to multifactorial diseases. Network centrality observed for hubs, VIPs and high hubs of CO networks, is consistent with the network disease model, where a group of nodes whose perturbation leads to a disease phenotype occupies a central position in the network. Conceivably, the chance for exerting therapeutic effects through the modulation of particular genes will be higher if these genes are highly interconnected in transcriptional networks. PMID:24278214

Energy efficient mechanisms for high-performance Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Alsaify, Baha'adnan

2009-12-01

Due to recent advances in microelectronics, the development of low cost, small, and energy efficient devices became possible. Those advances led to the birth of the Wireless Sensor Networks (WSNs). WSNs consist of a large set of sensor nodes equipped with communication capabilities, scattered in the area to monitor. Researchers focus on several aspects of WSNs. Such aspects include the quality of service the WSNs provide (data delivery delay, accuracy of data, etc...), the scalability of the network to contain thousands of sensor nodes (the terms node and sensor node are being used interchangeably), the robustness of the network (allowing the network to work even if a certain percentage of nodes fails), and making the energy consumption in the network as low as possible to prolong the network's lifetime. In this thesis, we present an approach that can be applied to the sensing devices that are scattered in an area for Sensor Networks. This work will use the well-known approach of using a awaking scheduling to extend the network's lifespan. We designed a scheduling algorithm that will reduce the delay's upper bound the reported data will experience, while at the same time keeps the advantages that are offered by the use of the awaking scheduling -- the energy consumption reduction which will lead to the increase in the network's lifetime. The wakeup scheduling is based on the location of the node relative to its neighbors and its distance from the Base Station (the terms Base Station and sink are being used interchangeably). We apply the proposed method to a set of simulated nodes using the "ONE Simulator". We test the performance of this approach with three other approaches -- Direct Routing technique, the well known LEACH algorithm, and a multi-parent scheduling algorithm. We demonstrate a good improvement on the network's quality of service and a reduction of the consumed energy.

Computational analysis of complex systems: Applications to population dynamics and networks

NASA Astrophysics Data System (ADS)

Molnar, Ferenc

In most complex evolving systems, we can often find a critical subset of the constituents that can initiate a global change in the entire system. For example, in complex networks, a critical subset of nodes can efficiently spread information, influence, or control dynamical processes over the entire network. Similarly, in nonlinear dynamics, we can locate key variables, or find the necessary parameters, to reach the attraction basin of a desired global state. In both cases, a fundamental goal is finding the ability to efficiently control these systems. We study two distinct complex systems in this dissertation, exploring these topics. First, we analyze a population dynamics model describing interactions of sex-structured population groups. Specifically, we analyze how a sex-linked genetic trait's ecological consequence (population survival or extinction) can be influenced by the presence of sex-specific cultural mortality traits, motivated by the desire to expand the theoretical understanding of the role of biased sex ratios in organisms. We analyze dynamics within a single population group, as well as between competing groups. We find that there is a finite range of sex ratio bias that can be maintained in stable equilibrium by sex-specific mortalities. We also find that the outcome of an invasion and the ensuing between-group competition depends not on larger equilibrium group densities, but on the higher allocation of sex-ratio genes. When we extend the model with diffusive dispersal, we find that a critical patch size for achieving positive growth only exists if the population expands into an empty environment. If a resident population is already present that can be exploited by the invading group, then any small seed of invader can advance from rarity, in the mean-field approximation, as long as the local competition dynamics favors the invader's survival. Most spatial models assume initial populations with a uniform distribution inside a finite patch; a simple, but not a cost-efficient approach. We show, using a novel application of simulated annealing, that a specific, non-trivial shape of spatial distribution can minimize the total cost of successful invasion, i.e., the cost of ecological restoration. Further, our approach can be generalized to essentially any reaction-diffusion model with diffusive spreading. In the second part of the dissertation we conduct an extensive study of minimum dominating sets (MDS) in complex networks; particularly, in scale-free networks. MDS is the smallest subset of nodes in a network that can reach every other node as nearest neighbors, thus it provides a key subset of nodes that play critical role in controllability and observability of social, biological, and technological networks. Continued interest in network control, monitoring and influencing of complex networks motivates our research of understanding the properties and practical application-related issues of the MDS. Our study of the scaling behavior reveals that the size of MDS always scales linearly with network size, as long as the power-law degree exponent gamma of the degree distribution is larger than 2. However, when gamma<2, a domination transition occurs, allowing the MDS size to become O(1), leading to easily dominated networks, under certain structural conditions. Motivated by practical applicability in large networks, we develop a new dominating set selection method, derived from probabilistic node selection techniques, which can select small dominating sets without complete network topology information. We also show that the effectiveness of our method, as well as the effectiveness of other heuristics of dominating set selection, strongly depends on the assortativity of networks. Finally, we conduct a numerical study to analyze the fraction of nodes that remain dominated, after the network is damaged, and some nodes are removed. We find that dominating sets optimized for small size are particularly vulnerable to damage; a significant amount of "domination coverage" may be lost if key dominator nodes are deleted. However, we also find that increasing the redundancy of dominating sets by adding a few well-picked nodes can successfully increase the post-damage dominated fraction of the network. Based on this idea, we develop two algorithms to build dominating sets with flexible balance between size and damage resilience.

Ferromagnetic transition in a simple variant of the Ising model on multiplex networks

NASA Astrophysics Data System (ADS)

Krawiecki, A.

2018-02-01

Multiplex networks consist of a fixed set of nodes connected by several sets of edges which are generated separately and correspond to different networks ("layers"). Here, a simple variant of the Ising model on multiplex networks with two layers is considered, with spins located in the nodes and edges corresponding to ferromagnetic interactions between them. Critical temperatures for the ferromagnetic transition are evaluated for the layers in the form of random Erdös-Rényi graphs or heterogeneous scale-free networks using the mean-field approximation and the replica method, from the replica symmetric solution. Both methods require the use of different "partial" magnetizations, associated with different layers of the multiplex network, and yield qualitatively similar results. If the layers are strongly heterogeneous the critical temperature differs noticeably from that for the Ising model on a network being a superposition of the two layers, evaluated in the mean-field approximation neglecting the effect of the underlying multiplex structure on the correlations between the degrees of nodes. The critical temperature evaluated from the replica symmetric solution depends sensitively on the correlations between the degrees of nodes in different layers and shows satisfactory quantitative agreement with that obtained from Monte Carlo simulations. The critical behavior of the magnetization for the model with strongly heterogeneous layers can depend on the distributions of the degrees of nodes and is then determined by the properties of the most heterogeneous layer.

Melanoma metastases in regional lymph nodes are accurately detected by proton magnetic resonance spectroscopy of fine-needle aspirate biopsy samples.

PubMed

Stretch, Jonathan R; Somorjai, Ray; Bourne, Roger; Hsiao, Edward; Scolyer, Richard A; Dolenko, Brion; Thompson, John F; Mountford, Carolyn E; Lean, Cynthia L

2005-11-01

Nonsurgical assessment of sentinel nodes (SNs) would offer advantages over surgical SN excision by reducing morbidity and costs. Proton magnetic resonance spectroscopy (MRS) of fine-needle aspirate biopsy (FNAB) specimens identifies melanoma lymph node metastases. This study was undertaken to determine the accuracy of the MRS method and thereby establish a basis for the future development of a nonsurgical technique for assessing SNs. FNAB samples were obtained from 118 biopsy specimens from 77 patients during SN biopsy and regional lymphadenectomy. The specimens were histologically evaluated and correlated with MRS data. Histopathologic analysis established that 56 specimens contained metastatic melanoma and that 62 specimens were benign. A linear discriminant analysis-based classifier was developed for benign tissues and metastases. The presence of metastatic melanoma in lymph nodes was predicted with a sensitivity of 92.9%, a specificity of 90.3%, and an accuracy of 91.5% in a primary data set. In a second data set that used FNAB samples separate from the original tissue samples, melanoma metastases were predicted with a sensitivity of 87.5%, a specificity of 90.3%, and an accuracy of 89.1%, thus supporting the reproducibility of the method. Proton MRS of FNAB samples may provide a robust and accurate diagnosis of metastatic disease in the regional lymph nodes of melanoma patients. These data indicate the potential for SN staging of melanoma without surgical biopsy and histopathological evaluation.

Latent geometry of bipartite networks

NASA Astrophysics Data System (ADS)

Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri

2017-03-01

Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.

A decorated raven bone from the Zaskalnaya VI (Kolosovskaya) Neanderthal site, Crimea

PubMed Central

Evans, Sarah; Stepanchuk, Vadim; Tsvelykh, Alexander; d’Errico, Francesco

2017-01-01

We analyze a radius bone fragment of a raven (Corvus corax) from Zaskalnaya VI rock shelter, Crimea. The object bears seven notches and comes from an archaeological level attributed to a Micoquian industry dated to between 38 and 43 cal kyr BP. Our study aims to examine the degree of regularity and intentionality of this set of notches through their technological and morphometric analysis, complemented by comparative experimental work. Microscopic analysis of the notches indicate that they were produced by the to-and-fro movement of a lithic cutting edge and that two notches were added to fill in the gap left between previously cut notches, probably to increase the visual consistency of the pattern. Multivariate analysis of morphometric data recorded on the archaeological notches and sets of notches cut by nine modern experimenters on radii of domestic turkeys shows that the variations recorded on the Zaskalnaya set are comparable to experimental sets made with the aim of producing similar, parallel, equidistant notches. Identification of the Weber Fraction, the constant that accounts for error in human perception, for equidistant notches cut on bone rods and its application to the Zaskalnaya set of notches and thirty-six sets of notches incised on seventeen Upper Palaeolithic bone objects from seven sites indicate that the Zaskalnaya set falls within the range of variation of regularly spaced experimental and Upper Palaeolithic sets of notches. This suggests that even if the production of the notches may have had a utilitarian reason the notches were made with the goal of producing a visually consistent pattern. This object represents the first instance of a bird bone from a Neanderthal site bearing modifications that cannot be explained as the result of butchery activities and for which a symbolic argument can be built on direct rather than circumstantial evidence. PMID:28355292

Masked Proportional Routing

NASA Technical Reports Server (NTRS)

Wolpert, David

2004-01-01

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Target Control in Logical Models Using the Domain of Influence of Nodes.

PubMed

Yang, Gang; Gómez Tejeda Zañudo, Jorge; Albert, Réka

2018-01-01

Dynamical models of biomolecular networks are successfully used to understand the mechanisms underlying complex diseases and to design therapeutic strategies. Network control and its special case of target control, is a promising avenue toward developing disease therapies. In target control it is assumed that a small subset of nodes is most relevant to the system's state and the goal is to drive the target nodes into their desired states. An example of target control would be driving a cell to commit to apoptosis (programmed cell death). From the experimental perspective, gene knockout, pharmacological inhibition of proteins, and providing sustained external signals are among practical intervention techniques. We identify methodologies to use the stabilizing effect of sustained interventions for target control in Boolean network models of biomolecular networks. Specifically, we define the domain of influence (DOI) of a node (in a certain state) to be the nodes (and their corresponding states) that will be ultimately stabilized by the sustained state of this node regardless of the initial state of the system. We also define the related concept of the logical domain of influence (LDOI) of a node, and develop an algorithm for its identification using an auxiliary network that incorporates the regulatory logic. This way a solution to the target control problem is a set of nodes whose DOI can cover the desired target node states. We perform greedy randomized adaptive search in node state space to find such solutions. We apply our strategy to in silico biological network models of real systems to demonstrate its effectiveness.

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

PubMed

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

2008-04-01

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

An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

PubMed Central

Penumalli, Chakradhar; Palanichamy, Yogesh

2015-01-01

A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling for mobile ad hoc networks (MANETs) is proposed. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem [BSP] and at the same time considering the node's remaining energy. The Connected Dominating Set is widely used as a virtual backbone or spine in mobile ad hoc networks [MANETs] or Wireless Sensor Networks [WSN]. The CDS of a graph representing a network has a significant impact on an efficient design of routing protocol in wireless networks. Here the CDS is a distributed algorithm with activity scheduling based on unit disk graph [UDG]. The node's mobility and residual energy (RE) are considered as parameters in the construction of stable optimal energy efficient CDS. The performance is evaluated at various node densities, various transmission ranges, and mobility rates. The theoretical analysis and simulation results of this algorithm are also presented which yield better results. PMID:26221627

KeyWare: an open wireless distributed computing environment

NASA Astrophysics Data System (ADS)

Shpantzer, Isaac; Schoenfeld, Larry; Grindahl, Merv; Kelman, Vladimir

1995-12-01

Deployment of distributed applications in the wireless domain lack equivalent tools, methodologies, architectures, and network management that exist in LAN based applications. A wireless distributed computing environment (KeyWareTM) based on intelligent agents within a multiple client multiple server scheme was developed to resolve this problem. KeyWare renders concurrent application services to wireline and wireless client nodes encapsulated in multiple paradigms such as message delivery, database access, e-mail, and file transfer. These services and paradigms are optimized to cope with temporal and spatial radio coverage, high latency, limited throughput and transmission costs. A unified network management paradigm for both wireless and wireline facilitates seamless extensions of LAN- based management tools to include wireless nodes. A set of object oriented tools and methodologies enables direct asynchronous invocation of agent-based services supplemented by tool-sets matched to supported KeyWare paradigms. The open architecture embodiment of KeyWare enables a wide selection of client node computing platforms, operating systems, transport protocols, radio modems and infrastructures while maintaining application portability.

Influence of Microgravity Environment on Root Growth, Soluble Sugars, and Starch Concentration of Sweetpotato Stem Cuttings

PubMed Central

Mortley, Desmond G.; Bonsi, Conrad K.; Hill, Walter A.; Morris, Carlton E.; Williams, Carol S.; Davis, Ceyla F.; Williams, John W.; Levine, Lanfang H.; Petersen, Barbara V.; Wheeler, Raymond M.

2009-01-01

Because sweetpotato [Ipomoea batatas (L.) Lam.] stem cuttings regenerate very easily and quickly, a study of their early growth and development in microgravity could be useful to an understanding of morphological changes that might occur under such conditions for crops that are propagated vegetatively. An experiment was conducted aboard a U.S. Space Shuttle to investigate the impact of microgravity on root growth, distribution of amyloplasts in the root cells, and on the concentration of soluble sugars and starch in the stems of sweetpotatoes. Twelve stem cuttings of ‘Whatley/Loretan’ sweetpotato (5 cm long) with three to four nodes were grown in each of two plant growth units filled with a nutrient agarose medium impregnated with a half-strength Hoagland solution. One plant growth unit was flown on Space Shuttle Colombia for 5 days, whereas the other remained on the ground as a control. The cuttings were received within 2 h postflight and, along with ground controls, processed in ≈45 min. Adventitious roots were counted, measured, and fixed for electron microscopy and stems frozen for starch and sugar assays. Air samples were collected from the headspace of each plant growth unit for postflight determination of carbon dioxide, oxygen, and ethylene levels. All stem cuttings produced adventitious roots and growth was quite vigorous in both ground-based and flight samples and, except for a slight browning of some root tips in the flight samples, all stem cuttings appeared normal. The roots on the flight cuttings tended to grow in random directions. Also, stem cuttings grown in microgravity had more roots and greater total root length than ground-based controls. Amyloplasts in root cap cells of ground-based controls were evenly sedimented toward one end compared with a more random distribution in the flight samples. The concentration of soluble sugars, glucose, fructose, and sucrose and total starch concentration were all substantially greater in the stems of flight samples than those found in the ground-based samples. Carbon dioxide levels were 50% greater and oxygen marginally lower in the flight plants, whereas ethylene levels were similar and averaged less than 10 nL·L −1. Despite the greater accumulation of carbohydrates in the stems, and greater root growth in the flight cuttings, overall results showed minimal differences in cell development between space flight and ground-based tissues. This suggests that the space flight environment did not adversely impact sweetpotato metabolism and that vegetative cuttings should be an acceptable approach for propagating sweetpotato plants for space applications. PMID:20186286

Predicting Likelihood of Having Four or More Positive Nodes in Patient With Sentinel Lymph Node-Positive Breast Cancer: A Nomogram Validation Study

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

Unal, Bulent; Gur, Akif Serhat; Beriwal, Sushil

2009-11-15

Purpose: Katz suggested a nomogram for predicting having four or more positive nodes in sentinel lymph node (SLN)-positive breast cancer patients. The findings from this formula might influence adjuvant radiotherapy decisions. Our goal was to validate the accuracy of the Katz nomogram. Methods and Materials: We reviewed the records of 309 patients with breast cancer who had undergone completion axillary lymph node dissection. The factors associated with the likelihood of having four or more positive axillary nodes were evaluated in patients with one to three positive SLNs. The nomogram developed by Katz was applied to our data set. The areamore » under the curve of the corresponding receiver operating characteristics curve was calculated for the nomogram. Results: Of the 309 patients, 80 (25.9%) had four or more positive axillary lymph nodes. On multivariate analysis, the number of positive SLNs (p < .0001), overall metastasis size (p = .019), primary tumor size (p = .0001), and extracapsular extension (p = .01) were significant factors predicting for four or more positive nodes. For patients with <5% probability, 90.3% had fewer than four positive nodes and 9.7% had four or more positive nodes. The negative predictive value was 91.7%, and sensitivity was 80%. The nomogram was accurate and discriminating (area under the curve, .801). Conclusion: The probability of four or more involved nodes is significantly greater in patients who have an increased number of positive SLNs, increased overall metastasis size, increased tumor size, and extracapsular extension. The Katz nomogram was validated in our patients. This nomogram will be helpful to clinicians making adjuvant treatment recommendations to their patients.« less

Macroscopic description of complex adaptive networks coevolving with dynamic node states

NASA Astrophysics Data System (ADS)

Wiedermann, Marc; Donges, Jonathan F.; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

Temporal effects in trend prediction: identifying the most popular nodes in the future.

PubMed

Zhou, Yanbo; Zeng, An; Wang, Wei-Hong

2015-01-01

Prediction is an important problem in different science domains. In this paper, we focus on trend prediction in complex networks, i.e. to identify the most popular nodes in the future. Due to the preferential attachment mechanism in real systems, nodes' recent degree and cumulative degree have been successfully applied to design trend prediction methods. Here we took into account more detailed information about the network evolution and proposed a temporal-based predictor (TBP). The TBP predicts the future trend by the node strength in the weighted network with the link weight equal to its exponential aging. Three data sets with time information are used to test the performance of the new method. We find that TBP have high general accuracy in predicting the future most popular nodes. More importantly, it can identify many potential objects with low popularity in the past but high popularity in the future. The effect of the decay speed in the exponential aging on the results is discussed in detail.

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

PubMed

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

2016-01-01

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

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Macroscopic description of complex adaptive networks coevolving with dynamic node states.

PubMed

Wiedermann, Marc; Donges, Jonathan F; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

2015-05-01

In many real-world complex systems, the time evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the coevolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we mainly find that, in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability are crucial parameters for controlling the sustainability of the system's equilibrium state. We derive a macroscopic description of the system in terms of ordinary differential equations which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network. The thus obtained framework is applicable to many fields of study, such as epidemic spreading, opinion formation, or socioecological modeling.

COMCAN: a computer program for common cause analysis

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

Burdick, G.R.; Marshall, N.H.; Wilson, J.R.

1976-05-01

The computer program, COMCAN, searches the fault tree minimal cut sets for shared susceptibility to various secondary events (common causes) and common links between components. In the case of common causes, a location check may also be performed by COMCAN to determine whether barriers to the common cause exist between components. The program can locate common manufacturers of components having events in the same minimal cut set. A relative ranking scheme for secondary event susceptibility is included in the program.

One cutting plane algorithm using auxiliary functions

NASA Astrophysics Data System (ADS)

Zabotin, I. Ya; Kazaeva, K. E.

2016-11-01

We propose an algorithm for solving a convex programming problem from the class of cutting methods. The algorithm is characterized by the construction of approximations using some auxiliary functions, instead of the objective function. Each auxiliary function bases on the exterior penalty function. In proposed algorithm the admissible set and the epigraph of each auxiliary function are embedded into polyhedral sets. In connection with the above, the iteration points are found by solving linear programming problems. We discuss the implementation of the algorithm and prove its convergence.

Nanoassembly of nanostructures by cutting, bending and soldering of carbon nanotubes with electron beam.

PubMed

Liu, Pou; Kantola, Kalle; Fukuda, Toshio; Arai, Fumihito

2009-05-01

We report that a series of in situ nanofabrication techniques of nanostructures, including cutting, bending and soldering of carbon nanotubes (CNTs), inside a field emission scanning electron microscope (FE-SEM) used for nanoassembly of nanostructures. The CNTs can be cut with electron beam assisted with oxygen gas. The cutting was developed for the bending of CNT, if some conditions of the cutting technique are changed. These include the increase of the acceleration voltage and/or setting the oxygen gas nozzle farther from the sample, and/or reducing the irradiation time. Using the proposed bending method angles larger than 90 degrees can be formed and the location of the kink can be set accurately. It is also shown that tungsten can be deposited on a substrate by the electron-beam-induced deposition, if the oxygen of the proposed cutting technique is replaced by W(CO)6. In this paper, these three nanofabrication methods were employed in the creation of a two dimensional (2D) nanostructure, the letters N and U, and a three dimensional (3D) nanostructure, the letter N. The 2D letters were constructed from 6 CNTs assembled on a substrate while the 3D letter N was bended from a single CNT and fixed to stand on a substrate. Based on the high performance of the proposed techniques, it is suggested that the cutting, bending, and soldering techniques inside SEM will become widely utilized in the fabrication and assembly of nanodevices and in the characterization of nanomaterials.

The Utility of Sentinel Node Biopsy for Sinonasal Melanoma.

PubMed

Oldenburg, Michael S; Price, Daniel L

2017-10-01

Objective  Report two positive sentinel node biopsies for sinonasal melanoma. Design  Retrospective review. Setting  Academic tertiary care center. Participants  Patients who underwent sentinel node biopsy for sinonasal melanoma between November 1, 2014 and November 1, 2015. Main Outcome Measures  Clinical course. Results  Two patients were identified. Patient 1 (83M) presented with a sinonasal melanoma anterior to the left inferior turbinate and was clinically N0 neck. Lymphoscintigraphy revealed two sentinel nodes in the ipsilateral and three in the contralateral cervical basins. The left level I sentinel node was positive for melanoma and lymphadenectomy showed no additional metastases. Patient 2 (71F) presented after incomplete resection of a sinonasal melanoma of the left posterior maxillary sinus wall and was clinically N0 neck. Lymphoscintigraphy with single-photon emission computed tomography (SPECT/CT) localization revealed one sentinel node in the parapharyngeal space and another in the ipsilateral cervical basin. Metastatic melanoma was found in both nodes and completion lymphadenectomy was negative for additional disease. Both patients developed distant metastasis in less than 1 year after surgical resection but responded well to adjuvant immunomodulatory chemotherapeutic agents. Conclusion  Sentinel node biopsy for sinonasal melanoma can provide crucial clinical evidence of regional metastasis prior to overt clinical signs and symptoms. This intraoperative tool has the potential to improve detection of regional metastasis and improve long-term outcomes of this aggressive malignancy.

A New Method for Setting Calculation Sequence of Directional Relay Protection in Multi-Loop Networks

NASA Astrophysics Data System (ADS)

Haijun, Xiong; Qi, Zhang

2016-08-01

Workload of relay protection setting calculation in multi-loop networks may be reduced effectively by optimization setting calculation sequences. A new method of setting calculation sequences of directional distance relay protection in multi-loop networks based on minimum broken nodes cost vector (MBNCV) was proposed to solve the problem experienced in current methods. Existing methods based on minimum breakpoint set (MBPS) lead to more break edges when untying the loops in dependent relationships of relays leading to possibly more iterative calculation workloads in setting calculations. A model driven approach based on behavior trees (BT) was presented to improve adaptability of similar problems. After extending the BT model by adding real-time system characters, timed BT was derived and the dependency relationship in multi-loop networks was then modeled. The model was translated into communication sequence process (CSP) models and an optimization setting calculation sequence in multi-loop networks was finally calculated by tools. A 5-nodes multi-loop network was applied as an example to demonstrate effectiveness of the modeling and calculation method. Several examples were then calculated with results indicating the method effectively reduces the number of forced broken edges for protection setting calculation in multi-loop networks.

Comparison of setting time measured using ultrasonic wave propagation with saw-cutting times on pavements.

DOT National Transportation Integrated Search

2015-10-01

At present, there is little fundamental guidance available to assist contractors in choosing when to schedule saw cuts on joints. To : conduct pavement finishing and sawing activities effectively, however, contractors need to know when a concrete mix...

Finding influential nodes for integration in brain networks using optimal percolation theory.

PubMed

Del Ferraro, Gino; Moreno, Andrea; Min, Byungjoon; Morone, Flaviano; Pérez-Ramírez, Úrsula; Pérez-Cervera, Laura; Parra, Lucas C; Holodny, Andrei; Canals, Santiago; Makse, Hernán A

2018-06-11

Global integration of information in the brain results from complex interactions of segregated brain networks. Identifying the most influential neuronal populations that efficiently bind these networks is a fundamental problem of systems neuroscience. Here, we apply optimal percolation theory and pharmacogenetic interventions in vivo to predict and subsequently target nodes that are essential for global integration of a memory network in rodents. The theory predicts that integration in the memory network is mediated by a set of low-degree nodes located in the nucleus accumbens. This result is confirmed with pharmacogenetic inactivation of the nucleus accumbens, which eliminates the formation of the memory network, while inactivations of other brain areas leave the network intact. Thus, optimal percolation theory predicts essential nodes in brain networks. This could be used to identify targets of interventions to modulate brain function.

Optimizing Hybrid Spreading in Metapopulations

PubMed Central

Zhang, Changwang; Zhou, Shi; Miller, Joel C.; Cox, Ingemar J.; Chain, Benjamin M.

2015-01-01

Epidemic spreading phenomena are ubiquitous in nature and society. Examples include the spreading of diseases, information, and computer viruses. Epidemics can spread by local spreading, where infected nodes can only infect a limited set of direct target nodes and global spreading, where an infected node can infect every other node. In reality, many epidemics spread using a hybrid mixture of both types of spreading. In this study we develop a theoretical framework for studying hybrid epidemics, and examine the optimum balance between spreading mechanisms in terms of achieving the maximum outbreak size. We show the existence of critically hybrid epidemics where neither spreading mechanism alone can cause a noticeable spread but a combination of the two spreading mechanisms would produce an enormous outbreak. Our results provide new strategies for maximising beneficial epidemics and estimating the worst outcome of damaging hybrid epidemics. PMID:25923411

Optimizing hybrid spreading in metapopulations.

PubMed

Zhang, Changwang; Zhou, Shi; Miller, Joel C; Cox, Ingemar J; Chain, Benjamin M

2015-04-29

Epidemic spreading phenomena are ubiquitous in nature and society. Examples include the spreading of diseases, information, and computer viruses. Epidemics can spread by local spreading, where infected nodes can only infect a limited set of direct target nodes and global spreading, where an infected node can infect every other node. In reality, many epidemics spread using a hybrid mixture of both types of spreading. In this study we develop a theoretical framework for studying hybrid epidemics, and examine the optimum balance between spreading mechanisms in terms of achieving the maximum outbreak size. We show the existence of critically hybrid epidemics where neither spreading mechanism alone can cause a noticeable spread but a combination of the two spreading mechanisms would produce an enormous outbreak. Our results provide new strategies for maximising beneficial epidemics and estimating the worst outcome of damaging hybrid epidemics.