Exploration and manipulation of physical objects are essential for early childhood learning. TangiGuru is an e-Learning platform that allows children to engage with real-world physical objects to provide that essentia...
详细信息
Heterogeneous computing, which combines the power of CPUs and GPUs, is increasingly important in today's data-centric era. However, it also presents significant challenges, particularly in terms of GPU memory mana...
Heterogeneous computing, which combines the power of CPUs and GPUs, is increasingly important in today's data-centric era. However, it also presents significant challenges, particularly in terms of GPU memory management. Compute eXpress Link (CXL) technology, which is supported by industry leaders, offers enhanced memory expansion capabilities. Alongside this, NVIDIA's Unified Memory (UM) system simplifies the process of sharing data between CPUs and GPUs. We explore the role of CXL memory in various scenarios within the UM framework while simultaneously highlighting issues such as the handling of page faults at the software level.
The great Covid-19 pandemic affected billions of people's lives personally and socially. The research involves the analysis of public's views and opinions shared on Twitter social media platform related to Cov...
详细信息
ISBN:
(数字)9798350308259
ISBN:
(纸本)9798350308266
The great Covid-19 pandemic affected billions of people's lives personally and socially. The research involves the analysis of public's views and opinions shared on Twitter social media platform related to Covid-19 pandemic and its detrimental or non-detrimental effects on public's mental health by using machine learning algorithm. The main purpose of this research includes analyzing public views related to Covid-19 pandemic by classifying the Tweets collected from the Twitter social platform. The proposed approach combines deep word embedding with MiniLM as an encoder to produce word vectors of high-dimensionality to preserve the words' semantic information. The resultant word vectors were used to train the model for the classification of the tweet in five sentiments i.e. Positive, Extremely Positive, Negative, Extremely Negative, and Neutral. The methodology is tested using publicly available Kaggle dataset as well as privately collected tweets. The comparative evaluation of the models revealed that MiniLM outperformed existing BERT based counterparts and attained highest accuracy of 93% with the Kaggle dataset. This analysis can assist the medical health authorities to monitor health information, conduct, and plan interventions to lower the pandemic effect and can help government to take precautionary measures.
In mobile ground-to-air (GA) propagation channels, the birth and death of multipath components (MPCs) are frequently observed, and the wide-sense stationary uncorrelated scattering (WSSUS) assumption does not always h...
详细信息
A real-time system is overloaded when all the tasks in a workload cannot meet their deadlines, and hence a robust algorithm is essential to maximize the number of tasks that meet their deadlines with the minimum numbe...
A real-time system is overloaded when all the tasks in a workload cannot meet their deadlines, and hence a robust algorithm is essential to maximize the number of tasks that meet their deadlines with the minimum number of miss rates and context switching. Although the Rate Monotonic (RM), Earliest Deadline First (EDF), and Least Laxity First (LLF) algorithms optimally perform and schedule tasks on a non-overloaded system, they have deficient performance when the system is overloaded. Therefore, we propose a new scheduling algorithm for uniprocessor and partitioned multiprocessor systems to address the overload situation. Since the proposed scheduling algorithm operates like EDF non-overloaded conditions, the proposed algorithm is optimal for non-overloaded systems. In addition, the proposed algorithm is robust against overloading situations as it executes the maximum possible tasks in the overload situation instead of missing deadlines of many tasks or burdening context switching to the system. The proposed algorithm allocates a processor to tasks based on the possibility of executing the task. The experimental results demonstrate that the proposed scheduling algorithm maximizes the number of tasks that meet their deadlines in overload conditions without a domino effect and context switching. In addition, the proposed algorithm achieves the lowest miss rate without context switching and the highest efficiency and processor utilization in the overloaded system compared with RM, EDF, and LLF.
Deep learning models are being utilized and further developed in many application domains, but challenges still exist regarding their interpretability and consistency. Interpretability is important to provide users wi...
Deep learning models are being utilized and further developed in many application domains, but challenges still exist regarding their interpretability and consistency. Interpretability is important to provide users with transparent information that enhances the trust between the user and the learning model. It also gives developers feedback to improve the consistency of their deep learning models. In this paper, we present a novel architectural design to embed interpretation into the architecture of the deep learning model. We apply dynamic pixel-wised weights to input images and produce a highly correlated feature map for classification. This feature map is useful for providing interpretation and transparent information about the decision-making of the deep learning model while keeping full context about the relevant feature information compared to previous interpretation algorithms. The proposed model achieved 92% accuracy for CIFAR 10 classifications without finetuning the hyperparameters. Furthermore, it achieved a 20% accuracy under 8/255 PGD adversarial attack for 100 iterations without any defense method, indicating extra natural robustness compared to other Convolutional Neural Network (CNN) models. The results demonstrate the feasibility of the proposed architecture.
We study joint downlink-uplink beamforming design for wireless federated learning (FL) with a multi-antenna base station. Considering analog transmission over noisy channels and uplink over-the-air aggregation, we der...
详细信息
This paper proposes a fluid rendering pipeline that uses OpenGL-4 shaders to employ the parallel processing capabilities of the GPU. The fluid’s surface mesh is produced using tessellation shader stages where the inp...
This paper proposes a fluid rendering pipeline that uses OpenGL-4 shaders to employ the parallel processing capabilities of the GPU. The fluid’s surface mesh is produced using tessellation shader stages where the input patches are assigned tessellation levels based on the fluid heightmap’s curvature. The curvature is stored using a texture buffer object which allows access by shaders, thus allowing the tessellation calculations to be carried out in parallel. Use of this adaptive tessellation method increases both the simulation’s framerate as well as its capacity to handle a greater number of primitives. Furthermore, it more optimally distributes the mesh’s vertices to effectively increase the level of detail without using more primitives. Polygon culling using the geometry shader further optimises the number of primitives used to define the fluid surface. The Phong-Blinn model is used for surface lighting. We propose two GPU-based fluid surface flow visualisation methods. Texture buffer objects can be used to store and update a surface texture. Alternatively, particle positions are updated each frame using the geometry shader and stored in a buffer object using transform feedback. These flow visualisation techniques are particularly effective for communicating the swirling motion of vortices.
In our rapidly evolving digital landscape, the imperative of safeguarding personal data has surged in significance. As lives increasingly intertwine with digital technologies, personal information has grown markedly, ...
In our rapidly evolving digital landscape, the imperative of safeguarding personal data has surged in significance. As lives increasingly intertwine with digital technologies, personal information has grown markedly, parallel to the escalating threats posed by cyberattacks and data breaches. This research paper provides a comprehensive exploration of data security and privacy, aiming to impart a profound understanding of the intrinsic value of data. It meticulously examines essential methodologies such as encryption, access control, multifactor authentication, and systems, all of which collectively form the bedrock of a resilient security framework. Additionally, this study delves into the intricate regulatory landscape that governs data protection, placing particular emphasis on well-established frameworks such as the General Data Protection Regulation and the Health Insurance Portability and Accountability Act. It highlights emergent trends in data security, including the integration of artificial intelligence and machine learning for threat detection, while also addressing the distinctive challenges posed by the proliferation of Internet of Things (IoT) devices. In conclusion, this paper underscores the paramount importance of personal data protection in our digital age, offering invaluable insights and guidance for organizations and individuals endeavoring to bolster their defenses and uphold data integrity within our interconnected world.
This paper considers a multi-group multicasting scenario facilitated by a reconfigurable intelligent surface (RIS). We propose a fast and scalable algorithm for the joint design of the base station (BS) multicast beam...
This paper considers a multi-group multicasting scenario facilitated by a reconfigurable intelligent surface (RIS). We propose a fast and scalable algorithm for the joint design of the base station (BS) multicast beamforming and the RIS passive beamforming to minimize the transmit power subject to the quality-of-service (QoS) constraints. By exploring the structure of the joint optimization problem, we show that this QoS problem can be broken into a BS multicast QoS subproblem and an RIS max-min-fair (MMF) multicast subproblem, which are solved alternatingly. In our proposed algorithm, we utilize the optimal multicast beamforming structure to obtain the BS beamformers efficiently. Furthermore, we reformulate the challenging RIS multicast subproblem and employ a first-order projected sub gradient algorithm (PSA) to solve it, which yields closed-form updates. Simulation results show the efficacy of our proposed algorithm in performance and computational cost compared to other alternative methods.
暂无评论