Distributed energy resources management with cyber-physical SCADA in the context of future smart grids

In the energy management of a small power system, the scheduling of the generation units is a crucial problem for which adequate methodologies can maximize the performance of the energy supply. This paper proposes an innovative methodology for distributed energy resources management. The optimal operation of distributed generation, demand response and storage resources is formulated as a mixed-integer linear programming model (MILP) and solved by a deterministic optimization technique CPLEX-based implemented in General Algebraic Modeling Systems (GAMS). The paper deals with a vision for the grids of the future, focusing on conceptual and operational aspects of electrical grids characterized by an intensive penetration of DG, in the scope of competitive environments and using artificial intelligence methodologies to attain the envisaged goals. These concepts are implemented in a computational framework which includes both grid and market simulation.

Distributed Energy Resources Management using Plug-in Hybrid Electric Vehicles as a Fuel-Shifting Demand Response Resource

In the smart grids context, distributed energy resources management plays an important role in the power systems’ operation. Battery electric vehicles and plug-in hybrid electric vehicles should be important resources in the future distribution networks operation. Therefore, it is important to develop adequate methodologies to schedule the electric vehicles’ charge and discharge processes, avoiding network congestions and providing ancillary services. This paper proposes the participation of plug-in hybrid electric vehicles in fuel shifting demand response programs. Two services are proposed, namely the fuel shifting and the fuel discharging. The fuel shifting program consists in replacing the electric energy by fossil fuels in plug-in hybrid electric vehicles daily trips, and the fuel discharge program consists in use of their internal combustion engine to generate electricity injecting into the network. These programs are included in an energy resources management algorithm which integrates the management of other resources. The paper presents a case study considering a 37-bus distribution network with 25 distributed generators, 1908 consumers, and 2430 plug-in vehicles. Two scenarios are tested, namely a scenario with high photovoltaic generation, and a scenario without photovoltaic generation. A sensitivity analyses is performed in order to evaluate when each energy resource is required.

Divided we stand: Parallel distributed stack memory management

We present an overview of the stack-based memory management techniques that we used in our non-deterministic and-parallel Prolog systems: &-Prolog and DASWAM. We believe that the problems associated with non-deterministic and-parallel systems are more general than those encountered in or-parallel and deterministic and-parallel systems, which can be seen as subsets of this more general case. We develop on the previously proposed "marker scheme", lifting some of the restrictions associated with the selection of goals while keeping (virtual) memory consumption down. We also review some of the other problems associated with the stack-based management scheme, such as handling of forward and backward execution, cut, and roll-backs.

Constrained Consumption Shifting Management in the Distributed Energy Resources Scheduling Considering Demand Response

Demand response concept has been gaining increasing importance while the success of several recent implementations makes this resource benefits unquestionable. This happens in a power systems operation environment that also considers an intensive use of distributed generation. However, more adequate approaches and models are needed in order to address the small size consumers and producers aggregation, while taking into account these resources goals. The present paper focuses on the demand response programs and distributed generation resources management by a Virtual Power Player that optimally aims to minimize its operation costs taking the consumption shifting constraints into account. The impact of the consumption shifting in the distributed generation resources schedule is also considered. The methodology is applied to three scenarios based on 218 consumers and 4 types of distributed generation, in a time frame of 96 periods.

Sistema de gestão e controlo da atribuição de endereçamento de rede

Com a evolução tecnológica, a informática assumiu um papel fulcral na nossa vida actual tanto numa vertente doméstica como para as mais variadíssimas organizações. As redes IP estão disseminadas por todo o lado, escritórios, habitações, estabelecimentos de ensino, espaços comerciais, com as mais diversas topologias e dimensões, que como qualquer recurso devem ser bem geridas. O presente projecto insere-se neste contexto, pretendendo criar um sistema para dar apoio no controlo e gestão de endereçamento IP dados por um servidor DHCP. A problemática central que este projecto pretende tratar é a detecção da configuração forçada de endereços IP por parte dos utilizadores, notificando tais situações aos administradores de rede. O sistema é constituído por vários componentes como Linux, MySQL, ISC DHCP, SNMP, PHP, APACHE e irá interagir com equipamentos de rede que possuam tabelas de endereços para que a informação, nestas encontradas, seja comparada com a informação dos endereços fornecidos pelo servidor DHCP. O sistema dá suporte a uma página web que pretende auxiliar algumas configurações e fornecer informações estatísticas sobre a rede.

A framework for realistic real-time walkthroughs in a VR distributed environment

Virtual and augmented reality (VR/AR) are increasingly being used in various business scenarios and are important driving forces in technology development. However the usage of these technologies in the home environment is restricted due to several factors including lack of low-cost (from the client point of view) highperformance solutions. In this paper we present a general client/server rendering architecture based on Real-Time concepts, including support for a wide range of client platforms and applications. The idea of focusing on the real-time behaviour of all components involved in distributed IP-based VR scenarios is new and has not been addressed before, except for simple sub-solutions. This is considered as “the most significant problem with the IP environment” [1]. Thus, the most important contribution of this research will be the holistic approach, in which networking, end-systems and rendering aspects are integrated into a cost-effective infrastructure for building distributed real-time VR applications on IP-based networks.

Localitzador Gràfic d' Adreces IP

Aquest projecte estudia el problema de l'extracció i la visualització de manera entenedora de la informació pública més rellevant d'una adreça IP, tot i que no aborda els problemes relacionats amb la informació insuficient perquè pertanyen a un àmbit de recerca diferent.

Traceroute Visual : Geolocalización IP

Aquest document desenvolupa la realització d'un

TraceWorld, localitzador gràfic d'adreces IP

Memòria del projecte treball fi de carrera "Localitzador gràfic d'adreces IP". Principalment mostra un mapa geogràfic que visualitza el recorregut que realitzen els paquets de dades per arribar al seudestí.

A proposal for a flexible scheduling and memory management scheme for non-deterministic, andparallel execution of logic programs

In this paper, we examine the issue of memory management in the parallel execution of logic programs. We concentrate on non-deterministic and-parallel schemes which we believe present a relatively general set of problems to be solved, including most of those encountered in the memory management of or-parallel systems. We present a distributed stack memory management model which allows flexible scheduling of goals. Previously proposed models (based on the "Marker model") are lacking in that they impose restrictions on the selection of goals to be executed or they may require consume a large amount of virtual memory. This paper first presents results which imply that the above mentioned shortcomings can have significant performance impacts. An extension of the Marker Model is then proposed which allows flexible scheduling of goals while keeping (virtual) memory consumption down. Measurements are presented which show the advantage of this solution. Methods for handling forward and backward execution, cut and roll back are discussed in the context of the proposed scheme. In addition, the paper shows how the same mechanism for flexible scheduling can be applied to allow the efficient handling of the very general form of suspension that can occur in systems which combine several types of and-parallelism and more sophisticated methods of executing logic programs. We believe that the results are applicable to many and- and or-parallel systems.

National five digit zip code and post office directory /

Kept up to date by addenda.

Types of Addresses and Levels of use in the TCP/IP Protocol Stack

The publication comments on certain moments of the method of teaching the types of addresses and their use in the TCP/IP protocol stack.

An epistemic event -based correlation scheme for pervasive network management

Computer networks produce tremendous amounts of event-based data that can be collected and managed to support an increasing number of new classes of pervasive applications. Examples of such applications are network monitoring and crisis management. Although the problem of distributed event-based management has been addressed in the non-pervasive settings such as the Internet, the domain of pervasive networks has its own characteristics that make these results non-applicable. Many of these applications are based on time-series data that possess the form of time-ordered series of events. Such applications also embody the need to handle large volumes of unexpected events, often modified on-the-fly, containing conflicting information, and dealing with rapidly changing contexts while producing results with low-latency. Correlating events across contextual dimensions holds the key to expanding the capabilities and improving the performance of these applications. This dissertation addresses this critical challenge. It establishes an effective scheme for complex-event semantic correlation. The scheme examines epistemic uncertainty in computer networks by fusing event synchronization concepts with belief theory. Because of the distributed nature of the event detection, time-delays are considered. Events are no longer instantaneous, but duration is associated with them. Existing algorithms for synchronizing time are split into two classes, one of which is asserted to provide a faster means for converging time and hence better suited for pervasive network management. Besides the temporal dimension, the scheme considers imprecision and uncertainty when an event is detected. A belief value is therefore associated with the semantics and the detection of composite events. This belief value is generated by a consensus among participating entities in a computer network. The scheme taps into in-network processing capabilities of pervasive computer networks and can withstand missing or conflicting information gathered from multiple participating entities. Thus, this dissertation advances knowledge in the field of network management by facilitating the full utilization of characteristics offered by pervasive, distributed and wireless technologies in contemporary and future computer networks.

An Epistemic Event-based Correlation Scheme for Pervasive Network Management

Computer networks produce tremendous amounts of event-based data that can be collected and managed to support an increasing number of new classes of pervasive applications. Examples of such applications are network monitoring and crisis management. Although the problem of distributed event-based management has been addressed in the non-pervasive settings such as the Internet, the domain of pervasive networks has its own characteristics that make these results non-applicable. Many of these applications are based on time-series data that possess the form of time-ordered series of events. Such applications also embody the need to handle large volumes of unexpected events, often modified on-the-fly, containing conflicting information, and dealing with rapidly changing contexts while producing results with low-latency. Correlating events across contextual dimensions holds the key to expanding the capabilities and improving the performance of these applications. This dissertation addresses this critical challenge. It establishes an effective scheme for complex-event semantic correlation. The scheme examines epistemic uncertainty in computer networks by fusing event synchronization concepts with belief theory. Because of the distributed nature of the event detection, time-delays are considered. Events are no longer instantaneous, but duration is associated with them. Existing algorithms for synchronizing time are split into two classes, one of which is asserted to provide a faster means for converging time and hence better suited for pervasive network management. Besides the temporal dimension, the scheme considers imprecision and uncertainty when an event is detected. A belief value is therefore associated with the semantics and the detection of composite events. This belief value is generated by a consensus among participating entities in a computer network. The scheme taps into in-network processing capabilities of pervasive computer networks and can withstand missing or conflicting information gathered from multiple participating entities. Thus, this dissertation advances knowledge in the field of network management by facilitating the full utilization of characteristics offered by pervasive, distributed and wireless technologies in contemporary and future computer networks.

The medicine and epidemiology of bovine respiratory disease in feedlots

Bovine Respiratory Disease (BRD) results from a complex, multifactorial interaction of stressors, animal susceptibility, and respiratory pathogens. The infectious agents associated with BRD are ubiquitous among cattle populations. Typically, one or a combination of stressors are necessary to initiate BRD. Prevention of BRD should, therefore, address management procedures to minimise stressors. Administration of vaccines against BRD agents may help reduce the incidence of BRD but is unlikely to eliminate the condition. The effectiveness of antimicrobials in the treatment of BIRD depends primarily on early recognition and treatment. The use of antioxidant vitamins, minerals or other agents in the prevention and treatment of BRD warrants further research.