Properties of possible counterexamples to the Seymour's Second Neighborhood Conjecture
The project is devoted to the study of the Seymour’s Second Neighborhood conjecture by determining the properties of possible counterexamples to it. This problem has remained unsolved for more than 30 years, although there is some progress in its solution. The vector of the research is aimed at the analysis of possible counterexamples to the conjecture with the subsequent finding of some of their characteristic values. In addition, attention is focused on the generalized Seymour’s conjecture for vertex-weighted graphs. Combinatorial research methods and graph theory methods were used in the project. The author determines the values of densities and diameters of possible counterexamples, considers separately directed graphs of diameter 3. The conditions under which specific graphs cannot be counterexamples to the Seymour’s conjecture with the minimum number or vertices are defined. The relationship between the Seymour’s conjecture and vertex-weighted Seymour’s conjecture is explained. It is proved that if there exists at least one counterexample, then there exist counterexamples with an arbitrary diameter not less than 3. Under the same condition, the existence of counterexamples with a density both close to 0 and close to 1 is also proved. The equivalence of the above two conjectures is substantiated in detail. It can be concluded that if the Seymour’s Second Neighborhood Conjecture is true for a directed graph of diameter 3, then it is true for any digraph, so that problem will be solved. Moreover, if the conjecture is true, then vertex-weighted version of this conjecture is true too. That is why a digraph of diameter 3 needs further research.
The Use of Brine Shrimp to Test for Water Pollutants
The use of brine shrimp nauplii to test for the overall toxicity of sediment samples is proposed. Brine shrimp nauplii were cultured with different concentrations of heavy metals, including chromium (III), copper (II), nickel, lead and zinc, and organic pollutants, including triclosan, oxybenzone, octinoxate and bisphenol A. The brine shrimp nauplii were observed under a dissection microscope to determine the death rate. Results showed that brine shrimp nauplii are more sensitive to copper, cadmium, bisphenol A and oxybenzone. The LC50 (24h) are 55.5, 24.9, 5.6 and 2.7 ppm respectively. Zinc is likely to have synergistic toxic effect with nickel or lead. The synergistic toxic effects of other heavy metals and organic pollutants should be confirmed with further investigations. Brine shrimp nauplii were treated with extracts from sediment samples collected from the oyster culture zone of the Deep Bay, namely Pak Nei, Sha Kiu Tsuen and Hang Hau Tsuen. The sediment samples were extracted with neutral sodium acetate to dissolve the exchangeable heavy metal ions and some organic pollutants. The death rate of brine shrimp nauplii treated with the sediment extract of Hang Hau Tsuen was similar to 1 ppm PBA. It was also about 10 to 20% higher than that of the other two sites (Pak Nei and Sha Kiu Tsuen). Since Hang Hau Tsuen is closer to the residential area and Lau Fau Shan Seafood Market than the other two sites, its sediment sample is likely to have a higher level of environmental pollutants. The results suggest that brine shrimp nauplii may be used as a biomarker to monitor the environmental changes in the overall level of pollutants in sediment samples.
A Person Re-identification based Misidentification-proof Person Following Service Robot
Two years ago, I attended a robot contest, in which one of the missions required the robot to follow the pedestrian to complete the task. At that time, I used their demo program to complete the task. Not long after, I found two main issues: 1. The program follows the closest point read by the depth camera, which if I walk close to a wall next to, the robot may likely ‘follow’ the wall. 2. Not to mention if another pedestrian crosses between the robot and the target. Regarding these two issues, I decided to improve it. We’ve designed a procedure of using YOLO Object Detection and Person re-identification to re-identify the target for continuous following.
Properties of possible counterexamples to the Seymour's Second Neighborhood Conjecture
The project is devoted to the study of the Seymour’s Second Neighborhood conjecture by determining the properties of possible counterexamples to it. This problem has remained unsolved for more than 30 years, although there is some progress in its solution. The vector of the research is aimed at the analysis of possible counterexamples to the conjecture with the subsequent finding of some of their characteristic values. In addition, attention is focused on the generalized Seymour’s conjecture for vertex-weighted graphs. Combinatorial research methods and graph theory methods were used in the project. The author determines the values of densities and diameters of possible counterexamples, considers separately directed graphs of diameter 3. The conditions under which specific graphs cannot be counterexamples to the Seymour’s conjecture with the minimum number or vertices are defined. The relationship between the Seymour’s conjecture and vertex-weighted Seymour’s conjecture is explained. It is proved that if there exists at least one counterexample, then there exist counterexamples with an arbitrary diameter not less than 3. Under the same condition, the existence of counterexamples with a density both close to 0 and close to 1 is also proved. The equivalence of the above two conjectures is substantiated in detail. It can be concluded that if the Seymour’s Second Neighborhood Conjecture is true for a directed graph of diameter 3, then it is true for any digraph, so that problem will be solved. Moreover, if the conjecture is true, then vertex-weighted version of this conjecture is true too. That is why a digraph of diameter 3 needs further research.