Given the severity of waste pollution as a major environmental concern, intelligent and sustainable waste management is becoming increasingly crucial in both developed and developing countries. The material compositio...
详细信息
Six-phase motors are becoming more popular because of their advantages such as lower torque ripple, better power distribution per phase, higher efficiency, and fault-tolerant capability compared to the three-phase one...
详细信息
Over the past two decades, the rise in video streaming has been driven by internet accessibility and the demand for high-quality video. To meet this demand across varying network speeds and devices, transcoding is ess...
详细信息
Incredible progress has been made in human action recognition(HAR),significantly impacting computer vision applications in sports ***,identifying dynamic and complex movements in sports like badminton remains challeng...
详细信息
Incredible progress has been made in human action recognition(HAR),significantly impacting computer vision applications in sports ***,identifying dynamic and complex movements in sports like badminton remains challenging due to the need for precise recognition accuracy and better management of complex motion *** learning techniques like convolutional neural networks(CNNs),long short-term memory(LSTM),and graph convolutional networks(GCNs)improve recognition in large datasets,while the traditional machine learning methods like SVM(support vector machines),RF(random forest),and LR(logistic regression),combined with handcrafted features and ensemble approaches,perform well but struggle with the complexity of fast-paced sports like *** proposed an ensemble learning model combining support vector machines(SVM),logistic regression(LR),random forest(RF),and adaptive boosting(AdaBoost)for badminton action *** data in this study consist of video recordings of badminton stroke techniques,which have been extracted into spatiotemporal *** three-dimensional distance between each skeleton point and the right hip represents the spatial *** temporal features are the results of Fast Dynamic Time Warping(FDTW)calculations applied to 15 frames of each video *** weighted ensemble model employs soft voting classifiers from SVM,LR,RF,and AdaBoost to enhance the accuracy of badminton action *** E2 ensemble model,which combines SVM,LR,and AdaBoost,achieves the highest accuracy of 95.38%.
Generator tripping scheme(GTS)is the most commonly used scheme to prevent power systems from losing safety and ***,GTS is composed of offline predetermination and real-time scenario ***,it is extremely time-consuming ...
详细信息
Generator tripping scheme(GTS)is the most commonly used scheme to prevent power systems from losing safety and ***,GTS is composed of offline predetermination and real-time scenario ***,it is extremely time-consuming and labor-intensive for manual predetermination for a large-scale modern power *** improve efficiency of predetermination,this paper proposes a framework of knowledge fusion-based deep reinforcement learning(KF-DRL)for intelligent predetermination of ***,the Markov Decision Process(MDP)for GTS problem is formulated based on transient instability ***,linear action space is developed to reduce dimensionality of action space for multiple controllable ***,KF-DRL leverages domain knowledge about GTS to mask invalid actions during the decision-making *** can enhance the efficiency and learning ***,the graph convolutional network(GCN)is introduced to the policy network for enhanced learning *** simulation results obtained on New England power system demonstrate superiority of the proposed KF-DRL framework for GTS over the purely data-driven DRL method.
Integrated sensing and communications (ISAC) is one of the crucial technologies for 6G, and channel state information (CSI) based sensing serves as an essential part of ISAC. However, current research on ISAC focuses ...
详细信息
Image inpainting consists of filling holes or missing parts of an image. Inpainting face images with symmetric characteristics is more challenging than inpainting a natural scene. None of the powerful existing models ...
详细信息
Extreme events jeopardize power network operations, causing beyond-design failures and massive supply interruptions. Existing market designs fail to internalize and systematically assess the risk of extreme and rare e...
详细信息
Cloud Computing (CC) is widely adopted in sectors like education, healthcare, and banking due to its scalability and cost-effectiveness. However, its internet-based nature exposes it to cyber threats, necessitating ad...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwr...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwright, 2018;Agarwal et al., 2017;Falahatgar et al., 2017;Heckel et al., 2019;Wang et al., 2024a;Gu and Xu, 2023;Kunisky et al., 2024), noisy searching (Berlekamp, 1964;Horstein, 1963;Burnashev and Zigangirov, 1974;Pelc, 1989;Karp and Kleinberg, 2007), among many others, the goal is to devise algorithms with the minimum number of queries that are robust enough to detect and correct the errors that can happen during the computation. In this work, we consider the noisy computing of the threshold-k function. For n Boolean variables x = (x1, ..., xn) ∈ {0, 1}n, the threshold-k function THk(·) computes whether the number of 1's in x is at least k or not, i.e., (Equation presented) The noisy queries correspond to noisy readings of the bits, where at each time step, the agent queries one of the bits, and with probability p, the wrong value of the bit is returned. It is assumed that the constant p ∈ (0, 1/2) is known to the agent. Our goal is to characterize the optimal query complexity for computing the THk function with error probability at most δ. This model for noisy computation of the THk function has been studied by Feige et al. (1994), where the order of the optimal query complexity is established;however, the exact tight characterization of the optimal number of queries is still open. In this paper, our main contribution is tightening this gap by providing new upper and lower bounds for the computation of the THk function, which simultaneously improve the existing upper and lower bounds. The main result of this paper can be stated as follows: for any 1 ≤ k ≤ n, there exists an algorithm that computes the THk function with an error probability at most δ = o(1), and the algorithm uses at most (Equation presented) queries in expectation. Here we define m (Eq
暂无评论