The medical domain faces unique challenges in Information Retrieval (IR) due to the complexity of medical language and terminology discrepancies between user queries and documents. While traditional Keyword-Based Meth...
详细信息
The recommendation system has far-reaching significance and great practical value, which alleviates people’s troubles about choosing from a huge amount of information. The existing recommendation system usually faces...
详细信息
With the intensification of aging, life-assistive devices for the elderly are becoming important. As an important auxiliary tool, intelligent canes can significantly improve the quality of life of the elderly. Based o...
详细信息
This paper focuses on the finite-time control(FTC) of the composite formation consensus(CFC)problems for multi-robot systems(MRSs). The CFC problems are firstly proposed for MRSs under the complex network topology of ...
详细信息
This paper focuses on the finite-time control(FTC) of the composite formation consensus(CFC)problems for multi-robot systems(MRSs). The CFC problems are firstly proposed for MRSs under the complex network topology of cooperative or cooperative-competitive networks. Regarding the problems of FTC and CFC on multiple Lagrange systems(MLSs), coupled sliding variables are introduced to deal with the robustness and consistent convergence. Then, the adaptive finite-time protocols are given based on the displacement approaches. With the premised FTC, tender-tracking methods are further developed for the problems of tracking information disparity. Stability analyses of those MLSs mentioned above are clarified with Lyapunov candidates considering the coupled sliding vectors, which provide new verification for tender-tracking systems. Under the given coupled-sliding-variable-based finite-time protocols, MLSs distributively adjust the local formation error to achieve global CFC and perform uniform convergence in time-varying tracking. Finally, simulation experiments are conducted while providing practical solutions for the theoretical results.
Spherical fuzzy soft expert set(SFSES)theory blends the perks of spherical fuzzy sets and group decision-making into a unified *** allows solutions to highly complicated uncertainties and ambiguities under the unbiase...
详细信息
Spherical fuzzy soft expert set(SFSES)theory blends the perks of spherical fuzzy sets and group decision-making into a unified *** allows solutions to highly complicated uncertainties and ambiguities under the unbiased supervision and group decision-making of multiple ***,SFSES theory has some deficiencies such as the inability to interpret and portray the bipolarity of *** work highlights and overcomes these limitations by introducing the novel spherical fuzzy bipolar soft expert sets(SFBSESs)as a powerful hybridization of spherical fuzzy set theory with bipolar soft expert sets(BSESs).Followed by the development of certain set-theoretic operations and properties of the proposed model,important problems,including the selection of non-powered dam(NPD)sites for hydropower conversion are discussed and solved under the proposed *** problems mainly focus on the need for an efficient tool capable of considering the bipolarity of parameters,complicated ambiguities,and multiple *** the new approach by a detailed comparative analysis,it is concluded that the proposed model is more comprehensive and reliable for multi-attribute group decisionmaking(MAGDM)than the previous tools,particularly considering the bipolarity of parameters under SFSES environment.
In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(***.134:108344,2...
详细信息
In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(***.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing *** examples show that the proposed method is efficient with the two-step technique.
The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain C...
详细信息
Owing to the progress of information technology, library management system is being automated intelligently. Book barcode recognition is the key to improve the quality of service but its performance is affected by lig...
详细信息
This work focuses on finding an approximate solution to the Sharma-Tasso-Olive (STO) equation. The approach combines accelerated Adomian decomposition (ADM) with the Ramadan group integral transform (RGT) to tackle th...
详细信息
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tile...
详细信息
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number(*** number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly,respects the agent's knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.
暂无评论