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.

Reconfiguração de redes de distribuição de energia elétrica através de um algoritmo de busca dispersa

Pós-graduação em Engenharia Elétrica - FEIS

Reconfiguration of radial electric power distribution system via a scatter search algorithm

In this paper, to solve the reconfiguration problem of radial distribution systems a scatter search, which is a metaheuristic-based algorithm, is proposed. In the codification process of this algorithm a structure called node-depth representation is used. It then, via the operators and from the electrical power system point of view, results finding only radial topologies. In order to show the effectiveness, usefulness, and the efficiency of the proposed method, a commonly used test system, 135-bus, and a practical system, a part of Sao Paulo state's distribution network, 7052 bus, are conducted. Results confirm the efficiency of the proposed algorithm that can find high quality solutions satisfying all the physical and operational constraints of the problem.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.

A New Fast Motion Estimation and Mode Decision algorithm for H.264 Depth Maps encoding in Free Viewpoint TV

In this paper, we consider a scenario where 3D scenes are modeled through a View+Depth representation. This representation is to be used at the rendering side to generate synthetic views for free viewpoint video. The encoding of both type of data (view and depth) is carried out using two H.264/AVC encoders. In this scenario we address the reduction of the encoding complexity of depth data. Firstly, an analysis of the Mode Decision and Motion Estimation processes has been conducted for both view and depth sequences, in order to capture the correlation between them. Taking advantage of this correlation, we propose a fast mode decision and motion estimation algorithm for the depth encoding. Results show that the proposed algorithm reduces the computational burden with a negligible loss in terms of quality of the rendered synthetic views. Quality measurements have been conducted using the Video Quality Metric.

Modularity and robustness of bone networks

Cortical bones, essential for mechanical support and structure in many animals, involve a large number of canals organized in intricate fashion. By using state-of-the art image analysis and computer graphics, the 3D reconstruction of a whole bone (phalange) of a young chicken was obtained and represented in terms of a complex network where each canal was associated to an edge and every confluence of three or more canals yielded a respective node. The representation of the bone canal structure as a complex network has allowed several methods to be applied in order to characterize and analyze the canal system organization and the robustness. First, the distribution of the node degrees (i.e. the number of canals connected to each node) confirmed previous indications that bone canal networks follow a power law, and therefore present some highly connected nodes (hubs). The bone network was also found to be partitioned into communities or modules, i.e. groups of nodes which are more intensely connected to one another than with the rest of the network. We verified that each community exhibited distinct topological properties that are possibly linked with their specific function. In order to better understand the organization of the bone network, its resilience to two types of failures (random attack and cascaded failures) was also quantified comparatively to randomized and regular counterparts. The results indicate that the modular structure improves the robustness of the bone network when compared to a regular network with the same average degree and number of nodes. The effects of disease processes (e. g., osteoporosis) and mutations in genes (e.g., BMP4) that occur at the molecular level can now be investigated at the mesoscopic level by using network based approaches.

Multi-objective evolutionary algorithm for single and multiple fault service restoration in large-scale distribution systems

Network reconfiguration for service restoration (SR) in distribution systems is a complex optimization problem. For large-scale distribution systems, it is computationally hard to find adequate SR plans in real time since the problem is combinatorial and non-linear, involving several constraints and objectives. Two Multi-Objective Evolutionary Algorithms that use Node-Depth Encoding (NDE) have proved able to efficiently generate adequate SR plans for large distribution systems: (i) one of them is the hybridization of the Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) with NDE, named NSGA-N; (ii) the other is a Multi-Objective Evolutionary Algorithm based on subpopulation tables that uses NDE, named MEAN. Further challenges are faced now, i.e. the design of SR plans for larger systems as good as those for relatively smaller ones and for multiple faults as good as those for one fault (single fault). In order to tackle both challenges, this paper proposes a method that results from the combination of NSGA-N, MEAN and a new heuristic. Such a heuristic focuses on the application of NDE operators to alarming network zones according to technical constraints. The method generates similar quality SR plans in distribution systems of significantly different sizes (from 3860 to 30,880 buses). Moreover, the number of switching operations required to implement the SR plans generated by the proposed method increases in a moderate way with the number of faults.

Three-dimensional mapping of real environments for cognitive robots navigation

Abstract The development of cognitive robots needs a strong “sensorial” support which should allow it to perceive the real world for interacting with it properly. Therefore the development of efficient visual-processing software to be equipped in effective artificial agents is a must. In this project we study and develop a visual-processing software that will work as the “eyes” of a cognitive robot. This software performs a three-dimensional mapping of the robot’s environment, providing it with the essential information required to make proper decisions during its navigation. Due to the complexity of this objective we have adopted the Scrum methodology in order to achieve an agile development process, which has allowed us to correct and improve in a fast way the successive versions of the product. The present project is structured in Sprints, which cover the different stages of the software development based on the requirements imposed by the robot and its real necessities. We have initially explored different commercial devices oriented to the acquisition of the required visual information, adopting the Kinect Sensor camera (Microsoft) as the most suitable option. Later on, we have studied the available software to manage the obtained visual information as well as its integration with the robot’s software, choosing the high-level platform Matlab as the common nexus to join the management of the camera, the management of the robot and the implementation of the behavioral algorithms. During the last stages the software has been developed to include the fundamental functionalities required to process the real environment, such as depth representation, segmentation, and clustering. Finally the software has been optimized to exhibit real-time processing and a suitable performance to fulfill the robot’s requirements during its operation in real situations.

D6.3 – Semantic Content Annotation Support

The Semantic Annotation component is a software application that provides support for automated text classification, a process grounded in a cohesion-centered representation of discourse that facilitates topic extraction. The component enables the semantic meta-annotation of text resources, including automated classification, thus facilitating information retrieval within the RAGE ecosystem. It is available in the ReaderBench framework (http://readerbench.com/) which integrates advanced Natural Language Processing (NLP) techniques. The component makes use of Cohesion Network Analysis (CNA) in order to ensure an in-depth representation of discourse, useful for mining keywords and performing automated text categorization. Our component automatically classifies documents into the categories provided by the ACM Computing Classification System (http://dl.acm.org/ccs_flat.cfm), but also into the categories from a high level serious games categorization provisionally developed by RAGE. English and French languages are already covered by the provided web service, whereas the entire framework can be extended in order to support additional languages.

Ontological representation of tumor-node-metastasis classification and an ontology-driven classifier: a study on colorectal cancer

Dissertação de mestrado integrado em Engenharia Biomédica (área de especialização em Informática Médica)

Menopausal status: a possible predictive factor for recurrence in women with cancer of the uterine cervix without pelvic lymph node metastasis

Abstract Objectives to evaluate risk factors for recurrence of carcinoma of the uterine cervix among women who had undergone radical hysterectomy without pelvic lymph node metastasis, while taking into consideration not only the classical histopathological factors but also sociodemographic, clinical and treatment-related factors. Study desin This was an exploratory analysis on 233 women with carcinoma of the uterine cervix (stages IB and IIA) who were treated by means of radical hysterectomy and pelvic lymphadenectomy, with free surgical margins and without lymph node metastases on conventional histopathological examination. Women with histologically normal lymph nodes but with micrometastases in the immunohistochemical analysis (AE1/AE3) were excluded. Disease-free survival for sociodemographic, clinical and histopathological variables was calculated using the Kaplan-Meier method. The Cox proportional hazards model was used to identify the independent risk factors for recurrence. Twenty-seven recurrences were recorded (11.6%), of which 18 were pelvic, four were distant, four were pelvic + distant and one was of unknown location. The five-year disease-free survival rate among the study population was 88.4%. The independent risk factors for recurrence in the multivariate analysis were: postmenopausal status (HR 14.1; 95% CI: 3.7-53.6; P < 0.001), absence of or slight inflammatory reaction (HR 7.9; 95% CI: 1.7-36.5; P = 0.008) and invasion of the deepest third of the cervix (HR 6.1; 95% CI: 1.3-29.1; P = 0.021). Postoperative radiotherapy was identified as a protective factor against recurrence (HR 0.02; 95% CI: 0.001-0.25; P = 0.003). (To continue) Postmenopausal status is a possible independent risk factor for recurrence even when adjusted for classical prognostic factors (such as tumour size, depth of tumour invasion, capillary embolisation) and treatment-related factors (period of treatment and postoperative radiotherapy status)

The interaction between N-category and N-ratio as a new tool to improve lymph node metastasis staging in gastric cancer: Results of a single cancer center in Brazil

Background: Depth of tumor invasion (T-category) and the number of metastatic lymph nodes (N-category) are the most important prognostic factors in patients with gastric cancer. Recently, the ratio between metastatic and dissected lymph nodes (N-ratio) has been established as one. The aim of this study is to evaluate the impact of N-ratio and its interaction with N-category as a prognostic factor in gastric cancer. Methods: This was a retrospective study in which we reviewed clinical and pathological data of 165 patients who had undergone curative surgery at our institution through a 9-year period. The exclusion criteria included metastases, gastric stump tumors and gastrectomy with less than 15 lymph nodes dissected. Results: The median age of the patients was 63 years and most of them were male. Total gastrectomy was the most common procedure and 92.1% of the patients had a D2-lymphadenectomy. Their 5-year overall survival was 57.7%. T-category, N-category, extended gastrectomy, and N-ratio were prognostic factors in overall and disease-free survival in accordance with univariate analysis. In accordance with TNM staging, N1 patients who have had NR1 had 5-year survival in 75.5% whereas in the NR2 group only 33% of the cases had 5-year survival. In the multivariate analysis, the interaction between N-category and N-ratio was an independent prognostic factor. Conclusion: Our findings confirmed the role of N-ratio as prognostic factor of survival in patients with gastric cancer surgically treated with at least 15 lymph nodes dissected. The relationship between N-category and N-ratio is a better predictor than lymph node metastasis staging. (C) 2010 Elsevier Ltd. All rights reserved.

A volumetric hybrid representation for obstacle detection in all-terrain robots

This dissertation presents an approach aimed at three-dimensional perception’s obstacle detection on all-terrain robots. Given the huge amount of acquired information, the adversities such environments present to an autonomous system and the swiftness, thus required, from each of its navigation decisions, it becomes imperative that the 3-D perceptional system to be able to map obstacles and passageways in the most swift and detailed manner. In this document, a hybrid approach is presented bringing the best of several methods together, combining the lightness of lesser meticulous analyses with the detail brought by more thorough ones. Realizing the former, a terrain’s slope mapping system upon a low resolute volumetric representation of the surrounding occupancy. For the latter’s detailed evaluation, two novel metrics were conceived to discriminate the little depth discrepancies found in between range scanner’s beam distance measurements. The hybrid solution resulting from the conjunction of these two representations provides a reliable answer to traversability mapping and a robust discrimination of penetrable vegetation from that constituting real obstructions. Two distinct robotic platforms offered the possibility to test the hybrid approach on very different applications: a boat, under an European project, the ECHORD Riverwatch, and a terrestrial four-wheeled robot for a national project, the Introsys Robot.

Monocular-based 3-D seafloor reconstruction and ortho-mosaicing by piecewise planar representation

Photo-mosaicing techniques have become popular for seafloor mapping in various marine science applications. However, the common methods cannot accurately map regions with high relief and topographical variations. Ortho-mosaicing borrowed from photogrammetry is an alternative technique that enables taking into account the 3-D shape of the terrain. A serious bottleneck is the volume of elevation information that needs to be estimated from the video data, fused, and processed for the generation of a composite ortho-photo that covers a relatively large seafloor area. We present a framework that combines the advantages of dense depth-map and 3-D feature estimation techniques based on visual motion cues. The main goal is to identify and reconstruct certain key terrain feature points that adequately represent the surface with minimal complexity in the form of piecewise planar patches. The proposed implementation utilizes local depth maps for feature selection, while tracking over several views enables 3-D reconstruction by bundle adjustment. Experimental results with synthetic and real data validate the effectiveness of the proposed approach

Symbolic meaning of local identity – A case study on Barcelona place brand representation

The core objective of this research process was to design an operational tool for place brand analysis. By modelling the emotional significance and the deeper-lying symbols associated to a specific place identity I expected to create a semiotic tool that could be applied, mutatis mutandis, on other similar place brands. As a field case study to develop the instrument, my choice of the research arena was Barcelona city, the capital of Catalonia Autonomous Community, Spain. Barcelona brand identity was approached in the line of the Chicago Urban Anthropology School. The research methods were designed according to the prescriptions of the urban anthropology, namely qualitative methods: in-depth interviews and discourse analysis. The final research outcome was a model summarizing a range of specific emotional values that support a place brand to position in the collective mindset and to assume a positively valued status and identity in the world order.