A Bayesian approach for zero-modified Skellam model with Hamiltonian MCMC

Statistical Methods & Applications - In this paper is presented the zero-modified poisson difference and present possible applications of them in the analysis of paired count data. The...     

Effects of variations in water quantity and quality in the structure and functions of invertebrates’ community of a Mediterranean urban stream

Urban Ecosystems - Urban streams provide important ecosystem services to cities’ population, from the maintenance of urban biodiversity, temperature, humidity and air quality to improving...     

Urban ecosystem Services in Latin America: mismatch between global concepts and regional realities?

Urban Ecosystems - Latin America and the Caribbean (LAC) is one of the most urbanized and biologically diverse regions in the world but is often characterized by weak environmental governance and...     

Town Centre Management: Outlook from Portugal

In the last two decades, the Portuguese Government has responded to the decline of centres of commerce. In this paper, we analyse the three different experiences of town centre management (TCM) schemes developed in Portugal since the turn of the millennium. The first two stages were developed using public sector initiatives and their impacts were limited. The third stage is still under way and is composed of private projects created by local business owners. Taking Lisbon as a case study for this third stage we conclude that these projects have become a pro-active means of intervention in Portuguese town centres.     

New bounds for locally irregular chromatic index of bipartite and subcubic graphs

A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v. A locally irregular edge-coloring of a graph G is an (improper) edge-coloring such that the graph induced on the edges of any color class is locally irregular. It is conjectured that three colors suffice for a locally irregular edge-coloring. In the paper, we develop a method using which we prove four colors are enough for a locally irregular edge-coloring of any subcubic graph admiting such a coloring. We believe that our method can be further extended to prove the tight bound of three colors for such graphs. Furthermore, using a combination of existing results, we present an improvement of the bounds for bipartite graphs and general graphs, setting the best upper bounds to 7 and 220, respectively.