Sentinel node biopsy in breast cancer: results in a large series

Sentinel lymph node biopsy (SLNB) is an appropriate method for the evaluation of axillary status in cases of early breast cancer. We report our experience in treating cases evaluated using SLNB. We analyzed a total of 1192 cases assessed by means of SLNB from July 1999 to December 2007. SLNB processing was successfully completed in 1154 cases with the use of blue dye or radiolabeled 99mTc-Dextran-500, or both. Of these 1154 patients, 857 were N0(i-) (no regional lymph node metastasis, negative immunohistochemistry, IHC), 96 were N0(i+) (no regional lymph node metastasis histologically, positive IHC, no IHC cluster greater than 0.2 mm) and 201 were N1mi (greater than 0.2 mm, none greater than 2.0 mm). Most of the tumors (70%) were invasive ductal carcinomas and tumors were staged as T1 in 770 patients (65%). A total of 274 patients underwent SLNB and axillary dissections up to April 2003. The inclusion criteria were tumor size equal to or less than 3 cm in diameter, no clinically palpable axillary lymph nodes, no neoadjuvant therapy. In 19 cases, the SLN could not be identified intraoperatively. A false-negative rate of 11% and a negative predictive value of 88.2% were obtained for the 255 assessable patients. The overall concordance between SLNB and axillary lymph node status was 92%. SLNB sensitivity for nodes was 81% and specificity was 100%. The higher sensitivity, specificity, accuracy, and lower false-negative rates of SLNB suggest that this method may be an appropriate alternative to total axillary dissection in early breast cancer patients.

Typical and atypical enteropathogenic Escherichia coli bacterial translocation associated with tissue hypoperfusion in rats

Although enteropathogenic Escherichia coli (EPEC) are well-recognized diarrheal agents, their ability to translocate and cause extraintestinal alterations is not known. We investigated whether a typical EPEC (tEPEC) and an atypical EPEC (aEPEC) strain translocate and cause microcirculation injury under conditions of intestinal bacterial overgrowth. Bacterial translocation (BT) was induced in female Wistar-EPM rats (200-250 g) by oroduodenal catheterization and inoculation of 10 mL 10(10) colony forming unit (CFU)/mL, with the bacteria being confined between the duodenum and ileum with ligatures. After 2 h, mesenteric lymph nodes (MLN), liver and spleen were cultured for translocated bacteria and BT-related microcirculation changes were monitored in mesenteric and abdominal organs by intravital microscopy and laser Doppler flow, respectively. tEPEC (N = 11) and aEPEC (N = 11) were recovered from MLN (100%), spleen (36.4 and 45.5%), and liver (45.5 and 72.7%) of the animals, respectively. Recovery of the positive control E. coli R-6 (N = 6) was 100% for all compartments. Bacteria were not recovered from extraintestinal sites of controls inoculated with non-pathogenic E. coli strains HB101 (N = 6) and HS (N = 10), or saline. Mesenteric microcirculation injuries were detected with both EPEC strains, but only aEPEC was similar to E. coli R-6 with regard to systemic tissue hypoperfusion. In conclusion, overgrowth of certain aEPEC strains may lead to BT and impairment of the microcirculation in systemic organs.

Transduction motif analysis of gastric cancer based on a human signaling network

To investigate signal regulation models of gastric cancer, databases and literature were used to construct the signaling network in humans. Topological characteristics of the network were analyzed by CytoScape. After marking gastric cancer-related genes extracted from the CancerResource, GeneRIF, and COSMIC databases, the FANMOD software was used for the mining of gastric cancer-related motifs in a network with three vertices. The significant motif difference method was adopted to identify significantly different motifs in the normal and cancer states. Finally, we conducted a series of analyses of the significantly different motifs, including gene ontology, function annotation of genes, and model classification. A human signaling network was constructed, with 1643 nodes and 5089 regulating interactions. The network was configured to have the characteristics of other biological networks. There were 57,942 motifs marked with gastric cancer-related genes out of a total of 69,492 motifs, and 264 motifs were selected as significantly different motifs by calculating the significant motif difference (SMD) scores. Genes in significantly different motifs were mainly enriched in functions associated with cancer genesis, such as regulation of cell death, amino acid phosphorylation of proteins, and intracellular signaling cascades. The top five significantly different motifs were mainly cascade and positive feedback types. Almost all genes in the five motifs were cancer related, including EPOR,MAPK14, BCL2L1, KRT18,PTPN6, CASP3, TGFBR2,AR, and CASP7. The development of cancer might be curbed by inhibiting signal transductions upstream and downstream of the selected motifs.

Benchmark of routing protocols regarding green considerations

In Mobile Ad-hoc Networks (MANET) the participating nodes have several roles such as sender, receiver and router. Hence there is a lot of energy consumed by the nodes for the normal working of the network since each node has many different roles. Also in MANET the nodes keep moving constantly and this in turn consumes a lot of energy. Since battery capacity of these nodes is limited it fails to fulfil the high demand of energy. The scarcity of energy makes the energy conservation in mobile ad-hoc networks an important concern. There is several research carried out on the energy consumption of mobile ad-hoc networks these days. Some of this research suggests sleep mode, transmission power control, load balancing etc. In this thesis, we are comparing various proposed energy efficient models for some of the ad-hoc protocols. We compare different energy efficient models for Optimised Linked State Algorithm (OLSR) and Ad-hoc On Demand Distance Vector (AODV). The routing protocols are compared for different parameters such as average remaining energy, number of nodes alive, payload data received and performance with different mobility speed. The simulation results helps in benchmarking the various energy efficient routing models for OLSR and AODV protocols. The benchmarking of the routing protocols can be based on many factors but this thesis concentrates on benchmarking the MANET routing protocols mainly based on the energy efficiency and increased network lifetime.

Embedded Service Bus for Internet of Things Interoperability

Internet of Things (IoT) technologies are developing rapidly, and therefore there exist several standards of interconnection protocols and platforms. The existence of heterogeneous protocols and platforms has become a critical challenge for IoT system developers. To mitigate this challenge, few alliances and organizations have taken the initiative to build a framework that helps to integrate application silos. Some of these frameworks focus only on a specific domain like home automation. However, the resource constraints in the large proportion of connected devices make it difficult to build an interoperable system using such frameworks. Therefore, a general purpose, lightweight interoperability framework that can be used for a range of devices is required. To tackle the heterogeneous nature, this work introduces an embedded, distributed and lightweight service bus, Lightweight IoT Service bus Architecture (LISA), which fits inside the network stack of a small real-time operating system for constrained nodes. LISA provides a uniform application programming interface for an IoT system on a range of devices with variable resource constraints. It hides platform and protocol variations underneath it, thus facilitating interoperability in IoT implementations. LISA is inspired by the Network on Terminal Architecture, a service centric open architecture by Nokia Research Center. Unlike many other interoperability frameworks, LISA is designed specifically for resource constrained nodes and it provides essential features of a service bus for easy service oriented architecture implementation. The presented architecture utilizes an intermediate computing layer, a Fog layer, between the small nodes and the cloud, thereby facilitating the federation of constrained nodes into subnetworks. As a result of a modular and distributed design, the part of LISA running in the Fog layer handles the heavy lifting to assist the lightweight portion of LISA inside the resource constrained nodes. Furthermore, LISA introduces a new networking paradigm, Node Centric Networking, to route messages across protocol boundaries to facilitate interoperability. This thesis presents a concept implementation of the architecture and creates a foundation for future extension towards a comprehensive interoperability framework for IoT.

Proximity Based Authentication in IoT

IoT consists of essentially thousands of tiny sensor nodes interconnected to the internet, each one of which executes the programmed functions under memory and power limita- tions. The sensor nodes are distributed mainly for gathering data in various situations. IoT envisions the future technologies such as e-health, smart city, auto-mobiles automa- tion, construction sites automation, and smart home. Secure communication of data under memory and energy constraints is major challenge in IoT. Authentication is the first and important phase of secure communication. This study presents a protocol to authenticate resource constraint devices in physical proximity by solely using the shared wireless communication interfaces. This model of authentication only relies on the abundance of ambient radio signals to authenticate in less than a second. To evaluate the designed protocol, SkyMotes are emulated in a network environment simulated by Contiki/COOJA. Results presented during this study proves that this approach is immune against passive and active attacks. An adversary located as near as two meters can be identified in less than a second with minimal expense of energy. Since, only radio device is used as required hardware for the authentication, this technique is scalable and interoperable to heterogeneous nature of IoT.

Phylogenetic Analysis of Avidins and Expression of Novel Avidins from Lactrodectus hesperus and Hoeflea phototrophica

Avidins (Avds) are homotetrameric or homodimeric glycoproteins with typically less than 130 amino acid residues per monomer. They form a highly stable, non-covalent complex with biotin (vitamin H) with Kd = 10-15 M (for chicken Avd). The best-studied Avds are the chicken Avd from Gallus gallus and streptavidin from Streptomyces avidinii, although other Avd studies have also included Avds from various origins, e.g., from frogs, fishes, mushrooms and from many different bacteria. Several engineered Avds have been reported as well, e.g., dual-chain Avds (dcAvds) and single-chain Avds (scAvds), circular permutants with up to four simultaneously modifiable ligand-binding sites. These engineered Avds along with the many native Avds have potential to be used in various nanobiotechnological applications. In this study, we made a structure-based alignment representing all currently available sequences of Avds and studied the evolutionary relationship of Avds using phylogenetic analysis. First, we created an initial multiple sequence alignment of Avds using 42 closely related sequences, guided by the known Avd crystal structures. Next, we searched for non-redundant Avd sequences from various online databases, including National Centre for Biotechnology Information and the Universal Protein Resource; the identified sequences were added to the initial alignment to expand it to a final alignment of 242 Avd sequences. The MEGA software package was used to create distance matrices and a phylogenetic tree. Bootstrap reproducibility of the tree was poor at multiple nodes and may reflect on several possible issues with the data: the sequence length compared is relatively short and, whereas some positions are highly conserved and functional, others can vary without impinging on the structure or the function, so there are few informative sites; it may be that periods of rapid duplication have led to paralogs and that the differences among them are within the error limit of the data; and there may be other yet unknown reasons. Principle component analysis applied to alternative distance data did segregate the major groups, and success is likely due to the multivariate consideration of all the information. Furthermore, based on our extensive alignment and phylogenetic analysis, we expressed two novel Avds, lacavidin from Lactrodectus Hesperus, a western black widow spider, and hoefavidin from Hoeflea phototrophica, an aerobic marine bacterium, the ultimate aim being to determine their X-ray structures. These Avds were selected because of their unique sequences: lacavidin has an N-terminal Avd-like domain but a long C-terminal overhang, whereas hoefavidin was thought to be a dimeric Avd. Both these Avds could be used as novel scaffolds in biotechnological applications.

Relay protection in active distribution networks

Increasingly growing share of distributed generation in the whole electrical power system’s generating system is currently a worldwide tendency, driven by several factors, encircling mainly difficulties in refinement of megalopolises’ distribution networks and its maintenance; widening environmental concerns adding to both energy efficiency approaches and installation of renewable sources based generation, inherently distributed; increased power quality and reliability needs; progress in IT field, making implementable harmonization of needs and interests of different-energy-type generators and consumers. At this stage, the volume, formed by system-interconnected distributed generation facilities, have reached the level of causing broad impact toward system operation under emergency and post-emergency conditions in several EU countries, thus previously implementable approach of their preliminary tripping in case of a fault, preventing generating equipment damage and disoperation of relay protection and automation, is not applicable any more. Adding to the preceding, withstand capability and transient electromechanical stability of generating technologies, interconnecting in proximity of load nodes, enhanced significantly since the moment Low Voltage Ride-Through regulations, followed by techniques, were introduced in Grid Codes. Both aspects leads to relay protection and auto-reclosing operation in presence of distributed generation generally connected after grid planning and construction phases. This paper proposes solutions to the emerging need to ensure correct operation of the equipment in question with least possible grid refinements, distinctively for every type of distributed generation technology achieved its technical maturity to date and network’s protection. New generating technologies are equivalented from the perspective of representation in calculation of initial steady-state short-circuit current used to dimension current-sensing relay protection, and widely adopted short-circuit calculation practices, as IEC 60909 and VDE 0102. The phenomenon of unintentional islanding, influencing auto-reclosing, is addressed, and protection schemes used to eliminate an sustained island are listed and characterized by reliability and implementation related factors, whereas also forming a crucial aspect of realization of the proposed protection operation relieving measures.

Quadtree representation and compression of spatial data

Spatial data representation and compression has become a focus issue in computer graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing on the principle of recursive decomposition of space, always offer a compact and efficient representation of an image. For a given image, the choice of quadtree root node plays an important role in its quadtree representation and final data compression. The goal of this thesis is to present a heuristic algorithm for finding a root node of a region quadtree, which is able to reduce the number of leaf nodes when compared with the standard quadtree decomposition. The empirical results indicate that, this proposed algorithm has quadtree representation and data compression improvement when in comparison with the traditional method.

Using genetic algorithms for the single allocation hub location problem

Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

In this thesis we are going to analyze the dictionary graphs and some other kinds of graphs using the PagerRank algorithm. We calculated the correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial social and random graphs. We found that when we omitted some random nodes from each of the graphs, we have not noticed any significant changes in the ranking of the nodes according to their PageRank. We also discovered that some social graphs selected for our study were less resistant to the changes of PageRank.

Factors Associated with Small Aggressive Non-Small Cell Lung Carcinomas

Small aggressive non-small cell lung carcinomas (SA-NSCLC) are characterized by spread to distant lymph nodes and metastases, even while the primary tumour remains small in size, as opposed to tumours that are relatively large before cancer progression. These small aggressive cancers present a challenge for clinical diagnosis and screening, carry grave prognosis, and may benefit from using a targeted approach to identify high-risk individuals. The objectives of this thesis were to identify factors associated with SA-NSCLC, and compare survivorship of stage IV SA-NSCLC to large stage IV NSCLC. Logistic and Cox regression analysis were performed using data from the National Lung Screening Trial (NLST). Model building was guided by knowledge of lung carcinogenesis and lung cancer prognostic factors. Previous diagnosis of emphysema and positive family history of lung cancer in females were associated with increased risk of SA-NSCLC among adenocarcinomas. Despite overall poor prognosis, SA-NSCLC have a better prognosis compared to large stage IV NSCLC.

Disease-Gene Association Using Genetic Programming

As a result of mutation in genes, which is a simple change in our DNA, we will have undesirable phenotypes which are known as genetic diseases or disorders. These small changes, which happen frequently, can have extreme results. Understanding and identifying these changes and associating these mutated genes with genetic diseases can play an important role in our health, by making us able to find better diagnosis and therapeutic strategies for these genetic diseases. As a result of years of experiments, there is a vast amount of data regarding human genome and different genetic diseases that they still need to be processed properly to extract useful information. This work is an effort to analyze some useful datasets and to apply different techniques to associate genes with genetic diseases. Two genetic diseases were studied here: Parkinson’s disease and breast cancer. Using genetic programming, we analyzed the complex network around known disease genes of the aforementioned diseases, and based on that we generated a ranking for genes, based on their relevance to these diseases. In order to generate these rankings, centrality measures of all nodes in the complex network surrounding the known disease genes of the given genetic disease were calculated. Using genetic programming, all the nodes were assigned scores based on the similarity of their centrality measures to those of the known disease genes. Obtained results showed that this method is successful at finding these patterns in centrality measures and the highly ranked genes are worthy as good candidate disease genes for being studied. Using standard benchmark tests, we tested our approach against ENDEAVOUR and CIPHER - two well known disease gene ranking frameworks - and we obtained comparable results.

Community Detection in Multi-Layer Networks

In the scope of the current thesis we review and analyse networks that are formed by nodes with several attributes. We suppose that different layers of communities are embedded in such networks, besides each of the layers is connected with nodes' attributes. For example, examine one of a variety of online social networks: an user participates in a plurality of different groups/communities – schoolfellows, colleagues, clients, etc. We introduce a detection algorithm for the above-mentioned communities. Normally the result of the detection is the community supplemented just by the most dominant attribute, disregarding others. We propose an algorithm that bypasses dominant communities and detects communities which are formed by other nodes' attributes. We also review formation models of the attributed networks and present a Human Communication Network (HCN) model. We introduce a High School Texting Network (HSTN) and examine our methods for that network.