50,264 research outputs found

    On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint

    Full text link
    In the problem of minimum connected dominating set with routing cost constraint, we are given a graph G=(V,E)G=(V,E), and the goal is to find the smallest connected dominating set DD of GG such that, for any two non-adjacent vertices uu and vv in GG, the number of internal nodes on the shortest path between uu and vv in the subgraph of GG induced by D{u,v}D \cup \{u,v\} is at most α\alpha times that in GG. For general graphs, the only known previous approximability result is an O(logn)O(\log n)-approximation algorithm (n=Vn=|V|) for α=1\alpha = 1 by Ding et al. For any constant α>1\alpha > 1, we give an O(n11α(logn)1α)O(n^{1-\frac{1}{\alpha}}(\log n)^{\frac{1}{\alpha}})-approximation algorithm. When α5\alpha \geq 5, we give an O(nlogn)O(\sqrt{n}\log n)-approximation algorithm. Finally, we prove that, when α=2\alpha =2, unless NPDTIME(npolylogn)NP \subseteq DTIME(n^{poly\log n}), for any constant ϵ>0\epsilon > 0, the problem admits no polynomial-time 2log1ϵn2^{\log^{1-\epsilon}n}-approximation algorithm, improving upon the Ω(logn)\Omega(\log n) bound by Du et al. (albeit under a stronger hardness assumption)

    Microscopy of glazed layers formed during high temperature sliding wear at 750C

    Get PDF
    The evolution of microstructures in the glazed layer formed during high temperature sliding wear of Nimonic 80A against Stellite 6 at 750 ◦C using a speed of 0.314ms−1 under a load of 7N has been investigated using scanning electron microscopy (SEM), energy dispersive analysis by X-ray (EDX), X-ray diffraction (XRD) analysis, scanning tunnelling microscopy (STM) and transmission electron microscopy (TEM). The results indicate the formation of a wear resistant nano-structured glazed layer. The mechanisms responsible for the formation of the nano-polycrystalline glazed layer are discussed

    Comment on "Self-Purification in Semiconductor Nanocrystals"

    Full text link
    In a recent Letter [PRL 96, 226802 (2006)], Dalpian and Chelikowsky claimed that formation energies of Mn impurities in CdSe nanocrystals increase as the size of the nanocrystal decreases, and argued that this size dependence leads to "self-purification" of small nanocrystals. They presented density-functional-theory (DFT) calculations showing a strong size dependence for Mn impurity formation energies, and proposed a general explanation. In this Comment we show that several different DFT codes, pseudopotentials, and exchange-correlation functionals give a markedly different result: We find no such size dependence. More generally, we argue that formation energies are not relevant to substitutional doping in most colloidally grown nanocrystals.Comment: 1 page, 1 figur

    No association of CTLA-4 polymorphisms with susceptibility to Behcet disease

    Get PDF
    Background: Cytotoxic T lymphocyte-associated antigen 4 (CTLA-4) is a key negative regulator of T lymphocytes and has been shown to be associated with a number of autoimmune diseases. The present study was performed to assess the association between CTLA-4 polymorphisms and Behcet disease (BD) in Chinese patients. Methods: Two hundred and twenty-eight BD patients and 207 controls were analysed for four single nucleotide polymorphisms (SNPs) (21661A/G, 2318C/T, + 49G/A and CT60G/A) in the CTLA-4 gene by PCR-restriction fragment length polymorphism (RFLP) analysis. The association between SNP +49A/G and BD in Chinese population as well as other ethnic groups was analysed by meta-analysis. Results: No association could be detected between CTLA-4 SNPs or haplotypes and BD. Also, no association was observed between CTLA-4 polymorphisms and BD subgroups, stratified by clinical features. A meta-analysis showed that there was no heterogeneity between studies (p = 0.60, I-2 = 0%) and that CTLA-4 SNP + 49 was not associated with BD (overall effect: Z = 0.26, p = 0.79). Conclusion: This study and a meta-analysis failed to demonstrate any association between the tested CTLA-4 polymorphisms and B

    A Game-Theory Based Incentive Framework for an Intelligent Traffic System as Part of a Smart City Initiative

    Get PDF
    Intelligent Transportation Systems (ITSs) can be applied to inform and incentivize travellers to help them make cognizant choices concerning their trip routes and transport modality use for their daily travel whilst achieving more sustainable societal and transport authority goals. However, in practice, it is challenging for an ITS to enable incentive generation that is context-driven and personalized, whilst supporting multi-dimensional travel goals. This is because an ITS has to address the situation where different travellers have different travel preferences and constraints for route and modality, in the face of dynamically-varying traffic conditions. Furthermore, personalized incentive generation also needs to dynamically achieve different travel goals from multiple travellers, in the face of their conducts being a mix of both competitive and cooperative behaviours. To address this challenge, a Rule-based Incentive Framework (RIF) is proposed in this paper that utilizes both decision tree and evolutionary game theory to process travel information and intelligently generate personalized incentives for travellers. The travel information processed includes travellers’ mobile patterns, travellers’ modality preferences and route traffic volume information. A series of MATLAB simulations of RIF was undertaken to validate RIF to show that it is potentially an effective way to incentivize travellers to change travel routes and modalities as an essential smart city service
    corecore