The Role of Community‑Supported Agriculture in Sustainable Development

The main aim of the research is to present the essence Community‑supported agriculture (CSA) concept by illustrating the application of this idea in sustainable development in rural areas in Poland. The article focuses on pointing out the determinants for the development of CSA and gives some examples of using this concept in other countries. Based on the analyzed literature of the subject, both Polish and foreign, the basic assumptions and objectives of the concept are presented as well as the barriers of development and the expected results. CSA is a relatively new concept in Poland. However, it’s implementation may contribute to solving the problem of green jobs and dynamic development of rural areas while preserving the environment.Podstawowym celem pracy jest przedstawienie istoty koncepcji Rolnictwa Wspieranego przez Społeczność (RWS) przez zobrazowanie zastosowania tej idei w rozwoju zrównoważonym na obszarach wiejskich w Polsce. W artykule skoncentrowano się na przedstawieniu uwarunkowań dla rozwoju RWS oraz podano przykłady wykorzystania tej koncepcji w innych państwach. Na podstawie przeanalizowanej literatury przedmiotu, zarówno polskiej, jak i zagranicznej, przedstawiono podstawowe założenia i cele koncepcji, a także bariery rozwoju i oczekiwane rezultaty. RWS jest stosunkowo nową koncepcją na terenie Polski, jednakże jej wdrażanie może przyczynić się do rozwiązania problemu tzw. zielonych miejsc pracy oraz zdynamizowania rozwoju obszarów wiejskich przy zachowaniu troski o środowisko naturalne

Dissipative stability theory for linear repetitive processes with application in iterative learning control

This paper develops a new set of necessary and sufficient conditions for the stability of linear repetitive processes, based on a dissipative setting for analysis. These conditions reduce the problem of determining whether a linear repetitive process is stable or not to that of checking for the existence of a solution to a set of linear matrix inequalities (LMIs). Testing the resulting conditions only requires compu- tations with matrices whose entries are constant in comparison to alternatives where frequency response computations are required

<i>H</i>₂ and mixed <i>H</i>₂/<i>H</i>_∞ Stabilization and Disturbance Attenuation for Differential Linear Repetitive Processes

Repetitive processes are a distinct class of two-dimensional systems (i.e., information propagation in two independent directions) of both systems theoretic and applications interest. A systems theory for them cannot be obtained by direct extension of existing techniques from standard (termed 1-D here) or, in many cases, two-dimensional (2-D) systems theory. Here, we give new results towards the development of such a theory in H2 and mixed H2/H∞ settings. These results are for the sub-class of so-called differential linear repetitive processes and focus on the fundamental problems of stabilization and disturbance attenuation

Control and Filtering for Discrete Linear Repetitive Processes with H infty and ell 2--ell infty Performance

Repetitive processes are characterized by a series of sweeps, termed passes, through a set of dynamics defined over a finite duration known as the pass length. On each pass an output, termed the pass profile, is produced which acts as a forcing function on, and hence contributes to, the dynamics of the next pass profile. This can lead to oscillations which increase in amplitude in the pass to pass direction and cannot be controlled by standard control laws. Here we give new results on the design of physically based control laws for the sub-class of so-called discrete linear repetitive processes which arise in applications areas such as iterative learning control. The main contribution is to show how control law design can be undertaken within the framework of a general robust filtering problem with guaranteed levels of performance. In particular, we develop algorithms for the design of an H? and $\ell_{2}–\ell_{\infty}$ dynamic output feedback controller and filter which guarantees that the resulting controlled (filtering error) process, respectively, is stable along the pass and has prescribed disturbance attenuation performance as measured by $H_{\infty}$ and $\ell_{2}$–$\ell_{\infty}$ norms

VC Density of Set Systems Definable in Tree-Like Graphs

We study set systems definable in graphs using variants of logic with different expressive power. Our focus is on the notion of Vapnik-Chervonenkis density: the smallest possible degree of a polynomial bounding the cardinalities of restrictions of such set systems. On one hand, we prove that if phi(x,y) is a fixed CMSO_1 formula and C is a class of graphs with uniformly bounded cliquewidth, then the set systems defined by phi in graphs from C have VC density at most |y|, which is the smallest bound that one could expect. We also show an analogous statement for the case when phi(x,y) is a CMSO_2 formula and C is a class of graphs with uniformly bounded treewidth. We complement these results by showing that if C has unbounded cliquewidth (respectively, treewidth), then, under some mild technical assumptions on C, the set systems definable by CMSO_1 (respectively, CMSO_2) formulas in graphs from C may have unbounded VC dimension, hence also unbounded VC density

H2/H∞ output information-based disturbance attenuation for differential linear repetitive processes

Repetitive processes propagate information in two independent directions where the duration of one is finite. They pose control problems that cannot be solved by application of results for other classes of 2D systems. This paper develops controller design algorithms for differential linear processes, where information in one direction is governed by a matrix differential equation and in the other by a matrix discrete equation, in an H2/H∞ setting. The objectives are stabilization and disturbance attenuation, and the controller used is actuated by the process output and hence the use of a state observer is avoided

The Foil: Capture-Avoiding Substitution With No Sharp Edges

Correctly manipulating program terms in a compiler is surprisingly difficult because of the need to avoid name capture. The rapier from "Secrets of the Glasgow Haskell Compiler inliner" is a cutting-edge technique for fast, stateless capture-avoiding substitution for expressions represented with explicit names. It is, however, a sharp tool: its invariants are tricky and need to be maintained throughout the whole compiler that uses it. We describe the foil, an elaboration of the rapier that uses Haskell's type system to enforce the rapier's invariants statically, preventing a class of hard-to-find bugs, but without adding any run-time overheads.Comment: Presented at IFL 202

H∞ and guaranteed cost control of discrete linear repetitive processes

AbstractRepetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. In general, they cannot be controlled by direct extension of existing techniques from either standard (termed 1D here) or 2D systems theory. Here first we give major new results on the design of control laws using an H∞ setting and including the possibility of uncertainty in the process model. Then we give the first ever results on guaranteed cost control, i.e. including a performance criterion in the design. The designs in both cases can be computed using linear matrix inequalities. These results are for so-called discrete linear repetitive processes which arise in applications areas such as iterative learning control

Fast Deep Matting for Portrait Animation on Mobile Phone

Image matting plays an important role in image and video editing. However, the formulation of image matting is inherently ill-posed. Traditional methods usually employ interaction to deal with the image matting problem with trimaps and strokes, and cannot run on the mobile phone in real-time. In this paper, we propose a real-time automatic deep matting approach for mobile devices. By leveraging the densely connected blocks and the dilated convolution, a light full convolutional network is designed to predict a coarse binary mask for portrait images. And a feathering block, which is edge-preserving and matting adaptive, is further developed to learn the guided filter and transform the binary mask into alpha matte. Finally, an automatic portrait animation system based on fast deep matting is built on mobile devices, which does not need any interaction and can realize real-time matting with 15 fps. The experiments show that the proposed approach achieves comparable results with the state-of-the-art matting solvers.Comment: ACM Multimedia Conference (MM) 2017 camera-read