A robust model-free controller for a three-phase grid-connected photovoltaic system based on ultra-local model

In this paper, a robust model-free controller for a grid-connected photovoltaic (PV) system is designed. The system consists of a PV generator connected to a three-phase grid by a DC/AC converter. The control objectives of the overall system are to extract maximum power from the PV source, to control reactive power exchange and to improve the quality of the current injected into the grid. The model-free control technique is based on the use of an ultra-local model instead of the dynamic model of the overall system. The local model is continuously updated based on a numerical differentiator using only the input–output behavior of the controlled system. The model-free controller consists of a classical feedback controller and a compensator for the effects of internal parameter changes and external disturbances. Simulation results illustrate the efficiency of the controller for grid-connected PV systems.     

Flexible Distribution-Based Regression Models for Count Data: Application to Medical Diagnosis

Abstract

Data mining techniques have been successfully utilized in different applications of significant fields, including medical research. With the wealth of data available within the health-care systems, there is a lack of practical analysis tools to discover hidden relationships and trends in data. The complexity of medical data that is unfavorable for most models is a considerable challenge in prediction. The ability of a model to perform accurately and efficiently in disease diagnosis is extremely significant. Thus, the model must be selected to fit the data better, such that the learning from previous data is most efficient, and the diagnosis of the disease is highly accurate. This work is motivated by the limited number of regression analysis tools for multivariate counts in the literature. We propose two regression models for count data based on flexible distributions, namely, the multinomial Beta-Liouville and multinomial scaled Dirichlet, and evaluated the proposed models in the problem of disease diagnosis. The performance is evaluated based on the accuracy of the prediction which depends on the nature and complexity of the dataset. Our results show the efficiency of the two proposed regression models where the prediction performance of both models is competitive to other previously used regression models for count data and to the best results in the literature.     

Friction compensation controller for load varying machine tool feed drive

The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

Artificial bee colony based algorithm for maximum power point tracking (MPPT) for PV systems operating under partial shaded conditions

Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial conditions. In this paper, a novel artificial bee colony based maximum power point tracking algorithm (MPPT) is proposed. The developed algorithm, does not allow only overcoming the common drawback of the conventional MPPT methods, but it gives a simple and a robust MPPT scheme. A co-simulation methodology, combining Matlab/Simulink™ and Cadence/Pspice™, is used to verify the effectiveness of the proposed method and compare its performance, under dynamic weather conditions, with that of the Particle Swarm Optimization (PSO) based MPPT algorithm. Moreover, a laboratory setup has been realized and used to experimentally validate the proposed ABC-based MPPT algorithm. Simulation and experimental results have shown the satisfactory performance of the proposed approach.     

Study on maximum power point tracking of photovoltaic array in irregular shadow

Traditional maximum power point tracking (MPPT) methods can hardly find global maximum power point (MPP) because output characteristics curve of photovoltaic (PV) array may have multi local maximum power points in irregular shadow, and thus easily fall into the local maximum power point. To address this drawback, Considering that sliding mode variable structure (SMVS) control strategy have such advantages as simple structure, fast response and strong robustness, and P&O method have the advantages of simple principle and convenient implementation, so a new algorithm combining SMVS control method and P&O method is proposed, besides, PI controller is applied to reduce system chattering caused by switching sliding surface. It is applied to MPPT control of PV array in irregular shadow to solve the problem of multi-peak optimization in partial shadow. In order to verity the rationality of the proposed algorithm, the experimental circuit is built, which achieves MPPT control by means of the proposed algorithm and P&O method. The experimental results show that compared with the traditional P&O algorithm, the proposed algorithm can fast track the global MPP, tracking speed increases by 60% and the relative error decreased by 20%. Moreover, the system becomes more stable near the MPP, the fluctuations of output power is greatly reduced, and thus make full use of solar energy.     

灵芝菌丝体多糖的分离纯化及其单糖组成分析与分子量测定

前期杂交优化后赤芝菌种经液体深层发酵后,提取灵芝菌丝体多糖,并过DEAE-Sepharose Fast Flow柱分离纯化,利用高效体积排阻色谱(HPSEC)检测多糖级分的纯度,采用完全酸水解PMP柱前衍生化RP—HPLC测定多糖级分的单糖组成,多角度光散射仪联用装置(SEC—MALLS)测定其绝对重均分子量(Mw),并且根据分子旋转半径与分子摩尔数的关系曲线斜率初步推断其空间构象。结果显示:分离纯化得到3个多糖级分GLMP1、GLMP2和GLMP3,HPSEC检测其峰面积百分比分别为93.58%,97.64%,99.19%,单糖组成分析结果表明GLMP1、GLMP2和GLMP3均含有甘露糖、鼠李糖、半乳糖醛酸、葡萄糖、半乳糖、木糖、阿拉伯糖和岩藻糖,但单糖摩尔比各异。SEC—MALLS测试GLMP1、GLMP2和GLMP3的Mw分别为4.526×105,4.603×104,3.760×103 g/mol,3个多糖级分构象可能均为高度紧缩且具有分支结构的聚合物。     

Length–weight relationships of five catfish species (Siluriformes) from the Ganga River,India

Knowledge of the length–weight relationships (LWRs) of fish is an important tool to understand fish body form, growth pattern, stock management and their conservation. The present study focused on investigating the length–weight relationships for five catfish species, Pachypterus atherinoides (Bloch, 1794), belonging to family Horabagridae; Batasio batasio (Hamilton, 1822) family Bagridae; Bagarius yarrelli (Sykes, 1839), family Gogangra viridescens (Hamilton, 1822); and Sisor rhabdophorus (Hamilton, 1822) belonging to family Sisoridae. Specimens were collected from the middle stretch of the Ganga River in India from November 2016 to May 2018. A total of 174 specimens of five fish species were collected, and their total lengths were measured to the nearest centimetre and the body weight to the nearest gram. The value of the parameter slope (b) of LWRs of the five species ranged from 2.86 (B. yarrelli) to 3.16 (G. viridescens), with a mean value of 2.99. The results of the present study documented the new maximum total length (TL) for P. atherinoides and S. rhabdophorus. The present study also provides the first reference regarding LWRs for S. rhabdophorus.