The presented diploma thesis is concerned with analysing of contentual and graphical sides of historical, current and future maps of cities. The theoretical part describes historical development of the city maps up to date. Further there is outlined possible form of maps in the near future. The change of the forms is presented on example of the city of Nový Jičín. The main task of the practical part of the thesis was to make a new orientation map of the city of Nový Jičín. There are described the continuous steps of its creation completed with graphical samples. The city map is appendix of the thesis.

Produced by the Johnson City GIS Division on May 8, 2006, this map denotes the annexations of Johnson City and the surrounding area from 1960 to 2006. The map scale indicates a ratio of 1:24,000. In the text box on the left side, the ID, date, and annexation names are listed. As part of the legend, each 5 year annexation period is color coded. Physical copy resides with Johnson City, Geographic Information Systems Division. 1 in= 2000’ / https://dc.etsu.edu/rare-maps/1057/thumbnail.jpg

City map of Elizabethton, Tennessee prepared in April 1964 by the Tennessee Department of Highways Highway Planning Survey Division in cooperation with the U.S. Department of Commerce Bureau of Public Roads. The legend denotes a variety of points of interest within the city's infrastructure including government offices, hospitals, and highways as well as railroads and streams. The highlighted portions were added by hand at an indeterminate time post publication. The ETSU Library Depository stamp is dated March 18, 1986. This is the date the map was received by the Government Information, Law and Maps Department where it resides as part of our Tennessee state depository collection. Physical copy resides in the Government Information, Law and Maps Department of East Tennessee State University’s Sherrod Library. / https://dc.etsu.edu/rare-maps/1010/thumbnail.jpg

Produced by the Johnson City GIS Division on September 9, 2003, this map denotes the annexations of Johnson City and the surrounding area from 1960 to 2003. The map scale indicates a ratio of 1:24,000. In the text box on the left side, the ID, date, and annexation names are listed. As part of the legend, each 5 year annexation period is color coded. This map was donated by the Johnson City GIS Division and now resides in the map collection of Sherrod Library's Government Information, Law and Maps Department. Physical copy resides in the Government Information, Law and Maps Department of East Tennessee State University’s Sherrod Library. / https://dc.etsu.edu/rare-maps/1011/thumbnail.jpg

Large topographical map of the northeast Tennessee region around Johnson City published in 1955. Prepared by the Army Map Service, Corps of Engineers, U.S. Army, Washington D.C. Compiled in 1951 from United States Quadrangles, U.S. Geological Survey, and county highway maps. Planimetric detail partially revised by photo-planimetric methods. Control by USC & GS, TVA, and CE. Roads, railroad and aeronautical data verified by state authorities, 1954. Legend denotes populated places, types of roads, and railroads. Topography, names of roads, communities, and waterways can be found on the map itself. Physical copy resides in the Government Information, Law and Maps Department of East Tennessee State University’s Sherrod Library. Scale - 1: 250,000 / https://dc.etsu.edu/rare-maps/1043/thumbnail.jpg

Produced by the Johnson City GIS Division on June 17, 1994. This map denotes the annexations of Johnson City and the surrounding area from 1960 to 1994. The map scale indicates a ratio of 1:24,000. In the text box on the left side, the ID, date, and annexation names are listed. As part of the legend, each 5 year annexation period is color coded. Physical copy resides with Johnson City, Geographic Information Systems Division. / https://dc.etsu.edu/rare-maps/1055/thumbnail.jpg

Produced by the Johnson City GIS Division on June 19, 2001, this map denotes the annexations of Johnson City and the surrounding area from 1960 to 2000. The map scale indicates a ratio of 1:24,000. In the text box on the left side, the ID, date, and annexation names are listed. As part of the legend, each 5 year annexation period is color coded. Physical copy resides with Johnson City, Geographic Information Systems Division. Scale - 1"= 2000’ / https://dc.etsu.edu/rare-maps/1056/thumbnail.jpg

Created 3/28/2006 by Johnson City GIS, this map provides a tour of historic places in Johnson City, Tennessee. Historic sites are listed on the right edge and are denoted by numbers which correspond to places on the map.Road names are listed on the map itself. Physical copy resides with Johnson City, Geographic Information Systems Division. Scale - 1" = 0.257260 miles / https://dc.etsu.edu/rare-maps/1054/thumbnail.jpg

This thesis proposes a concept for exploring cities with an inclusive map. Most of current studies and projects only include one kind of user groups if creating systems for navigation and exploring new areas. Often, if creating a system for a very exclusive user group, e. g. visually impaired, other user groups are not considered. Though in order to create an accessible system, studies should include the user in the range of the most inclusive and most exclusive user groups. This is why we tried to create the concept of a design for an accessible city map under the approach of inclusive design. Since around 15 per cent of the world population suffer from some kind of disability, we decided to start with the most exclusive users of a city map – visually impaired. Therefore, theoretical and practical human-centred design methods are used to create a prototype hand in hand with the future user groups. The details used in the design process incorporates data from 10 survey answers from visually impaired people as well as data from 10 interviews with sighted people and a workshop with six people from different professions out of sociology, tourism marketing, HCI and language sciences. Additionally, at the end of the process, an evaluation with three visually impaired and two sighted people was used to prove the concept of the created prototype. The prototype was created with different digital fabrication and IoT tools and technologies. It should help to make public spaces more accessible and explorable. We hope to deliver a base idea of an accessible city map, which shows how to include inclusive design in the regular design process, in order to design without exceptions. The evaluation showed that our idea worked and that even though the users' groups are very different, they have a lot in common.

Submitted by FERNANDO VLADIMIR CERNA ÑAHUIS null (fvcerna83@gmail.com) on 2017-02-22T17:36:35Z No. of bitstreams: 1 TESE-FINAL.pdf: 2994686 bytes, checksum: 5e487b40d4aeb0006f40a0abdb9d9af6 (MD5) / Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-02-24T20:11:29Z (GMT) No. of bitstreams: 1 nahuis_fvc_dr_ilha.pdf: 2994686 bytes, checksum: 5e487b40d4aeb0006f40a0abdb9d9af6 (MD5) / Made available in DSpace on 2017-02-24T20:11:29Z (GMT). No. of bitstreams: 1 nahuis_fvc_dr_ilha.pdf: 2994686 bytes, checksum: 5e487b40d4aeb0006f40a0abdb9d9af6 (MD5) Previous issue date: 2017-02-17 / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / Nesta tese são apresentados três modelos de programação matemática que abordam os problemas de otimização relacionados ao gerenciamento da energia nos sistemas de distribuição de energia elétrica (SDEE), como: 1) Programação ótima das entregas e carregamento dos veículos elétricos (VEs) durante a navegação em um mapa de cidade, 2) Gerenciamento ótimo pelo lado da demanda considerando um sistema fotovoltaico híbrido (SFH) em uma residência em baixa tensão (RBT) no SDEE, e 3) O melhoramento do fator de carga (FC) do SDEE através do controle da demanda. O primeiro problema visa minimizar os custos relacionados com a manutenção e geração de horas extra durante a operação de uma frota de VEs, levando em conta um conjunto de entregas pre-especificadas, assim como, pontos de carregamento alocados ao longo de cada via urbana (principal e/ou secundária) pertencente ao mapa da cidade. No segundo problema, para uma residência em baixa tensão é planejado um perfil ótimo de consumo para o dia seguinte. Este perfil de consumo é obtido através de um programa de gerenciamento pelo lado da demanda (GLD) que considera uma estrutura tarifária e um esquema de operação que otimiza os recursos energéticos vindos de um SFH e o SDEE. Para cada problema de otimização é apresentado o seu correspondente modelo de programação não linear inteiro misto (PNLIM). O terceiro problema visa minimizar os custos por compra de energia (consumo e perdas de potência ativa) da concessionária, levando em conta, o controle da demanda dos usos-finais, presentes nas unidades consumidoras (residenciais, comerciais, e industriais) no SDEE. As incertezas na utilização dos usos-finais nas unidades consumidoras são simuladas através de um algoritmo Monte Carlo. Além disso, o modelo proposto PIMRQ é rodado dentro de um processo iterativo, que visa a melhoria do FC do SDEE. Por outro lado, através destes modelos não-lineares, a solução ótima global não é garantida, enquanto o uso de modelos equivalentes (para o primeiro e segundo problema, sendo um modelo aproximado para o terceiro) de programação linear inteira mista (PLIM) resolvidos por ferramentas de otimização clássica existentes garantem a convergência para a solução ótima global. Por conseguinte, para resolver este inconveniente, os seus modelos MILP equivalentes são obtidos e explicados em detalhe. Os modelos propostos foram implementados na linguagem de modelagem algébrica AMPL e resolvidos usando o solver comercial CPLEX. Além disso, algoritmos de simulação para representar as incertezas dos tempos de demora na operação dos VEs e os hábitos de utilização dos usos-finais durante o dia, são desenvolvidos. Um grafo unidirecional de 71 nós, uma rede elétrica IEEE de 34 nós, e 21 usos-finais (incluído um VE plug-in para o carregamento na residência) residenciais são utilizados para testar a precisão e a eficiência, assim como, também técnica de solução dos modelos propostos para cada problema. / This thesis presents three mathematical programming models to address the optimization problems related to the energy management in the electricity distribution systems (EDSs), such as: 1) Optimal delivery scheduling and charging of electric vehicles (EVs) in the navigation of a city map, 2) Optimal demand side management of an EDS considering a hybrid photovoltaic system (HPS) in a residential low voltage (RLV), and 3) Load factor improvement through the demand control in the EDS. The first problem aims at minimizing the costs related to the maintenance and generation of extra hours during the operation of a EVs fleet, taking into account a number of prespecified deliveries, as well as charging points allocated along each urban road (main or secondary) belongs to the city map. In the second problem, for a RLV, an optimal consumption profile of a day-ahead is planned. This consumption profile is obtained through a demand side management (DSM) program that considers a tariff structure and an operating scheme that optimizes the energy resources coming from HFS and EDS. The third problem aims at minimizing the costs of energy purchase (consumption and active energy losses) of the company, taking into account, the demand control of the end-uses, presents in the consumers units (residential, commercial, and industrial) in the EDS. Uncertainties in the use of the end-uses in the different consumer units are simulated through a Monte Carlo algorithm that determines a habitual consumption profile for EDSs. Based on this habitual profile, the proposed MIPRQ model determines an optimal profile for EDSs. This model uses an iterative process that aims to improve the load factor of the EDS. For each optimization problem the corresponding non-linear mixed integer programming (NLMIP) model is presented. On the other hand, via these nonlinear models, the global optimal solution is not guaranteed, while using the equivalent mixed-integer linear (MILP) models (for the first and second problems, being an approximate model for the third) and solving them by existing classical optimization tools ensures convergence to global optimal solution. Therefore, in order to address this drawback, their equivalent mixed integer linear programming (MILP) models are obtained and explained in detail. The proposed models are implemented in the algebraic modeling language AMPL and solved using the commercial CPLEX solver. Moreover, simulations algorithms to represent the uncertainties of delay times in the operation of EVs and usage habits of end-uses during the day, are developed. A multidirectional graph with 71 nodes, an electrical network IEEE 34 nodes, and a quantity of 21 residential end-uses (including an EV plug-in for residential charging) are used to test the precision and the efficiency, as well as the solution technique of the models proposed for each problem. / CNPq: 141462/2013- 2