80 research outputs found

    Threshold Graphs Maximize Homomorphism Densities

    Full text link
    Given a fixed graph HH and a constant c[0,1]c \in [0,1], we can ask what graphs GG with edge density cc asymptotically maximize the homomorphism density of HH in GG. For all HH for which this problem has been solved, the maximum is always asymptotically attained on one of two kinds of graphs: the quasi-star or the quasi-clique. We show that for any HH the maximizing GG is asymptotically a threshold graph, while the quasi-clique and the quasi-star are the simplest threshold graphs having only two parts. This result gives us a unified framework to derive a number of results on graph homomorphism maximization, some of which were also found quite recently and independently using several different approaches. We show that there exist graphs HH and densities cc such that the optimizing graph GG is neither the quasi-star nor the quasi-clique, reproving a result of Day and Sarkar. We rederive a result of Janson et al. on maximizing homomorphism numbers, which was originally found using entropy methods. We also show that for cc large enough all graphs HH maximize on the quasi-clique, which was also recently proven by Gerbner et al., and in analogy with Kopparty and Rossman we define the homomorphism density domination exponent of two graphs, and find it for any HH and an edge

    New Lower Bounds for Adaptive Tolerant Junta Testing

    Full text link
    We prove a kΩ(log(ε2ε1))k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))} lower bound for adaptively testing whether a Boolean function is ε1\varepsilon_1-close to or ε2\varepsilon_2-far from kk-juntas. Our results provide the first superpolynomial separation between tolerant and non-tolerant testing for a natural property of boolean functions under the adaptive setting. Furthermore, our techniques generalize to show that adaptively testing whether a function is ε1\varepsilon_1-close to a kk-junta or ε2\varepsilon_2-far from (k+o(k))(k + o(k))-juntas cannot be done with poly(k,(ε2ε1)1)\textsf{poly} (k, (\varepsilon_2 - \varepsilon_1)^{-1}) queries. This is in contrast to an algorithm by Iyer, Tal and Whitmeyer [CCC 2021] which uses poly(k,(ε2ε1)1)\textsf{poly} (k, (\varepsilon_2 - \varepsilon_1)^{-1}) queries to test whether a function is ε1\varepsilon_1-close to a kk-junta or ε2\varepsilon_2-far from O(k/(ε2ε1)2)O(k/(\varepsilon_2-\varepsilon_1)^2)-juntas.Comment: 22 page

    A review on GPRS Applications

    Get PDF
    Files are scattered over multiple machines. In case if user forgets to take file in pen drive or email the file, user is left with no other option. But calling home or respecting location and explaining the person to navigate through the directory and mail the file. Now if the person is not computer educated or does not know how to operate the computer and internet then the situation become more difficult. In this case the user may face many issues as he might not get the required file. To overcome this problem many developers have come up with the mobile application which will remotely connect to your desktop and transfer the file. Now a days loss of contacts has become a major issue. So this app also gives the facility of automatic contact update,even if user doesn’t have any Gmail or any otheraccount on website.In this project we make an application which can search the desktop computer file using SMS as well as automatically update user’s contact

    Polylog-Competitive Deterministic Local Routing and Scheduling

    Full text link
    This paper addresses point-to-point packet routing in undirected networks, which is the most important communication primitive in most networks. The main result proves the existence of routing tables that guarantee a polylog-competitive completion-time deterministically\textbf{deterministically}: in any undirected network, it is possible to give each node simple stateless deterministic local forwarding rules, such that, any adversarially chosen set of packets are delivered as fast as possible, up to polylog factors. All previous routing strategies crucially required randomization for both route selection and packet scheduling. The core technical contribution of this paper is a new local packet scheduling result of independent interest. This scheduling strategy integrates well with recent sparse semi-oblivious path selection strategies. Such strategies deterministically select not one but several candidate paths for each packet and require a global coordinator to select a single good path from those candidates for each packet. Another challenge is that, even if a single path is selected for each packet, no strategy for scheduling packets along low-congestion paths that is both local and deterministic is known. Our novel scheduling strategy utilizes the fact that every semi-oblivious routing strategy uses only a small (polynomial) subset of candidate routes. It overcomes the issue of global coordination by furthermore being provably robust to adversarial noise. This avoids the issue of having to choose a single path per packet because congestion caused by ineffective candidate paths can be treated as noise. Our results imply the first deterministic universally-optimal algorithms in the distributed supported-CONGEST model for many important global distributed tasks, including computing minimum spanning trees, approximate shortest paths, and part-wise aggregates.Comment: To appear at STOC 202

    Evaluation of immunization coverage among children aged 12-23 months in Surendranagar city

    Get PDF
    Background: Infectious diseases are a major cause of morbidity & mortality in children. One of the most cost effective & easy methods for child survival is immunization. In May 1974, the World Health Organization (WHO) officially launched a global immunization programme known as Expanded Programme of immunization (EPI) to protect all the children of the world against 6 Vaccine Preventable Diseases by the year 2000. It was later redesignated as Universal Immunization Programme (UIP) since 1985. The objectives of this study were to assess the dropout rate and primary immunization coverage of children aged 12-23 months in Surendranagar city and to know the various reasons for partially or not immunizing the child.Methods: A community-based cross-sectional study. Thirty clusters were selected out of a total of 282 blocks of Surendranagar using the cluster sampling method. Cluster sampling method was used for sample selection and the proforma designed by UNICEF was used as a study tool. Sample size was 210 children (7 Children from each cluster) of aged 12-23 months. The obtained data were analyzed using appropriate statistical tests like Z test and X2 test. Results: Out Of the 210 surveyed children, 121(57.62%) were males and 89(42.38%) were females. Immunization card was available for 69.52% of children and fully immunized were 70.47%. Coverage was highest for BCG (95.71%) followed by OPV3 (82.85%), DPT3 (79.52%) and lowest for measles (75.23%). As far as the dropout rate is concerned, it was 21.39%, 10.21%, and 9.37% for BCG to measles, DPT1 to DPT3, and OPV1 to OPV3, respectively. Amongst the various reasons main reasons for dropout or unimmunization of children were ignorance in about 64% and lack of information regarding time, place and schedule (21%).Conclusions: Improvement should focus on reducing the dropout rate from DPT2/OPV2 to DPT3/OPV3 and improving coverage of measles and also Vitamin A

    Disease-specific health-related quality of life (HRQL) instruments for food allergy: protocol for a systematic review

    Get PDF
    BACKGROUND: The European Academy of Allergy and Clinical Immunology is in the process of developing its Guideline for Food Allergy and Anaphylaxis, and this systematic review is one of seven inter-linked evidence syntheses that are being undertaken in order to provide a state-of-the-art synopsis of the current evidence base in relation to epidemiology, prevention, diagnosis and clinical management, and impact on quality of life, which will be used to inform clinical recommendations. The aim of this systematic review will be to determine which validated instruments can be employed to enable assessment of the impact of, and investigations and interventions for, food allergy on health-related quality of life.METHODS: Seven bibliographic databases were searched from their inception to September 30, 2012 for disease-specific HRQL questionnaires that were specifically designed for use with patients/carers and any articles relating to the description, development and/or the validation of the above identified HRQLs. There were no language or geographic restrictions. We will assess the development of the instruments identified and their performance properties including: validity; generalizability; responsiveness; managing missing data; how variation in patient demography was managed; and cross-cultural and linguistic adaptation, using a previously reported quality assessment tool.DISCUSSION: Using appropriately developed and validated instruments is critical to the accurate evaluation of HRQL in people with food allergy. This review will systematically appraise the evidence on the subject and help to identify any gaps
    corecore