Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Intelligent traffic safety cloud supervision system based on Internet of vehicles technology

  • In view of the poor supervision effect of the traditional monitoring cloud supervision system, this paper puts forward a design method of Intelligent Transportation Security Cloud supervision system based on the Internet of vehicles technology, uses the tsed-01 sensor chip to optimize the hardware configuration of the cloud supervision system, perfects the software functions based on the Internet of vehicles technology, and relies on the Internet of vehicles communication platform and cloud data sharing equipment to optimize the software functions of the cloud supervision system, identify and manage the heterogeneous data sources generated by different modules in the cloud supervision system to simplify the steps of the cloud supervision system and provide data support for the comprehensive decision-making of traffic management. The experimental results show that the intelligent traffic safety cloud supervision system based on the Internet of vehicles technology has good practicability, and has guiding significance for the construction of urban rail transit monitoring cloud supervision systems in the future.

    Citation: Jian Gao, Hao Liu, Yang Zhang. Intelligent traffic safety cloud supervision system based on Internet of vehicles technology[J]. Electronic Research Archive, 2023, 31(11): 6564-6584. doi: 10.3934/era.2023332

    Related Papers:

    [1] Xiaoyuan Zhang, Meng Bao, Xiaoquan Xu . On function spaces related to some kinds of weakly sober spaces. AIMS Mathematics, 2022, 7(5): 9311-9324. doi: 10.3934/math.2022516
    [2] Sana Khadim, Muhammad Qasim . Quotient reflective subcategories of the category of bounded uniform filter spaces. AIMS Mathematics, 2022, 7(9): 16632-16648. doi: 10.3934/math.2022911
    [3] Samuel García-Baquerín, Isabel Marrero . Duals of Gelfand-Shilov spaces of type K{Mp} for the Hankel transformation. AIMS Mathematics, 2024, 9(7): 18247-18277. doi: 10.3934/math.2024891
    [4] Sadok Otmani, Aissa Bouharou, Khaled Zennir, Keltoum Bouhali, Abdelkader Moumen, Mohamed Bouye . On the study the radius of analyticity for Korteweg-de-Vries type systems with a weakly damping. AIMS Mathematics, 2024, 9(10): 28341-28360. doi: 10.3934/math.20241375
    [5] Dumitru Baleanu, Babak Shiri . Generalized fractional differential equations for past dynamic. AIMS Mathematics, 2022, 7(8): 14394-14418. doi: 10.3934/math.2022793
    [6] Rui Gao, Jianrong Wu . Filter with its applications in fuzzy soft topological spaces. AIMS Mathematics, 2021, 6(3): 2359-2368. doi: 10.3934/math.2021143
    [7] Liu Yang, Ruishen Qian . Power bounded and power bounded below composition operators on Dirichlet Type spaces. AIMS Mathematics, 2021, 6(2): 2018-2030. doi: 10.3934/math.2021123
    [8] Ugur G. Abdulla . Generalized Newton-Leibniz formula and the embedding of the Sobolev functions with dominating mixed smoothness into Hölder spaces. AIMS Mathematics, 2023, 8(9): 20700-20717. doi: 10.3934/math.20231055
    [9] Cure Arenas Jaffeth, Ferrer Sotelo Kandy, Ferrer Villar Osmin . Functions of bounded (2,k)-variation in 2-normed spaces. AIMS Mathematics, 2024, 9(9): 24166-24183. doi: 10.3934/math.20241175
    [10] Saak Gabriyelyan . Limited type subsets of locally convex spaces. AIMS Mathematics, 2024, 9(11): 31414-31443. doi: 10.3934/math.20241513
  • In view of the poor supervision effect of the traditional monitoring cloud supervision system, this paper puts forward a design method of Intelligent Transportation Security Cloud supervision system based on the Internet of vehicles technology, uses the tsed-01 sensor chip to optimize the hardware configuration of the cloud supervision system, perfects the software functions based on the Internet of vehicles technology, and relies on the Internet of vehicles communication platform and cloud data sharing equipment to optimize the software functions of the cloud supervision system, identify and manage the heterogeneous data sources generated by different modules in the cloud supervision system to simplify the steps of the cloud supervision system and provide data support for the comprehensive decision-making of traffic management. The experimental results show that the intelligent traffic safety cloud supervision system based on the Internet of vehicles technology has good practicability, and has guiding significance for the construction of urban rail transit monitoring cloud supervision systems in the future.



    With the development of non-Hausdorff topology, sober spaces, well-filtered spaces and d-spaces form the most important three types of T0 spaces. During the past few years, a large number of properties of these spaces are investigated (see [1,3,4,5,9,14,17,19,29,30,32,33]). By the further researches of sober spaces and well-filtered spaces, many classes of weakly sober spaces and weakly well-filtered spaces have been posed and extensively investigated from various different perspectives (see [4,16,23,24,28,29,36,37,38]). In particular, Xu, Shen, Xi and Zhao introduced and investigated Rudin sets and WD sets for researching well-filtered spaces and gave the characterization of well-filtered spaces by the two kinds of T0 spaces in [19,29]. Rudin sets and WD sets play an important role in study of well-filtered spaces and sober spaces (see [19,27,28,29,30,33]). In [16], using Rudin sets, Miao, Li and Zhao introduced and studied a new kind of weakly well-filtered spaces—k-bounded well-filtered spaces, namely, T0 spaces X in which every nonempty closed Rudin subset A of X that has a sup is the closure of a (unique) point of X.

    In this paper, also using Rudin sets, we introduce a new type of weakly well-filtered spaces—weakly bounded well-filtered spaces, which are strictly stronger than k-bounded well-filtered spaces. The main purpose of the paper is to investigate some basic properties of k-bounded well-filtered spaces and weakly bounded well-filtered spaces. It is proved that the category KBWF of all k-bounded well-filtered spaces with continuous mappings is not reflective in the category Top0 of all T0 spaces with continuous mappings, and also the category KBWFr of all k-bounded well-filtered spaces with continuous mappings preserving all existing sups of Rudin sets is not reflective in the category Topr of all T0 spaces with continuous mappings preserving all existing sups of Rudin sets. Moreover, some fundamental properties, such as hereditary, products, retracts, .etc, in k-bounded well-filtered spaces and weakly bounded well-filtered spaces are investigated and the relationships among some weakly sober spaces are posed. It is proved that if the Smyth power space PS(X) is k-bounded well-filtered (resp., weakly bounded well-filtered), then so is X. Two examples are given to show that the converses do not hold in general.

    In this section, we introduce the necessary notations, terminologies and some facts that will be used in the paper. For further details, we refer the reader to [5,6,17].

    For a poset P and AP, let A={xP:xa for some aA} and A={xP:xa for some aA}. For arbitrary xP, let x represent {x} and x represent {x}, respectively. We call A a lower set (resp., an upper set) if A=A (resp., A=A). For a set X, the cardinality of X is denoted by |X|. The set of all natural numbers with the usual order is denoted by N and ω=|N|. 2X denotes the set of all subsets of X. Put X(<ω)={FX:Fis a nonempty finite set} and FinP={F:FP(<ω)}. A subset D of P is directed provided that it is nonempty and every finite subset of D has an upper bound in D. The set of all directed sets of P is denoted by D(P). P is said to be a directed complete poset, a dcpo for short, if every directed subset of P has the least upper bound in P. As in [5], the upper topology on a poset P, generated by the complements of the principal ideals of P, is denoted by υ(P). The upper sets of P form the (upper) Alexandroff topology γ(P). The space ΓP=(P,γ(P)) is called the Alexandroff space of P. A subset U of a poset P is called Scott open if U=U and DU for all directed sets DP with DU whenever D exists. The topology formed by all Scott open sets of P is called the Scott topology, written as σ(P). ΣP=(P,σ(P)) is called the Scott space of P. Clearly, ΣP is a T0 space. For the chain 2={0,1} (with the order 0<1), we have σ(2)={,{1},{0,1}}. The space Σ2 is well-known under the name of Sierpinski space.

    Given a T0 space X, we can define a partially order X, called the specialization order, which is defined by xXy iff x¯{y}. Let ΩX denote the poset (X,X). Clearly, each open set is an upper set and each closed set is a lower set with respect to the partially order X. Unless otherwise stated, throughout the paper, whenever an order-theoretic concept is mentioned in a T0 space, it is to be interpreted with respect to the specialization order. Let O(X) (resp., C(X)) be the set of all open subsets (resp., closed subsets) of X and denote S(X)={{x}:xX}, D(X)={DX:D is a directed set of X}. A T0 space X is called a d-space (or monotone convergence space) if X (with the specialization order) is a dcpo and O(X)σ(X) (cf. [5]).

    Remark 2.1. Let X be a T0 space and CX. Then C exists in X iff clX(C) exists in X. Moreover, If C exists in X, then clX(C)=C.

    A nonempty subset A of a T0 space X is said to be irreducible if for any {F1,F2}C(X), AF1F2 always implies AF1 or AF2. The set of all irreducible (resp., irreducible closed) subsets of X is denoted by Irr(X) (resp., Irrc(X)). The space X is said to be sober, if for any AIrrc(X), we can find a unique point xX with A=¯{x}. Put Top0 the category of all T0 spaces with continuous mappings and Sob the full subcategory of Top0 containing all sober spaces.

    Let X be a topological space, G2X and AX. Set GA={GG:GA} and GA={GG:GA}. We write A and A for GA and GA, respectively if there is no confusion. The lower Vietoris topology on G is the topology that has {U:UO(X)} as a subbase, and the resulting space is denoted by PH(G). If GIrr(X), then {GU:UO(X)} is a topology on G.

    Remark 2.2. Let X be a T0 space. The space Xs=PH(Irrc(X)) with the canonical mapping ηX:XXs, given by ηX(x)=¯{x}, is the sobrification of X (cf. [5,6]).

    A subset K of a topological space X is called supercompact if for any family {Ui:iI}O(X), KiIUi, we can find iI satisfying KUi. It follows from [8,Fact 2.2] that the supercompact saturated sets of a T0 space X are exactly the sets x with xX. We call AX saturated if A equals the intersection of all open sets which contain A (equivalently, A is an upper set in the specialization order). The set of all nonempty compact saturated subsets of X is denoted by K(X) and is endowed with the Smyth preorder, that is, for K1,K2K(X), K1K2 iff K2K1. We call a T0 space X well-filtered (WF for short) if for any filtered family KK(X), any open set U and KU, there exists KK satisfying KU.

    For any topological space X, G2X and AX, the upper Vietoris topology on G is the topology denoted by {GU:UO(X)} as a base, and PS(G) denotes the resulting space. The Smyth power space or upper space PS(K(X)) of X is denoted shortly by PS(X) (cf. [7,8,17]). As we all know, the specialization order on PS(X) is the Smyth order (that is, PS(X)=⊑).

    Rudin's Lemma is a useful and important tool in non-Hausdorff topology and domain theory (see [4,5,6,10,19,27,28,29,35]). Heckmann and Keimel [8] presented the following topological variant of Rudin's Lemma.

    Lemma 2.3. ([8,Lemma 3.1]) (Topological Rudin Lemma) Let X be a topological space and A anirreducible subset of the Smyth power space PS(X). Then every closed set CX thatmeets all members of A contains a minimal irreducible closed subset A that still meets allmembers of A.

    For a T0 space X and KK(X), let M(K)={AC(X):KA for all KK} (that is, KA) and m(K)={AC(X):Ais a minimal member of M(K)}.

    Definition 2.4. ([29,Definition 4.6]) Let X be a T0 space. A nonempty subset A of X is said to have Rudin property, if there exists a filtered family KK(X) satisfying ¯Am(K) (that is, ¯A is a minimal closed set that intersects all members of K). Let RD(X)={AC(X):Ahas Rudin property}. The sets in RD(X) will also be called Rudin sets.

    Lemma 2.5. ([33,Lemma 2.7]) Suppose that X,Y are both T0 spaces and f:XY is a continuous mapping, if ARD(X), then ¯f(A)RD(Y).

    In this section, the concept of weakly bounded well-filtered spaces is posed and we investigate relationships among some kinds of weakly sober spaces and weakly well-filtered spaces.

    Definition 3.1. ([14,Definition 2.1]) Let X be a T0 space. We call X bounded well-filtered (b-WF for short) if, whenever a nonempty open set U contains a filtered intersection iIKi of compact saturated subsets, then U contains Ki for some iI.

    Bounded well-filtered spaces were called weak well-filtered in [14]. It was shown in [14,Proposition 3.3] that a T0 space X is bounded well-filtered if and only if for any nonempty open set U and every filtered family {Ki}iI of nonempty compact saturated subsets with iIKi, iIKiU implies KiU for some iI. In order to correspond to the concept of bounded sober spaces, we call it bounded well-filtered here (note that {Ki}iIK(X) is upper bounded in K(X) iff iIKi).

    Proposition 3.2. A bounded well-filtered space is saturated-hereditary.

    Proof. Assume that X is a bounded well-filtered space and U is a nonempty saturated subspace of X. Suppose that KUK(U) is filtered, VO(U){}, and KUV. Then we can find WO(X){} with V=WU. As U=XU, KUK(X) and KUW. It follows from the bounded well-filteredness of X that there exists KKU with KW, and hence KWU=V. Therefore, U is bounded well-filtered.

    Definition 3.3. ([38,Definition 4.1]) Let X be a T0 space. We call X k-bounded sober (k-b-sober for short) if for any irreducible closed set A with A existing, we can find a unique point xX with A=cl({x}).

    Definition 3.4. ([16,Definition 4.2]) Let X be a T0 space. We call X k-bounded well-filtered (k-b-WF for short) if for any non-empty closed Rudin subset A with A existing, we can find a unique point xX such that A=cl({x}).

    Throughout this paper, KBWF denotes the category of all k-bounded well-filtered spaces with continuous mappings, Topr denotes the category of all T0 spaces with continuous mappings preserving all existing sups of Rudin sets and KBWFr denotes the full subcategory of Topr containing all k-bounded well-filtered spaces.

    By [33], we know that for a T0 space X, Sc(X)Dc(X)RD(X)WD(X)Irrc(X). So if X is a k-bounded sober space, it is obvious that X is k-bounded well-filtered. Moreover, it was proved in [16] that if a T0 space X is a k-bounded well-filtered space and X is locally compact, then X is a k-bounded sober space. Clearly, each well-filtered space is k-bounded well-filtered, but the converse is not valid, see [16,Example 4.5].

    Definition 3.5. ([37,Definition 2]) A T0 space is called bounded sober (b-sober for short) if every upper bounded closed irreducible set is the closure of a unique singleton.

    Proposition 3.6. Let X be a T0 space and Y a bounded sober space. Then the function space Top0(X,Y) of all continuous functions f:XY equipped with the topology of pointwise convergence is bounded sober.

    Proof. Let A be an upper bounded irreducible subset of Top0(X,Y) with the topology induced by the product topology on YX. Then Ax=πx(A)={a(x):aA} is irreducible for each xX and has an upper bound in Y. Since Y is bounded sober, we can find a unique axY with clY(Ax)=clY({ax}). Define f:XY by f(x)=ax. We show that the function f is continuous. Let xX and VO(Y) with f(x)=axV. It follows from ¯πx(A)=¯{ax} that Vπx(A), hence there exists aA such that a(x)V. By the continuity of a:XY, we can find a UO(X) with xU such that a(z)V for each zU. From aA, it follows that a(z)πz(A)¯πz(A)=¯{az}=¯{f(z)}, and hence f(z)V for all zU, which means that f is continuous. Finally, we show that ¯A=¯{f} in Top0(X,Y) (with the topology induced by the product topology on YX). Let π1x(Ux) (xX and UxO(Y)) be arbitrary subbasic open set such that fπ1x(Ux). By f(x)=ax¯πx(A), we have fπ1x(¯πx(A))π1x(Ux)=π1x(¯πx(A)Ux). Therefore, ¯πx(A)Ux, and hence πx(A)Ux or, equivalently, Aπ1x(Ux). Since A is irreducible, we deduce that all basic open sets containing f must meet A. It follows that ¯A=¯{f}. We conclude that the space Top0(X,Y) is bounded sober.

    Definition 3.7. Let X be a T0 space. We call X bounded d-space (b-d-space for short) if for every upper bounded DD(X), we can find xX such that ¯D=cl({x}).

    Proposition 3.8. A bounded d-space is closed-hereditary and saturated-hereditary.

    Proof. Suppose that X is a bounded d-space and A is a closed subspace of X. For each upper bounded directed set D in A, it is clear that D is directed and has an upper bound in X. As X is a bounded d-space, there exists a unique xX such that clX(D)=clX({x}). As the directed set D has upper bound in A and A=A, we have xA. Then clA(D)=clX(D)A=clX({x})A=clA({x}). Hence, A is a bounded d-space.

    Let U be a nonempty saturated subspace of X. For each upper bounded directed set DU in U, it is clear that DU is directed and has upper bound in X. From X being a bounded d-space, it follows that we can find a unique xX such that clX(DU)=clX({x}). We know that xU by U=U. Then clU(DU)=clX(DU)U=clX({x})U=clU({x}). Hence U is a bounded d-space.

    Definition 3.9. Let X be a T0 space. We call X weakly bounded well-filtered (w-b-WF for short) provided that for arbitrary upper bounded Rudin set AX, there exists xX with A=cl({x}).

    Since Sc(X)Dc(X)RD(X)WD(X)Irrc(X) for a T0 space X by [33,Proposition 2.6], it is obvious that each bounded sober space is weakly bounded well-filtered and each weakly bounded well-filtered space is a bounded d-space. By the following example, the well-known Johnstone's dcpo J equipped with Scott topology is a weakly bounded well-filtered space but not a well-filtered space.

    Example 3.10. Let J be the well-known dcpo constructed by Johnstone in [11], that is, J=N×(N{ω}) with the order defined as follows: (j,k)(m,n) iff j=m and kn, or n=ω and km. It is well-known that ΣJ is a dcpo and a non-sober space. Moreover, it was proved in [14,Example 3.1] that ΣJ is not well-filtered. Now we show that ΣJ is weakly bounded well-filtered.

    In fact, it is straightforward to verify that Irrc(ΣJ)={x:xJ}{J}. Since J does not have an upper bound in ΣJ, we have that ΣJ is bounded sober, and hence it is weakly bounded well-filtered.

    Theorem 3.11. Let X be a T0 space. X is weakly bounded well-filtered if and only if for an upper bounded closed set B and any filtered family {Ki:iI}K(X) such that KiB for all iI, iIKiB.

    Proof. Let X be a weakly bounded well-filtered space, B an upper bounded closed set and {Ki:iI}K(X) a filtered family with KiB for all iI. By Topological Rudin Lemma, we can find a minimal upper bounded closed subset CB with KiC for all iI. Since X is weakly bounded well-filtered, it is natural to find a unique xX with C=x, then xKi for each iI, which implies that xiIKi. Therefore, C(iIKi), and hence B(iIKi).

    Conversely, let A be an upper bounded Rudin set in X. By the definition of Rudin sets, we can find a filtered family {Ki:iI}K(X) with Am({Ki:iI}). Therefore, iIKiA. Select a point xiIKiA. Then xA and (x)Ki. It follows from the minimality of A that A=x.

    Proposition 3.12. Every bounded well-filtered space is weakly bounded well-filtered.

    Proof. Assume that X is bounded well-filtered, B is an upper bounded closed set and {Ki:iI}K(X) is a filtered family with KiB for all iI. If iIKiB=, then iIKiXB. Since B has upper bound, there exists a cX with Bc. Clearly, cKi for each iI, which means that iIKi. As X is bounded well-filtered, it is natural that KiXB for some iI, which contradicts with KiB for each iI. Therefore, iIKiB. Thus X is weakly bounded well-filtered by Theorem 3.11.

    The converse of Proposition 3.12 is not valid, see the following example.

    Example 3.13. Let J=N×(N{ω}) be the Johnstone's dcpo (see Example 3.10). Put P=J{a} and a is incomparable with all elements of J. Then {a}σ(P) and Irrc(ΣP)={x:xP}{J}. Since J does not have upper bound in P, ΣP is weakly bounded well-filtered. Set Ki={(j,ω):ji}{a}. Then {Ki:iN} is a filtered family and {Ki:iN}K(ΣP). However, iNKi={a}σ(P) and Ki{a} for each iI. Therefore, ΣP is not bounded well-filtered.

    As every weakly bounded well-filtered space is k-bounded well-filtered, one can directly get the following result by Proposition 3.12.

    Corollary 3.14. Every bounded well-filtered space is k-bounded well-filtered.

    By Example 3.13, we know that the converse of Corollary 3.14 is not valid in general.

    Figure 1 shows the relationships among some types of weakly sober spaces.

    Figure 1.  The relationships among weakly sober spaces.

    In this section, it is shown that k-bounded well-filteredness and weakly bounded well-filteredness both are saturated-hereditary, but k-bounded well-filteredness is not closed-hereditary. Moreover, weakly bounded well-filtered spaces are closed under retracts and products.

    Proposition 4.1. Suppose that X is k-bounded well-filtered and U is a nonempty saturated subspace of X. Then U is a k-bounded well-filtered space.

    Proof. Let C be a Rudin set in U and UC exist. Let u=UC. Then u is an upper bound of C in X. For any upper bound v of C in X, since U is a saturated subspace of X and CU, we have that vU, and hence uv in U or, equivalently, in X. It follows that u=XC, whence u=XclX(C) by Remark 2.1. Since C is a Rudin set in U, by Lemma 2.5, clX(C) is a Rudin set in X. From k-bounded well-filteredness of X, it follows that there exists xX with clX(C)=clX({x}). Since CU=U and Cx, we obtain that xU and C=clU(C)=(clX(C))U=(clX({x}))U=clU({x}). Thus as a saturated subspace, U is k-bounded well-filtered.

    The following example shows that k-bounded well-filteredness is not closed-hereditary.

    Example 4.2. Suppose that P=N{a,b} and the partial order on P is given as follows (see Figure 2):

    Figure 2.  A closed subspace of a k-bounded well-filtered space is not k-bounded well-filtered.

    (i) n<n+1 for each nN,

    (ii) n<a and n<b for all nN,

    (iii) a and b are incomparable.

    Clearly, Irrc(ΣP)={x:xP}{N}. The irreducible closed set N does not have supremum in ΣP, and thus ΣP is k-bounded sober, hence k-bounded well-filtered.

    Put A=N{a}. Then A=N{a}=a is a closed subspace of ΣP and N is a Rudin set in the subspace A. Indeed, set K={An:nN}. It is clear that KK(A) and Nm(K). Moreover, AN=a and Na=¯{a}. Therefore, A (as a closed subspace of ΣP) is not k-bounded well-filtered.

    Definition 4.3. ([5]) A topological space X is a retract of a topological space Y provided that there exist two continuous maps s:XY and r:YX with rs=idX.

    Next, we give an example to show that the class of k-bounded well-filtered spaces is not closed under retracts.

    Example 4.4. Let X=ΣP and Y=(A,σ(P)|A) be the two spaces in Example 4.2. f:XY is defined as follows:

    f(x)={x,xN,a,x{a,b},

    and define g:YX by g(y)=y for each yY, that is, g is the identical embedding of Y in X. Clearly, f is continuous and fg(y)=y for each yY, that is, fg=idY. Therefore, Y is a retract of X. It has been shown in Example 4.2 that X is k-bounded well-filtered, but Y is not.

    Proposition 4.5. Suppose that X is a k-bounded well-filtered space and Y is a topological space. If there exist two continuous mappings f:XY and g:YX satisfying fg=idY and gfidX, then Y is k-bounded well-filtered.

    Proof. Firstly, it is trivial that Y is a T0 space.

    Secondly, let F be a Rudin set in Y and YF exist. Let a=YF. Since g is continuous, by Lemma 2.5, clX(g(F)) is a closed Rudin set in X. We show that clX(g(F))=g(a). For each xF, by a=YF, we have that xYa and hence g(x)Xg(a). Therefore, g(a) is an upper bound of g(F). On the other hand, for an arbitrary upper bound b of g(F), and for each xF, g(x)Xb, whence x=fg(x)Yf(b). Since gfidX, we have gf(b)b. Since YF=aYf(b), we have g(a)gf(b)b. Thus g(a)=clX(g(F)).

    Finally, since X is k-bounded well-filtered, we can find a unique xX satisfying clX(g(F))=clX({x}). Then we show that F=clY({f(x)}). On the one hand, F=fg(F)fclX(g(F))=f(clX({x}))clY({f(x)}). On the other hand, f(x)f(clX(g(F)))clY(fg(F))=clY({F})=F, so clY({f(x)})F. Therefore, F=clY({f(x)}), proving that Y is k-bounded well-filtered.

    Example 4.6. Consider the space X=ΣP in Example 4.2. We know that X is k-bounded sober and hence k-bounded well-filtered.

    Let f=idX:XX be the identity mapping. g:XX is defined as follows:

    g(x)={x,xN,a,x=a,a,x=b.

    Clearly, g is continuous and Z={xX:f(x)=g(x)}=N{a}. It has been shown in Example 4.2 that subspace Z of X is not k-bounded well-filtered.

    Theorem 4.7. Let Xi (iI) be T0 spaces and X=iIXi. Then the followings are equivalent:

    (1) X is k-bounded well-filtered.

    (2) For all iI, Xi is k-bounded well-filtered.

    Proof. (1) (2): For jI, suppose that Fj is a Rudin set and XjFj exists, denoted by XjFj=xj. For each iI, choose siXi. Put B=iIBi, where Bj=Fj and Bi=si for ij. Then by [19,Theorem 2.10], B is a Rudin set in X and XB=(ai)iI, where aj=xj and ai=si for ij. From the k-bounded well-filteredness of X, it follows that we can find a unique x=(xi)iIX with B=clX({x})=iIclXi({xi}). Then Fj=pj(B)=¯{xj}. Thus Xj is k-bounded well-filtered.

    (2) (1): By [2,Theorem 2.3.11], X is a T0 space. Let F be a Rudin set in X and XF exist, denoted by XF=b=(bi)iI. For all iI, set pi:XXi to be the ith projection. By Lemma 2.5, clXi(pi(F)) is a Rudin set in Xi.

    Claim 1. For each jI, bj is the supremum of pj(F) in Xj.

    For mpj(F), there is x=(xi)iIF with m=xj=pj(x)pj(F). Since (bi)iI=XF, we have x(bi)iI. Then m=xj=pj(x)pj(b)=bj, and hence bj is an upper bound of pj(F) in Xj. Let s be an upper bound of pj(F) in Xj and c=(ci)iI, where cj=s and ci=bi if ij. Then c is an upper bound of F, whence bc and bjcj=s. Thus bj=Xjpj(F).

    Claim 2. There is xX satisfying F=¯{x}.

    For each iI, since Xi is k-bounded well-filtered, there is xiXi with clXi(pi(F))=clXi({xi}). Let x=(xi)iI. Since F is a Rudin set, and hence a closed irreducible subset, then F=iIclXi(pi(F))=iIclXi({xi})=clX({x}).

    Therefore, X is k-bounded well-filtered.

    By the following example, a k-bounded well-filtered space X for which the function space [XX] equipped with the topology of pointwise convergence may not be k-bounded well-filtered.

    Example 4.8. Let X=ΣP be the space in Example 4.2. It was shown in Example 4.2 that X is k-bounded well-filtered. Clearly, f:XX is continuous iff f:PP is order preserving. For each iN, define a mapping fi:XX by

    fi(x)={b,xP{1},i,x=1.

    Put D={fi:iN}. It was proved in [24,Example 3.12] that D is a directed subset in [XX] under the pointwise ordering and [XX]D is a closed subset in [XX] with respect to the topology of pointwise convergence. So cl[XX](D)=[XX]D. By [33,Proposition 2.6], we know that Dc(X)RD(X) for each T0 space X. Then [XX]D is a Rudin set in [XX]. Moreover, we see that g is the only upper bound of D in [XX], where g(x)=b for each xP, and hence g=[XX]D. However, [XX]D[XX]{g}. Therefore, [XX] of all continuous functions with the topology of pointwise convergence is not k-bounded well-filtered.

    Proposition 4.9. Weakly bounded well-filteredness is closed-hereditary and saturated-hereditary.

    Proof. Suppose that X is a weakly bounded well-filtered space and A is a closed subspace of X. Then A is T0. Assume that F is a Rudin set of A and has an upper bound in A. Then F is a closed subset of X. By Lemma 2.5, F is a Rudin set in X and also upper bounded in X. By the weakly bounded well-filteredness of X, we can find a unique xX with F=clX({x}). Since FA, we have that xA and F=clX({x})A=clA({x}). Thus A is weakly bounded well-filtered.

    Then assume that UX is non-empty saturated and F is a Rudin set of U which has an upper bound in U. Then U is T0 and by Lemma 2.5, clX(F) is a Rudin set in X. As F has an upper bound in U, we can find aU satisfying FUa=clX({a})U=XaUXa, and hence clX(F) is also upper bounded in X. It follows from the weakly bounded well-filteredness of X that we can choose a unique xX with clX(F)=clX({x}). Then FclX({x}). Since U is a saturated subset of X and FU, we have xU. Therefore, F=clU(F)=(clX(F))U=(clX({x}))U=clU({x}). Therefore, U is weakly bounded well-filtered.

    Proposition 4.10. Suppose that X is a weakly bounded well-filtered space and Y is a T0 space, Z={xX:f(x)=g(x)} is weakly bounded well-filtered, where f,g:XY are both continuous mappings.

    Proof. Suppose Z. Then since Z is a subspace of X, Z is T0. Assume that FRD(Z) which has an upper bound in Z. By Lemma 2.5, clX(F) is a Rudin set in X. According to the hypothesis, there exists aZ satisfying FZ{a}=clX({a})Z=X{a}ZX{a}, which means that a is an upper bound of F in X. Then the Rudin set clX(F) is upper bounded in X. Since X is weakly bounded well-filtered, we can choose a unique xX satisfying clX(F)=clX({x}). Then clY({f(x)})=clY(f(clX({x})))=clY(f(clX(F)))=clY(f(F))=clY(g(F))=clY(g(clX(F)))=clY(g(clX({x})))=clY({g(x)}). As Y is T0, it is clear that f(x)=g(x), and hence xZ. Thus we obtain that F=clZ(F)=(clX(F))Z=(clX({x}))Z=clZ({x}). In conclusion, Z is weakly bounded well-filtered.

    Proposition 4.11. The class of weakly bounded well-filtered spaces is closed under retraction.

    Proof. Suppose that X is weakly bounded well-filtered and suppose further that Y is a retract of X. Then we can choose two continuous mappings f:XY and g:YX with fg=idY. Firstly, as a retract of T0 space X, Y is a T0 space. Then let F be an upper bounded Rudin set in Y. It follows from Lemma 2.5 that clX(g(F)) is a Rudin set in X. Since F is upper bounded in Y, there exists bY with FYb, and hence g(F)g(Yb)Xg(b). Thus g(F) is upper bounded in X. Since X is weakly bounded well-filtered, we can choose a unique cX with clX(g(F))=clX({c}). We show that F=clY({f(c)}).

    On the one hand, F=fg(F)f(clX(g(F)))=f(clX({c}))clY({f(c)}). On the other hand, we know that f(c)f(clX({c}))=f(clX(g(F)))clY(f(g(F)))=clY(F)=F, whence clY({f(c)})F. Therefore, F=clY({f(c)}). So Y is weakly bounded well-filtered.

    Theorem 4.12. Let Xi(iI) be T0 spaces and X=iIXi. Then the followings are equivalent:

    (1) X is weakly bounded well-filtered;

    (2) Xi is weakly bounded well-filtered for all iI.

    Proof. (1) (2): It is trivial by Proposition 4.11.

    (2) (1): Suppose ARD(X) which has an upper bound a=(ai)iI in X. Then for all iI, by [29,Lemma 4.13], pi(A)RD(Xi) and pi(A)pi(a)pi(a)=Xiai. For each iI, since Xi is weakly bounded well-filtered, we can choose a unique xiXi satisfying pi(A)=clXi({xi}). Let x=(xi)iI. Then it follows from [29,Corollary 2.7] that A=iIpi(A)=iIclXi({xi})=clX({x}). Thus X is weakly bounded well-filtered.

    The Smyth power spaces are very important structures in domain theory and non-Hausdorff topology, which can describe a demonic view of bounded non-determinism (see [5,7,17,21,22]). Now we prove that for a T0 space X, if PS(X) is k-bounded well-filtered (resp., weakly bounded well-filtered), then so is X. Two examples are given to show that the converses do not hold.

    Proposition 5.1. Let X be a T0 space. If PS(X) is k-bounded well-filtered, so is X.

    Proof. Assume that PS(X) is k-bounded well-filtered and F is a Rudin set in X and XF exists, denoted by XF=a. Let ηX:XPS(X) be defined by ηX(x)=x for each xX. It follows from [29,Lemma 4.13] that ¯ηX(F)=¯{x:xF} is a Rudin set in PS(X). Then we claim that ¯ηX(F) exists in PS(X).

    For each xF, since XF=a, we have xa, that is, xa. So a is an upper bound of ηX(F) in PS(X). For an arbitrary upper bound GK(X) of ηX(F), and for each xF, xG, that is, Gx. Therefore, GxFx=XF=a, i.e., aG. So ηX(F)=a, and hence ¯ηX(F)=a in PS(X) by Remark 2.1. Since PS(X) is k-bounded well-filtered, we can choose KK(X) satisfying ¯ηX(F)=cl({K}). Therefore, a=¯ηX(F)=cl({K})=K and hence ¯ηX(F)=cl({a}). Let UO(X), then

    FUηX(F)U{a}UaU{a}U.

    Thus, F=clX(F)=clX({a}), that is, X is k-bounded well-filtered.

    Example 5.2. Suppose that X=ΣP is the space in Example 4.2. It is shown in Example 4.2 that X is k-bounded well-filtered. Clearly, K(X)={x:xP}{{a,b}}.

    Put Q=N{a,b,c} and the order on Q is defined by the following (see Figure 3):

    Figure 3.  The dcpo Q.

    (a) a and b are incomparable,

    (b) c<a and c<b,

    (c) n<c for each nN,

    (d) n<n+1 for all nN.

    Then Q is a dcpo. Let f:PS(ΣP)ΓQ be defined as the following

    f(x)={nx=n(nN),ax={a},bx={b},cx={a,b}.

    Clearly, f is a homeomorphism. In ΓQ, it is clear that N is a Rudin set (indeed, Nm({Qn:nN})) and c=QN. However, for any xQ, NQx=clΓQ({x}). Therefore, ΓQ is not k-bounded well-filtered and hence PS(K(X)) is not k-bounded well-filtered.

    Theorem 5.3. For a T0 space X, if PS(X) is weakly bounded well-filtered, then so is X.

    Proof. Suppose that ARD(X) which has an upper bound a in X. Then by Lemma 2.5, ¯ηX(A)=¯{a:aA} is a Rudin set in PS(X). It is clear that Xa is an upper bound of ¯ηX(A) in PS(X). Since PS(X) is weakly bounded well-filtered, we can find a unique KK(X) satisfying clPS(X)(ηX(A))=clPS(X)({K}).

    Now we show that K is supercompact. Let {Ui:iI}O(X) with KiIUi, i.e., KiIUi. By clPS(X)(ηX(A))=clPS(X)({K}), we have that {a:aA}iIUi. Then there exists a0A and i0I such that a0Ui0, that is, a0Ui0. By a0clPS(X)(ηX(A))=clPS(X)({K}), {K}Ui0 or, equivalently, KUi0. Thus K is supercompact, and hence, by [8,Fact 2.2], K=x for some xX, whence clPS(X)(ηX(A))=clPS(X)({x}).

    Finally, we verify that clX(A)=clX({x}). Let UO(X). By clPS(X)(ηX(A))=clPS(X)({x}), we have that

    AUηX(A)U{x}UxU{x}U.

    Thus, A=clX(A)=clX({x}) and X is weakly bounded well-filtered.

    Example 5.4. Let Y={a1,a2,,an,} and X=NY. The order on X is defined as the following (see Figure 4):

    Figure 4.  X is bounded well-filtered but PS(X) is not weakly bounded well-filtered.

    (i) n<n+1 for all nN,

    (ii) for any n,mN with nm, an and am are incomparable,

    (iii) for any n,mN, n and am are incomparable.

    Let X be endowed with the topology τ=υ(X)2Y. It is straightforward to verify that the specialization order of (X,τ) agrees with the original order of X and Irrc((X,τ))={x:xX}N. Since N is not upper bounded in X, it is clear that (X,τ) is bounded sober and hence weakly bounded well-filtered. Now we show that PS((X,τ)) is not weakly bounded well-filtered.

    Let K={nY:nN}. We first verify that KK((X,τ)). For each nN, if nYiI(UiVi)=iIUiiIVi, where Uiυ(X) and Vi2Y, then niIUi. We can choose i0I such that nUi0. Then there exists a finite set F in X with nXFUi0. Then there is JI(<ω) with nYiJ(UiVi), which means that nY is compact, whence a compact saturated set.

    Since X=1Y2YnY, we know that K is directed. Then we claim that K=nN{an}. Clearly, KnN{an}. On the other hand, if KK((X,τ)) and KnN{an}, then for each nN, anK. So YK. Since KK((X,τ)), KY (note {an}τ for each nN and Y=nN{an}), whence there exists mN with mK. Let m0=min{nN:nK}. Then K=m0YK. Hence, nN{an}K. Thus K=nN{an}.

    For each nN, {an}=Xan is τ-closed. So K=nN{an} is closed in PS((X,τ)). Moreover, since nN(nY)=Yτ, we know that K is upper bounded in PS(X) (for each nN, {an}=Xan is an upper bound of K), hence K is an upper bounded Rudin set in PS(X). Suppose that there exists GK((X,τ)) with K=clPS(X)({G}), then GnN(nY)=Y, i.e., GY, and Y is open in PS(X), but nYY for all nN, contradicting with K=clPS(X)({G}). Therefore, PS((X,τ)) is not weakly bounded well-filtered.

    In this section, we mainly consider the following two questions.

    Question 6.1. Is KBWF reflective in Top0?

    Question 6.2. Is KBWFr reflective in Topr?

    Then, we give negative answers to Questions 6.1 and 6.2, respectively. In this section, K always denotes a full subcategory of Top0, and we call the objects of K K-spaces. Moreover, if homeomorphic copies of K-spaces are still K-spaces, it will be called closed with respect to homeomorphisms.

    Definition 6.3. ([27,Definition 4.1]) A K-reflection of a T0 space X is a pair ˜X,μ consisted by a K-space ˜X and a continuous mapping μ:X˜X which satisfy that for any continuous mapping f:XY to a K-space, we can choose a unique continuous mapping f:˜XY with fμ=f.

    If K-reflections exist, are unique up to homeomorphism and denoted by Xk.

    Definition 6.4. [31,Definition 4.3] Suppose that a T0 space X has a greatest element X and X{X}Irrc(X). Let satisfy X. Then (C(X){X{X}}){X{}} is a topology on X{}. X denotes the resulting space. For each xX{X}, let the mapping ηX:XX be such that ηX(x)=x and ηX(X)=. It is straightforward to prove that ηX is a topological embedding.

    Definition 6.5. [31,Definition 4.4] We call a T0 space X a K¬-space if it satisfies the following four conditions:

    (1) X is not a K-space.

    (2) X (with the specialization order) has a greatest element X.

    (3) X{X}Irrc(X).

    (4) ¯{x}X{X} for each xX, or equivalently, X{X} has no greatest element.

    Since ¯{X}=X=XX{X}, condition (4) in Definition 6.5 is equivalent to the condition: ¯{x}X{X} for each xX{X}.

    Theorem 6.6. The KBWF-reflection of (N{N},σ(N{N}){N}) does not exist.

    Proof. Put L=N{N}. The order on L is defined by 1<2<3<<n<n+1<<N and endow L with the topology (as the set of all closed sets) τ={n:nN}{,L}{N} (clearly, the set of all open subsets is υ(L){{N}}=σ(L){{N}}). Then

    (a) (L,τ) is not k-bounded well-filtered. Indeed, it is straightforward to verify that O((L,τ))={Lx:xL}{} and K(X)={Lx:xL}. Since Nm({Ln:nN}), N is a Rudin set in (L,τ) and N=N. As Nx for all xL, (L,τ) is not k-bounded well-filtered.

    (b) (L,τ) has a greatest element (L,τ).

    Clearly, the specialization order of (L,τ) agrees with the original order on L. Whence (L,τ) has a greatest element (L,τ), namely, the element N.

    (c) Irrc((L,τ))={x:xL}{N}={x:xL}{L{(L,τ)} (note that L=N). Whence L{N}=NIrrc((L,τ)).

    (d) ¯{x}=xN=L{N} for each xL.

    (e) (L,τ) is a KBWF¬-space and Irrc((L,τ))={x:xL}{N}={x:xL}{L{(L,τ)}.

    By (a)-(d), (L,τ) is a KBWF¬-space and Irrc((L,τ))={x:xL}{N}={x:xL}{L{(L,τ)}.

    (f) (L,τ),ηL is a sobrification of (L,τ), where ηL:(L,τ)(L,τ) is defined by ηL(x)=x for each xN and ηL(N)=.

    By (e) and [31,Corollary 4.15], (L,τ),ηL is a sobrification of (L,τ).

    (g) (L,τ),ηL is not a KBWF-reflection of (L,τ).

    Assume, on the contrary, that (L,τ),ηL is a KBWF-reflection of (L,τ). Let N12=N{1,2}. Define an order on N12 by n<n+1 and n<1,n<2 for any nN. Endow N12 with the Scott topology σ(N12). It is proved in Example 4.2 that (N12,σ(N12)) is k-bounded well-filtered.

    Define a mapping f:(L,τ)(N12,σ(N12)) by

    f(x)={nx=nN,1x=N.

    It is easy to see that f is a topological embedding. Since (L,τ),ηL is a KBWF-reflection of (L,τ), there is a unique fk:(L,τ)((N12,σ(N12)) such that f=fkηL, that is, the following diagram commutes.

    Then fk(n)=fk(ηL(n))=f(n)=n for each nN and fk()=fk(ηL(N))=f(N)=1. For each nN, since n<N< in (L,τ), we have that n=fk(n)fk(N)fk()=1 in (N12,σ(N12)). Whence fk(N) is an upper bound of N in N12 and fk(N)1. So fk(N)=1 and hence (fk)1(N)=NC((L,τ)) (note that N is closed in (N12,σ(N12))), which contradicts the continuity of fk.

    Thus (L,τ),ηL is not a KBWF-reflection of (L,τ).

    (h) The KBWF-reflection of (L,τ) does not exist.

    By (e), (f), (g) and [31,Corollary 4.15], the KBWF-reflection of (L,τ) does not exist.

    Corollary 6.7. KBWF is not reflective in Top0.

    Remark 6.8. Corollary 6.7 can be obtained by [20,Theorem 2.14,Example 3.7] in a different way. In fact, let X and Xn be the spaces in [20,Example 3.7]. It was proved in [20,Example 3.7] that each Xn is a k-bounded sober subspace of X and hence a k-bounded well-filtered subspace of X. Let Y=n2Xn=[0,1){2}, then YF=2 and F=[0,1) is a directed closed set in Y, but xY,FclY({x}). Therefore, Y=n2Xn is not a k-bounded well-filtered space. That is, the category KBWF does not satisfies (K3). It follows from [20,Theorem 2.14] that KBWF is not reflective in Top0.

    Then, in [16,Theorem 3.3], it was proved that KBSob is not reflective in Topk (continuous mappings preserving all existing sups of irreducible sets). In this paper, Topr denotes the category of all T0 spaces with continuous mappings preserving all existing sups of Rudin sets. Similarly, we show that KBWFr is not reflective in Topr, which gives a negative answer to Question 6.2.

    Example 6.9. Let P=J{1} be the subset of L=J{1,2} in [16,Lemma 3.1], where J is the well-known Johnstone's dcpo. In ΓP=(P,γ(P)), B={(1,n):nN} is an irreducible closed set with B=(1,ω). In ΓP, a subset is irreducible if and only if it is directed. Then, we know that B is a directed closed set. Therefore, B is a Rudin set and B=(1,ω). However, for all xP, Bx. Therefore, ΓP is not k-bounded well-filtered.

    Theorem 6.10. The KBWFr-reflection of (P,γ(P)) does not exist.

    Proof. Let X=ΓP in Example 6.9 and Y=ΣL in [16,Lemma 3.1]. By [16,Lemma 3.1], Y is k-bounded well-filtered. We assume that the KBWFr-reflection of ΓP exists, then let αX:XXk be the reflection of X in KBWFr. Let f:XY be such that f(x)=x for each xX. Then f is continuous and f(XD)=XD=YD=Yf(D), where D is a directed subset of P. So, f is a homomorphism in the category Topr. We can find a unique f:XkY with f=fαX. Moreover, it was proved in [16,Theorem 3.3] that Y and Xk are homeomorphic.

    Suppose that Z=Σ2 is the Sierpinski space, f0 is the constant mapping which maps x to 0 for each xX and f is the constant mapping mapping y to 0 for each yY. Let g:YZ be such that

    g(x)={0,xP;1,x=2.

    Then f0=f0f=gf, which is a contradiction since f0 is unique. In conclusion, the KBWFr-reflection of ΓP does not exist.

    Corollary 6.11. KBWFr is not reflective in Topr.

    In this paper, based on Rudin sets, we investigate the relationships among some weakly sober spaces and mainly study some properties of k-bounded well-filtered spaces and weakly bounded well-filtered spaces. Combining some previous papers, such as [5,11,12,13,15,18,19,23,25,26,32,34,35,36,37,38], we obtain the following Table 1. In this table, "+" means that the property is preserved, and "" denotes that the property is not preserved in spaces. Moreover, "?" denotes that we do not know the related results and it need to study for further. Moreover, in this paper, we do not consider the property of reflection of weakly bounded well-filtered spaces and lead it to be researched in the future.

    Table 1.  Some properties of kinds of spaces.
    Item Closed heredity Saturated heredity Retract Product Functional space Smyth power construction PS(X) property TX property T Reflection
    Sobriety + + + + + + + +
    b-sobriety + + + + + + +
    k-b-sobriety + + +
    WF spaces + + + + + + + +
    b-WF spaces ? + + ? ? + + ?
    w-b-WF spaces + + + + ? + ?
    k-b-WF spaces + + +
    d-spaces + + + + + + +
    b-d-spaces + + + + ? + ?
    Almost sobriety + + +

     | Show Table
    DownLoad: CSV

    This research is supported by the National Natural Science Foundation of China (Nos. 12071199, 11661057), the Natural Science Foundation of Jiangxi Province, China (No. 20192ACBL20045) and the Foundation of PhD start-up of Nanchang Hangkong University (EA202007056).

    All authors declare that there is no conflict of interest.



    [1] E. Namazi, J. Li, C. Lu, Intelligent intersection management systems considering autonomous vehicles: A systematic literature review, IEEE Access, 7 (2019), 91946–91965. https://doi.org/10.1109/ACCESS.2019.2927412 doi: 10.1109/ACCESS.2019.2927412
    [2] U. K. Lilhore, A. L. Imoize, C. T. Li, S. Simaiya, S. K. Pani, N. Goyal, et al., Design and implementation of an ML and IoT based adaptive traffic-management system for smart cities, Sensors, 22 (2022), 2908. https://doi.org/10.3390/s22082908 doi: 10.3390/s22082908
    [3] R. Ravish, S. R. Swamy, Intelligent traffic management: A review of challenges, solutions, and future perspectives, Transport Telecommun. J., 22 (2021), 163–182. https://doi.org/10.2478/ttj-2021-0013 doi: 10.2478/ttj-2021-0013
    [4] S. Sharma, S. K. Awasthi, Introduction to intelligent transportation system: overview, classification based on physical architecture, and challenges, Int. J. Sens. Netw., 38 (2022), 215–240. https://doi.org/10.1504/IJSNET.2022.122593 doi: 10.1504/IJSNET.2022.122593
    [5] K. Jurczenia, J. Rak, A survey of vehicular network systems for road traffic management, IEEE Access, 10 (2022), 42365–42385. https://doi.org/10.1109/ACCESS.2022.3168354 doi: 10.1109/ACCESS.2022.3168354
    [6] A. Dureja, S. Sangwan, Intelligent traffic management system using Ant Colony Optimization and Internet of Things, Int. J. Commun. Syst., 35(2022), e5248.
    [7] J. Lian, Y. Zhou, Model predictive control of the fuel cell cathode system based on state quantity estimation, Comput. Simul., 37 (2020), 119–122. https://doi.org/10.3969/j.issn.1006-9348.2020.07.023 doi: 10.3969/j.issn.1006-9348.2020.07.023
    [8] Y. Lin, Spoken instruction understanding in air traffic control: challenge, technique, and application, Aerospace, 8 (2021). https://doi.org/10.3390/aerospace8030065 doi: 10.3390/aerospace8030065
    [9] C. Chen, S. Quan, A summary of security techniques-based blockchain in IoV, Secur. Commun. Netw., 2022 (2022), 8689651. https://doi.org/10.1155/2022/8689651 doi: 10.1155/2022/8689651
    [10] T. K. Chan, C. S. Chin, Review of autonomous intelligent vehicles for urban driving and parking, Electronics, 10 (2021), 1021. https://doi.org/10.3390/electronics10091021 doi: 10.3390/electronics10091021
    [11] N. Sharma, N. Chauhan, N. Chand, Cluster based distributed service discovery in Internet of vehicle, J. Commun. Software Syst., 17 (2021), 281–288. https://doi.org/10.24138/jcomss-2021-0069 doi: 10.24138/jcomss-2021-0069
    [12] H. Zhang, L. Zhang, Y. Guo, Z. Wang, Data transmission mechanism of vehicle networking based on fuzzy comprehensive evaluation, Open Math., 20 (2022), 1909–1925. https://doi.org/10.1515/math-2022-0537 doi: 10.1515/math-2022-0537
    [13] C. Xu, H. Wu, H. Liu, W. Gu, Y. Li, D. Cao, Blockchain-oriented privacy protection of sensitive data in the internet of vehicles, IEEE Trans. Intell. Veh., 8 (2022), 1057–1067. https://doi.org/10.1109/TIV.2022.3164657 doi: 10.1109/TIV.2022.3164657
    [14] C. Zhang, M. Dong, K. Ota, Employ AI to improve AI services: Q-learning based holistic traffic control for distributed co-inference in deep learning, IEEE Trans. Serv. Comput., 15 (2022), 627–639. https://doi.org/10.1109/TSC.2021.3113184 doi: 10.1109/TSC.2021.3113184
    [15] Z. Wang, Y. Ma, Detection and recognition of stationary vehicles and seat belts in intelligent Internet of Things traffic management system, Neural Comput. Appl., 34 (2021), 3513–3522. https://doi.org/10.1007/s00521-021-05870-6 doi: 10.1007/s00521-021-05870-6
    [16] R. Markowska, Z. Wróbel, Selected issues of safe operation of the railway traffic control system in the event of exposition to damage caused by lightning discharges, Energies, 14 (2021). https://doi.org/10.3390/en14185808 doi: 10.3390/en14185808
    [17] S. Hoskova-Mayerova, J. Kalvoda, M. Bauer, P. Rackova, Development of a methodology for assessing workload within the air traffic control environment in the Czech Republic, Sustainability, 14 (2022). https://doi.org/10.3390/su14137858 doi: 10.3390/su14137858
    [18] A. Vernotte, A. Cretin, B. Legeard, F. Peureux, A domain-specific language to design false data injection tests for air traffic control systems, Int. J. Software Tools Technol. Transfer, 24 (2021), 127–158. https://doi.org/10.1007/s10009-021-00604-4 doi: 10.1007/s10009-021-00604-4
    [19] C. Li, S. Xi, C. Lu, C. D. Gill, R. Guerin, Prioritizing soft real-time network traffic in virtualized hosts based on xen, in 21st IEEE Real-Time and Embedded Technology and Applications Symposium, (2015), 145–156. https://doi.org/10.1109/TNET.2021.3114055
    [20] L. Dzhuma, O. Dmitriiev, O. Lavrynenko, M. Soroka, Revealing the regularities related to the professional activities of the air traffic controller of airport traffic control tower, Technol. Audit Prod. Reserves, 3 (2021), 29–40. https://doi.org/10.15587/2706-5448.2021.235456 doi: 10.15587/2706-5448.2021.235456
    [21] Q. Xu, Y. Pang, Y. Liu, Air traffic density prediction using Bayesian ensemble graph attention network (BEGAN), Transp. Res. Part C Emerging Technol., 153 (2023). https://doi.org/10.1016/j.trc.2023.104225 doi: 10.1016/j.trc.2023.104225
    [22] S. Borsuk, O. Reva, Distributions of air traffic control students' attitudes towards workload, Aviation, 25 (2021), 241–251. https://doi.org/10.3846/aviation.2021.15954 doi: 10.3846/aviation.2021.15954
    [23] M. E. S. Ciu, A. R. Ub, The implementation of e-government in the sector transportation (studi on area traffic control system program resources in Sidoarjo district), JKMP, 10 (2022), 54–63. https://doi.org/10.21070/jkmp.v10i1.1688 doi: 10.21070/jkmp.v10i1.1688
    [24] C. J. Qun, On-ramp traffic control and optimization of urban expressway, J. Syst. Manage., 31 (2022), 27. https://doi.org/10.3969/j.issn1005-2542.2022.01.003 doi: 10.3969/j.issn1005-2542.2022.01.003
    [25] J. A. Chris, Potential use and benefits of automation for traffic control in roadway construction, J. Civil Eng. Constr. Technol., 12 (2021), 7–24. https://doi.org/10.5897/JCECT2020.0549 doi: 10.5897/JCECT2020.0549
    [26] D. Fuscá, K. Rahimli, R. Leuzzi, Identification of vessel class with LSTM using kinematic features in maritime traffic control, Int. J. Mar. Environ. Sci., 16 (2022).
    [27] P. Wang, P. Li, F. R. Chowdhury, Development of an adaptive traffic signal control framework for urban signalized interchanges based on infrastructure detectors and CAV technologies, J. Transp. Eng. Part A. Syst., 148 (2022). https://doi.org/10.1061/JTEPBS.0000648 doi: 10.1061/JTEPBS.0000648
    [28] I. K. U. Adizov, Operational traffic control with a system of priorities at stations without centralization, Sci. Prog., 2 (2021), 797–803.
    [29] S. Neelakandan, M. A. Berlin, S. Tripathi, V. B. Devi, I. Bhardwaj, N. Arulkumar, IoT-based traffic prediction and traffic signal control system for smart city, Soft Comput., 25 (2021), 12241–12248. https://doi.org/10.1007/s00500-021-05896-x doi: 10.1007/s00500-021-05896-x
    [30] D. Li, S. B. De, Distributed model-free adaptive predictive control for urban traffic networks, IEEE Trans. Control Syst. Technol., 30 (2022), 180–192. https://doi.org/10.1109/TCST.2021.3059460 doi: 10.1109/TCST.2021.3059460
    [31] T. Yoshioka, H. Sakakibara, R. Tenhagen, S. Lorkowski, T. Oguchi, Traffic signal control parameter calculation using probe data, Int. J. Intell. Transp. Syst. Res., 20 (2022), 288–298. https://doi.org/10.1007/s13177-021-00292-z doi: 10.1007/s13177-021-00292-z
    [32] Y. Ju, Y. Chen, Z. Cao, L. Liu, Q. Pei, M. Xiao, et al., Joint secure offloading and resource allocation for vehicular edge computing network: A multi-agent deep reinforcement learning approach, IEEE Trans. Intell. Transp. Syst., 24 (2023), 5555–5569. https://doi.org/10.1109/TITS.2023.3242997 doi: 10.1109/TITS.2023.3242997
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1887) PDF downloads(118) Cited by(0)

Figures and Tables

Figures(10)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog