Central-Tapped Node Linked Modular Fault-Tolerance Topology for SRM Applications

Electric vehicles (EVs) and hybrid electric vehicles (HEVs) can reduce greenhouse gas emissions while switched reluctance motor (SRM) is one of the promising motor for such applications. This paper presents a novel SRM fault-diagnosis and fault-tolerance operation solution. Based on the traditional asymmetric half-bridge topology for the SRM driving, the central tapped winding of the SRM in modular half-bridge configuration are introduced to provide fault-diagnosis and fault-tolerance functions, which are set idle in normal conditions. The fault diagnosis can be achieved by detecting the characteristic of the excitation and demagnetization currents. An SRM fault-tolerance operation strategy is also realized by the proposed topology, which compensates for the missing phase torque under the open-circuit fault, and reduces the unbalanced phase current under the short-circuit fault due to the uncontrolled faulty phase. Furthermore, the current sensor placement strategy is also discussed to give two placement methods for low cost or modular structure. Simulation results in MATLAB/Simulink and experiments on a 750-W SRM validate the effectiveness of the proposed strategy, which may have significant implications and improve the reliability of EVs/HEVs.

What is the role of the cell adhesion protein N-cadherin in the molecular and morphological asymmetries of the Hensen’s node

Tese de doutoramento, Ciências Biomédicas (Ciências Morfológicas), Universidade de Lisboa, Faculdade de Medicina, 2014

Improving quality-of-service in wireless sensor networks by mitigating “Hidden-Node Collisions”

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.

Hematopoiesis in the Drosophila larva: beyond the lymph gland

All coelomate animals possess a population of cells that do not make part of an organ and instead freely flow inside the body cavity. These cells, termed hemocytes (in invertebrates) or blood cells (in vertebrates), are involved in varied functions including immune response, clearance of apoptotic cells and distribution of nutrient and gases (Grigorian & Hartenstein 2013).(...)

Could concomitant radio-chemotherapy improve the outcomes of early-stage node negative anal canal cancer patients? A retrospective analysis of 122 patients.

One hundred twenty-two early-stage anal canal cancer patients (median age: 69 years) were treated with curative radiotherapy with (70 patients) or without (52 patients) concomitant chemotherapy. Median follow-up was 65 months (range: 4-238). At multivariate analysis, concomitant chemotherapy significantly improved local control (p = .007). Local control significantly influenced all considered endpoints, except the metastases free survival. The global rates of G3-G4 acute and late toxicity were 13.1% and 8.2%, respectively, and they were not increased by concomitant chemotherapy. Finally, concomitant chemotherapy is efficacious and safe in the treatment of T1-2N0 anal canal cancer patients and should be prospectively studied.

The role of molecular, clinical and socioeconomic factors in the long-term survival of axillary node negative breast cancer patients

The overall objective of this study was to investigate factors associated with long-term survival in axillary node negative (ANN) breast cancer patients. Clinical and biological factors included stage, histopathologic grade, p53 mutation, Her-2/neu amplification, estrogen receptor status (ER), progesterone receptor status (PR) and vascular invasion. Census derived socioeconomic (SES) indicators included median individual and household income, proportions of university educated individuals, housing type, "incidence" of low income and an indicator of living in an affluent neighbourhood. The effects of these measures on breast cancer-specific survival and competing cause survival were investigated. A cohort study examining survival among axillary node negative (ANN) breast cancer patients in the greater Toronto area commenced in 1 989. Patients were followed up until death, lost-to-follow up or study termination in 2004. Data were collected from several sources measuring patient demographics, clinical factors, treatment, recurrence of disease and survival. Census level SES data were collected using census geo-coding of patient addresses' at the time of diagnosis. Additional survival data were acquired from the Ontario Cancer Registry to enhance and extend the observation period of the study. Survival patterns were examined using KaplanMeier and life table procedures. Associations were examined using log-rank and Wilcoxon tests of univariate significance. Multivariate survival analyses were perfonned using Cox proportional hazards models. Analyses were stratified into less than and greater than 5 year survival periods to observe whether known markers of short-tenn survival were also associated with reductions in long-tenn survival among breast cancer patients. The 15 year survival probabilities in this cohort were: for breast cancerspecific survival 0.88, competing causes survival 0.89 and for overall survival 0.78. Estrogen receptor (ER) and progesterone receptor (PR) status (Hazard Ratio (HR) ERIPR- versus ER+/PR+, 8.15,95% CI, 4.74, 14.00), p53 mutation (HR, 3.88, 95% CI, 2.00, 7.53) and Her-2 amplification (HR, 2.66, 95% CI, 1.36, 5.19) were associated with significant reductions in short-tenn breast cancer-specific survival «5 years following diagnosis), however, not with long-term survival in univariate analyses. Stage, histopathologic grade and ERiPR status were the clinicallbiologieal factors that were associated with short-term breast cancer specific survival in multivariate results. Living in an affluent neighbourhood (top quintile of median household income compared to the rest of the population) was associated with the largest significant increase in long-tenn breast cancer-specific survival after adjustment for stage, histopathologic grade and treatment (HR, 0.36, 95% CI, 0.12, 0.89).

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

Routing protocol enhancement for handling node mobility in wireless sensor networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Performance improvement of multiple Connections in AODV with the concern of Node bandwidth

Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central coordination. In MANET, node mobility and dynamic topology play an important role in the performance. MANET provide a solution for network connection at anywhere and at any time. The major features of MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in the network. Several issues have been identified. The bandwidth is recognized as the prominent factor reducing the performance of the network. This paper gives an improvement of normal AODV for simultaneous multiple connections under the consideration of bandwidth of node.

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

RMAC-M: Extending the R-MAC Protocol for an Energy Efficient, Delay Tolerant Underwater Acoustic Sensor Network application with a mobile data mule node

One of the major applications of underwater acoustic sensor networks (UWASN) is ocean environment monitoring. Employing data mules is an energy efficient way of data collection from the underwater sensor nodes in such a network. A data mule node such as an autonomous underwater vehicle (AUV) periodically visits the stationary nodes to download data. By conserving the power required for data transmission over long distances to a remote data sink, this approach extends the network life time. In this paper we propose a new MAC protocol to support a single mobile data mule node to collect the data sensed by the sensor nodes in periodic runs through the network. In this approach, the nodes need to perform only short distance, single hop transmission to the data mule. The protocol design discussed in this paper is motivated to support such an application. The proposed protocol is a hybrid protocol, which employs a combination of schedule based access among the stationary nodes along with handshake based access to support mobile data mules. The new protocol, RMAC-M is developed as an extension to the energy efficient MAC protocol R-MAC by extending the slot time of R-MAC to include a contention part for a hand shake based data transfer. The mobile node makes use of a beacon to signal its presence to all the nearby nodes, which can then hand-shake with the mobile node for data transfer. Simulation results show that the new protocol provides efficient support for a mobile data mule node while preserving the advantages of R-MAC such as energy efficiency and fairness.

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Impact of Node Mobility on Routing Protocols for Wireless Sensor Networks

Wireless sensor networks monitor their surrounding environment for the occurrence of some anticipated phenomenon. Most of the research related to sensor networks considers the static deployment of sensor nodes. Mobility of sensor node can be considered as an extra dimension of complexity, which poses interesting and challenging problems. Node mobility is a very important aspect in the design of effective routing algorithm for mobile wireless networks. In this work we intent to present the impact of different mobility models on the performance of the wireless sensor networks. Routing characteristics of various routing protocols for ad-hoc network were studied considering different mobility models. Performance metrics such as end-to-end delay, throughput and routing load were considered and their variations in the case of mobility models like Freeway, RPGM were studied. This work will be useful to figure out the characteristics of routing protocols depending on the mobility patterns of sensors