Power graphs : a survey

This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.

Robust nonlinear distributed controller design for active and reactive power sharing in islanded microgrids

This paper presents a robust nonlinear distributed controller design for islanded operation of microgrids in order to maintain active and reactive power balance. In this paper, microgrids are considered as inverter-dominated networks integrated with renewable energy sources (RESs) and battery energy storage systems (BESSs), where solar photovoltaic generators act as RESs and plug-in hybrid electric vehicles as BESSs to supply power into the grid. The proposed controller is designed by using partial feedback linearization and the robustness of this control scheme is ensured by considering structured uncertainties within the RESs and BESSs. An approach for modeling the uncertainties through the satisfaction of matching conditions is also provided in this paper. The proposed distributed control scheme requires information from local and neighboring generators to communicate with each other and the communication among RESs, BESSs, and control centers is developed by using the concept of the graph theory. Finally, the performance of the proposed robust controller is demonstrated on a test microgrid and simulation results indicate the superiority of the proposed scheme under different operating conditions as compared to a linear-quadratic-regulator-based controller.

A new model to imitate the foraging behavior of Physarum polycephalum on a nutrient-poor substrate

Researches on Physarum polycephalum show that methods inspired by the primitive unicellular organism can construct an efficient network and solve some complex problems in graph theory. Current models simulating the intelligent behavior of Physarum are mainly based on Hagen-Poiseuille Law and Kirchhoff Law, reaction-diffusion, Cellular Automaton and multi-agent approach. In this paper, based on an assumption that the plasmodium of Physarum forages for food along the gradient of chemo-attractants on a nutrient-poor substrate, a new model is proposed to imitate its intelligent foraging behavior. The key point of the model is that the growth of Physarum is determined by the simple particle concentration field relating the distance to food source and the shape of food source on a nutrient-poor substrate. To verify this model, numerical experiments are conducted according to Adamatzky[U+05F3]s experiment. Results in spanning tree construction by this model are almost the same as those of Physarum and Oregonator model. The proposed model can also imitate Physarum to avoid repellents. Furthermore, the Euclidean Spanning tree built by this model is similar to its corresponding Minimal Euclidean Spanning tree.

Mapas cognitivos SODA ampliados: prescrição de um método para articular atitudes, comportamentos e seqüências cognitivas a mapas SODA

Este trabalho de tese tem por objetivo ampliar o alcance e aplicação de mapas SODA, preservando a metodologia originalmente desenvolvida. Inicialmente é realizada uma revisão do método, abordando de forma conjunta os artigos seminais, a teoria psicológica de Kelly e a teoria dos grafos; e ao final propomos uma identidade entre construtos de mapas SODA com os conhecimentos tácitos e explícitos, da gestão do conhecimento (KM). Essa sequencia introdutória é completada com uma visão de como os mapas SODA tem sido aplicado. No estágio seguinte o trabalho passa a analisar de forma crítica alguns pontos do método que dão margens a interpretações equivocadas. Sobre elas passamos a propor a aplicação de teorias, de diversos campos, tais como a teoria de means-end (Marketing), a teoria da atribuição e os conceitos de atitude (Psicologia), permitindo inferências que conduzem à proposição da primeira tese: mapas SODA são descritores de atitudes. O próximo estágio prossegue analisando criticamente o método, e foca no paradigma estabelecido por Eden, que não permite conferir ao método o status de descritor de comportamento. Propomos aqui uma mudança de paradigma, adotando a teoria da ação comunicativa, de Habermas, e sobre ela prescrevemos a teoria da ação e da escada da inferência (Action Science) e uma teoria da emoção (neuro ciência), o que permite novas inferências, que conduzem à proposição da segunda tese: mapas SODA podem descrever comportamentos. Essas teses servem de base para o alargamento de escopos do método SODA. É proposta aqui a utilização da teoria de máquinas de estado finito determinístico, designadas por autômato. Demonstramos um mapeamento entre autômato com mapas SODA, obtendo assim o autômato SODA, e sobre ele realizamos a última contribuição, uma proposta de mapas SODA hierárquicos, o que vem a possibilitar a descrição de sequencias de raciocínio, ordenando de forma determinística atitudes e comportamentos, de forma estruturada. A visão de como ela pode ser aplicada é realizada por meio de estudo de caso.

Mundos pequenos, produção acadêmica e grafos de colaboração: um estudo de caso dos Enanpads

Utilizando a base de dados dos trabalhos publicados nos Enanpads realizados em 2002-04, este artigo focaliza a área de administração da informação para realizar um estudo exploratório sobre a formação de padrões nas estruturas de disseminação do conhecimento acadêmico no Brasil, apoiado nos conceitos oriundos da análise das redes sociais e conjugados com a base proveniente da teoria dos grafos e em recursos computacionais. Procurou-se mapear os fluxos de informações que possibilitam as trocas de conhecimento através das ligações existentes no meio acadêmico. Os resultados indicam a necessidade de ampliar e estreitar os laços entre os autores, notadamente os que possuem algum grau de centralidade local, no intuito de obter o fortalecimento das instituições de ensino, de forma a quebrar as resistências à produção conjunta entre elas, em detrimento do padrão de reprodução endógena detectado.

Uma metodologia para modelagem e avaliação da dependabilidade de redes industriais sem fio

Ensuring the dependability requirements is essential for the industrial applications since faults may cause failures whose consequences result in economic losses, environmental damage or hurting people. Therefore, faced from the relevance of topic, this thesis proposes a methodology for the dependability evaluation of industrial wireless networks (WirelessHART, ISA100.11a, WIA-PA) on early design phase. However, the proposal can be easily adapted to maintenance and expansion stages of network. The proposal uses graph theory and fault tree formalism to create automatically an analytical model from a given wireless industrial network topology, where the dependability can be evaluated. The evaluation metrics supported are the reliability, availability, MTTF (mean time to failure), importance measures of devices, redundancy aspects and common cause failures. It must be emphasized that the proposal is independent of any tool to evaluate quantitatively the target metrics. However, due to validation issues it was used a tool widely accepted on academy for this purpose (SHARPE). In addition, an algorithm to generate the minimal cut sets, originally applied on graph theory, was adapted to fault tree formalism to guarantee the scalability of methodology in wireless industrial network environments (< 100 devices). Finally, the proposed methodology was validate from typical scenarios found in industrial environments, as star, line, cluster and mesh topologies. It was also evaluated scenarios with common cause failures and best practices to guide the design of an industrial wireless network. For guarantee scalability requirements, it was analyzed the performance of methodology in different scenarios where the results shown the applicability of proposal for networks typically found in industrial environments

Física estatística aplicada a sistemas sociais através do estudo de redes complexas

In this work a study of social networks based on analysis of family names is presented. A basic approach to the mathematical formalism of graphs is developed and then main theoretical models for complex networks are presented aiming to support the analysis of surnames networks models. These, in turn, are worked so as to be drawn leading quantities, such as aggregation coefficient, minimum average path length and connectivity distribution. Based on these quantities, it can be stated that surnames networks are an example of complex network, showing important features such as preferential attachment and small-world character

Anchor Areas to Improve Conservation and Increase Connectivity within the Brazilian "Mesopotamia of Biodiversity"

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

EthoSeq: A tool for phylogenetic analysis and data mining in behavioral sequences

This article introduces the software program called EthoSeq, which is designed to extract probabilistic behavioral sequences (tree-generated sequences, or TGSs) from observational data and to prepare a TGS-species matrix for phylogenetic analysis. The program uses Graph Theory algorithms to automatically detect behavioral patterns within the observational sessions. It includes filtering tools to adjust the search procedure to user-specified statistical needs. Preliminary analyses of data sets, such as grooming sequences in birds and foraging tactics in spiders, uncover a large number of TGSs which together yield single phylogenetic trees. An example of the use of the program is our analysis of felid grooming sequences, in which we have obtained 1,386 felid grooming TGSs for seven species, resulting in a single phylogeny. These results show that behavior is definitely useful in phylogenetic analysis. EthoSeq simplifies and automates such analyses, uncovers much of the hidden patterns of long behavioral sequences, and prepares this data for further analysis with standard phylogenetic programs. We hope it will encourage many empirical studies on the evolution of behavior.

Invariance for Impulsive Control Systems

In this article, we provide invariance conditions for control systems whose dynamics are given by measure driven differential inclusions. The solution concept plays a critical role in the extension of the conventional conditions for the impulsive control context. A couple of examples illustrating the specific features of impulsive control systems are included.