This paper develops a Machine Learning model to estimate the citation counts of research papers. The model uses citation functions, representing the intentions of the paper's author when making citations of previo...
详细信息
Birds play an essential role in the functioning of the world's ecosystems by directly impacting human health, economy, and food production and benefiting millions of other species. The diversity of bird habitats s...
详细信息
The integration of digital content into the real world through mobile augmented reality (AR) systems presents captivating prospects, yet user engagement and experience within such environments are largely contingent u...
详细信息
Uncertainty estimation in deep learning has emerged as a crucial area of research due to its significance in enhancing model reliability and decision-making in critical applications. This article explores various meth...
详细信息
This paper explores partitioning strategies for vertex-centric historical graph systems within distributed environments, focusing on efficient data management and query execution. Historical graphs, which capture the ...
详细信息
ISBN:
(纸本)9798400706295
This paper explores partitioning strategies for vertex-centric historical graph systems within distributed environments, focusing on efficient data management and query execution. Historical graphs, which capture the dynamic evolution of vertices and edges over time, present unique challenges for storage and computation due to their constantly changing nature. We investigate two partitioning approaches for offline and online environments. Both offline and online algorithms aim to minimize an appropriately defined notion of edge cuts within the historical graph setting; the former algorithm is based on BFS, while the latter is based on a greedy partitioning approach. Both algorithms are compared qualitatively and quantitatively to hash-based methods that are mainly used in this setting. They are evaluated on real-world datasets, using metrics such as weighted edge cut score ratio and load balance ratio. Our experiments reveal that our online method consistently reduces edge cuts with minimal overhead, making it suitable for real-time distributed processing systems for historical graphs. Similarly, the offline algorithm achieves much better results for weighted edge cuts, but it requires severely more computational resources to achieve this performance. Additionally, the study highlights how varying the number of workers and partitioning thresholds impacts system performance across different datasets. All our experiments have been carried out in a simulation environment. The results provide valuable insights into optimizing partition strategies for historical graphs, paving the way for more efficient graph analytics in distributed systems.
COTS HW and SW components become crucial for advancing AI in space applications. The CAIRS21 ESA project considers Coral TPU as a candidate AI co-processor in avionics and examines its suitability in terms of performa...
详细信息
Cryptoprocessors play a pivotal role in enhancing the security of modern computing systems by accelerating cryptographic operations and fortifying data protection. This survey delves into the world of cryptoprocessors...
详细信息
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities ω1 and ω2. This extension, while conceptually...
详细信息
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities ω1 and ω2. This extension, while conceptually simple, poses analytical challenges involving the Appell F1 series. Despite these challenges, we are able to analyze key properties of the model, which include the distributions of contact and intercontact durations, as well as the expected time-aggregated degree. The incorporation of ω1 and ω2 enables more flexible tuning of the average contact and intercontact durations, and of the average time-aggregated degree, providing a finer control for exploring the effect of temporal network dynamics on dynamical processes. Overall, our results provide new insights into the analysis of temporal networks and contribute to a more general representation of real-world scenarios.
The potential of Education Technology has reached a point where teachers cannot keep up with the latest trends, nor they can spend the time to get accustomed to innovative technologies that might become obsolete in a ...
详细信息
ISBN:
(数字)9798350378894
ISBN:
(纸本)9798350378900
The potential of Education Technology has reached a point where teachers cannot keep up with the latest trends, nor they can spend the time to get accustomed to innovative technologies that might become obsolete in a few years. With the rise in the popularity of Minecraft Education, an educational platform based on the engine of the world-famous video-game: Minecraft, as well as the benefits of gamification in classrooms for all student ages, it seems that an application that would help teachers create educational video games that are run on Minecraft Education, without any code and with artificial intelligence assistance, could be just the thing that they need to update their teaching techniques. We propose the creation of a platform like that, and we present its potential design, after being consulted by the available research that has been done to this day regarding instructional design, user interface and applications that utilize large language models.
With the rapid proliferation of Internet of Things (IoT) devices and the ever-increasing volume of sensor data, optimizing resource utilization has become crucial for building sustainable and efficient IoT systems. In...
详细信息
暂无评论