567 research outputs found

    Unravelling DNS Performance: A Historical Examination of F-ROOT in Southeast Asia

    Full text link
    The DNS root server system uses Anycast technology to provide resolution through widely distributed root nodes. In recent years, the F-root node has seen astonishing growth and now boasts the largest number of nodes among the 13 root servers. Based on Ripe Atlas measurement data, we examined the availability and query latency of the F-root within the Southeast Asian region historically. The collected data illustrates how latency varies with changes in the number of root nodes, how the geographic distribution of responding root nodes changes in different periods, and examines the most recent differences between countries in terms of latency distribution. This study sheds light on the evolving landscape of DNS infrastructure in Southeast Asia.Comment: 10 pages,4 figure

    On hybrid consensus-based extended Kalman filtering with random link failures over sensor networks

    Get PDF
    summary:This paper is concerned with the distributed filtering problem for nonlinear time-varying systems over wireless sensor networks under random link failures. To achieve consensus estimation, each sensor node is allowed to communicate with its neighboring nodes according to a prescribed communication topology. Firstly, a new hybrid consensus-based filtering algorithm under random link failures, which affect the information exchange between sensors and are modeled by a set of independent Bernoulli processes, is designed via redefining the interaction weights. Second, a novel observability condition, called parameterized jointly uniform observability, is proposed to ensure the stochastic boundedness of the error covariances of the hybrid consensus-based filtering algorithm. Finally, an example is given to demonstrate the effectiveness of the derived theoretical results

    CCD photometric study of the W UMa-type binary II CMa in the field of Berkeley 33

    Full text link
    The CCD photometric data of the EW-type binary, II CMa, which is a contact star in the field of the middle-aged open cluster Berkeley 33, are presented. The complete R light curve was obtained. In the present paper, using the five CCD epochs of light minimum (three of them are calculated from Mazur et al. (1993)'s data and two from our new data), the orbital period P was revised to 0.22919704 days. The complete R light curve was analyzed by using the 2003 version of W-D (Wilson-Devinney) program. It is found that this is a contact system with a mass ratio q=0.9q=0.9 and a contact factor f=4.1f=4.1%. The high mass ratio (q=0.9q=0.9) and the low contact factor (f=4.1f=4.1%) indicate that the system just evolved into the marginal contact stage

    Iterative point-wise reinforcement learning for highly accurate indoor visible light positioning

    Get PDF
    Iterative point-wise reinforcement learning (IPWRL) is proposed for highly accurate indoor visible light positioning (VLP). By properly updating the height information in an iterative fashion, the IPWRL not only effectively mitigates the impact of non-deterministic noise but also exhibits excellent tolerance to deterministic errors caused by the inaccurate a priori height information. The principle of the IPWRL is explained, and the performance of the IPWRL is experimentally evaluated in a received signal strength (RSS) based VLP system and compared with other positioning algorithms, including the conventional RSS algorithm, the k-nearest neighbors (KNN) algorithm and the PWRL algorithm where iterations exclude. Unlike the supervised machine learning method, e.g., the KNN, whose performance is highly dependent on the training process, the proposed IPWRL does not require training and demonstrates robust positioning performance for the entire tested area. Experimental results also show that when a large height information mismatch occurs, the IPWRL is able to first correct the height information and then offers robust positioning results with a rather low positioning error, while the positioning errors caused by the other algorithms are significantly higher

    Diffusion of False Information During Public Crises: Analysis Based on the Cellular Automaton Method

    Get PDF
    The progress of false information diffusion in the public crisis is harmful to the society. When the public crisis occurs, the public respond in different ways and the public also want to tell others what they think right. But what they think is right is not recognized by the government. Thus the false information forms and it begins to diffuse. As the false information spreads, the harm to society magnifies gradually. Particularly in network society, false information diffusion can easily cause secondary hazards and accelerate public crises to a devastating degree. Thus intervening and controlling the false information diffusion is an important aspect of the public crisis management. From the perspective of the social network theory, this study analyzes the progress of false information diffusion in terms of different public crisis management strategies and presents the result of false information diffusion through simulation on cellular automaton of different public crisis management strategies. In simulations on cellular automaton, interventions are also carried to control false information diffusion and alternatives are proposed to help reduce public crises. This study also extends the theory of false information management, which is significant for the government to improve the ability to evaluate the false information and carry out interventions effectively to control the false information when it begins to diffuse
    corecore