Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Probability of axillary node involvement in patients with tubular carcinoma of the breast

The aim of this study was to investigate the frequency of axillary metastasis in women with tubular carcinoma (TC) of the breast. Women who underwent axillary dissection for TC in the Western Sydney area (1984-1995) were identified retrospectively through a search of computerized records. A centralized pathology review was performed and tumours were classified as pure tubular (22) or mixed tubular (nine), on the basis of the invasive component containing 90 per cent or more, or 75-90 per cent tubule formation respectively. A Medline search of the literature was undertaken to compile a collective series (20 studies with a total of 680 patients) to address the frequency of nodal involvement in TC. A quantitative meta-analysis was used to combine the results of these studies. The overall frequency of nodal metastasis was five of 31 (16 per cent); one of 22 pure tubular and four of nine mixed tumours (P = 0.019). None of the tumours with a diameter of 10 mm or less (n = 16) had nodal metastasis compared with five of 15 larger tumours (P = 0.018). The meta-analysis of 680 women showed an overall frequency of nodal metastasis in TC of 13.8 (95 per cent confidence interval 9.3-18.3) per cent. The frequency of nodal involvement was 6.6 (1.7-11.4) per cent in pure TC (n = 244) and 25.0 (12.5-37.6) per cent in mixed TC (n = 149). A case may be made for observing the clinically negative axilla in women with a small TC (10 mm or less in diameter).

Distribution of lymph nodes in the mesorectum: how deep is TME necessary?

Background Standardization of total mesorectal excision (TME) had a great impact on decreasing local recurrence rates for the treatment of rectal cancer. However, exact numbers and distribution of lymph nodes (LN) along the mesorectum remains controversial with some studies suggesting that few LNs are present in the distal third of the mesorectum. Methods Eighteen fresh cadavers without a history of rectal cancer were studied. The rectum was removed by TME and then was divided into right lateral, posterior and left lateral sides, which were further subdivided into 3 levels (upper, middle and lower). A pathologist determined the number and sizes of the LNs in each of the nine areas, b linded to their anatomical origin. Results Overall, the mesorectum had a mean of 5.7 LNs (SD=3.7) and on average each LN had a maximum diameter of 3.0 mm (SD=2.7). There was no association between the mean number or size of LNs with gender, BMI, or age. There was a significantly higher prevalence of LNs in the posterior location (2.8 per mesorectum) than in the two lateral locations (0.8 and 1.2 per mesorectum; p=0.02). The distribution of LNs in the three levels of the rectum was not significant. Conclusions The distribution of LNs reinforces the fact that TME should always include the distal third of the mesorectum. Care must be taken to not violate the posterior aspect of the mesorectum.

Antigen-presenting cells in draining lymph nodes of goats repeatedly infested by the Cayenne tick Amblyomma cajennense nymphs

Resistance to tick feeding has been previously shown to be an acquired, immunologically mediated phenomenon in goats, associated with cutaneous basophilia to nymphs of Amblyomma cajennense, the Cayenne tick, after repeated infestations. On the other hand, it is well known that antigen-presenting cells (APCs) play an important role in the host immune reaction to tick infestations. The most able APCs for Th cells are the well defined dendritic cells, mononuclear phagocytes and B-lymphocytes. Immunohistochemical analysis of draining lymph nodes of goats repeatedly infested with nymphs of the ixodid tick A. cajennense to search for APCs was done. Pre-scapular lymph nodes draining the tick attachment sites were collected 15 days after both the first and third infestations. Tick infestations resulted in increased number of CD21(+) B lymphocytes in lymph nodes after the tertiary infestation. However, the number of CD11b(+) and CD11c(+) cells were not altered after the successive infestations. Lower numbers of CD11c(+) cells had infiltrated lymph nodes responsible for draining the tick infested skin. These findings suggest that acquired immunity of goats against nymphs of A. cajennense is possibly established by B lymphocytes during the first infestation and that APCs may play a key role in this mechanism.

A Century of Change in Coral Reef Status in Southeast and Central Pacific: Polynesia Mana Node, Cook Islands, French Polynesia, Kiribati, Niue, Tokelau, Tonga, Wallis and Futuna

The Polynesia Mana Node of the southeast and central Pacific contains 7 independent or autonomous countries or territories with only 6,000 km2 of land on 347 islands, but surrounded by 12 million km2 of EEZ. These seas contain 13,000 km2 of coral reefs as the main natural ecosystem providing food resources and opportunities for development, especially for tourism and pearl culture for 500,000 inhabitants. During the 19th and first half of the 20th centuries, there was major exploitation by the colonial powers of mother-of-pearl oysters for the button industry, as well as guano, sandalwood and trepang. The Polynesian people were largely involved in a subsistence economy and all coral reefs and lagoons were healthy. During the last two decades of the 20th, all countries experienced rapid development and urbanization, rising populations, and some increased agriculture. These developments were limited to a few islands of each country (i.e. 15 islands amongst the 347) with resulting degradation of the coral reefs around these sites. The other islands remained mostly uninhabited and pristine, and continued with a subsistence economy. Generally, there was more damage to the coral reefs through natural events such as cyclones and coral bleaching, than by human activities. There is however, an urgent need to combat the threats on some islands from increased sedimentation, over-fishing, dredging and nutrient pollution.

Postoperative vaginal vault brachytherapy for node-negative Stage II (occult) endometrial carcinoma

Objective. The aim of this study is to look at the efficacy of extended surgical staging and postoperative vaginal vault brachytherapy in patients with Stage II (occult) endometrial carcinoma. Methods. Between January 1989 and December 1997, there were 30 patients with Stage II (occult) endometrial carcinoma who received postoperative vaginal vault brachytherapy as the only adjuvant treatment. The study group consisted of 15 of these patients who had extended surgical staging (including lymphadenectomy). Results. At a median follow-up of 36 months (range 17 to 113 months), there has been no recurrence. There were no major complications from surgery. Only 1 patient had mild rectal bleeding following vaginal vault brachytherapy and there were no grade 3 or 4 bowel toxicities. Conclusions. Extended surgical staging and postoperative vaginal vault brachytherapy for Stage II (occult) endometrial carcinoma is associated with minimal morbidity and excellent survival. (C) 2001 Academic Press.

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.

H-NAMe: specifying, implementing and testing a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This technical report tackles the hidden-node problem in WSNs and proposes HNAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this technical report will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol.

H-NAMe: a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This paper tackles the hiddennode problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this paper will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol

Node adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimization

Meshless methods are used for their capability of producing excellent solutions without requiring a mesh, avoiding mesh related problems encountered in other numerical methods, such as finite elements. However, node placement is still an open question, specially in strong form collocation meshless methods. The number of used nodes can have a big influence on matrix size and therefore produce ill-conditioned matrices. In order to optimize node position and number, a direct multisearch technique for multiobjective optimization is used to optimize node distribution in the global collocation method using radial basis functions. The optimization method is applied to the bending of isotropic simply supported plates. Using as a starting condition a uniformly distributed grid, results show that the method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution. (C) 2013 Elsevier Ltd. All rights reserved.

Scaling law in Saddle-node bifurcations for one-dimensional maps: A complex variable approach

The study of transient dynamical phenomena near bifurcation thresholds has attracted the interest of many researchers due to the relevance of bifurcations in different physical or biological systems. In the context of saddle-node bifurcations, where two or more fixed points collide annihilating each other, it is known that the dynamics can suffer the so-called delayed transition. This phenomenon emerges when the system spends a lot of time before reaching the remaining stable equilibrium, found after the bifurcation, because of the presence of a saddle-remnant in phase space. Some works have analytically tackled this phenomenon, especially in time-continuous dynamical systems, showing that the time delay, tau, scales according to an inverse square-root power law, tau similar to (mu-mu (c) )(-1/2), as the bifurcation parameter mu, is driven further away from its critical value, mu (c) . In this work, we first characterize analytically this scaling law using complex variable techniques for a family of one-dimensional maps, called the normal form for the saddle-node bifurcation. We then apply our general analytic results to a single-species ecological model with harvesting given by a unimodal map, characterizing the delayed transition and the scaling law arising due to the constant of harvesting. For both analyzed systems, we show that the numerical results are in perfect agreement with the analytical solutions we are providing. The procedure presented in this work can be used to characterize the scaling laws of one-dimensional discrete dynamical systems with saddle-node bifurcations.

Multiobjective optimization for node adaptation in the analysis of composite plates using a meshless collocation method

The bending of simply supported composite plates is analyzed using a direct collocation meshless numerical method. In order to optimize node distribution the Direct MultiSearch (DMS) for multi-objective optimization method is applied. In addition, the method optimizes the shape parameter in radial basis functions. The optimization algorithm was able to find good solutions for a large variety of nodes distribution.