Chronic disease, geographic location and socioeconomic disadvantage as obstacles to equitable access to e-health

Despite recent public attention to e-health as a solution to rising healthcare costs and an ageingpopulation, there have been relatively few studies examining the geographical pattern of e-health usage. This paper argues for an equitable approach to e-health and attention to the way in which e-health initiatives can produce locational health inequalities, particularly in socioeconomically disadvantaged areas. In this paper, we use a case study to demonstrate geographical variation in Internet accessibility, Internet status and prevalence of chronic diseases within a small district. There are signifi cant disparities in access to health information within socioeconomically disadvantaged areas. The most vulnerable people in these areas are likely to have limited availability of, or access to Internet healthcare resources. They are also more likely to have complex chronic diseases and, therefore, be in greatest need of these resources. This case study demonstrates the importance of an equitable approach to e-health information technologies and telecommunications infrastructure.

Geoproof : proofs of geographic location for cloud computing environment

Cloud computing has emerged as a major ICT trend and has been acknowledged as a key theme of industry by prominent ICT organisations. However, one of the major challenges that face the cloud computing concept and its global acceptance is how to secure and protect the data that is the property of the user. The geographic location of cloud data storage centres is an important issue for many organisations and individuals due to the regulations and laws that require data and operations to reside in specific geographic locations. Thus, data owners may need to ensure that their cloud providers do not compromise the SLA contract and move their data into another geographic location. This paper introduces an architecture for a new approach for geographic location assurance, which combines the proof of storage protocol (POS) and the distance-bounding protocol. This allows the client to check where their stored data is located, without relying on the word of the cloud provider. This architecture aims to achieve better security and more flexible geographic assurance within the environment of cloud computing.

On the Geographic Location of Internet Resources

One relatively unexplored question about the Internet's physical structure concerns the geographical location of its components: routers, links and autonomous systems (ASes). We study this question using two large inventories of Internet routers and links, collected by different methods and about two years apart. We first map each router to its geographical location using two different state-of-the-art tools. We then study the relationship between router location and population density; between geographic distance and link density; and between the size and geographic extent of ASes. Our findings are consistent across the two datasets and both mapping methods. First, as expected, router density per person varies widely over different economic regions; however, in economically homogeneous regions, router density shows a strong superlinear relationship to population density. Second, the probability that two routers are directly connected is strongly dependent on distance; our data is consistent with a model in which a majority (up to 75-95%) of link formation is based on geographical distance (as in the Waxman topology generation method). Finally, we find that ASes show high variability in geographic size, which is correlated with other measures of AS size (degree and number of interfaces). Among small to medium ASes, ASes show wide variability in their geographic dispersal; however, all ASes exceeding a certain threshold in size are maximally dispersed geographically. These findings have many implications for the next generation of topology generators, which we envisage as producing router-level graphs annotated with attributes such as link latencies, AS identifiers and geographical locations.

The Impact on Geographic Location Accuracy due to Different Satellite Orbit Ephemerides

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Errors due to the tropospheric and ionospheric effects on the geographic location of data collection platforms

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Distribution of Brazilian dermatologists according to geographic location, population and HDI of municipalities: an ecological study

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Construction of a limited geographic location code; a report of a project sponsored by the Manpower Branch, Human Resources Division, Office of Naval Research, Contract N 7 onr-422.

Mode of access: Internet.

Residential sales by auction : a property type or geographic consideration

The sale of residential property by auction is a preferred sale method by real estate agents, but not always preferred by some vendors and most residential property buyers. In many residential property markets, the performance and measure of residential property market activity is based on the number of properties offered for sale by auction, auction clearance rates and the number of properties sold prior to auction. However, in many specific residential property markets, sale by auction may not be the preferred or supported method of sale. This paper will review the type of residential property sale within the Sydney residential property market and track the auction sales and clearance rates for Sydney over the past 5 months and compare these results in relation to clearance rates, passed in sales, and properties sold prior to auction This will provide a breakdown of real estate agency sale practice over a large metropolitan region to determine the impact of geographic location and socio-economic factors on the auction of residential property. In addition the paper will analyse the weekly auction sales in the Sydney residential property market to determine what areas of Sydney have the greatest number of house auctions and the performance of the auctions in relation location and socio economic factors.

Enhanced geoproof : improved geographic assurance for data in the cloud

The geographic location of cloud data storage centres is an important issue for many organisations and individuals due to various regulations that require data and operations to reside in specific geographic locations. Thus, cloud users may want to be sure that their stored data have not been relocated into unknown geographic regions that may compromise the security of their stored data. Albeshri et al. (2012) combined proof of storage (POS) protocols with distance-bounding protocols to address this problem. However, their scheme involves unnecessary delay when utilising typical POS schemes due to computational overhead at the server side. The aim of this paper is to improve the basic GeoProof protocol by reducing the computation overhead at the server side. We show how this can maintain the same level of security while achieving more accurate geographic assurance.

Wireless privacy and personalized location-based services: the challenge of translating the legal framework into business practices

L'avancement des communications sans-fil permet l'obtention de nouveaux services bases sur l'habileté des fournisseurs de services sans-fil à déterminer avec précision, et avec l'utilisation de technologies de pistage, la localisation et position géographiquement d'appareils sans-fil Cette habileté permet d'offrir aux utilisateurs de sans-fil de nouveaux services bases sur la localisation et la position géographique de leur appareil. Le développement des services basés sur la localisation des utilisateurs de sans-fil soulevé certains problèmes relatifs à la protection de la vie privée qui doivent être considérés. En effet, l'appareil sans-fil qui suit et enregistre les mouvements de I 'utilisateur permet un système qui enregistre et entrepose tous les mouvements et activités d'un tel utilisateur ou encore qui permet l'envoi de messages non anticipes à ce dernier. Pour ce motif et afin de protéger la vie privée des utilisateurs de sans-fil, une compagnie désirant développer ou déployer une technologie permettant d'offrir ce genre de services personnalisés devra analyser l'encadrement légal touchant la protection des données personnelles--lequel est dans certains cas vague et non approprié à ce nouveau contexte--ainsi que la position de l'industrie dans ce domaine, et ce, afin d'être en mesure de traduire cet encadrement en pratiques commerciales. Cette analyse permettra d'éclairer le fournisseur de ces services sur la façon d'établir son modèle d'affaires et sur le type de technologie à développer afin d'être en mesure de remédier aux nouveaux problèmes touchant la vie privée tout en offrant ces nouveaux services aux utilisateurs de sans-fil.

Dynamic Facility Location with Modular Capacities : Models, Algorithms and Applications in Forestry

Les décisions de localisation sont souvent soumises à des aspects dynamiques comme des changements dans la demande des clients. Pour y répondre, la solution consiste à considérer une flexibilité accrue concernant l’emplacement et la capacité des installations. Même lorsque la demande est prévisible, trouver le planning optimal pour le déploiement et l'ajustement dynamique des capacités reste un défi. Dans cette thèse, nous nous concentrons sur des problèmes de localisation avec périodes multiples, et permettant l'ajustement dynamique des capacités, en particulier ceux avec des structures de coûts complexes. Nous étudions ces problèmes sous différents points de vue de recherche opérationnelle, en présentant et en comparant plusieurs modèles de programmation linéaire en nombres entiers (PLNE), l'évaluation de leur utilisation dans la pratique et en développant des algorithmes de résolution efficaces. Cette thèse est divisée en quatre parties. Tout d’abord, nous présentons le contexte industriel à l’origine de nos travaux: une compagnie forestière qui a besoin de localiser des campements pour accueillir les travailleurs forestiers. Nous présentons un modèle PLNE permettant la construction de nouveaux campements, l’extension, le déplacement et la fermeture temporaire partielle des campements existants. Ce modèle utilise des contraintes de capacité particulières, ainsi qu’une structure de coût à économie d’échelle sur plusieurs niveaux. L'utilité du modèle est évaluée par deux études de cas. La deuxième partie introduit le problème dynamique de localisation avec des capacités modulaires généralisées. Le modèle généralise plusieurs problèmes dynamiques de localisation et fournit de meilleures bornes de la relaxation linéaire que leurs formulations spécialisées. Le modèle peut résoudre des problèmes de localisation où les coûts pour les changements de capacité sont définis pour toutes les paires de niveaux de capacité, comme c'est le cas dans le problème industriel mentionnée ci-dessus. Il est appliqué à trois cas particuliers: l'expansion et la réduction des capacités, la fermeture temporaire des installations, et la combinaison des deux. Nous démontrons des relations de dominance entre notre formulation et les modèles existants pour les cas particuliers. Des expériences de calcul sur un grand nombre d’instances générées aléatoirement jusqu’à 100 installations et 1000 clients, montrent que notre modèle peut obtenir des solutions optimales plus rapidement que les formulations spécialisées existantes. Compte tenu de la complexité des modèles précédents pour les grandes instances, la troisième partie de la thèse propose des heuristiques lagrangiennes. Basées sur les méthodes du sous-gradient et des faisceaux, elles trouvent des solutions de bonne qualité même pour les instances de grande taille comportant jusqu’à 250 installations et 1000 clients. Nous améliorons ensuite la qualité de la solution obtenue en résolvent un modèle PLNE restreint qui tire parti des informations recueillies lors de la résolution du dual lagrangien. Les résultats des calculs montrent que les heuristiques donnent rapidement des solutions de bonne qualité, même pour les instances où les solveurs génériques ne trouvent pas de solutions réalisables. Finalement, nous adaptons les heuristiques précédentes pour résoudre le problème industriel. Deux relaxations différentes sont proposées et comparées. Des extensions des concepts précédents sont présentées afin d'assurer une résolution fiable en un temps raisonnable.

The location of lightning affecting the ionospheric sporadic-E layer as evidence for multiple enhancement mechanisms

We present a study of the geographic location of lightning affecting the ionospheric sporadic-E (Es) layer over the ionospheric monitoring station at Chilton, UK. Data from the UK Met Office's Arrival Time Difference (ATD) lightning detection system were used to locate lightning strokes in the vicinity of the ionospheric monitoring station. A superposed epoch study of this data has previously revealed an enhancement in the Es layer caused by lightning within 200km of Chilton. In the current paper, we use the same data to investigate the location of the lightning strokes which have the largest effect on the Es layer above Chilton. We find that there are several locations where the effect of lightning on the ionosphere is most significant statistically, each producing different ionospheric responses. We interpret this as evidence that there is more than one mechanism combining to produce the previously observed enhancement in the ionosphere.

GeoConnect : geographic and connectivity-aware routing protocol for wireless sensor network

Sensor nodes are closely tied with their geographic location and their connectivity. In recent years many routing protocols have been developed to provide efficient strategy. But most of them are either focus on the geographic proximity or on connectivity. However in sparse network, Geographic routing would fail at local dead ends where a node has no neighbour closer to destination. In contrast, connectivity-based routing may result in non-optimal path and overhead management. In this paper we designed a scalable and distributed routing protocol, GeoConnect, which considers geographic proximity and connectivity for choosing next hop. In GeoConnecl, we construct a new naming system that integrates geographic and connectivity information into a node identification. We use dissimilarity function to compute the dissimilarity and apply a distributed routing algorithm to route packets. The experimental results show that GeoConnect routing provides robust and better performance than sole geographic routing or connectivity routing.