Intelligent diagnosis of retinal vein occlusion based on color fundus photographs

AIM:To develop an artificial intelligence(AI)diagnosis model based on deep learning(DL)algorithm to diagnose different types of retinal vein occlusion(RVO)by recognizing color fundus photographs(CFPs).METHODS:Totally 914 CFPs of healthy people and patients with RVO were collected as experimental data sets,and used to train,verify and test the diagnostic model of RVO.All the images were divided into four categories[normal,central retinal vein occlusion(CRVO),branch retinal vein occlusion(BRVO),and macular retinal vein occlusion(MRVO)]by three fundus disease experts.Swin Transformer was used to build the RVO diagnosis model,and different types of RVO diagnosis experiments were conducted.The model’s performance was compared to that of the experts.RESULTS:The accuracy of the model in the diagnosis of normal,CRVO,BRVO,and MRVO reached 1.000,0.978,0.957,and 0.978;the specificity reached 1.000,0.986,0.982,and 0.976;the sensitivity reached 1.000,0.955,0.917,and 1.000;the F1-Sore reached 1.000,0.9550.943,and 0.887 respectively.In addition,the area under curve of normal,CRVO,BRVO,and MRVO diagnosed by the diagnostic model were 1.000,0.900,0.959 and 0.970,respectively.The diagnostic results were highly consistent with those of fundus disease experts,and the diagnostic performance was superior.CONCLUSION:The diagnostic model developed in this study can well diagnose different types of RVO,effectively relieve the work pressure of clinicians,and provide help for the follow-up clinical diagnosis and treatment of RVO patients.

Synthesis and Coloring Mechanism of Metallic Glaze in R_(2)O-RO-Al_(2)O_(3)-SiO_(2)-P_(2)O_(5)System

A copper-red and silver-white metallic glaze of R_(2)O-RO-Al_(2)O_(3)-SiO_(2)-P_(2)O_(5)system was synthesized by adjusting the firing temperature and glaze components.The coloration mechanism of the metallic glaze was revealed via investigation of the microstructure of the glaze.Our research reveals that the metallic glaze with different colors is mainly due to the amount of Fe_(2)O_(3).The metallic glaze shows a silver-white luster due to a structural color ofα-Fe_(2)O_(3)crystals with a good orientation when the sample contains 0.0939 mol of Fe_(2)O_(3),maintaining temperatures at 1150℃for 0.5 h.The metallic glaze is copper-red which is dominated by the coupling of chemical and structural color ofα-Fe_(2)O_(3)crystals when the sample contains 0.0783 mol of Fe_(2)O_(3).After testing the amount of SiO_(2),we find that 4.0499 mol is the optimal amount to form the ceramic network,and 0.27 mol AlPO_(4)is the best amount to promote phase separation.

Perfect 1-k Matchings of Bipartite Graphs

Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.

Algorithm for Visualization of Zero Divisor Graphs of the Ring ℤn Using MAPLE Coding

This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤn modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.

GraphSTGAN:Situation understanding network of slow-fast high maneuvering targets for maritime monitor services of IoT data

With the rapid growth of the maritime Internet of Things(IoT)devices for Maritime Monitor Services(MMS),maritime traffic controllers could not handle a massive amount of data in time.For unmanned MMS,one of the key technologies is situation understanding.However,the presence of slow-fast high maneuvering targets and track breakages due to radar blind zones make modeling the dynamics of marine multi-agents difficult,and pose significant challenges to maritime situation understanding.In order to comprehend the situation accurately and thus offer unmanned MMS,it is crucial to model the complex dynamics of multi-agents using IoT big data.Nevertheless,previous methods typically rely on complex assumptions,are plagued by unstructured data,and disregard the interactions between multiple agents and the spatial-temporal correlations.A deep learning model,Graph Spatial-Temporal Generative Adversarial Network(GraphSTGAN),is proposed in this paper,which uses graph neural network to model unstructured data and uses STGAN to learn the spatial-temporal dependencies and interactions.Extensive experiments show the effectiveness and robustness of the proposed method.

On an Invariant of Tournament Digraphs

To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15.

Maximal Resonance of{(3,4),4}-Fullerene Graphs

A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant.

On the (Δ + 2)-Total-Colorability of Planar Graphs with 7-Cycles Containing at Most Two Chords

The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In this paper, we prove that TCC holds for planar graph with Δ = 6 and every 7-cycle contains at most two chords.

Weak External Bisection of Some Graphs

Let G be a graph. A bipartition of G is a bipartition of V (G) with V (G) = V1 ∪ V2 and V1 ∩ V2 = ∅. If a bipartition satisfies ∥V1∣ - ∣V2∥ ≤ 1, we call it a bisection. The research in this paper is mainly based on a conjecture proposed by Bollobás and Scott. The conjecture is that every graph G has a bisection (V1, V2) such that ∀v ∈ V1, at least half minuses one of the neighbors of v are in the V2;∀v ∈ V2, at least half minuses one of the neighbors of v are in the V1. In this paper, we confirm this conjecture for some bipartite graphs, crown graphs and windmill graphs.

A Cognitive Psychological Study on the Acquisition of Chinese Word’s Coloring Meaning--Chinese as a Second Language

Lexical meaning mainly includes rational meaning,grammatical meaning,and coloring meaning.Mastering the coloring meaning of vocabulary is of great significance for foreign students to use Chinese vocabulary correctly.This study mainly examines the psychological mechanism of Chinese second language learners mastering the coloring meaning of words,examines the psychological characteristics of students mastering the color meaning of words from the perspectives of second language learning theory and cognitive theory,establishes a cognitive schema for coloring meaning learning,and proposes corresponding learning models and teaching strategies.

Coloring of some integer distance graphs

An integer distance graph is a graph G(Z, D) with the integer set Z as vertexset, in which an edge joining two vertices u and v if and only if | u - v | ∈ D, where D is a setof natural numbers. Using a related theorem in combinatorics and some conclusions known to us in thecoloring of the distance graph, the chromatic number _X(G) is determined in this paper that is ofthe distance graph G(Z, D) for some finite distance sets D containing {2, 3} with D = 4 andcontaining {2, 3, 5} with | D | = 5 by the method in which the combination of a few periodiccolorings.

国外应急管理研究热点与演进--基于2001—2023年Web of Science数据库知识图谱分析

为探究国外应急管理领域的研究热点与演进,选取2001—2023年Web of Science数据库(WoS)收录的1724篇应急管理文献,基于CiteSpace文献计量软件从发文量趋势、机构、国家及作者合作网络、共被引文献、关键词共现及聚类特征进行可视化分析。研究结果表明:国外应急管理领域的年发文量呈现稳步增长的趋势,研究主题演进可分为3个阶段:(1)2001—2010年,应急预案与决策成为研究热点;(2)2011—2018年,疏散、社区脆弱性、社区韧性成为高突现强度关键词;(3)2019—2023年,智慧应急成为研究热点。随着大数据、人工智能等新型互联网技术在数字中国建设中的发展与应用,智慧应急将成为新时期应急管理内涵建设的重要方向之一。研究结果可为我国应急管理新理论与新技术发展提供参考。

Vertex-distinguishing VE-total Colorings of Cycles and Complete Graphs

Let G be a simple graph of order at least 2.A VE-total-coloring using k colors of a graph G is a mapping f from V (G) E(G) into {1,2,···,k} such that no edge receives the same color as one of its endpoints.Let C(u)={f(u)} {f(uv) | uv ∈ E(G)} be the color-set of u.If C(u)=C(v) for any two vertices u and v of V (G),then f is called a k-vertex-distinguishing VE-total coloring of G or a k-VDVET coloring of G for short.The minimum number of colors required for a VDVET coloring of G is denoted by χ ve vt (G) and it is called the VDVET chromatic number of G.In this paper we get cycle C n,path P n and complete graph K n of their VDVET chromatic numbers and propose a related conjecture.

广告对儿童影响的国际研究态势——基于Web of Science的知识图谱分析(2006—2023)

儿童处于生理和心理快速发展的阶段,广告对儿童这一敏感群体的影响较为显著。本文对2006—2023年Web of Science核心数据库的323篇文献进行了知识图谱可视化分析。经过分析表明,2016—2021年,研究广告对儿童影响的学术活力明显增强;18年来,作者、国家、机构之间形成了明显的合作网络,高校是该领域研究的核心力量。该领域的研究进程可分为3个阶段,其中儿童的广告素养与广告易感性、不健康广告对儿童不健康消费的促进作用、植入式广告对儿童广告辨识能力的阻碍、儿童对食品广告的品牌依恋为主要的研究热点。从研究结果看,在未来,广告与社交媒体、数据追踪、人工智能会有更多地结合,广告对儿童影响的形式也将更加多元和隐蔽,因此这些内容将成为广告对儿童影响研究未来重要的研究方向。

Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained.

On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

A proper edge coloring of a graph G is called adjacent vertex-distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the coloring set of edges incident with u is not equal to the coloring set of edges incident with v, where uv∈ E（G）. The adjacent vertex distinguishing acyclic edge chromatic number of G, denoted by X＇Aa（G）, is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G. If a graph G has an adjacent vertex distinguishing acyclic edge coloring, then G is called adjacent vertex distinguishing acyclic. In this paper, we obtain adjacent vertex-distinguishing acyclic edge coloring of some graphs and put forward some conjectures.

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

Melnikov(1975) conjectured that the edges and faces of a plane graph G can be colored with △(G) + 3 colors so that any two adjacent or incident elements receive distinct colors, where △(G) denotes the maximum degree of G. This paper proves the conjecture for the case △(G) ≤4.

Cyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles

A total coloring of a graph G is a functionsuch that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. A k-interval is a set of k consecutive integers. A cyclically interval total t-coloring of a graph G is a total coloring a of G with colors 1,2,...,t, such that at least one vertex or edge of G is colored by i,i=1,2,...,t, and for any, the set is a -interval, or is a -interval, where dG(x) is the degree of the vertex x in G. In this paper, we study the cyclically interval total colorings of cycles and middle graphs of cycles.

On the Spectral Properties of Graphs with Rank 4

Let G be a graph and A(G) the adjacency matrix of G. The spectrum of G is the eigenvalues together with their multiplicities of A(G). Chang et al. (2011) characterized the structures of all graphs with rank 4. Monsalve and Rada (2021) gave the bound of spectral radius of all graphs with rank 4. Based on these results as above, we further investigate the spectral properties of graphs with rank 4. And we give the expressions of the spectral radius and energy of all graphs with rank 4. In particular, we show that some graphs with rank 4 are determined by their spectra.

Coupling of reduced inorganic fertilizer with plant-based organic fertilizer as a promising fertilizer management strategy for colored rice in tropical regions

Colored rice is a type of high-quality,high-added-value rice that has attracted increasing attention in recent years.The use of large amounts of inorganic nitrogen fertilizer in rice fields results in low fertilizer use efficiency and high environmental pollution.Organic fertilizer is a promising way to improve soil quality and sustain high yields.However,most studies focus on the effect of animal-based organic fertilizers.The effects of different ratios of plantbased organic fertilizer and inorganic fertilizer on the grain yield and quality of colored rice have rarely been reported.Therefore,a two-year field experiment was conducted in 2020 and 2021 to study the effects of replacing inorganic N fertilizers with plant-based organic fertilizers on the yield,nitrogen use efficiency(NUE),and anthocyanin content of two colored rice varieties in a tropical region in China.The experimental treatments included no nitrogen fertilization(T1),100% inorganic nitrogen fertilizer(T2),30%inorganic nitrogen fertilizer substitution with plant-based organic fertilizer(T3),60%inorganic nitrogen fertilizer substitution with plant-based organic fertilizer(T4),and 100% plantbased organic fertilizer(T5).The total nitrogen provided to all the treatments except T1 was the same at 120 kg ha-1.Our results showed that the T3 treatment enhanced the grain yield and anthocyanin content of colored rice by increasing nitrogen use efficiency compared with T2.On average,grain yields were increased by 9 and 8%,while the anthocyanin content increased by 16 and 10% in the two colored rice varieties under T3 across the two years,respectively,as compared with T2.Further study of the residual effect of partial substitution of inorganic fertilizers showed that the substitution of inorganic fertilizer with plant-based organic fertilizer improved the soil physiochemical properties,and thus increased the rice grain yield,in the subsequent seasons.The highest grain yield of the subsequent rice crop was observed under the T5 treatment.Our results suggested that the application of plantbased organic fertilizers can sustain the production of colored rice with high anthocyanin content in tropical regions,which is beneficial in reconciling the relationship between rice production and environmental protection.