A Distributed Robotic Vision Service

Robotic vision is limited by line of sight and onboard camera capabilities. Robots can acquire video or images from remote cameras, but processing additional data has a computational burden. This paper applies the Distributed Robotic Vision Service, DRVS, to robot path planning using data outside line-of-sight of the robot. DRVS implements a distributed visual object detection service to distributes the computation to remote camera nodes with processing capabilities. Robots request task-specific object detection from DRVS by specifying a geographic region of interest and object type. The remote camera nodes perform the visual processing and send the high-level object information to the robot. Additionally, DRVS relieves robots of sensor discovery by dynamically distributing object detection requests to remote camera nodes. Tested over two different indoor path planning tasks DRVS showed dramatic reduction in mobile robot compute load and wireless network utilization.

Traffic Profiling for Efficient Network Resource Utilization.

Traffic Engineering has been the prime concern for Internet Service Providers (ISPs), with the main focus being minimization of over-utilization of network capacity even though additional capacity is available which is under-utilized, Furthermore, requirements of timely delivery of digitized audiovisual information raises a new challenge of finding a path meeting these requirements. This paper addresses the issue of (a) distributing load to achieve global efficiency in resource utilization. (b) Finding a path satisfying the real time requirements of, delay and bandwidth requested by the applications. In this paper we do a critical study of the link utilization that varies over time and determine the time interval during which the link occupancy remains constant across days. This information helps in pre-determining link utilization that is useful in balancing load in the network Finally, we run simulations that use a dynamic time interval for profiling traffic and show improvement in terms number of calls admitted/blocked.

RESTful Discovery and Eventing for Service Provisioning in Assisted Living Environments

Service provisioning in assisted living environments faces distinct challenges due to the heterogeneity of networks, access technology, and sensing/actuation devices in such an environment. Existing solutions, such as SOAP-based web services, can interconnect heterogeneous devices and services, and can be published, discovered and invoked dynamically. However, it is considered heavier than what is required in the smart environment-like context and hence suffers from performance degradation. Alternatively, REpresentational State Transfer (REST) has gained much attention from the community and is considered as a lighter and cleaner technology compared to the SOAP-based web services. Since it is simple to publish and use a RESTful web service, more and more service providers are moving toward REST-based solutions, which promote a resource-centric conceptualization as opposed to a service-centric conceptualization. Despite such benefits of REST, the dynamic discovery and eventing of RESTful services are yet considered a major hurdle to utilization of the full potential of REST-based approaches. In this paper, we address this issue, by providing a RESTful discovery and eventing specification and demonstrate it in an assisted living healthcare scenario. We envisage that through this approach, the service provisioning in ambient assisted living or other smart environment settings will be more efficient, timely, and less resource-intensive.

Acoustic tracking of reef fishes to elucidate habitat utilization patterns and residence times inside and outside marine protected areas around the island of St. John, USVI

This technical memorandum describes a developing project under the direction of NOAA’s Biogeography Branch in consultation with the National Park Service and US Geological Survey to understand and quantify spatial patterns and habitat affinities of reef fishes in the US Virgin Islands. The purpose of this report is to describe and disseminate the initial results from the project and to share information on the location of acoustic receivers and species electronic tag ID codes. The Virgin Islands Coral Reef National Monument (VICRNM), adjacent to Virgin Islands National Park (VIIS), was established by Executive Order in 2000, but resources within the monument are poorly documented and the degree of connectivity to VIIS is unknown. Whereas, VICRNM was established with full protection from resource exploitation, VIIS has incurred resource harvest by fishers since 1956 as allowed in its enabling legislation. Large changes in local reef communities have occurred over the past several decades, in part due to overexploitation. In order to better understand the habitat utilization patterns and movement of fishes among management regimes and areas open to fishing around St, John, an array of hydroacoustic receivers was deployed while a variety of reef fish species were acoustically tagged. In July 2006, nine receivers with a detection range of ca. 350 m were deployed in Lameshur Bay on the south shore of St. John, within VIIS. Receivers were located adjacent to reefs and in seagrass beds, inshore and offshore of these reefs. It was found that lane snappers and bluestriped grunts showed diel movement from reef habitats during daytime hours to offshore seagrass bed at night. Timing of migrations was highly predictable and coincided with changes in sunrise and sunset over the course of the year. Fish associated with reefs that did not have adjacent seagrass beds made more extensive movements than those fishes associated with reefs that had adjacent seagrass habitats. In April 2007, 21 additional receivers were deployed along much of the south shore of St. John (ca. 20 km of shoreline). This current array will address broader-scale movement among management units and examine the potential benefits of the VICRNM to provide adult “spillover” into VIIS and adjacent harvested areas. The results from this work will aid in defining fine to moderate spatial scales of reef fish habitat affinities and in designing and evaluating marine protected areas.

Utilization of treated wood, steel, fibreglass, ferrocement and aluminium in the construction of modern fishing boats and their comparative cost analysis

Modern fishing boats have to be built not only on perfect lines but also with sound and strong construction materials that will ensure a long lasting trouble free service commensurate with the heavy capital investment involved. Choice of construction materials for fishing boats need careful scrutiny as they have to perform too well under most aggressive environments-sea-water and marine atmosphere. A number of alternative boat-building materials are now available whose comparative merits and demerits as well as comparative costs are brought out in this paper.

A Virtual Deadline Scheduler for Window-Constrained Service Guarantees

This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), that attempts to guarantee no more than x out of y deadlines are missed for real-time jobs such as periodic CPU tasks, or delay-constrained packet streams. While DWCS is capable of generating a feasible window-constrained schedule that utilizes 100% of resources, it requires all jobs to have the same request periods (or intervals between successive service requests). We describe a new algorithm called Virtual Deadline Scheduling (VDS), that provides window-constrained service guarantees to jobs with potentially different request periods, while still maximizing resource utilization. VDS attempts to service m out of k job instances by their virtual deadlines, that may be some finite time after the corresponding real-time deadlines. Notwithstanding, VDS is capable of outperforming DWCS and similar algorithms, when servicing jobs with potentially different request periods. Additionally, VDS is able to limit the extent to which a fraction of all job instances are serviced late. Results from simulations show that VDS can provide better window-constrained service guarantees than other related algorithms, while still having as good or better delay bounds for all scheduled jobs. Finally, an implementation of VDS in the Linux kernel compares favorably against DWCS for a range of scheduling loads.

Anti-cholinergic load, health care utilization, and survival in people with advanced cancer: a pilot study.

INTRODUCTION: Anti-cholinergic medications have been associated with increased risks of cognitive impairment, premature mortality and increased risk of hospitalisation. Anti-cholinergic load associated with medication increases as death approaches in those with advanced cancer, yet little is known about associated adverse outcomes in this setting. METHODS: A substudy of 112 participants in a randomised control trial who had cancer and an Australia modified Karnofsky Performance Scale (AKPS) score (AKPS) of 60 or above, explored survival and health service utilisation; with anti-cholinergic load calculated using the Clinician Rated Anti-cholinergic Scale (modified version) longitudinally to death. A standardised starting point for prospectively calculating survival was an AKPS of 60 or above. RESULTS: Baseline entry to the sub-study was a mean 62 +/- 81 days (median 37, range 1-588) days before death (survival), with mean of 4.8 (median 3, SD 4.18, range 1 - 24) study assessments in this time period. Participants spent 22% of time as an inpatient. There was no significant association between anti-cholinergic score and time spent as an inpatient (adjusted for survival time) (p = 0.94); or survival time. DISCUSSION: No association between anti-cholinergic load and survival or time spent as an inpatient was seen. Future studies need to include cognitively impaired populations where the risks of symptomatic deterioration may be more substantial.

HOME-BASED REHABILITATION AND ITS IMPACT ON HOSPITAL UTILIZATION

There is compelling evidence for the effectiveness of home-based occupational therapy and physiotherapy rehabilitation for community dwelling elderly who may struggle with basic activities and the functions of daily living and mobility. Nonetheless, an estimated 2% of home care’s elderly clients receive these therapies. Ontario’s home care data indicates that 78% of clients that could benefit from these specific therapies are not receiving them. The study examined a subset of elderly clients receiving home care following a hospital discharge during 2009-2010. The aim of this study was to: understand the difference between those home care clients who received occupational therapy or physiotherapy and those who did not; and determine if receiving these therapies impacted the utilization of hospital emergency departments and inpatient admissions. A retrospective cohort design and multivariate and survival analysis of hospital and home care administrative data structured the study. Results suggest that home-based rehabilitation is offered to a minority of the home care population. Distinct client characteristics and process variables significantly associated with the increased likelihood of receiving home-based occupational and physical therapies included: clients who were older, females, admitted to home care from hospital inpatient units, assessed as non-acute for clinical and service needs and required more home making support and assistance with activities of daily living. Almost one quarter of the total sample returned to hospital. Visits to emergency departments accounted for the greater part of hospital utilization and primarily for sub-acute general symptoms and signs, post-procedural complications, infections or acute episodes from chronic obstructive pulmonary disease and renal failure. Slightly over half of the clients returning to hospital did not receive home-based rehabilitation. Clients who received occupational therapy returned to the hospital sooner following their home care admission whereas clients receiving physiotherapy spent the longest time before rehospitalizing. The majority of the clients receiving occupational therapy were admitted to home care having just resolved sub-acute conditions or symptoms, many of which are known to influence functional and physical decline. Moreover, analysis of process variables indicated that the wait time for a referral to occupational therapy was two times longer compared to physiotherapy. These same clients also waited, on average, over one month before an occupational therapist’s first visit. The need to discriminate who receives home-based rehabilitation is essential to understanding how specific therapies contribute to improving systems outcomes. This study is the first examination that focuses specifically on home-based occupational therapy and physiotherapy rehabilitation and the client characteristics and process variables associated with receiving/not receiving these therapies and the impact these factors have on the time-to-rehospitalization.

Does Cost-Effectiveness Analysis Have a Role in US Managed Care Drug Formularies? An Empirical Study of Utilization, Costs, Outcomes, and Elasticity of Demand of a Value-Based Formulary

Thesis (Ph.D.)--University of Washington, 2015

Predictors of primary health care utilization by former residents of institutions in Ontario

For years institutionalization has been the primary method of service delivery for persons with developmental disabilities (DD). However, in Ontario the last institution was closed on March 31, 2009 with former residents now residing in small, communitybased homes. This study investigated potential predictors of primary health care utilization by former residents. Several indirect measures were employed to gather information from 60 participants on their age, health status, adaptive functioning level, problem behaviour, mental health status and, total psychotropic medication use. A direct measure was used to gather primary health care utilization information, which served as the dependent variable. A stepwise linear regression failed to reveal significant predictors of health care utilization. The data were subsequently dichotomized and the outcomes of a logistic regression analysis indicated that mental health status, psychotropic medication use and, an interaction between mental health status and health status significantly predicted higher primary health care usage.

Routage adaptatif et qualité de service dans les réseaux optiques à commutation de rafales

Les réseaux optiques à commutation de rafales (OBS) sont des candidats pour jouer un rôle important dans le cadre des réseaux optiques de nouvelle génération. Dans cette thèse, nous nous intéressons au routage adaptatif et au provisionnement de la qualité de service dans ce type de réseaux. Dans une première partie de la thèse, nous nous intéressons à la capacité du routage multi-chemins et du routage alternatif (par déflection) à améliorer les performances des réseaux OBS, pro-activement pour le premier et ré-activement pour le second. Dans ce contexte, nous proposons une approche basée sur l’apprentissage par renforcement où des agents placés dans tous les nœuds du réseau coopèrent pour apprendre, continuellement, les chemins du routage et les chemins alternatifs optimaux selon l’état actuel du réseau. Les résultats numériques montrent que cette approche améliore les performances des réseaux OBS comparativement aux solutions proposées dans la littérature. Dans la deuxième partie de cette thèse, nous nous intéressons au provisionnement absolu de la qualité de service où les performances pire-cas des classes de trafic de priorité élevée sont garanties quantitativement. Plus spécifiquement, notre objectif est de garantir la transmission sans pertes des rafales de priorité élevée à l’intérieur du réseau OBS tout en préservant le multiplexage statistique et l’utilisation efficace des ressources qui caractérisent les réseaux OBS. Aussi, nous considérons l’amélioration des performances du trafic best effort. Ainsi, nous proposons deux approches : une approche basée sur les nœuds et une approche basée sur les chemins. Dans l’approche basée sur les nœuds, un ensemble de longueurs d’onde est assigné à chaque nœud du bord du réseau OBS pour qu’il puisse envoyer son trafic garanti. Cette assignation prend en considération les distances physiques entre les nœuds du bord. En outre, nous proposons un algorithme de sélection des longueurs d’onde pour améliorer les performances des rafales best effort. Dans l’approche basée sur les chemins, le provisionnement absolu de la qualité de service est fourni au niveau des chemins entre les nœuds du bord du réseau OBS. À cette fin, nous proposons une approche de routage et d’assignation des longueurs d’onde qui a pour but la réduction du nombre requis de longueurs d’onde pour établir des chemins sans contentions. Néanmoins, si cet objectif ne peut pas être atteint à cause du nombre limité de longueurs d’onde, nous proposons de synchroniser les chemins en conflit sans le besoin pour des équipements additionnels. Là aussi, nous proposons un algorithme de sélection des longueurs d’onde pour les rafales best effort. Les résultats numériques montrent que l’approche basée sur les nœuds et l’approche basée sur les chemins fournissent le provisionnement absolu de la qualité de service pour le trafic garanti et améliorent les performances du trafic best effort. En outre, quand le nombre de longueurs d’ondes est suffisant, l’approche basée sur les chemins peut accommoder plus de trafic garanti et améliorer les performances du trafic best effort par rapport à l’approche basée sur les nœuds.

Solution Methods for Service Network Design with Resource Management Consideration

La gestion des ressources, équipements, équipes de travail, et autres, devrait être prise en compte lors de la conception de tout plan réalisable pour le problème de conception de réseaux de services. Cependant, les travaux de recherche portant sur la gestion des ressources et la conception de réseaux de services restent limités. La présente thèse a pour objectif de combler cette lacune en faisant l’examen de problèmes de conception de réseaux de services prenant en compte la gestion des ressources. Pour ce faire, cette thèse se décline en trois études portant sur la conception de réseaux. La première étude considère le problème de capacitated multi-commodity fixed cost network design with design-balance constraints(DBCMND). La structure multi-produits avec capacité sur les arcs du DBCMND, de même que ses contraintes design-balance, font qu’il apparaît comme sous-problème dans de nombreux problèmes reliés à la conception de réseaux de services, d’où l’intérêt d’étudier le DBCMND dans le contexte de cette thèse. Nous proposons une nouvelle approche pour résoudre ce problème combinant la recherche tabou, la recomposition de chemin, et une procédure d’intensification de la recherche dans une région particulière de l’espace de solutions. Dans un premier temps la recherche tabou identifie de bonnes solutions réalisables. Ensuite la recomposition de chemin est utilisée pour augmenter le nombre de solutions réalisables. Les solutions trouvées par ces deux méta-heuristiques permettent d’identifier un sous-ensemble d’arcs qui ont de bonnes chances d’avoir un statut ouvert ou fermé dans une solution optimale. Le statut de ces arcs est alors fixé selon la valeur qui prédomine dans les solutions trouvées préalablement. Enfin, nous utilisons la puissance d’un solveur de programmation mixte en nombres entiers pour intensifier la recherche sur le problème restreint par le statut fixé ouvert/fermé de certains arcs. Les tests montrent que cette approche est capable de trouver de bonnes solutions aux problèmes de grandes tailles dans des temps raisonnables. Cette recherche est publiée dans la revue scientifique Journal of heuristics. La deuxième étude introduit la gestion des ressources au niveau de la conception de réseaux de services en prenant en compte explicitement le nombre fini de véhicules utilisés à chaque terminal pour le transport de produits. Une approche de solution faisant appel au slope-scaling, la génération de colonnes et des heuristiques basées sur une formulation en cycles est ainsi proposée. La génération de colonnes résout une relaxation linéaire du problème de conception de réseaux, générant des colonnes qui sont ensuite utilisées par le slope-scaling. Le slope-scaling résout une approximation linéaire du problème de conception de réseaux, d’où l’utilisation d’une heuristique pour convertir les solutions obtenues par le slope-scaling en solutions réalisables pour le problème original. L’algorithme se termine avec une procédure de perturbation qui améliore les solutions réalisables. Les tests montrent que l’algorithme proposé est capable de trouver de bonnes solutions au problème de conception de réseaux de services avec un nombre fixe des ressources à chaque terminal. Les résultats de cette recherche seront publiés dans la revue scientifique Transportation Science. La troisième étude élargie nos considérations sur la gestion des ressources en prenant en compte l’achat ou la location de nouvelles ressources de même que le repositionnement de ressources existantes. Nous faisons les hypothèses suivantes: une unité de ressource est nécessaire pour faire fonctionner un service, chaque ressource doit retourner à son terminal d’origine, il existe un nombre fixe de ressources à chaque terminal, et la longueur du circuit des ressources est limitée. Nous considérons les alternatives suivantes dans la gestion des ressources: 1) repositionnement de ressources entre les terminaux pour tenir compte des changements de la demande, 2) achat et/ou location de nouvelles ressources et leur distribution à différents terminaux, 3) externalisation de certains services. Nous présentons une formulation intégrée combinant les décisions reliées à la gestion des ressources avec les décisions reliées à la conception des réseaux de services. Nous présentons également une méthode de résolution matheuristique combinant le slope-scaling et la génération de colonnes. Nous discutons des performances de cette méthode de résolution, et nous faisons une analyse de l’impact de différentes décisions de gestion des ressources dans le contexte de la conception de réseaux de services. Cette étude sera présentée au XII International Symposium On Locational Decision, en conjonction avec XXI Meeting of EURO Working Group on Locational Analysis, Naples/Capri (Italy), 2014. En résumé, trois études différentes sont considérées dans la présente thèse. La première porte sur une nouvelle méthode de solution pour le "capacitated multi-commodity fixed cost network design with design-balance constraints". Nous y proposons une matheuristique comprenant la recherche tabou, la recomposition de chemin, et l’optimisation exacte. Dans la deuxième étude, nous présentons un nouveau modèle de conception de réseaux de services prenant en compte un nombre fini de ressources à chaque terminal. Nous y proposons une matheuristique avancée basée sur la formulation en cycles comprenant le slope-scaling, la génération de colonnes, des heuristiques et l’optimisation exacte. Enfin, nous étudions l’allocation des ressources dans la conception de réseaux de services en introduisant des formulations qui modèlent le repositionnement, l’acquisition et la location de ressources, et l’externalisation de certains services. À cet égard, un cadre de solution slope-scaling développé à partir d’une formulation en cycles est proposé. Ce dernier comporte la génération de colonnes et une heuristique. Les méthodes proposées dans ces trois études ont montré leur capacité à trouver de bonnes solutions.

lntemet utilization and academic activities of faculty members in the universities of Kerala : an analytical study

This thesis Entitled Internet Utilization and Academic Activities of Faculty Members in the Universities of kerala: an analytical study. Today, scientific research is throwing up new discoveries, inventions and vistas by the hour. We are witnessing a veritable knowledge explosion. It is important for members of university faculty members to keep abreast of it for giving up-t-date information to their students about the new development in the subject of their study. The internet is an invaluable tool for achieving it. Most of the universities have sufficient internet facility, but the accessibility to all the faculty members is not adequate. University Libraries also provides standard supplementary service in the internet area. This study indicates differential level of awareness and utilization of the internet services by the faculty members in the areas of teaching, research and publication. However the overall impression is that the awareness and utilization is inadequate. This point to the urgent need to devise programs and schemes to promote internet utilization among the faculty members. The suggestions indicate the key areas that deserve attention by policy makers and administrators. Thanks to the internet, every new development in every field of study is just a click away for faculty members, research scholars and students.

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred

A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.