Nádia P. Kozievitch

Dr. Nádia P. Kozievitch

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2019 in Future Generation Computer Systems
Verified
Journal Article
Open access
AAAndy S. Alic
Andy S. Alic
JAJussara Almeida
Jussara Almeida
GAGiovanni Aloisio
Giovanni Aloisio
NANazareno Andrade
Nazareno Andrade
NANuno Antunes
Nuno Antunes
MVMarco Vieira
Marco Vieira

28 August 2018 in ACM Transactions on Accessible Computing
Verified
Journal Article
Open access
GBGuilherme L. Barczyszyn
Guilherme L. Barczyszyn
LCLetícia M. De O. Camenar
Letícia M. De O. Camenar
DNDiego De F. Do Nascimento
Diego De F. Do Nascimento
NKNádia P. Kozievitch
Nádia P. Kozievitch
RSRicardo D. Da Silva
Ricardo D. Da Silva
RMRodrigo Minetto
Rodrigo Minetto
Route planning is a challenging problem for urban computing that usually involves the processing of a huge amount of data and collaborative user feedback. Traditionally, route planning services are street-based, that is, even paths for a pedestrian are suggested in terms of streets. However, such models are not suitable for users with certain disabilities. To address this problem, we have performed a requirement analysis with a group of wheelchair-users and their companions to understand their urban mobility experience. Given that perspective, we describe in this article a sidewalk-based model to accommodate the needs for a wheelchair route planning service. The model is mathematically defined as a graph, where the vertices are the city block corners and the edges are the sidewalks or crosswalks. The edge costs are derived from important accessibility features, such as distance, path inclination, and existence and maintenance conditions of curb ramps, crosswalks, and sidewalks. The model has been designed so that user feedback is considered to help updating the model when accessibility issues are detected, by wheelchair-users and companions, or solved, by the department of city planning. We also present a route planning algorithm that provides a set of alternative routes based on accessibility conditions, and a shortcut recommender algorithm to support accessibility-related decision making by the department of city planning. Experiments, by using PgRouting and PostGIS with open data, are reported for a Brazilian city neighborhood to validate the model and the route planning service.

10 December 2019
Verified
Book Chapter
Closed access
PDF file
TLTatiane Lautert
Tatiane Lautert
ANAdolfo Gustavo Serra Seca Neto
Adolfo Gustavo Serra Seca Neto
NKNádia P. Kozievitch
Nádia P. Kozievitch

1 January 2016
Verified
Conference Paper
Open access
NKNádia P. Kozievitch
Nádia P. Kozievitch
LALeonelo D. A. Almeida
Leonelo D. A. Almeida
RSRicardo Dutra da Silva
Ricardo Dutra da Silva
RMRodrigo Minetto
Rodrigo Minetto
In this paper we describe a bottom-up approach to integrate GIS maps (endorsed by discrete features, such as points, lines, polygons), in order to develop a route planner for wheelchair users. We integrate public available data with a novel model for route planning, based on sidewalks, crosswalks and curb ramps, as opposed to traditional street-based approaches. We show that our sidewalk-based model is more suitable than available planning routes under mobility constraints, using a case study in Curitiba, Brazil.

26 December 2016
Verified
Conference Paper
Closed access
ESEmerson Luiz Chiesse da Silva
Emerson Luiz Chiesse da Silva
MRMarcelo De Oliveira Rosa
Marcelo De Oliveira Rosa
KFKeiko Veronica Ono Fonseca
Keiko Veronica Ono Fonseca
RLRicardo Luders
Ricardo Luders
NKNádia P. Kozievitch
Nádia P. Kozievitch
Complex networks have been used to model public transportation systems (PTS) considering the relationship between bus lines and bus stops. Previous works focused on statistically characterize either the whole network or their individual bus stops and lines. The present work focused on statistically characterize different regions of a city (Curitiba, Brazil) assuming that a passenger could easily access different unconnected bus stops in a geographic area. K-means algorithm was used to partition the bus stops in (K =) 2 to 40 clusters with similar geographic area. Results showed strong inverse relationship (p < 2 × 10−16 and R2 = 0.74 for K = 40 in a log model) between the degree and the average path length of clustered bus stops. Regarding Curitiba, it revealed well and badly served regions (downtown area, and few suburbs in Southern and Western Curitiba, respectively). Some of these well served regions showed quantitative indication of potential bus congestion. By varying K, city planners could obtained zoomed view of the behavior of their PTS in terms of complex networks metrics.

8 November 2016
Verified
Conference Paper
Open access
YNYuri C B Neves
Yuri C B Neves
MSMozart P. Sindeaux
Mozart P. Sindeaux
WSWilliam Souza
William Souza
NKNádia P. Kozievitch
Nádia P. Kozievitch
ALAntonio A.F. Loureiro
Antonio A.F. Loureiro
TSThiago H. Silva
Thiago H. Silva
Urban computing is a recent area of study that helps us to understand the nature of urban phenomena. In this sense, an important aspect to study is the dynamics of commercial establishments popularity in the city. Recently, Google launched a new service that provides popularity time series of some commercial establishments in several cities. This is a valuable source of data that allow us to better understand the dynamics of establishments popularity, helping to change our perceived physical limits about the city, which can enable the development of new applications and urban services. The results of this study are: (1) characterization of Google popularity time series for bars and restaurants in the cities of Curitiba/Brazil and Chicago/USA. Among the results, we find cultural characteristics of these cities, as well as a favorable clustering of similar venues based on the temporal pattern of popularity; (2) evaluation of reproduction of Google popularity time series using Foursquare data. In this evaluation, we found evidence that Foursquare data might be used for this purpose. This means that for places where Google does not offer this service data from Foursquare, or other source, could be used. This enables the exploration of a greater number of establishments in, for example, a new venue recommendation engine.