121,436 research outputs found

    Social Cohesion, Structural Holes, and a Tale of Two Measures

    Get PDF
    EMBARGOED - author can archive pre-print or post-print on any open access repository after 12 months from publication. Publication date is May 2013 so embargoed until May 2014.This is an author’s accepted manuscript (deposited at arXiv arXiv:1211.0719v2 [physics.soc-ph] ), which was subsequently published in Journal of Statistical Physics May 2013, Volume 151, Issue 3-4, pp 745-764. The final publication is available at link.springer.com http://link.springer.com/article/10.1007/s10955-013-0722-

    Mathematics and the Internet: A Source of Enormous Confusion and Great Potential

    Get PDF
    Graph theory models the Internet mathematically, and a number of plausible mathematically intersecting network models for the Internet have been developed and studied. Simultaneously, Internet researchers have developed methodology to use real data to validate, or invalidate, proposed Internet models. The authors look at these parallel developments, particularly as they apply to scale-free network models of the preferential attachment type

    Detecting and Refactoring Operational Smells within the Domain Name System

    Full text link
    The Domain Name System (DNS) is one of the most important components of the Internet infrastructure. DNS relies on a delegation-based architecture, where resolution of names to their IP addresses requires resolving the names of the servers responsible for those names. The recursive structures of the inter dependencies that exist between name servers associated with each zone are called dependency graphs. System administrators' operational decisions have far reaching effects on the DNSs qualities. They need to be soundly made to create a balance between the availability, security and resilience of the system. We utilize dependency graphs to identify, detect and catalogue operational bad smells. Our method deals with smells on a high-level of abstraction using a consistent taxonomy and reusable vocabulary, defined by a DNS Operational Model. The method will be used to build a diagnostic advisory tool that will detect configuration changes that might decrease the robustness or security posture of domain names before they become into production.Comment: In Proceedings GaM 2015, arXiv:1504.0244

    Operational Plan for HMIS Rollout to be Read in Conjunction with the MoH&SW Document of October 2007

    Get PDF
    The MoH&SW, with a consortium of partners, in October 2007, developed a Proposal to Strengthen the HMIS in Tanzania. This document builds on that proposal to develop a budgeted 6‐month plan to kick‐start implementation of the Revised MTUHA in one region and at national level, to develop a replicable model that can be scaled up to other regions as additional funds become available. The overall HMIS revision process will ensure that, within a period of five years the HMIS will be functional in all 21 regions of the country, in a phased manner Six months intensive systems and database development in Mtwara region Eighteen months implementation in one region in each of the six zones Within 5 years, National rollout to every region The initial six months implementation process, described in depth in this document, will use action research and participatory development methodology that will integrate the six work packages in the HMIS document, in line with the HSSP III proposals for strengthening M&E. A number of dedicated teams will roll out the HMIS, develop a toolkit for implementation in other regions and produce a modern web based data warehouse. The project logframe aims to provide quality routine data for monitoring MDGs and the NHSSPIII by producing five outputs – HMIS revision, HMIS implementation, Capacity development, the DHIS software and action research. Terms of reference are developed for each of the HMIS teams, based on the activities in the logframe – Indicator and dataset revision, HMIS design, Database development and training team. An action‐based budget of US15millionisprovidedforthreeyearsthatenvisagesThemodelregionwillcost 15 million is provided for three years that envisages The model region will cost 1,25 million for the first year, including the rollout activities, the development of training material, adaptation of software etc. The other six regions will cost 1,05million for first year; all regions will reduce to 500,000forthesecondyearand500,000 for the second year and 300,000 in the third year. National level costs will reduce from 700,000to500,000ayearaslocalconsultantsreplaceinternationaltechnicalassistanceandMinistrytakesoverrunningexpenses.Rolloutfortheother14regionswillneedaseparatebudgetingprocessafterthesixregions,butshouldbeintherangeof1,8millionayear(orlessifcostscanbereduced).Theactivitiesinthemodelinitiationregionwillcost700,000 to 500,000 a year as local consultants replace international technical assistance and Ministry takes over running expenses. Rollout for the other 14 regions will need a separate budgeting process after the six regions, but should be in the range of 1,8 million a year (or less if costs can be reduced). The activities in the model initiation region will cost 1,2 million for the first year, including the rollout activities, the development of training material, adaptation of software et

    On Constructor Rewrite Systems and the Lambda Calculus

    Full text link
    We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by- value beta-reduction can be simulated by an orthogonal constructor term rewrite system in the same number of reduction steps. Conversely, each reduction in a term rewrite system can be simulated by a constant number of beta-reduction steps. This is relevant to implicit computational complexity, because the number of beta steps to normal form is polynomially related to the actual cost (that is, as performed on a Turing machine) of normalization, under weak call-by-value reduction. Orthogonal constructor term rewrite systems and lambda-calculus are thus both polynomially related to Turing machines, taking as notion of cost their natural parameters.Comment: 27 pages. arXiv admin note: substantial text overlap with arXiv:0904.412
    • …
    corecore