Does land use and landscape contribute to self-harm? A sustainability cities framework

Self-harm has become one of the leading causes of mortality in developed countries. The overall rate for suicide in Canada is 11.3 per 100,000 according to Statistics Canada in 2015. Between 2000 and 2007 the lowest rates of suicide in Canada were in Ontario, one of the most urbanized regions in Canada. However, the interaction between land use, landscape and self-harm has not been significantly studied for urban cores. It is thus of relevance to understand the impacts of land-use and landscape on suicidal behavior. This paper takes a spatial analytical approach to assess the occurrence of self-harm along one of the densest urban cores in the country: Toronto. Individual self-harm data was gathered by the National Ambulatory Care System (NACRS) and geocoded into census tract divisions. Toronto’s urban landscape is quantified at spatial level through the calculation of its land use at di erent levels: (i) land use type, (ii) sprawl metrics relating to (a) dispersion and (b) sprawl/mix incidence; (iii) fragmentation metrics of (a) urban fragmentation and (b) density and (iv) demographics of (a) income and (b) age. A stepwise regression is built to understand the most influential factors leading to self-harm from this selection generating an explanatory model.This research was supported by the Canadian Institutes of Health Research Strategic Team Grant in Applied Injury Research # TIR-103946 and the Ontario Neurotrauma Foundation grantinfo:eu-repo/semantics/publishedVersio

A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas

In several economical, statistical and geographical applications, a territory must be subdivided into functional regions. Such regions are not fixed and politically delimited, but should be identified by analyzing the interactions among all its constituent localities. This is a very delicate and important task, that often turns out to be computationally difficult. In this work we propose an innovative approach to this problem based on the solution of minimum cut problems over an undirected graph called here transitions graph. The proposed procedure guarantees that the obtained regions satisfy all the statistical conditions required when considering this type of problems. Results on real-world instances show the effectiveness of the proposed approach

Computational complexity and memory usage for multi-frontal direct solvers in structured mesh finite elements

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the estimates for systems resulting from $C^{p-1}$ polynomial B-spline spaces and compare them to those obtained using $C^0$ spaces.Comment: 8 pages, 2 figure

Distributed Clustering Based on Node Density and Distance in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are special type of network with sensing and monitoring the physical parameters with the property of autonomous in nature. To implement this autonomy and network management the common method used is hierarchical clustering. Hierarchical clustering helps for ease access to data collection and forwarding the same to the base station. The proposed Distributed Self-organizing Load Balancing Clustering Algorithm (DSLBCA) for WSNs designed considering the parameters of neighbor distance, residual energy, and node density.  The validity of the DSLBCA has been shown by comparing the network lifetime and energy dissipation with Low Energy Adaptive Clustering Hierarchy (LEACH), and Hybrid Energy Efficient Distributed Clustering (HEED). The proposed algorithm shows improved result in enhancing the life time of the network in both stationary and mobile environment

Spatial Data Preprocessing for Mining Spatial Association Rule with Conventional Association Mining Algorithms

The increasing usage of Geographical Information Systems (GIS) for various problems makes the volume of spatial data is growing fast. Spatial data mining is one of the several ways to find the new knowledge from data collection. One of spatial data mining tasks is spatial association rule. There are numerous association rule algorithms have been developed for mining association. Unfortunately, the most algorithms can only used for mining non-spatial and specific formatted data. Therefore, spatial data preprocessing is needed in order conventional association algorithms can be used for spatial data