The interdependence of continental warm cloud properties derived from unexploited solar background signals in ground-based lidar measurements

We have extensively analysed the interdependence between cloud optical depth, droplet effective radius, liquid water path (LWP) and geometric thickness for stratiform warm clouds using ground-based observations. In particular, this analysis uses cloud optical depths retrieved from untapped solar background signals that are previously unwanted and need to be removed in most lidar applications. Combining these new optical depth retrievals with radar and microwave observations at the Atmospheric Radiation Measurement (ARM) Climate Research Facility in Oklahoma during 2005–2007, we have found that LWP and geometric thickness increase and follow a power-law relationship with cloud optical depth regardless of the presence of drizzle; LWP and geometric thickness in drizzling clouds can be generally 20–40 % and at least 10 % higher than those in non-drizzling clouds, respectively. In contrast, droplet effective radius shows a negative correlation with optical depth in drizzling clouds and a positive correlation in non-drizzling clouds, where, for large optical depths, it asymptotes to 10 μm. This asymptotic behaviour in non-drizzling clouds is found in both the droplet effective radius and optical depth, making it possible to use simple thresholds of optical depth, droplet size, or a combination of these two variables for drizzle delineation. This paper demonstrates a new way to enhance ground-based cloud observations and drizzle delineations using existing lidar networks.

Characterizing topological and dynamical properties of complex networks without border effects

The properties of complex networks are highly Influenced by border effects frequently found as a consequence of the finite nature of real-world networks as well as network Sampling Therefore, it becomes critical to devise effective means for sound estimation of net work topological and dynamical properties will le avoiding these types of artifacts. In the current work, an algorithm for minimization of border effects is proposed and discussed, and its potential IS Illustrated with respect to two real-world networks. namely bone canals and air transportation (C) 2009 Elsevier B.V. All rights reserved.

Integração de redes GNSS: uma proposta metodológica de densificação da rede SIRGAS na América do Sul

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

Evaluating distributed generation impacts with a multiobjective index

Evaluating the technical impacts associated with connecting distributed generation to distribution networks is a complex activity requiring a wide range of network operational and security effects to be qualified and quantified. One means of dealing with such complexity is through the use of indices that indicate the benefit or otherwise of connections at a given location and which could be used to shape the nature of the contract between the utility and distributed generator. This paper presents a multiobjective performance index for distribution networks with distributed generation which considers a wide range of technical issues. Distributed generation is extensively located and sized within the IEEE-34 test feeder, wherein the multiobjective performance index is computed for each configuration. The results are presented and discussed.

Evaluating distributed time-varying generation through a multiobjective index

In the last decade, distributed generation, with its various technologies, has increased its presence in the energy mix presenting distribution networks with challenges in terms of evaluating the technical impacts that require a wide range of network operational effects to be qualified and quantified. The inherent time-varying behavior of demand and distributed generation (particularly when renewable sources are used), need to be taken into account since considering critical scenarios of loading and generation may mask the impacts. One means of dealing with such complexity is through the use of indices that indicate the benefit or otherwise of connections at a given location and for a given horizon. This paper presents a multiobjective performance index for distribution networks with time-varying distributed generation which consider a number of technical issues. The approach has been applied to a medium voltage distribution network considering hourly demand and wind speeds. Results show that this proposal has a better response to the natural behavior of loads and generation than solely considering a single operation scenario.

A novel single-phase hpf hybrid rectifier suitable for front-end trolleybus systems

This paper proposal presents the development and the experimental analysis of a new single-phase hybrid rectifier structure with high power factor (PF) and low harmonic distortion of current (THDI), suitable for application in traction systems of electrical vehicles pulled by electrical motors (trolleybus), which are powered by urban distribution network. This front-end rectifier structure is capable of providing significant improvements in trolleybuses systems and in the urban distribution network costs, and efficiency. The proposed structure is composed by an ordinary single-phase diode rectifier with parallel connection of a switched converter. It is outlined that the switched converter is capable of composing the input line current waveform assuring high power factor (HPF) and low THDI, as well as ordinary front-end converter. However, the power rating of the switched converter is about 34% of the total output power, assuring robustness and reliability. Therefore, the proposed structure was named single-phase HPF hybrid rectifier. A prototype rated at 15kW was developed and analyzed in laboratory. It was found that the input line current harmonic spectrum is in accordance with the harmonic limits imposed by IEC61000-3-4. The principle of operation, the mathematical analysis, the PWM control strategy, and experimental results of a 15kW prototype are also presented in this paper. © 2009 IEEE.

Traffic flow breakdown prediction using feature reduction through Rough-Neuro fuzzy Networks

The prediction of the traffic behavior could help to make decision about the routing process, as well as enables gains on effectiveness and productivity on the physical distribution. This need motivated the search for technological improvements in the Routing performance in metropolitan areas. The purpose of this paper is to present computational evidences that Artificial Neural Network ANN could be use to predict the traffic behavior in a metropolitan area such So Paulo (around 16 million inhabitants). The proposed methodology involves the application of Rough-Fuzzy Sets to define inference morphology for insertion of the behavior of Dynamic Routing into a structured rule basis, without human expert aid. The dynamics of the traffic parameters are described through membership functions. Rough Sets Theory identifies the attributes that are important, and suggest Fuzzy relations to be inserted on a Rough Neuro Fuzzy Network (RNFN) type Multilayer Perceptron (MLP) and type Radial Basis Function (RBF), in order to get an optimal surface response. To measure the performance of the proposed RNFN, the responses of the unreduced rule basis are compared with the reduced rule one. The results show that by making use of the Feature Reduction through RNFN, it is possible to reduce the need for human expert in the construction of the Fuzzy inference mechanism in such flow process like traffic breakdown. © 2011 IEEE.

Metodologia para análise e interpretação de alarmes em tempo real de sistemas de distribuição de energia elétrica

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Ecologia da paisagem para avaliação da idoneidade de redes ecológicas, como subsídio para o planejamento territorial

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

Optical Components for WDM Lightwave Networks

Recently, there has been growing interest in developing optical fiber networks to support the increasing bandwidth demands of multimedia applications, such as video conferencing and World Wide Web browsing. One technique for accessing the huge bandwidth available in an optical fiber is wavelength-division multiplexing (WDM). Under WDM, the optical fiber bandwidth is divided into a number of nonoverlapping wavelength bands, each of which may be accessed at peak electronic rates by an end user. By utilizing WDM in optical networks, we can achieve link capacities on the order of 50 THz. The success of WDM networks depends heavily on the available optical device technology. This paper is intended as a tutorial on some of the optical device issues in WDM networks. It discusses the basic principles of optical transmission in fiber and reviews the current state of the art in optical device technology. It introduces some of the basic components in WDM networks, discusses various implementations of these components, and provides insights into their capabilities and limitations. Then, this paper demonstrates how various optical components can be incorporated into WDM optical networks for both local and wide-area applications. Last, the paper provides a brief review of experimental WDM networks that have been implemented.

Routing and Wavelength Assignment (RWA) with Power Considerations In All- Optical Wavelength-Routed Networks

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

Using complex networks concepts to assess approaches for citations in scientific papers

The number of citations received by authors in scientific journals has become a major parameter to assess individual researchers and the journals themselves through the impact factor. A fair assessment therefore requires that the criteria for selecting references in a given manuscript should be unbiased with regard to the authors or journals cited. In this paper, we assess approaches for citations considering two recommendations for authors to follow while preparing a manuscript: (i) consider similarity of contents with the topics investigated, lest related work should be reproduced or ignored; (ii) perform a systematic search over the network of citations including seminal or very related papers. We use formalisms of complex networks for two datasets of papers from the arXiv and the Web of Science repositories to show that neither of these two criteria is fulfilled in practice. By representing the texts as complex networks we estimated a similarity index between pieces of texts and found that the list of references did not contain the most similar papers in the dataset. This was quantified by calculating a consistency index, whose maximum value is one if the references in a given paper are the most similar in the dataset. For the areas of "complex networks" and "graphenes", the consistency index was only 0.11-0.23 and 0.10-0.25, respectively. To simulate a systematic search in the citation network, we employed a traditional random walk search (i.e. diffusion) and a random walk whose probabilities of transition are proportional to the number of the ingoing edges of the neighbours. The frequency of visits to the nodes (papers) in the network had a very small correlation with either the actual list of references in the papers or with the number of downloads from the arXiv repository. Therefore, apparently the authors and users of the repository did not follow the criterion related to a systematic search over the network of citations. Based on these results, we propose an approach that we believe is fairer for evaluating and complementing citations of a given author, effectively leading to a virtual scientometry.

A presença de agentes intermediadores na formação de redes interorganizacionais: uma análise sob a perspectiva temporal

Nos estudos sobre redes interorganizacionais, existem esforços focados em entender a formação de redes, assunto esse que gera interesse dos formuladores de políticas públicas já que se busca no associativismo promovido pelo Estado e pelas iniciativas privadas, substância para impulsionar o desenvolvimento local. Diante disso, o objetivo do estudo foi verificar, por meio da formalização do Arranjo Produtivo Local (APL) de calçados de Birigüi (SP), se a presença desses agentes é essencial para a formação da rede interorganizacional. Como sustentações teóricas foram abordadas: a evolução temporal das redes; a Teoria Institucional aplicada às redes interorganizacionais; o capital social presente nos laços de relacionamento; a presença de agentes intermediários como coordenadores na governança das redes. A estratégia de pesquisa adotada baseou-se em entrevistas com 32% dos gestores das empresas que participavam formalmente do APL e com uma gestora do agente intermediador, além de observação e análises de pesquisas prévias sobre a industrialização de Birigüi. Como resultados verificou-se haver um legado regional que sustenta uma base de know-how para a industrialização de calçados. No entanto, percebeu-se que os interesses dos participantes do APL eram predominantemente comerciais, sem haver um nível de capital social e de institucionalização desenvolvidos a ponto de se criarem, de forma legítima, associações provenientes de vontades das próprias organizações. Sem esse ambiente institucional fortemente construído na região, não se verificou um racional claro para o associativismo, havendo a percepção de que os ganhos oriundos da participação na rede são futuros. Concluiu-se que a coordenação realizada por um agente intermediador tem poder de articulação limitado na formação de redes interorganizacionais se não existir uma institucionalização prévia que envolva, principalmente, valores e normas de capital social. Sem esses pré-requisitos, o agente intermediador pode acabar por ter funções de governança para ações assessórias da rede.