{'fraction_non_alphanumeric': 0.02254791431792559, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Competitive Analysis for the On-Line Fuzzy Most Connective Path Problem

In this paper, the on-line fuzzy most connective path problem (OFCP) without a map is originally proposed and studied by our team, based on the traditional optimal path problem in the domain of the operations research, fuzzy theory and logic and the theory of the on-line algorithms. In this model, two kinds of uncertainties, namely on-line and fuzzy, are combined to be considered at the same time. Firstly, some preliminaries concerning the competitive analysis and the most connective path problem and then the model of OFCP are established and relevant concepts are formulated. Following that, some on-line fuzzy algorithms are designed to handle the problem of OFCP and the rigorous proofs for the competitive ratio are given. Finally, conclusions are made and some possible research directions are discussed