The Single-Source Shortest Path (SSSP) algorithm is one of the most important kernels used by a variety of high-level graph processing applications. Although having been extensively studied for single-node scenarios, ...
详细信息
The Single-Source Shortest Path (SSSP) algorithm is one of the most important kernels used by a variety of high-level graph processing applications. Although having been extensively studied for single-node scenarios, SSSP algorithm still faces difficulties when being deployed on scale-free graph, which brings about redundant edge traversals, expensive atomic operations and random memory access. In this paper, three parallel-friendly and work-efficient opti-mizations are introduced to improve the performance of parallel SSSP algorithm with shared memory on the single-node system. First, a label-aware pruning technique is proposed to reduce the redundant edge traversals. Then, atomic operations caused by race conditions are eliminated by using destination-driven sub graph partitioning. Finally, we propose a double-ordered bucket strategy to further improve the efficiency of SSSP. The experiment demonstrates that the average speedup reaches to 27.58x compared with original implement for R-MAT graphs. Meanwhile, our method achieves up to 2.12x for R-MAT graphs and 4.45 x for real-world graphs on average compared to previous state-of-the-art parallel implementation.
Nowadays, challenges are changing production facilities: decentralized production networks are replacing centralized organizations to remain competitive. This paper investigates a resource sharing approach where match...
详细信息
Nowadays, challenges are changing production facilities: decentralized production networks are replacing centralized organizations to remain competitive. This paper investigates a resource sharing approach where matching resource offers and requests are made by an intermediate platform. One of the main pillars of collaboration is to keep promises, especially about deadlines: in the presented model, facilities could rate each other based on trustfulness and choose from offers based on this setting. Lead time prediction accuracy has a direct effect on the real processing intervals: if the prediction was accurate, the deadline could be met, which results in good ratings and a higher possibility to win more jobs. In the paper, effect of lead time prediction accuracy is investigated in trust-based resource sharing, and the performance of facilities is compared with agent-based simulation.
In recent years, object detection utilizing both visible (RGB) and thermal infrared (IR) imagery has garnered extensive attention and has been widely implemented across a diverse array of fields. By leveraging the com...
详细信息
The work addresses PID control design based on the velocity-pausing particle swarm optimization (VPPSO) technique. The suggested control design is utilized to develop a load frequency control (LFC) approach for an iso...
The work addresses PID control design based on the velocity-pausing particle swarm optimization (VPPSO) technique. The suggested control design is utilized to develop a load frequency control (LFC) approach for an isolated microgrid (MG) with heat-pumps (HPs) and electric-vehicles (EVs). The efficiency and effectiveness of suggested control design are assessed when there are randomized solar power and load-demand disturbances. Furthermore, the robustness and effectiveness of suggested control schemes are evaluated under uncertainty in system parameters and different EVs & HPs controller’s operating time-scheduling situations. The simulation results demonstrated the efficiency and usefulness of the recommended VPPSO-PID control strategy under several practical situations.
Under the optimality principle in the multi-stage cooperative game , we have discussed the strong time consistency in cooperative games with perfect information. Strong time consistency requires that if players can ob...
Under the optimality principle in the multi-stage cooperative game , we have discussed the strong time consistency in cooperative games with perfect information. Strong time consistency requires that if players can obtain higher rewards at a future time point, they should take actions at the current time point to maintain time consistency and maximize their rewards. We have found that in certain specific cases, the general core of cooperative games belongs to its strong dynamic stable core. To this end, we proposed a theorem and used a proof by contradiction to theoretically demonstrate the strong time consistency in cooperative games with perfect information. This finding has a positive impact on the study of cooperative games with specific relations of benefits.
Within online social networks, the rapid expansion of automated accounts, known as social bots, poses a significant challenge. This dynamic has sparked a strategic contest between bots and detectors. Both sides contin...
详细信息
ISBN:
(数字)9789887581598
ISBN:
(纸本)9798331540845
Within online social networks, the rapid expansion of automated accounts, known as social bots, poses a significant challenge. This dynamic has sparked a strategic contest between bots and detectors. Both sides continually learn and adjust their strategies to gain an edge in this silent war. To effectively manage risks from bot evolution, proactive detection methods have garnered widespread attention. In this work, we propose a graph-based and structure-aware adversarial learning framework for multi-category social bot detection. In detail, we adopt a categorical generative adversarial network to create synthetic evolved bot samples for adversarial learning, aiming to boost the detection performance. Besides, we design a user representation learning module, including local and remote feature extractors to mine neighborhood information and achieve multiple network structure representations. Results demonstrate that our model outperforms state-of-the-art approaches and exhibits strong robustness.
Machine learning (ML) is a rapidly evolving technology with expanding applications across various fields. This paper presents a comprehensive survey of recent ML applications in agriculture for sustainability and effi...
详细信息
To provide examinees with appropriate question items, identifying and evaluating users' latent and acquired skills is important in e-learning systems. These latent skills are defined in terms of a Q-matrix. Constr...
详细信息
To provide examinees with appropriate question items, identifying and evaluating users' latent and acquired skills is important in e-learning systems. These latent skills are defined in terms of a Q-matrix. Constructing Q-matrices manually is relatively labor-intensive, because doing so requires expert insight as well as verbal examination to identify which skills students have mastered. Methods to extract a Q-matrix from examination results automatically using nonnegative matrix factorization (NMF) have been explored, and improved methods such as online NMF have been proposed, which extracts an immutable Q-matrix from time-series data. In this study, we propose a data preprocessing method to improve the accuracy of NMF using a co-clustering method called an infinite relational model (IRM). We also describe experiments conducted using synthetic data, in which learners' skills and the bias in the number of their responses were evaluated, and show that the results demonstrate the efficacy of the proposed approach.
This paper considers the problem of monitoring and adaptively estimating an environmental field, such as temperature or salinity, using an autonomous underwater vehicle (AUV). The AUV moves in the field and persistent...
This paper considers the problem of monitoring and adaptively estimating an environmental field, such as temperature or salinity, using an autonomous underwater vehicle (AUV). The AUV moves in the field and persistently measures environmental scalars and its position in its local coordinate frame. The environmental scalars are approximately linearly distributed over the region of interest, and an adaptive estimator is designed to estimate the gradient. By orthogonal decomposition of the velocity of the AUV, a linear time-varying system is equivalently constructed, and the sufficient conditions on the motion of the AUV are established, under which the global exponential stability of the estimation error system is rigorously proved. Furthermore, an estimate of the exponential convergence rate is given, and a reference trajectory that maximizes the estimate of the convergence rate is obtained for the AUV to track. Numerical examples verify the stability and efficiency of the system.
Neuromorphic vision sensors or event cameras have made the visual perception of extremely low reaction time possible, opening new avenues for high-dynamic robotics applications. These event cameras' output is depe...
详细信息
暂无评论