GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    American Institute of Mathematical Sciences (AIMS) ; 2024
    In:  Mathematical Biosciences and Engineering Vol. 21, No. 2 ( 2024), p. 2626-2645
    In: Mathematical Biosciences and Engineering, American Institute of Mathematical Sciences (AIMS), Vol. 21, No. 2 ( 2024), p. 2626-2645
    Abstract: 〈 abstract 〉 〈 p 〉 Calculating single-source shortest paths (SSSPs) rapidly and precisely from weighted digraphs is a crucial problem in graph theory. As a mathematical model of processing uncertain tasks, rough sets theory (RST) has been proven to possess the ability of investigating graph theory problems. Recently, some efficient RST approaches for discovering different subgraphs (e.g. strongly connected components) have been presented. This work was devoted to discovering SSSPs of weighted digraphs by aid of RST. First, SSSPs problem was probed by RST, which aimed at supporting the fundamental theory for taking RST approach to calculate SSSPs from weighted digraphs. Second, a heuristic search strategy was designed. The weights of edges can be served as heuristic information to optimize the search way of $ k $-step $ R $-related set, which is an RST operator. By using heuristic search strategy, some invalid searches can be avoided, thereby the efficiency of discovering SSSPs was promoted. Finally, the W3SP@R algorithm based on RST was presented to calculate SSSPs of weighted digraphs. Related experiments were implemented to verify the W3SP@R algorithm. The result exhibited that W3SP@R can precisely calculate SSSPs with competitive efficiency. 〈 /p 〉 〈 /abstract 〉
    Type of Medium: Online Resource
    ISSN: 1551-0018
    Language: Unknown
    Publisher: American Institute of Mathematical Sciences (AIMS)
    Publication Date: 2024
    detail.hit.zdb_id: 2265126-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    MDPI AG ; 2023
    In:  Mathematics Vol. 11, No. 8 ( 2023-04-21), p. 1969-
    In: Mathematics, MDPI AG, Vol. 11, No. 8 ( 2023-04-21), p. 1969-
    Abstract: Label-specific feature learning has become a hot topic as it induces classification models by accounting for the underlying features of each label. Compared with single-label annotations, multi-label annotations can describe samples from more comprehensive perspectives. It is generally believed that the compelling classification features of a data set often exist in the aggregation of label distribution. In this in-depth study of a multi-label data set, we find that the distance between all samples and the sample center is a Gaussian distribution, which means that the label distribution has the tendency to cluster from the center and spread to the surroundings. Accordingly, the double annulus field based on this distribution trend, named DEPT for double annulusfield and label-specific features for multi-label classification, is proposed in this paper. The double annulus field emphasizes that samples of a specific size can reflect some unique features of the data set. Through intra-annulus clustering for each layer of annuluses, the distinctive feature space of these labels is captured and formed. Then, the final classification model is obtained by training the feature space. Contrastive experiments on 10 benchmark multi-label data sets verify the effectiveness of the proposed algorithm.
    Type of Medium: Online Resource
    ISSN: 2227-7390
    Language: English
    Publisher: MDPI AG
    Publication Date: 2023
    detail.hit.zdb_id: 2704244-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    American Institute of Mathematical Sciences (AIMS) ; 2023
    In:  Mathematical Biosciences and Engineering Vol. 20, No. 7 ( 2023), p. 12772-12801
    In: Mathematical Biosciences and Engineering, American Institute of Mathematical Sciences (AIMS), Vol. 20, No. 7 ( 2023), p. 12772-12801
    Abstract: 〈abstract〉 〈p〉There are approximately 2.2 billion people around the world with varying degrees of visual impairments. Among them, individuals with severe visual impairments predominantly rely on hearing and touch to gather external information. At present, there are limited reading materials for the visually impaired, mostly in the form of audio or text, which cannot satisfy the needs for the visually impaired to comprehend graphical content. Although many scholars have devoted their efforts to investigating methods for converting visual images into tactile graphics, tactile graphic translation fails to meet the reading needs of visually impaired individuals due to image type diversity and limitations in image recognition technology. The primary goal of this paper is to enable the visually impaired to gain a greater understanding of the natural sciences by transforming images of mathematical functions into an electronic format for the production of tactile graphics. In an effort to enhance the accuracy and efficiency of graph element recognition and segmentation of function graphs, this paper proposes an MA Mask R-CNN model which utilizes MA ConvNeXt as its improved feature extraction backbone network and MA BiFPN as its improved feature fusion network. The MA ConvNeXt is a novel feature extraction network proposed in this paper, while the MA BiFPN is a novel feature fusion network introduced in this paper. This model combines the information of local relations, global relations and different channels to form an attention mechanism that is able to establish multiple connections, thus increasing the detection capability of the original Mask R-CNN model on slender and multi-type targets by combining a variety of multi-scale features. Finally, the experimental results show that MA Mask R-CNN attains an 89.6% mAP value for target detection and 72.3% mAP value for target segmentation in the instance segmentation of function graphs. This results in a 9% mAP improvement for target detection and 12.8% mAP improvement for target segmentation compared to the original Mask R-CNN.〈/p〉 〈/abstract〉
    Type of Medium: Online Resource
    ISSN: 1551-0018
    Language: Unknown
    Publisher: American Institute of Mathematical Sciences (AIMS)
    Publication Date: 2023
    detail.hit.zdb_id: 2265126-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2022
    In:  International Journal of Machine Learning and Cybernetics Vol. 13, No. 11 ( 2022-11), p. 3645-3662
    In: International Journal of Machine Learning and Cybernetics, Springer Science and Business Media LLC, Vol. 13, No. 11 ( 2022-11), p. 3645-3662
    Type of Medium: Online Resource
    ISSN: 1868-8071 , 1868-808X
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2022
    detail.hit.zdb_id: 2572473-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2022
    In:  International Journal of Machine Learning and Cybernetics Vol. 13, No. 2 ( 2022-02), p. 337-356
    In: International Journal of Machine Learning and Cybernetics, Springer Science and Business Media LLC, Vol. 13, No. 2 ( 2022-02), p. 337-356
    Type of Medium: Online Resource
    ISSN: 1868-8071 , 1868-808X
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2022
    detail.hit.zdb_id: 2572473-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2023
    In:  Applied Intelligence Vol. 53, No. 24 ( 2023-12), p. 29781-29798
    In: Applied Intelligence, Springer Science and Business Media LLC, Vol. 53, No. 24 ( 2023-12), p. 29781-29798
    Type of Medium: Online Resource
    ISSN: 0924-669X , 1573-7497
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2023
    detail.hit.zdb_id: 1479519-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Elsevier BV ; 2024
    In:  Engineering Applications of Artificial Intelligence Vol. 129 ( 2024-03), p. 107616-
    In: Engineering Applications of Artificial Intelligence, Elsevier BV, Vol. 129 ( 2024-03), p. 107616-
    Type of Medium: Online Resource
    ISSN: 0952-1976
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2024
    detail.hit.zdb_id: 1502275-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...