Intelligent distribution planning and control incorporating microgrids

This paper proposes a comprehensive approach to the planning of distribution networks and the control of microgrids. Firstly, a Modified Discrete Particle Swarm Optimization (MDPSO) method is used to optimally plan a distribution system upgrade over a 20 year planning period. The optimization is conducted at different load levels according to the anticipated load duration curve and integrated over the system lifetime in order to minimize its total lifetime cost. Since the optimal solution contains Distributed Generators (DGs) to maximize reliability, the DG must be able to operate in islanded mode and this leads to the concept of microgrids. Thus the second part of the paper reviews some of the challenges of microgrid control in the presence of both inertial (rotating direct connected) and non-inertial (converter interfaced) DGs. More specifically enhanced control strategies based on frequency droop are proposed for DGs to improve the smooth synchronization and real power sharing minimizing transient oscillations in the microgrid. Simulation studies are presented to show the effectiveness of the control.

Exponentiated gradient algorithms for conditional random fields and max-margin Markov Networks

Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of parameters in these models is therefore an important problem, and becomes a key factor when learning from very large data sets. This paper describes exponentiated gradient (EG) algorithms for training such models, where EG updates are applied to the convex dual of either the log-linear or max-margin objective function; the dual in both the log-linear and max-margin cases corresponds to minimizing a convex function with simplex constraints. We study both batch and online variants of the algorithm, and provide rates of convergence for both cases. In the max-margin case, O(1/ε) EG updates are required to reach a given accuracy ε in the dual; in contrast, for log-linear models only O(log(1/ε)) updates are required. For both the max-margin and log-linear cases, our bounds suggest that the online EG algorithm requires a factor of n less computation to reach a desired accuracy than the batch EG algorithm, where n is the number of training examples. Our experiments confirm that the online algorithms are much faster than the batch algorithms in practice. We describe how the EG updates factor in a convenient way for structured prediction problems, allowing the algorithms to be efficiently applied to problems such as sequence learning or natural language parsing. We perform extensive evaluation of the algorithms, comparing them to L-BFGS and stochastic gradient descent for log-linear models, and to SVM-Struct for max-margin models. The algorithms are applied to a multi-class problem as well as to a more complex large-scale parsing task. In all these settings, the EG algorithms presented here outperform the other methods.

Sparseness vs estimating conditional probabilities : some asymptotic results

One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be used to estimate the conditional probability of the class label. We investigate the relationship between these two properties and show that these are intimately related: sparseness does not occur when the conditional probabilities can be unambiguously estimated. We consider a family of convex loss functions and derive sharp asymptotic results for the fraction of data that becomes support vectors. This enables us to characterize the exact trade-off between sparseness and the ability to estimate conditional probabilities for these loss functions.

Oxygen transport in soil and the vertical distribution of roots

An analytical solution for steady-state oxygen transport in soils including 2 sink terms, viz roots and microbes with the corresponding vertical distribution scaling lengths forming a ratio p, showed p governed the critical air-filled porosity, θ_c, needed by most plants. For low temperature and p, θ_c was <0.1 but at higher temperatures and p = 1, θ_c was >0.15 m³/m³. When root length density at the surface was 10⁴ m/m³ and p > 3, θ_c was 0.25 m³/m³, more than half the pore space. Few combinations of soil and climate regularly meet this condition. However, for sandy soils and seasonally warm, arid regions, the theory is consistent with observation, in that plants may have some deep roots. Critical θ_c values are used to formulate theoretical solutions in a forward mode, so different levels of oxygen uptake by roots may be compared to microbial activity. The proportion of respiration by plant roots increases rapidly with p up to p ≈2.