Over the past 10 years, developments in precision oncology have led to a rise in the demand for predictive tools that assist the screening and stratification of patients for treatment. The possibility digitizing tissue slide images has led to the creation of artificial intelligence (AI) and machine learning algorithms in digital pathology, which could ultimately improve patient care. In this context, we assessed a variety of AI-based computational models for digital pathology. In this review, we described the latest AI applications in oncology, current challenges and future prospects.

In this paper, a seamless connection between sensor technology and machine learning (ML) has been presented which has wide applicability in rehabilitation and physical medicine. The intent is to identify an ML algorithm which has a better performance, easy to deploy, and has less training time and consumes less computational resources. In short, we propose an algorithm which maximizes the synergy between a sensor and ML by maximizing classification performance and easy to do implementation, which is robust in computational power and lower in resource consumption. The premise of the work is to show the important considerations for evaluating ML algorithms for Upper-limb activity recognition for Physical medicine and rehabilitation field.

The use of didactic and interactive materials is essential in generating interest among students and teachers in utilizing mathematical models and digital technologies for the educational process. These materials create a dynamic and engaging learning environment that promotes a deeper understanding of complex concepts and fosters a passion for learning. Additionally, integrating interactive materials into pilot courses can assist teachers in better assessing student learning and adjusting the teaching strategies accordingly and the teachers can receive valuable insights into students' strengths and weaknesses, allowing them to provide targeted support and intervention when needed. In this context, the purpose of this paper is to introduce an approach for solving mathematics problems embedded in technical scenarios within the defense and security fields with the aid of digital technology. In this way, students can visualize abstract concepts, experiment with different scenarios, and receive instant feedback on their understanding. This paper helps to reinforce key concepts and enhance problem-solving skills, sparking curiosity, creativity, and encouraging active participation and collaboration. Throughout the development of this proposal, good practices are adopted, and advice for improvement is collected while having a wide range of users, giving feedback, discussions, and testing (pilot) short-term learning/teaching/training activities.

Recently, there appeared in this journal (Beh and Lombardo \textbf{2022}, {\it Symmetry}, 14, 1103) a paper that showed how to perform a correspondence analysis on a two-way contingency table where Bowker's statistic lies at the numerical heart of this analysis. Thus, we showed how this statistic can be used to visually identify departures from perfect symmetry. Interestingly, Bowker's statistic is a special case of the symmetry-version of the Cressie-Read family of divergence statistics. Therefore, this paper presents a new framework for visually assessing departures from perfect symmetry using a second-order Taylor series approximation of the Cressie-Read family of divergence statistics.

In the past twenty years, the IT industry has moved away from using physical servers for workload management to workloads consolidated via virtualization and, in the next iteration, further consolidated into containers. In the next step, container workloads based on Docker and Podman as underlying container technologies were orchestrated/automated via Kubernetes or OpenShift. On the other hand, high-performance computing (HPC) environments have been lagging in that process, as there’s still much work to figure out how to apply containerization platforms for HPC in real-life scenarios. Kubernetes and OpenShift have many advantages – generally speaking, container technologies use quite a bit less overhead from the computing perspective while providing many benefits in flexibility, modularity, and maintenance. Therefore, they are ideal for tasks requiring a lot of computing power. There are also some tradeoffs regarding the complexity of these two platforms - they’re just not that user-friendly when used by people without years of experience managing them. In this paper, we propose a different architecture based on seamless hardware integration and user-friendly, dynamic workload placement based on real-time performance analysis and prediction coupled with Machine Learning-based scheduling.

In the paper, we prove a joint limit theorem in terms of weak convergence of probability measures on $\mathbb{C}^2$ defined by means of the Epstein ζ(s;Q) and Hurwitz ζ(s,α) zeta-functions. The limit measure in the theorem is explicitly given. For this, some restrictions on the matrix Q and parameter α are required. The theorem obtained extends and generalizes Bohr-Jessen’s results characterising asymptotic behaviour of the Riemann zeta-function.

Fluorescence microscopic images of cells contain a large number of morphological features that are used as an unbiased source of quantitative information about cell status, through which researchers can extract quantitative information about cells and study the biological phenomena of cells through statistical and analytical analysis. As an important research object of phenotypic analysis, images have a great influence on the research results. Saturation artifacts present in the image result in a loss of grayscale information that does not reveal the true value of fluorescence intensity. From the perspective of data post-processing, we propose a two-stage cell image recovery model based on generative adversarial network to solve the problem of phenotypic feature loss caused by saturation artifacts. The model is capable of restoring large areas of missing phenotypic features. In the experiment, we adopt the strategy of progressive restore to improve the robustness of the training effect, and add the contextual attention structure to enhance the stability of the restore effect. We hope to use deep learning methods to mitigate the effects of saturation artifacts to reveal how chemical, genetic, and environmental factors affect cell state, providing an effective tool for studying the field of biological variability and improving image quality in analysis.

This paper aims to demonstrate that, beyond the small world of Riemann-Liouville and Caputo derivatives, there is a vast and rich world with many derivatives suitable for specific problems and various theoretical frameworks to develop, corresponding to the different paths taken. Notions of time and scale sequences are introduced and general associated basic derivatives, namely right/stretching and left/shrinking, are defined. A general framework for fractional derivative definitions is reviewed and applied to get both known and new fractional order derivatives. Several fractional derivatives are considered, mainly: Liouville, Hadamard, Euler, bilinear, tempered, q-derivative, and Hahn.

This article presents a combined route and path planning strategy to guide Skid-Steer Mobile Robots (SSMRs) in scheduled harvest tasks within expansive crop rows with complex terrain conditions. The proposed strategy integrates: i) a global planning algorithm based on the Traveling Salesman Problem under the Capacitated Vehicle Routing approach and Optimization Routing (OR-tools from Google) to prioritize harvesting positions by minimum path length, unexplored harvest points, and vehicle payload capacity, and ii) a local planning strategy using Informed Rapidly-exploring Random Tree (IRRT*) to coordinate scheduled harvesting points while avoiding low-traction terrain obstacles. The global approach generates an ordered queue of harvesting locations, maximizing the crop yield in a workspace map. In the second stage, the IRRT* planner avoids potential obstacles, including farm layout and slippery terrain. The path planning scheme incorporates a traversability model and a motion model of SSMRs to meet kinematic constraints. Experimental results in a generic fruit orchard demonstrated the effectiveness of the proposed strategy. In particular, the IRRT* algorithm outperformed RRT and RRT* with 96.1% and 97.6% smoother paths, respectively. The IRRT* also showed improved navigation efficiency, avoiding obstacles and slippage zones, making it suitable for precision agriculture.

This study explores the potential of using a Siamese Network as a biomarker for assessing the effectiveness of Dolphin-Assisted Therapy (DAT) in children with Cerebral Palsy (CP). The problem statement revolves around the need for objective measures to evaluate the impact of DAT on patients with CP, considering the subjective nature of traditional assessment methods. The methodology involves training a Siamese network, a type of neural network designed to compare similarities between inputs, using data collected from CP patients undergoing DAT sessions. The network is trained to learn patterns and similarities between pre- and post-therapy evaluations, in order to identify biomarkers indicative of therapy effectiveness. Notably, the Siamese Network’s architecture ensures that comparisons are made within the same feature space, allowing for more accurate assessments. The results of the study demonstrate promising findings, indicating different patterns in the output of the Siamese Network that correlate with improvements in symptoms of CP post-DAT. These findings suggest the potential utility of the Siamese Network as a biomarker to monitor therapy outcomes in children with CP who undergo DAT, offering a more objective and quantifiable approach to assessing therapeutic interventions. Significant disparities in neuronal voltage perturbations, with a mean of 7.9825 dB in specific samples compared to 6.2838 dB in the data set, indicate a marked difference from resting activity. This suggests that dolphin-assisted therapy selectively activates specific brain regions uniquely during the intervention.

Problem:Palestinian demographic landscape is undergoing an increase in the elderly population like many regions across the world. The elderly Palestinians face a unique challenges and problems of limited access to traditional care due to restricted movement, checkpoints, and also for limited healthcare resources. Therefore, the need arose to develop a sensitive and adaptable smart health monitoring system for Palestinian elderly to provide accurate and timely health data to improve well-being and prevent complications. Method: The proposed system (SHMS) leverages the Internet of Things (IoT) with appropriate sensors to track vital signs like heart rate, blood oximeter, body temperature and signal from a patient heart. Advanced algorithms analyze the data, generating alerts for potential health risks, triggering timely interventions, and enabling remote consultations. Results: This system has the potential to contributes to SDG 3 to significantly improve the health and well-being of elderly Palestinians by providing an accurate, low-power, and low-cost system for remote health monitoring. The system, being wearable, reads vital signs in real-time, overcoming geographical barriers and facilitating remote monitoring, especially in areas with limited healthcare centers and suffered from barriers along the way. The Doctor can suggest the patient’s prescription needed based on the momentary condition of the elderly and on previous readings of the sensors, if necessary. Which will also be notified via messages. Moreover, the doctor can take immediate intervention in case of an emergency. By implementing the system, it will be unnecessary for more than 50\% of the elderly to visit health care, thus reducing the cost to 50\%.}

The advancement of urban scholarship and the effective addressing of urban environment challenges necessitate the adoption of sophisticated analytical methods. Urban scholars and policymakers need advanced analytical methods to tackle issues like gentrification, housing affordability, and urban sprawl. Predictive models are crucial in the realm of urban studies, and hyperparameter tuning methods can significantly improve their accuracy and efficiency. Our study compares three such methods — Optuna, Random Search, and Grid Search — using a housing transaction dataset. We find that Optuna is not only 4 to 6 times faster than the other two methods when applied to Gradient Boosting Machine and Random Forest algorithms, but also achieves lower error values in key evaluation metrics on the test set, such as mean absolute error, mean squared error, mean absolute percentage error and root mean squared error.

On the H-type group G⊂Rm×Rn, we study the existence of solutions for the Brezis-Nirenberg problem

This manuscript presents a new two-parameter unit stochastic distribution, obtained by transforming the Laplace distribution, using generalized logistic map, into a unit interval. The distribution thus obtained is named the Laplace-logistic unit (abbreviated LLU) distribution, and its basic stochastic properties are examined in detail. Also, the procedure for estimating parameters based on quantiles is provided, along with the asymptotic properties of the obtained estimates and the appropriate numerical simulation study. Finally, the application of the LLU distribution in dynamic and regression analysis of real-world data with accentuated "peaks" and "fat" tails is also discussed.

Graph Neural Networks (GNNs) are powerful models capable of managing intricate connections in non-Euclidean data, such as social networks, physical systems, chemical structures, and communication networks. Despite their effectiveness, the large-scale and complex nature of graph data demands substantial computational resources and high performance during both training and inference stages, presenting significant challenges, particularly in the context of embedded systems. Recent studies on GNNs have investigated both software and hardware solutions to enhance computational efficiency. Earlier studies on Deep Neural Networks (DNNs) have indicated that methods like reconfigurable hardware and quantization are beneficial in addressing these issues. Unlike DNN research, studies on efficient computational methods for GNNs are less developed and require more exploration. This survey reviews the latest developments in quantization and FPGA-based acceleration for GNNs, showcasing the capabilities of reconfigurable systems (often FPGAs) to offer customized solutions in environments marked by significant sparsity and the necessity for dynamic load management. It also emphasizes the role of quantization in reducing both computational and memory demands through the use of fixed-point arithmetic and streamlined vector formats. This paper concentrates on low-power, resource-limited devices over general hardware accelerators and reviews research applicable to embedded systems. Additionally, it provides a detailed discussion of potential research gaps, foundational knowledge, obstacles, and prospective future directions.

The emergence of 6G communication technologies brings both opportunities and challenges for the Internet of Things (IoT) in Smart Cities. In this paper, we introduce an advanced network slicing framework designed to meet the complex demands of 6G Smart Cities IoT deployments. The framework development follows a detailed methodology that encompasses requirement analysis, metric formulation, constraint specification, objective setting, mathematical modeling, configuration optimization, performance evaluation, parameter tuning, and validation of the final design. Our evaluations demonstrate the framework's high efficiency, evidenced by low Round-Trip Time (RTT), minimal packet loss, increased availability, and enhanced throughput. Notably, the framework scales effectively, managing multiple connections simultaneously without compromising resource efficiency. Enhanced security is achieved through robust features such as 256-bit encryption and a high rate of authentication success. The discussion elaborates on these findings, underscoring the framework's impressive performance, scalability, and security capabilities.

While cycling presents environmental benefits and promotes a healthy lifestyle, the risks associated with overtaking maneuvers by motorized vehicles pose significant hindrances for many potential cyclists. Large-scale analysis of overtaking maneuvers could inform traffic researches and city planners on how to reduce these risks by better understanding these maneuvers. Drawing from the fields of sensor-based cycling research and of LiDAR-based traffic data sets, this paper provides a step towards addressing these safety concerns by introducing the Salzburg Bicycle 3d (SaBi3d) data set, consisting of LiDAR point clouds capturing car-to-bicycle overtaking maneuvers. The data set, collected using a LiDAR-equipped bicycle, facilitates detailed analysis of a large quantity of overtaking maneuvers without the need for manual annotation through enabling automatic labeling by a neural network. Additionally, a benchmark result for 3d object detection using a competitive neural network is provided as a baseline for future research. The SaBi3d data set is structured identically to the nuScenes data set, and therefore offers compatibility with numerous existing object detection systems. This work provides valuable resources for future researchers to better understand cycling infrastructure and mitigate risks, thus promoting cycling as a viable mode of transportation.

Brain tumor being one of the major health hazards always needs a prompt diagnosis for the early treatment options to improve the chances of the survival of the patients. Traditional manual assessment of MRI (magnetic resonance imaging) to identify these conditions is a common practice. Hence, automation of the diagnosis practices can considerably improve the quality of the treatment procedures. In recent years almost every method for the automated diagnosis of brain tumor detection uses a deep learning technique. Despite decent works current techniques need a significant improvement to produce better results. Along with failure to produce decent results, the current deep learning models present very complex architectures which sometimes require huge computational resources. Therefore, in this paper we present a novel method that uses a lightweight dual-stream model with dual-input to detect brain tumors on MRI images. Both the inputs use different pre-processing mechanisms based on Contrast Limited Adaptive Histogram Equalization (CLAHE) and White Patch Retinex algorithm in order to enhance the feature learning capabilities of the proposed model. In addition, the proposed method uses a two-fold margin loss to boost training process for better feature learning. The proposed method produces state-of-the-art results for the detection of Glioma, Meningioma and Pituitary tumors. The model presents accuracy of 99%, 98% and 99% respectively for Glioma, Meningioma and Pituitary tumor detection.

We propose a neural-network-based watermarking method that introduces the quantized activation function that approximates the quantization of JPEG compression. Many neural-network-based watermarking methods have been proposed. Conventional methods have acquired robustness against various attacks by introducing an attack simulation layer between the embedding network and the extraction network. The quantization process of JPEG compression was replaced by the noise addition process in the attack layer of the conventional methods. In this paper, we propose a quantized activation function that can simulate the JPEG quantization standard as it is in order to improve the robustness against the JPEG compression. Our quantized activation function consists of several hyperbolic tangent functions and is applied as an activation function for neural networks. Our network was introduced in the attack layer of ReDMark proposed by Ahmadi et al. to compare it with their method. That is, the embedding and extraction networks had the same structure. We compared the usual JPEG compressed images and the images applying the quantized activation function. The results showed that a network with quantized activation functions can approximate JPEG compression with high accuracy. We also compared the bit error rate (BER) of estimated watermarks generated by our network with those generated by ReDMark. We found that our network was able to produce estimated watermarks with lower BERs than those of ReDMark. Therefore, our network outperformed the conventional method with respect to image quality and BER.

As technology advances, people are increasingly adopting IoT (Internet of Things) devices in smart cities. These devices are equipped with sensors that are connected everywhere, from energy infrastructure and transportation to telecommunications, health and human services, waste management, public safety, and more. People want to access sensor data anytime and everywhere to make better decisions and improve their lives. To achieve this, a sensor integration model has been developed where multiple sensors are integrated under one gateway to manage and share sensor data. However, effective sharing of sensor data requires data security, privacy, confidentiality, fairness, effective architectural design, and low communication and computation costs. These issues need to be addressed in the sensor integration model in smart cities. Existing storage models face challenges in managing sensor data effectively. To overcome these issues and hurdles, a data storage framework leveraging blockchain technology has been proposed within the sensor integration model. This framework ensures data security, privacy, confidentiality, and a fair and transparent financial model, all while minimizing communication and computation costs.

The growing importance of edge and fog computing in the modern IT infrastructure is driven by the rise of decentralized applications. However, resource allocation within these frameworks is challenging due to varying device capabilities and dynamic network conditions. Conventional approaches often result in poor resource use and slowed advancements. This study presents a novel strategy for enhancing resource allocation in edge and fog computing by integrating machine learning with blockchain for reliable trust management. Our proposed framework, called CyberGuard, leverages blockchain’s inherent immutability and decentralization to establish a trustworthy and transparent network for monitoring and verifying edge and fog computing transactions. CyberGuard combines the Trust2Vec model with conventional machine learning models like SVM, KNN, and Random Forests, creating a robust mechanism for assessing trust and security risks. Through detailed optimization and case studies, CyberGuard demonstrates significant improvements in resource allocation efficiency and overall system performance in real-world scenarios. Our results highlight CyberGuard’s effectiveness, evidenced by a remarkable accuracy, precision, recall, and F1-Score of 98.18%, showcasing the transformative potential of our comprehensive approach in edge and fog computing environments.

In this study, a cholera infection model with the bilinear infection rate is developed by considering the perturbation of the infection rate by the mean-reverting process. First of all, we give the existence of a globally unique positive solution for a stochastic system at arbitrary initial value. On this basis, the sufficient condition for the model to have an ergodic stationary distribution is given by constructing proper Lyapunov functions and tight sets. This indicates in a biological sense the long-term persistence of cholera infection. Furthermore, after transforming the stochastic model to an relevant linearised system, an accurate expression for the probability density function of the stochastic model around a quasi-endemic equilibrium is derived. Subsequently, the sufficient condition to make the disease extinct is also derived. Eventually, the theoretical findings are shown by numerical simulations. Numerical simulations show that the impact of regression speed and fluctuation intensity on stochastic systems.

Data integrity and security are among the most essential things in this digital era performance. Digital certificates can be one solution to this problem. This research will develop the architecture of digital certificate verification and validation using blockchain. The blockchain concept for digital certificates uses three stages: requirements planning, workshop design, and implementation. Digital certificate files will be tested based on a scenario in which there could be any changes to those files, such as compressing files, changing data of files, inserting images in the file, and rotating files. This system architecture will detect any changes that could occur to the digital certificate file by using a digital signature, Keccak256 hash algorithm, and blockchain. This research shows that change detection accuracy for digital certificate files is 100%. However, there is a digital signature nature that could reduce the accuracy of change detection, and several solutions can be resolved. The average time to generate a signature using blockchain technology is 2.11 seconds, faster than 3.23 seconds when it does not use blockchain. The average time to validate a signature is 2.11 seconds without using blockchain, which is reduced to 0.22 seconds using blockchain technology. This research concludes that the architecture for digital certificate verification and validation using blockchain technology has successfully improved the security of digital certificates. Testing showed that even minor changes to a digital certificate could affect the signature, ensuring the certificate's integrity. For further research, evaluating the performance of various hash algorithms within the blockchain network is recommended.

Let $\{\tau_n\}_{n=1}^\infty$ and $\{\omega_m\}_{m=1}^\infty$ be two modular Parseval frames for a Hilbert C*-module $\mathcal{E}$. Then for every $x \in \mathcal{E}\setminus\{0\}$, we show that \begin{align}\label{UE} \|\theta_\tau x \|_0 \|\theta_\omega x \|_0 \geq \frac{1}{\sup_{n, m \in \mathbb{N}} \|\langle \tau_n, \omega_m\rangle \|^2}. \end{align} We call Inequality (\ref{UE}) as \textbf{Noncommutative Donoho-Stark-Elad-Bruckstein-Ricaud-Torr\'{e}sani Uncertainty Principle}. Inequality (\ref{UE}) is the noncommutative analogue of breakthrough Ricaud-Torr\'{e}sani uncertainty principle \textit{[IEEE Trans. Inform. Theory, 2013]}. In particular, Inequality (\ref{UE}) extends Elad-Bruckstein uncertainty principle \textit{[IEEE Trans. Inform. Theory, 2002]} and Donoho-Stark uncertainty principle \textit{[SIAM J. Appl. Math., 1989]}.

Previous research demonstrates that the interruption of immersive experiences may lead to a bias in the results of questionnaires. Thus, the traditional way of presenting questionnaires, paper-based or web-based, may not be compatible with evaluating VR experiences. Recent research has shown the positive impact of embedding questionnaires contextually into the virtual environment. However, a comprehensive overview of the available VR questionnaire solutions is currently missing. Furthermore, no clear taxonomy exists for these different solutions in the literature. To address this, we present a literature review of VR questionnaire user interfaces (UI) following PRISMA guidelines. Our search returned 1.109 initial results, which were screened for eligibility, resulting in a corpus of 25 papers. This paper contributes to HCI and games research with a literature review of embedded questionnaires in VR, discussing the advantages and disadvantages and introducing a taxonomy of in-VR questionnaire UIs.

Causal language can be a powerful tool for media outlets to subtly influence public perception and reinforce specific narratives. Therefore, identifying these linguistic patterns can be helpful in assessing the level of bias present in media content. In this paper, we directly compare the prevalence of causal language in headlines pertaining to the coverage of the Israel-Palestine conflict and the Russia-Ukraine war. We specifically look at the BBC and AlJazeera headlines covering the assault on Gaza since October 7, 2023. We use UniCausal, a model for causal text mining, in order to automatically extract the cause and effect of each headline. Our findings reveal that BBC headlines tend to avoid directly attributing causality to Israel for the violence in Gaza, whereas Al Jazeera headlines explicitly identify Israel as the responsible party. This differential use of causal language suggests a potential bias in media reporting.

In an era marked by swift technological progress, the pivotal role of Artificial Intelligence (AI) is increasingly evident across various sectors, including local governments. These governmental bodies are progressively leveraging AI technologies to enhance service delivery to their communities, ranging from simple task automation to more complicated engineering endeavours. While more and more local governments are adopting AI, it is imperative to understand the functions, implications, and consequences of AI. Despite the growing importance of this domain, a significant gap persists within the scholarly discourse. This study strives to bridge this void by exploring the applications of AI technologies within the context of local government service provision and using this inquiry to generate lessons and best practices for similar smart city initiatives. Through a comprehensive grey literature review, we analysed 262 real-world AI implementations across 170 local governments worldwide. The findings underscore several key points: (a) There has been a consistent upward trajectory in the adoption of AI by local governments over the last decade; (b) Local governments from China, the US, and the UK are at the forefront of AI adoption; (c) Among local government AI technologies, Natural Language Processing and Robotic Process Automation emerge as the most prevalent ones; (d) Local governments primarily deploy AI across 28 distinct services; (e) Information management, back-office work, and transportation and traffic management are leading domains in terms of AI adoption. This study enriches the extant body of knowledge by providing an overview of existing AI applications within the sphere of local governance. It offers insights for smart city policymakers and decision-makers considering the adoption, expansion, or refinement of AI technologies in urban service provision. Additionally, it underscores the importance of using these insights to guide the successful integration and optimisation of AI in future smart city projects, ensuring they meet the evolving needs of communities.

The accurate diagnosis and effective treatment of mental health disorders such as depression remain challenging owing to the complex underlying causes and varied symptomatology. Traditional information extraction methods struggle to adapt to evolving diagnostic criteria such as the Diagnostic and Statistical Manual of Mental Disorders fifth edition (DSM-5) and to contextualize rich patient data effectively. This study proposes a novel approach for enhancing information extraction from mental health data by integrating medical knowledge graphs and large language models (LLMs). Our method leverages the structured organization of knowledge graphs specifically designed for the rich domain of mental health combined with the powerful predictive capabilities and zero-shot learning abilities of LLMs. This research enhances the quality of knowledge graphs through entity linking and demonstrates superiority over traditional information extraction techniques, making a significant contribution to the field of mental health. It enables a more fine-grained analysis of the data and the development of new applications. Our approach redefines the manner in which mental health data are extracted and utilized. By integrating these insights with existing healthcare applications, the groundwork is laid for the development of real-time patient monitoring systems. The performance evaluation of this knowledge graph highlights its effectiveness and reliability, indicating significant advancements in automating medical data processing and depression management.

Federated learning is an effective approach for preserving data privacy and security, enabling machine learning to occur in a distributed environment and promoting its development. However, an urgent problem that needs to be addressed is how to encourage active client participation in federated learning. The Shapley Value, a classical concept in cooperative game theory, has been utilized for data valuation in machine learning services. Nevertheless, existing numerical evaluation schemes based on the Shapley Value are impractical as they necessitate additional model training, leading to increased communication overhead. Moreover, participants’ data may exhibit Non-IID characteristics, posing a significant challenge to evaluating participant contributions. Non-IID data weakens the marginal effects of participants, which in turn affects model accuracy and leads to underestimated contribution measurements. Current works often overlook the impact of heterogeneity on model aggregation. This paper presents a fair federated learning contribution measurement scheme that addresses the need for additional model computations. By introducing a noval aggregation weight, it enhances the accuracy of contribution measurement. Experiments on the MNIST dataset show that the proposed method can accurately compute the contributions of participants. Compared to existing baseline algorithms, the model accuracy is significantly improved, with a similar time cost.

Algorithmic systems used in healthcare contexts are primarily developed for the benefit of the public. It is therefore essential that these systems are trusted by the individuals for whose benefit they are deployed. Drawing inspiration from the principles embedded in the testing of the safety, efficacy and effectiveness of new medicinal products, concurrent design engineering and pro-fessional certification requirements, the authors propose, for the first time, a preliminary com-petency-based ‘Algorithmic Ethics’ Effectiveness Impact Assessment’ framework for developers of AI systems used in healthcare contexts. They concluded that this set of principles should en-compass the algorithmic systems ‘production lifecycle’, to guarantee the optimized use of the AI technologies, avoiding biases and discrimination while ensuring the best possible outcomes, simultaneously increasing decision-making capacity and the accuracy of the results. As AI is as good as those who program it and the system in which it operates, the robustness and trustworthiness of their ‘creators’ and ‘deployers’, should be fostered by a certification system guaranteeing the latter’s knowledge and understanding of ethical aspects as well as their com-petencies in integrating these aspects in trustworthy AI systems when used in healthcare con-texts.

The open data market is growing, driven by laws requiring governments to make data publicly available. However, the true value of this market lies in the products and services derived from open data. In Slovenia, the open data market has been growing since 2015, especially in the field of mobility. Platforms such as Avtolog.si facilitate the retrieval of vehicle data via vehicle identification numbers, while tocen.si, ojpp.si, and brezavta.si aggregate mobility data, focusing on sustainable and micromobile public transportation services. These platforms use open government data and private sector open data, and are freely accessible. This study examines the use of open data in the Slovenian mobility applications and similar solutions developed in other countries. By mapping these applications, we gain valuable insights into potential advances in the field, and provide a useful resource for future developers worldwide. By focusing on the socio-economic impact of these innovations, the study identifies methods for evaluating such applications. This approach highlights how transforming open data into user-friendly products and services can deepen our understanding of their broader societal and economic benefits. While open data is valuable in its own right, its full transformative potential is realized through innovative products that support sustainable lifestyles and promote environmentally conscious behavior.

Surface water plays a crucial role in climate change, human production, and life, making accurate monitoring and observation of surface water particularly important. However, due to the significant diversity and complexity of water distribution in surface space, accurate mapping of surface water faces considerable challenges. When extracting water bodies from medium-resolution satellite remote sensing images, CNN methods may suffer from limitations in receptive fields and insufficient context modeling capabilities, leading to the loss of water body boundary details and poor fusion of multiscale features. Currently, there is relatively little research on this issue; therefore, it is necessary to explore new combinations of deep learning networks to address these challenges. The purpose of this study is to address the above issues. We propose a new combination of deep learning networks that fully utilize multiscale information to enhance water features. Specifically, we first combine deformable convolutions with the Swin Transformer to increase effective receptive fields while better integrating global semantic information. This combination can capture features of water bodies at different scales, improve the accuracy and integrity of water extraction, and provide reliable technical support for detailed water body extraction. We tested the newly constructed model using Sentinel-2 satellite images. Our model achieved results of over 90%, with an average accuracy of 97.89%, average precision of 94.98%, average recall of 90.05%, and an average F1 score of 92.33%. In addition, our model achieved an accuracy of 98.03% in mountainous areas. Our experiments and results validate the potential of combining the Swin Transformer and deformable convolutions in detailed water body extraction.

In the field of 2-D image processing and computer vision, accurately detecting and segmenting objects in scenarios where they overlap or are obscured remains a challenge. This difficulty is worse in the analysis of shoeprints used in forensic investigations because they are embedded in noisy environments such as the ground and can be indistinct. Traditional Convolutional Neural Networks (CNNs), despite their success in various image analysis tasks, struggle with accurately delineating overlapping objects due to the complexity of segmenting intertwined textures and boundaries against a background of noise. This study introduces employs the YOLO (You Only Look Once) model enhanced by edge detection and image segmentation techniques to improve the detection of overlapping shoeprints. By focusing on the critical boundary information between shoeprint textures and the ground, our method demonstrates improvements in sensitivity and precision, achieving confidence levels above 85% for minimally overlapped images and maintaining above 70% for extensively overlapped instances. Heatmaps of convolution layers were generated to show how the network converges towards successful detection using these enhancements. This research may provide a potential methodology for addressing the broader challenge of detecting multiple overlapping objects against noisy backgrounds.

This study explores the properties and behavior of bi-close-to-convex functions, introducing new subclasses defined by their relationship with fractional differential operator and bi-univalent functions. Using the Faber polynomial technique, we derive upper bounds for the n^{th} coefficient of functions in these classes. We also investigate the erratic behavior of initial coefficients in bi-close-to-convex functions, as characterized by the (λ,q)-fractional differintegral operator. Furthermore, we address Fekete-Szegö problems and present notable findings from our investigation, contributing to the continued growth and refinement of geometric function theory, yielding new insights and practical uses.

Let $\mathcal{\mathcal{S}}_{\cos}^{\ast}$ denote the class of normalized analytic functions $f$ in the open unit disk $\mathbb{D}$ satisfying the subordination $\dfrac{zf^{\prime}(z)}{f(z)}\prec\cos z$. In the second section of this article we find the sharp upper bounds for the initial coefficients $a_{3}$, $a_{4}$ and $a_{5}$ and the sharp upper bound for module of the Hankel determinant $|H_{2,3}(f)|$ for the functions from the class $\mathcal{S}_{\cos}^{\ast}$. The first result of the next section deals with the sharp upper bounds of the logarithmic coefficients $\gamma_{3}$ and $\gamma_{4}$ and we found in addition the sharp upper bound for $\left|H_{2,2}\left(F_{f}/2\right)\right|$. For obtaining these results we used the very useful and appropriate Lemma 2.4 of N.E. Cho et al. [Filomat 34(6) (2020), 2061--2072], and the technique for finding the maximum value of a three variable function on a closed cuboid. All the maximum found values were checked by using MAPLE\texttrademark{} computare software, and we also found the extremal functions in each cases. All of our present results are the best ones and give sharp versions of those recently published in [Hacet. J. Math. Stat. 52, 596--618, 2023].

Pedestrian trajectories are crucial for self-driving cars to plan their paths effectively. The sensors implanted in these self-driving vehicles, despite being state-of-the-art ones, often face inaccuracies in the perception of surrounding environments due to technical challenges for adverse weather conditions, interference from other vehicles sensors and electronic devices, and signal reception failure, leading to incompleteness in trajectory data. But for real-time decision making for autonomous driving, the trajectory imputation is no less crucial. Previous attempts to address this issue such as statistical inference and machine learning approaches have shown promise. Yet, the landscape of deep learning is rapidly evolving with new and more robust models emerging. In this research, we have proposed an encoder-decoder architecture, Human Trajectory Imputation Model, coined as HTIM, to tackle these challenges. This architecture aims to fill in the missing parts of pedestrian trajectories. The model has been evaluated using the Intersection drone inD dataset, containing trajectory data at suitable altitudes preserving naturalistic pedestrian behavior with varied dataset sizes. To assess the effectiveness of our model, we have utilized L1, MSE, Quantile and ADE loss. Our experiments have demonstrated that HTIM outperforms the majority of the state-of-the-art methods in this field, thus indicating its superior performance in imputing pedestrian trajectories.

A class of semi-linear elliptic equations with critical Hardy-Sobolev exponent has been considered. This model is widely used in hydrodynamics and glaciology, gas combustion in thermodynamics, quantum field theory and statistical mechanics, as well as gravity balance problems in galaxies. The $\left( PS\right) _{c}$ sequence of energy functional has been investigated, and then the mountain pass lemma was used to prove the existence of at least one nontrivial solution. Also a multiplicity result has been obtained. Some known results have been generalized.

Ice formation on aircraft surfaces poses significant safety risks, and current detection systems often struggle to provide accurate, real-time predictions. This paper presents the development and comprehensive evaluation of a smart ice control system using a suite of machine learning models. The system utilizes various sensors to detect temperature anomalies and signal potential ice formation. We trained and tested supervised learning models (Logistic Regression, Support Vector Machine, Random Forest), unsupervised learning models (K-means clustering), and neural networks (Multi-Layer Perceptron) to predict and identify ice formation patterns. Experimental results demonstrate that our smart system, driven by machine learning, accurately predicts ice formation in real-time, optimizes de-icing processes, and enhances safety while reducing power consumption. This solution holds the potential for improving ice detection accuracy in aviation and other critical industries requiring robust predictive maintenance.

Biases in Artificial Intelligence (AI) or Machine Learning (ML) systems due to skewed datasets problematise the application of prediction models in practice. Representation bias is a prevalent form of bias found in the majority of datasets. This bias arises when training data inadequately represents certain segments of the data space, resulting in poor generalisation of prediction models. Despite AI practitioners employing various methods to mitigate representation bias, their effectiveness is often limited due to a lack of thorough domain knowledge. To address this limitation, this paper introduces human-in-the-loop interaction approaches for representation debiasing of generated data involving domain experts. Our work advocates for a controlled data generation process involving domain experts to effectively mitigate the effects of representation bias. We argue that domain experts can leverage their expertise to assess how representation bias affects prediction models. Moreover, our interaction approaches can facilitate domain experts in steering data augmentation algorithms to produce debiased augmented data and validate or refine the generated samples to reduce representation bias. We also discuss how these approaches can be leveraged for designing and developing user-centred AI systems to mitigate the impact of representation bias through effective collaboration between domain experts and AI.

This paper introduces an intelligent model that combines military expertise with the latest ad-vancements in machine learning (ML) and Geographic Information Systems (GIS) to support humanitarian demining decision-making processes. The model is based on direct input and val-idation from field decision-makers for their practical applicability and effectiveness. With a survey polling the inputs of demining experts, 95% of the responses came with an affirmation of the potential of the model to reduce threats and increase operational efficiency. It includes mili-tary-specific factors that factor in the proximity to strategic locations as well as environmental variables like vegetation cover and terrain resolution. With Gradient Boosting algorithms such as XGBoost and LightGBM, the accuracy rate is almost 97%. Such precision levels further enhance threat assessment, better allocation of resources, and around a 30% reduction in the cost and time of conducting demining operations, signifying a strong synergy of human expertise with algo-rithmic precision for maximal safety and effectiveness in demining

In the intersection of the Internet of Things (IoT) and Machine Learning (ML), the choice between high-level and low-level programming libraries presents a significant dilemma for developers, impacting not only the efficiency and effectiveness of ML models but also their environmental footprint. We have proposed a comprehensive framework to aid in this decision-making process, underpinned by a detailed comparative analysis of both types of libraries on one of the key IoT ML task; image classification. We have introduced a novel algorithm designed to calculate the green footprint of ML model training, factoring in execution time, memory utilization, power consumption, and CPU temperature, addressing the urgent need for sustainable ML practices. Through an empirical evaluation of popular libraries such as PyTorch for high-level and Libtorch for low-level development, we have assessed their performance, development efficiency, and hardware compatibility. The culmination of our research is a decision support system that synthesizes the experimental findings to guide developers toward choices that harmonize model performance with environmental sustainability.

I propose a test for machine self-awareness inspired by the Turing test. My test is simple, and it provides an objective, empirical metric to rectify the ungrounded speculation surging through industry, academia, and social media. Drawing from a breadth of philosophical literature, I argue the test captures the essence of self-awareness, rather than some postulated correlate or ancillary quality. To begin, the concept of self-awareness is clearly demarcated from related concepts like consciousness, agency, and free will. Next, I propose a model called the Nesting Doll of Self-Awareness and discuss its relevance for intelligent beings. Then, the test is presented in its full generality, applicable to any machine system. I show how to apply the test to Large Language Models and conduct experiments on popular open and closed source LLMs, obtaining reproducible results that suggest a lack of self-awareness. The implications of machine self-awareness are discussed in relation to questions about meaning and true understanding. Finally, some next steps are outlined for studying self-awareness in machines.

Computational animation of spatiotemporal models for 3-D shape and motion is considered as core of dynamic real-time vision. This is based on sets of features evaluated from multi-focal image streams. Subjects are defined as special objects capable of sensing environmental parameters and of initiating own actions in combination with stored knowledge. Object/subject recognition and scene understanding are achieved on different levels. Multiple objects are tracked individually for perceiving their actual state (‘here and now’). Fast saccadic jumps in gaze direction allow flexible concentration on objects or parts of actual interest. By analyzing motion of relevant objects/subjects over a larger time scale on the level of state variables and documenting them in the ‘scene tree representation’ (computer graphics), the situation with respect to decision making is assessed. Various behavioral capabilities of subjects are represented on an abstract level for characterizing their potential behaviors. These are generated by stereotypical feed-forward and feedback control applications on a separate level close to the actuator hardware with corresponding methods. This dual representation on one level for decision making and one on the implementation level allows for flexibility and easy adaptation or extension. Results are shown for road vehicle guidance based on three cameras on a gaze-controlled platform.

Convolutional Neural Networks (CNNs) present drawbacks for modeling geometric transformations, such as scaling and rotation, caused by the convolution operation’s locality. Deformable convolution (DCON), a mechanism that substitutes standard convolution, increasing the receptive field to capture relevant features, is a promising approach to solve this drawback and improve the robustness of CNNs. However, the optimal way to replace the standard convolution with its deformable counterpart in a CNN model is unclear. In this study, we clarify this aseveration by conducting several experiments using deformable convolutions applied in the layers that conform a small four-layer CNN model. We also use deformable convolutions on the four-layers of several ResNet CNNs with depths 18, 34, 50, and 101. The models were tested in binary balanced classes with 2D data for image classification: Cats & Dogs, EyesPACS, Spyders & Chickens, and Shapes. After this testing, we evaluated DCON in 3D data for action recognition: UCF101 and Human2 (a dataset we compiled to control movement, clothing and background). The contribution of this research lies in a guideline to use DCON. It can be summarized as follows: if DCON is used on the first layers of the proposal of model (with simple features), the computational resources expressed as the quantity of Flops will tend to increase and produce bigger misclassification than the standard CNN. However, if the DCON is used at the end layers, the quantity of Flops used in the training and testing will decrease, and the classification accuracy will improve by up to 20% about the base model. Moreover, it gains robustness when using deformable convolutions because it can adapt to the region of interest. Also, the best kernel size of the DCON is three. It showed better results than size five. In the last case, the quantity of Flops increase quadratically, but their performance does not increase significantly. With these results, we propose a guideline to use the DCON and contribute to understanding the impact of DCON on the robustness of CNNs.

In emergency situations, ensuring standardized Cardiopulmonary Resuscitation (CPR) actions is crucial. However, current Automated External Defibrillators (AEDs) lack methods to determine whether CPR actions are performed correctly, leading to inconsistent CPR quality. To address this issue, we introduce a novel method called Deep Learning-based CPR Action Standardization (DLCAS). This method involves three parts. First, it detects correct posture using OpenPose to recognize skeletal points. Second, it identifies a marker wristband with our CPR-Detection algorithm and measures compression depth, count and frequency using a depth algorithm. Finally, we optimize the algorithm for edge devices to enhance real-time processing speed. Extensive experiments on our custom dataset have shown that the CPR-Detection algorithm achieves a mAP0.5 of 97.04%, while reducing parameters to 0.20M and FLOPs to 132.15K. In a complete CPR operation procedure, the depth measurement solution achieves an accuracy of 90% with a margin of error less than 1 cm, while the count and frequency measurements achieve 98% accuracy with a margin of error less than 2 counts. Our method meets the real-time requirements in medical scenarios, and the processing speed on edge devices have increased from 8fps to 25fps.

Analog neuromorphic prototyping is crucial for creating spiking neuron models that use memristive devices as synapses to design integrated circuits that leverage on-chip parallel deep neural networks. These models mimic how biological neurons in the brain communicate through electrical potentials. Doing so enables more powerful and efficient functionality than traditional artificial neural networks that run on von Neumann computers or graphic processing unit-based platforms. This technology can accelerate deep learning processing, aiming to exploit the brain’s unique features of asynchronous and event-driven processing by leveraging neuromorphic hardware’s inherent parallelism and analog computation capabilities. Therefore, this paper presents the design and implementation of a leaky integrate and fire neuron prototype implemented with commercially available components on a PCB board. Simulations conducted in LTSpice agree well with the electrical test measurements. The results demonstrate that this design can be employed to interconnect many boards to build layers of physical spiking neurons, interconnected with spike-timing-dependent plasticity as the primary learning algorithm, contributing to the realization of experiments in the early stage of adopting neuromorphic computing.

In traditional finance, option prices are typically calculated using crisp sets of variables. However, in a proposed new approach, the assumption is made that these parameters have a degree of fuzziness or uncertainty associated with them. This allows participants to estimate option prices based on their risk preferences and beliefs, considering a range of possible values for the parameters. To determine the belief degree associated with a particular option price, an interpolation search algorithm was proposed recently[1]. Interpolation is a mathematical technique used to estimate values between known data points. In this case, the algorithm is applied to determine the belief degree associated with a specific option price within the range of possible prices. By incorporating fuzzy numbers and the belief degree, this approach provides a more flexible framework for practitioners to make their investment decisions. It allows them to consider their risk preferences and beliefs about the uncertain parameters when selecting an option price. In this paper, we will review a unified framework for combining fractional Brownian motion with fuzzy processes and obtain a joint measure space. We start by constructing a product measure space that captures the randomness and fuzziness inherent in the respective processes. We begin with the usual Kolmogorov filtered probability space (Ω, F, ℙ), where ℙ represents the probability measure, Ω is the set of all possible outcomes or states that a random process can take and {Ft, t ∈ [0, T]} is an information filtration. We will review the work of Merton (1976) on option pricing when the underlying stock returns have jumps [2] and expand it to fuzzy fractional processes.

The fusion of global contextual information with local cropped block details is crucial for segmenting ultra-high resolution images. In this study, we introduce a novel fusion mechanism termed Global-Local Deep Fusion (GL-Deep Fusion) based on an enhanced transformer architecture, which efficiently integrates global contextual information and local details. Specifically, we propose the Global-Local Synthesis Networks (GLSNet), a dual-branch network where one branch processes the entire original image, while the other branch handles cropped local patches as input. The feature fusion of different branches in GLSNet is achieved through GL-Deep Fusion, significantly enhancing the accuracy of ultra-high resolution image segmentation. Particularly effective is GLSNet in identifying tiny overlapping items. To optimize GPU memory utilization, we meticulously design a dual-branch architecture that proficiently leverages the features it extracts, seamlessly integrating them into the enhanced transformer framework of GL-Deep Fusion. Extensive experiments conducted on challenging benchmarks, including DeepGlobe and Vaihingen datasets, demonstrate that GLSNet achieves a new state-of-the-art performance in terms of GPU memory utilization and segmentation accuracy tradeoff.

In this paper, we perform the neural cryptanalysis and comprehensively analyze five block ciphers, Data Encryption Standard (DES), Simplified DES (SDES), Advanced Encryption Standard (AES), Simplified AES (SAES), and SPECK. The vulnerability of the block ciphers is investigated in three different attacks, such as Encryption Emulation (EE), Plaintext Recovery (PR), Key Recovery (KR), and Ciphertext Classification (CC) attacks. For the plaintexts, randomly generated block-sized bit arrays and texts are used. The block ciphers apply different numbers of round functions in the encryption of the block-sized bit arrays, and they are investigated by using the deep learning models trained with different numbers of data in EE, PR, and KR attacks. Moreover, the block ciphers use two different text encryption methods, Word-based Text Encryption (WTE) and Sentence-based Text Encryption (STE), to encrypt the texts in various operation modes, and they are analyzed with deep learning models in EE, PR, and CC attacks. As a result, the block ciphers can be vulnerable to deep learning-based EE and PR attacks using a large amount of train data, and STE can improve the strength of the block ciphers, unlike WTE, which shows almost the same classification accuracy as the plaintexts, especially in CC attack. Additionally, when the keys that are the same as the plaintexts are used in encryption, the block ciphers can be perfectly broken in KR attack. Moreover, especially in KR attack, the RNN-based deep learning model shows higher average Bit Accuracy Probability (BAPavg) than the fully connected-based deep learning model, which is used more often in previous works of neural cryptanalysis. Furthermore, although the transformer-based deep learning model is a state-of-the-art model in Natural Language Processing (NLP), the RNN-based deep learning model is more suitable for CC attack and shows higher classification accuracy.

Detection and measurement of pain are crucial in designing effective pain management interventions to alleviate suffering and prevent functional decline in the medical domain. Traditional methods of pain identification rely on verbal patient reports or observable signs, which can be imprecise or subjective due to variability in patient self-assessments. Hence, there is a pressing need for automated methods to standardize pain measurement procedures. This paper proposes a novel facial expression-based automated pain assessment system as a behavioral indicator for pain evaluation. Our system integrates a fusion structure comprising Convolutional Neural Networks (CNNs) and Tensor-based extended Quantitative Expression Descriptors Analysis (TXQEDA). This innovative approach allows for joint learning of robust pain-related facial expression features from raw facial images, combining RGB appearance with shape-based latent representation. We extensively evaluated our proposed model using the UNBC-McMaster dataset for pain classification and intensity estimation. Our results demonstrate the efficacy of the proposed technique, achieving an impressive accuracy of 99.10% for pain level classification. Furthermore, our system excels in pain intensity estimation, showcasing its potential to provide precise and reliable assessments of pain severity. Overall, our research underscores the importance of automated pain assessment systems in improving patient care and clinical outcomes. By leveraging advanced deep learning techniques and fusion strategies, our proposed model offers a promising approach for standardizing pain measurement procedures and enhancing the quality of pain management interventions.

Sharing confidential information is a critical concern in today’s world. Secret sharing schemes facilitate the sharing of secrets in a way that ensures only authorized participants (shareholders) can access the secret using their allocated shares. Hierarchical secret sharing schemes (HSSSs) build upon Shamir’s scheme by organizing participants into different levels based on priority. Within HSSS, participants at each level can reconstruct the secret if a specified number, denoted as the threshold value (t), or more of them are present. Each level has a predetermined threshold value. If the number of participants falls below the threshold at any level, higher-level participants must be involved in reconstructing the secret at lower levels. Our paper proposes schemes that implement hierarchical access structures and enable the sharing of multiple secrets. Additionally, our proposed scheme includes share verification. We have analyzed potential attacks and demonstrated the scheme’s resistance against them. Through security analysis and comparison with existing schemes, we highlight the novelty and superiority of our proposed approach, contributing to advancements in secure information sharing practices.

Named Entity Recognition (NER) serves as a fundamental and pivotal stage in the development of various knowledge-based support systems, including knowledge retrieval and question answering systems. In the domain of pig diseases, Chinese NER models encounter several challenges such as the scarcity of annotated data, domain-specific vocabulary, diverse entity categories, and ambiguous entity boundaries.To address these challenges, a corpus, labeled datasets and a lexicon specific to pig diseases for Chinese named entity recognition were constructed. Subsequently, a Pig Disease Chinese Named Entity Recognition (PDCNER) model was proposed. The model integrates external lexicon knowledge of pig disease by employing Lexicon-enhanced BERT and enhance feature representation by incorporating contrastive learning. Experimental results show that the model achieved the best recognition results, with a precision of 86.92%, a recall of 85.08%, and an F1-score of 85.99% respectively. Furthermore, the model exhibits robustness and generalizability across few-shot and publicly available datasets. Experimental results illustrate the proposed model could effectively identify Chinese named entities of pig diseases, outperforming several existing baseline methods. Moreover, the proposed model can be extended to other animal disease domains, such as chicken and cattle, thereby facilitating seamless adaptation for named entity identification across diverse contexts.

This paper introduces the novel concept of Time-Traveling Turing Machines (TTTMs) — Turing Machines with the ability to read symbols that have been explicitly sent from their future computational state. We delve into their properties and behavior, particularly emphasizing the importance of maintaining a self-consistent computational timeline. We present theorems demonstrating the universality of these machines and the challenges in achieving faster computations than traditional Turing Machines.

Ranked Set Sampling (RSS) is a useful technique for improving the estimator of population mean when the sampling units in a study can be easily ranked than the actual measurement. RSS performs better than simple random sampling (SRS) when the mean of units corresponding to each rank is used. The performance of RSS can be increased further by assigning weights to the ranked observations. In this paper, we propose weighted RSS procedures to estimate the population mean of positively skew distributions. It is shown that the gain in the relative precisions of the population mean for chosen distributions are uniformly higher than those based on RSS. The gains in relative precisions are substantially high. Further, the relative precisions of our estimator are slightly higher than the ones based on Neyman’s optimal allocation model for small sample sizes. Moreover, it is shown that, the performance of the proposed estimator increases as the skewness increases by using the example of lognormal family of distributions.

The aim of this study is to develop a software solution for real-time recognition of sign language words using two arms. This will enable communication between hearing-impaired individuals and those who can hear. Several sign language recognition systems have been developed using different technologies, including cameras, armbands, and gloves. The system developed in this study utilizes surface electromyography (muscle activity) and inertial measurement unit (motion dynamics) data from both arms. Other methods often have drawbacks, such as high costs, low accuracy due to ambient light and obstacles, and complex hardware requirements, which have prevented their practical application. A software has been developed that can run on different operating systems using digital signal processing and machine learning methods specific to the study. For the test, we created a dataset of 80 words based on their frequency of use in daily life and performed a thorough feature extraction process. We tested the recognition performance using various classifiers and parameters and compared the results. The Random Forest algorithm was found to have the highest success rate with 99.875% accuracy, while the Naive Bayes algorithm had the lowest success rate with 87.625% accuracy. Feedback from a test group of 10 people indicated that the system is user-friendly, aesthetically appealing, and practically useful. The new system enables smoother communication for people with hearing disabilities and promises seamless integration into daily life without compromising user comfort or lifestyle quality.

This paper presents a novel segmentation algorithm specially developed for applications in 3D point clouds with high variability and noise, particularly suitable for heritage building 3D data. The method can be categorized within the segmentation procedures based on edge detection. In addition, it uses a graph-based topo-logical structure generated from the supervoxelization of the 3D point clouds, which is used to make the clo-sure of the edge points and to define the different segments. The algorithm provides a valuable tool for generating results that can be used in subsequent classification tasks and broader computer applications dealing with 3D point clouds. One of the characteristics of this segmentation method is that it is unsupervised, which makes it particularly advantageous for heritage applications where labelled data is scarce. It is also easily adaptable to different edge point detection and supervoxelization algorithms. Finally, the results show that the 3D data can be segmented into different architectural elements, which is important for further classification or recognition. Extensive testing on real data from historic buildings demonstrates the effectiveness of the method. The results show superior performance compared to three other segmentation methods, both globally and in the segmentation of planar and curved zones of historic buildings.

To enhance the performance of visual SLAM in underwater environments, this paper presents an enhanced front-end method based on visual feature enhancement. The method comprises three modules aimed at optimizing and improving the matching capability of visual features from different perspectives. Firstly, to address issues related to insufficient underwater illumination and uneven distribution of artificial light sources, a brightness consistency recovery method is pro-posed. This method employs an adaptive histogram equalization algorithm to balance the brightness of images. Secondly, a method for denoising underwater suspended particulates is introduced to filter out noise from the images. After image-level processing, a combined underwater acousto-optic feature association method is proposed, which associates acoustic features from sonar with visual features, thereby providing distance information for the visual features. Finally, utilizing the AFRL dataset, the improved system incorporating the proposed enhancement methods is evaluated for performance against the OKVIS framework. The system achieves better trajectory estimation accuracy compared to OKVIS and demonstrates robustness in underwater environments.

As most of the videos are destined for human perception, many techniques have been designed to improve video coding based on how the human visual system perceives video quality. In this paper, we propose the use of two perceptual coding techniques, namely contrast masking and texture masking, jointly operating under the High Efficiency Video Coding (HEVC) standard. These techniques aim to improve the subjective quality of the reconstructed video at the same bit rate. For contrast masking, we propose the use of a specific weighting matrix for each block size (from 4×4 up to 32×32). We achieve average Bjøntegaard Delta-Rate (BD-rate) gains of between 2.5% and 4.48%, depending on the perceptual metric and coding mode used. The texture masking scheme is based on the classification of each coding unit, using its mean directional variance features as input to a support vector machine model. According to this classification, the block’s energy, the type of coding unit, and its size, an over-quantization is computed to provide a QP offset (DQP) for this coding unit. By applying both techniques in the HEVC Reference Software, an overall average of 5.79% BD-rate gain is achieved.

We leverage the explainability feature of KAN network and build an explainable language model where certain neurons encode individual words and neuron activation is fully interpretable in terms of the basis of a word. To do that, we propose a continuous word2vec model where a meaning of a word is expressed by a continuous profile of distances of this word from the words in the basis of words which is interpolated. As a result, the whole KAN network can be interpreted as a sequential procedure with word expressions. We then proceed from words to logic programs and develop a clause learning technique based on KAN. A logic program construction process from facts now become fully interpretable. We follow the differentiable inductive logic programming technique, representing a logic program as a matrix learned by KAN. Hence, we obtain an efficient and fully interpretable rule learning approach.

As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.

Recently, attention mechanisms have developed into an important tool for performance improvement of deep neural networks. In computer vision, attention mechanisms are generally divided into two main branches: spatial and channel attention. Both attention categories have their own advantages. The fusion of both attentions achieves higher performance, on the cost of the computational load. This paper introduces an innovative and lighter n-shifted sigmoid channel and spatial attention (CSA) module to reduce the computational cost and to improve the 3D scene relevant features selection. To validate the proposed attention module, 3D scene object detection in the deep Hough voting point sets is considered as the testing application. The proposed attention module with its piecewise n-shifted sigmoid activation function improves the network’s learning and generalization capacity which effectively predict bounding box parameters directly from 3D scenes and detect objects more accurately. This advantage is achieved by selectively attending to more relevant features of the input data. When used in the deep Hough voting point sets, the proposed attention module outperforms state-of-the-art 3D detection methods on the sizable SUNRGBD dataset. Experiments conducted showed an increase of 12.02 mean accuracy precision (mAP) when compared to the celebrated VoteNet (without attention). It also got 9.92 mAP higher compared to the MLVCNet, and 10.32 mAP higher than the Point Transformer. The proposed model not only decreases the sigmoid vanishing gradient problem but also brings out valuable features by fusing channel-wise and spatial information while improving accuracy results in 3D object detection.

Artificial Intelligence (AI) systems involve diverse components, such as data, models, users and predicted outcomes. To elucidate these different aspects of AI systems, multifaceted explanations that combine diverse explainable AI (XAI) methods are beneficial. However, popularly adopted user-centric XAI evaluation methods do not measure these explanations across the different components of the system. In this position paper, we advocate for an approach tailored to evaluate XAI methods considering the diverse dimensions of explainability within AI systems using a normalised scale. We argue that the prevalent user-centric evaluation methods fall short of facilitating meaningful comparisons across different types of XAI methodologies. Moreover, we discuss the potential advantages of adopting a standardised approach, which would enable comprehensive evaluations of explainability across systems. By considering various dimensions of explainability, such as data, model, predictions, and target users, a standardised evaluation approach promises to facilitate both inter-system and intra-system comparisons for user-centric AI systems.

Software systems are often maintained by a group of experienced software developers, in order to ensure that faults which may bring the system down are less likely. Large turnover in organizations such as CERN makes it important to think of ways of onboarding newcomers on a technical project rapidly. This paper focuses on optimizing the way that people get up-to-speed on the business logic and technologies used on the project, using a knowledge-imbued large language model that is enhanced using domain-specific knowledge from the group or team’s internal documentation.

We introduce NodeFlow, a flexible framework for probabilistic regression on tabular data that combines Neural Oblivious Decision Ensemble (NODE) and Conditional Continuous Normalizing Flows (CNF). It offers improved modeling capabilities for arbitrary probabilistic distributions, addressing the limitations of traditional parametric approaches. In NodeFlow, the NODE captures complex relationships in tabular data through a tree-like structure, while the conditional CNF utilizes the NODE’s output space as a conditioning factor. The training process of NodeFlow employs standard gradient-based learning, facilitating end-to-end optimization of the NODEs and CNF-based density estimation. This approach ensures outstanding performance, ease of implementation, and scalability, making NodeFlow an appealing choice for practitioners and researchers. Comprehensive assessments on benchmark datasets underscore NodeFlow’s efficacy, revealing its achievement of state-of-the-art outcomes in multivariate probabilistic regression setup and its strong performance in univariate regression tasks. Furthermore, ablation studies are conducted to justify the design choices of NodeFlow. In conclusion, NodeFlow’s end-to-end training process and strong performance make it a compelling solution for practitioners and researchers. Additionally, it opens new avenues for research and application in the field of probabilistic regression on tabular data.

This paper investigates the performance of dual hop UAV-assisted communication channels, employing a decode and forward relay architecture. The system utilizes Terahertz (THz) communication in the primary hop and Visible Light Communication (VLC) in the secondary hop. We conduct a thorough analysis by deriving closed-form expressions for end to end bit error rate (BER). Furthermore, we employ a Monte Carlo approach to generate best fitting curves and validate our numerical expressions with simulation results. Evaluation via BER and outage probability demonstrates the proposed system’s effectiveness. The outcomes of this research offer valuable insights into the feasibility and limitations of UAV-assisted THz- VLC systems.

The existence of palindrome numbers of arbitrary length greater than 2 that are divisible by the prime number 37 is proven in this paper. The method to construct such a palindrome is also described. It turns out that a palindrome number divisible by 37 is also divisible by 3 and, consequently, divisible by 111.

Product attribute extraction is an growing field in e- commerce business, with several applications including product ranking, product recommendation, future assortment planning and improving online shopping customer experiences. Under- standing the customer needs is critical part of online business, specifically fashion products. Retailers uses assortment planning to determine the mix of products to offer in each store and channel, stay responsive to market dynamics and to manage inventory and catalogs. The goal is to offer the right styles, in the right sizes and colors, through the right channels. When shoppers find products that meet their needs and desires, they are more likely to return for future purchases, fostering customer loyalty. Product attributes are a key factor in assortment planning. In this paper we present PAE, a product attribute extraction algorithm for future trend reports consisting text and images in PDF format. Most existing methods focus on attribute extraction from titles or product descriptions or utilize visual information from existing product images. Compared to the prior works, our work focuses on attribute extraction from PDF files where upcoming fashion trends are explained. This work proposes a more comprehensive framework that fully utilizes the different modalities for attribute extraction and help retailers to plan the assortment in advance. Our contributions are three-fold: (a) We develop PAE, an efficient framework to extract attributes from unstructured data (text and images); (b) We provide catalog matching methodology based on BERT representations to discover the existing attributes using upcoming attribute values; (c) We conduct extensive experiments with several baselines and show that PAE is an effective, flexible and on par or superior (avg 92.5% F1-Score) framework to existing state-of-the-art for attribute value extraction task.

Sign language recognition technology can help people with hearing impairments to communicate with those who are hearing impaired. At present, with the rapid development of society, deep learning technology also provided certain technical support for sign language recognition work. In sign language recognition tasks, the use of traditional convolutional neural networks to extract spatio-temporal features from sign language videos suffers from insufficient feature extraction, resulting in low recognition rates. Nevertheless, video-based sign language datasets are very large and require a lot of computational resources for training and generalisation must be ensured, which poses a challenge for recognition. In this paper, we have presented a video-based sign language recognition method based on resnet and lstm. As the number of network layers increases, the ResNet network can effectively solve the granularity explosion problem and obtain better time series features. We use the Resnet convolutional network as the backbone model. At the initialisation stage, we obtain sign language features using ResNet; then, the learned feature space is used as the input of LSTM network to obtain long sequence features. The experimental results show that the accuracy of the above model is better than the mainstream model, and it can effectively extract the spatio-temporal features in sign language videos and improve the recognition rate of sign language actions.

Tremor is a prevalent neurological disorder characterized by involuntary shaking or trembling of body parts. This condition impairs fine motor skills and hand coordination to varying degrees and can even affect overall body mobility. As a result, tremors severely disrupt the daily lives and work of those affected, significantly limiting their physical activity space. This study developed an innovative Spatial Augmented Reality (SAR) system aimed at assisting individuals with tremor disorders to overcome their physical limitations and expand their range of activities. The system integrates eye-tracking and Internet of Things (IoT) technologies, enabling users to smoothly control objects in the real world through eye movements. It employs a virtual stabilization algorithm for stable interaction with objects in the real environment. The study comprehensively evaluated the system's performance through three experiments: 1) assessing the effectiveness of the virtual stabilization algorithm in enhancing the system's ability to assist individuals with tremors in stable and efficient interaction with remote objects; 2) evaluating the system's fluidity and stability in performing complex interactive tasks; 3) investigating the precision and efficiency of the system in remote interactions within complex physical environments. The results demonstrate that the system significantly improves the stability and efficiency of interactions between individuals with tremor and remote objects, reduces operational errors, and enhances the accuracy and communication efficiency of interactions.

Deep learning architectures like ResNet and Inception have produced accurate predictions for classifying benign and malignant tumors in the healthcare domain. This enables healthcare institutions to make data-driven decisions and potentially enable early detection of malignancy by employing computer-vision-based deep learning algorithms. These Convolutional Neural Network algorithms, in addition to requiring huge amounts of data, can identify higher and lower-level features that are significant while classifying tumors into benign or malignant. However, these algorithms have limitations concerning explainability and identifying the exact features that are of importance and contributing to the final classification of tumors as benign or malignant. In this paper, we implement several explainable AI techniques, namely, LIME, Saliency Map, Occlusion Analysis, Grad-CAM, SHAP, and Smooth Grad to interpret the results of a custom ResNet60 classifier in the classification of ovarian tumors as benign or malignant. The ResNet60 model attained an accuracy of 97.50% for the test dataset.

In the whole world, including Mexico, the rising prevalence of diabetes poses significant challenges to healthcare systems, with a notable impact on hospital admissions even being an ambulatory care sensitive condition, that means, hospital admissions are avoidable. Traditional healthcare methodologies have been instrumental in managing diabetes and preventing complications, yet they often face limitations such as merging, cleansing, and outlier analysis of health data to identify and address diseases effectively. This paper aims to address this gap by conducting a comprehensive comparison of the methodologies used in healthcare and data science for this purpose. This work uses hospital diabetes discharge records from 2010 to 2023, a total of 36,665,793 records, which belong to medical units of the Ministry of Health of Mexico. In this work, we seek to provide the arguments why as a data scientist it is mandatory to learn the field of knowledge of the problem and its implications if this is not done, and therefore to disclose insights that can help in policy decisions and reduce the burden of avoidable hospitalizations. The approach is mainly based on the standardization or adjust rates by sex and age groups. This study provides the foundations for a new way of data scientist must deal with health data.

Health care operations in many hospitals are experiencing increasing demand which is however hindered by the limited resources available. The imbalance between the demand and service provision capacity within the hospitals have resulted in long waiting times for service delivery due to overcrowding, high costs of treatment as well as low levels of patient’s satisfaction. The above problems are attributed to the development of hospital management information system. This dissertation is focused on investigating some of the causes of the increased cost and time consumption as well as low levels of patient’s satisfaction in the application of hospital management information system. The study used comparative design to make a comparison of the respondents from two different hospital facilities where 400 health workers were drawn for research. The questionnaire was used as a survey tool for the study that involved both qualitative and quantitative analysis. The results of the study indicate various playing factors that arise due to the development of the hospital management information system. These factors include the large functionality of the system, the need for training of the end users, the increasing ageing population, and delays. The identified factors play a significant role in the way the information system impacts the time taken, the cost involved, and patient satisfaction. Keywords: health, hospital, doctors, technology, information system, time, and cost.

Acute lower respiratory tract infection is a major health problem that affects more than 15% of the total population of Saudi Arabia each year. Epidemiological studies conducted over the last three decades have indicated that viruses are responsible for the majority of these infections. The epidemiology of respiratory viruses in Saudi Arabia is believed to be affected mainly by the presence and mobility of large numbers of foreign workers and the gathering of millions of Muslims in Mecca during the Hajj and Umrah seasons. Knowledge concerning the epidemiology, circulation pattern, and evolutionary kinetics of respiratory viruses in Saudi Arabia are scant, with the available literature being inconsistent. After reviewing the available data on epidemiology and evolution of respiratory viruses, this study examines the effect of varying vaccination rates across different age groups during the 2019/2020 influenza season in Saudi Arabia. Utilizing an age-structured SEIR (Susceptible–Exposed–Infectious–Recovered) model, it develops customized vaccination policies by considering age-specific incidence rates. This pioneering research segments the population into five age groups—infants and school-aged children, junior and older youth, young adults and adults, middle-aged, and seniors—across five regional areas in Saudi Arabis: Eastern, Central, Northern, Western, and Southern. A contact matrix, compiled from multiple sources, is used to delineate the dynamics of influenza transmission. The study undertakes a thorough comparison of three distinct vaccination scenarios: no vaccination, national vaccination, and optimized vaccine allocation policy, under various potential pandemic situations. It examines their impact on vaccination campaigns in terms of the total number of infections, mortality, and morbidity rates. The results emphasize the crucial impact of population demographics on disease transmission and vaccine distribution. According to the findings, the optimized vaccination scenario proved to be the most effective strategy in all scenarios.

Target recognition and fine-grained ship classification in remote sensing face the challenges of high inter-class similarity and sample scarcity. A transfer fusion-based ship image harmonization algorithm is proposed to overcome these challenges. This algorithm designs a feature transfer fusion strategy based on the combination of region aware instantiation and attention mechanism. Implement adversarial learning through image harmony generator and discriminator module to generate realistic remote sensing ship harmony images. Furthermore, the do-main encoder and domain discriminator modules are responsible for extracting feature representations of foreground and background, and further aligning ship foreground with remote sensing ocean background features through feature discrimination. Compared with other advanced image conversion techniques, our algorithm delivers more realistic visuals, improving classification accuracy for six ship types by 3% and twelve types by 2.94%, outperforming Sim2RealNet. Finally, a mixed dataset containing data augmentation and harmonizing samples and real data was proposed for the fine-grained classification task of remote sensing ships. Evaluation experiments were conducted on 8 typical fine-grained classification algorithms, and the accuracy of fine-grained classification for all categories of ships was analyzed. The experimental results show that the mixed dataset proposed in this paper effectively alleviates the long tail problem in real datasets, and the proposed remote sensing ship data augmentation framework performs better than state-of-the-art data augmentation methods in fine-grained ship classification tasks.

In this article, we propose a circuit to imitate the behavior of a Reward-Modulated Spike-Timing-Dependent Plasticity synapse. When two neurons in adjacent layers produce spikes, each spike modifies the thickness of the common synapse. As a result, the synapse’s ability to conduct impulses is controlled, leading to an unsupervised learning rule. By introducing a reward signal, reinforcement learning is enabled by redirecting the growth and shrinkage of synapses based on signal feedback from the environment. The proposed synapse manages the convolution of the emitted spike signals to promote either the strengthening or weakening of the synapse, which is represented as the resistance value of a memristor device. As memristors have a conductance range that may differ from the available current input range of typical CMOS neuron designs, the synapse circuit can be adjusted to regulate the spike’s amplitude current to comply with the neuron. The circuit described in this work allows for the implementation of fully interconnected layers of neuron analog circuits. This is achieved by having each synapse reconform the spike signal, thus removing the burden of providing enough power from the neurons to each memristor. The synapse circuit was tested using a CMOS analog neuron described in the literature. Additionally, the article provides insight into how to properly describe the hysteresis behavior of the memristor in Verilog-A code. The testing and learning capabilities of the synapse circuit are demonstrated in simulation using the Skywater-130nm process. The article’s main goal is to provide the basic building blocks for Deep Neural Neural Networks relying on spiking neurons and memristors as the basic processing elements to handle spike generation, propagation, and synaptic plasticity.

Conventional traceability systems in Cambodian agriculture, such as Rubber Supply Chain Management (RSCM), often struggle to provide timely data and fair market prices, leading to mistrust among stakeholders, exploitation by intermediaries, and hindering progress towards ethical sourcing and sustainable practices. This research aims to showcase the potential of integrating blockchain technology, the Internet of Things (IoT), the InterPlanetary File System (IPFS), and Differential Privacy (DP) methods to empower Cambodian rubber farmers. By enhancing transparency, facilitating fair pricing, and promoting sustainable methods in the rubber industry, this integrated approach leverages Hyperledger Fabric (HLF) to create a decentralized and secure system for tracking rubber from its source to the end consumer. Integration with IPFS ensures secure and easily accessible data storage, further enhancing the system’s reliability. Additionally, the implementation of differential privacy techniques safeguards confidential data during information sharing among farmers and supply chain stakeholders, minimizing potential privacy concerns. This comprehensive system encourages consumers to make ethical and sustainable alternative options by providing accessible information on harvesting methods, processing procedures, labor conditions, and environmental impacts. The potential benefits extend beyond Cambodia, serving as a model for other developing countries aiming to modernize and enhance the agricultural distribution networks. Our results show that transaction send rates (TPS) and throughput in systems with and without differential privacy grow with increased transaction volumes. However, the system without differential privacy achieves greater scalability and efficiency above a certain threshold. However, it offers a slightly reduced latency, reflecting a trade-off between privacy and performance efficiency in blockchain-based agricultural traceability systems.

Abstract In This research we will describe how to deal the system with users to make the work in the company or in any work space . in application forms interact with users inside the system . application form of any system must creates a many graphical interface for user ant we should take care about who is dealing with the system , Additionally, application forms used from different type of user so that we must take care about this points during designing the system for different users . Application Forms in the system consists of many programs, or components and function we are designing it. the instructions inside program can be execute by clicking on the command button and we can create specific process in the system.

Fire is a serious security threat that can lead to casualties, property damage, and environmental damage. However, despite the availability of object detection algorithms, challenges persist in detecting fires and smoke. These challenges include slow convergence speed, poor performance in detecting small targets, and high computational cost limiting deployments. In this paper, Fire smoke and human detection based on ConvNeXt and Mixed encoder (FCM-DETR), an end-to-end object detection algorithm based on Deformable DETR, is proposed. Firstly, we introduce ConvNeXt to take the place of Resnet, which greatly reduces the amount of computation and improves the ability to extract irregular flame features. Secondly, to effectively process multi-scale features, the original encoder is decoupled into two modules. Then Mixed encoder, an innovative encoder structure, is proposed, resulting in excellent performance of multi-scale fire and smoke features fusion. What can’t be overlooked is that the encoder block is compatible with any DETR-based models. Finally, the convergence speed is accelerated and the mean of average precision is improved by applying a novel loss function called Powerful IoU v2. The experimental results indicate that our model achieves the best detection accuracy compared to other models, with mAP reaching 66.7%, mAPs and Accuracyfire achieving impressive 50.2% and 98.05%, respectively.

Some of the barriers preventing Virtual Reality (VR) from being widely adopted are the cost and unfamiliarity of VR systems. Here we propose that in many cases the specialized controllers shipped with most VR head-mounted displays can be replaced by a regular smartphone, cutting the cost of the system, and allowing users to interact in VR using a device they are already familiar with. To achieve this, we developed SmartVR Pointer, an approach that uses smartphones as a replacement for the specialized controllers for two essential operations in VR: selection and navigation by teleporting. In SmartVR Pointer a camera mounted on the head-mounted display (HMD) is tilted downwards so that it points to where the user will naturally be holding their phone in front of them. SmartVR Pointer supports three selection modalities: tracker-based,gaze-based, and combined/hybrid. In the tracker-based SmartVR pointer selection we use image-based tracking to track a QR code displayed on the phone screen and them map the phone’s position to a pointer shown within the field of view of the camera in the Virtual Environment. In the gaze-based selection modality the user places the pointer using their gaze and taps on the phone for selection. The combined technique is a hybrid between head-gaze-based interaction in VR and smartphone-based Augmented Reality. It allows the user to control a VR pointer that behaves like a mouse pointer by moving their smartphone to select objects within the virtual environment, and to interact with the selected objects using the smartphone’s touch screen. The touchscreen is used for selection and dragging. SmartVR Pointer is simple and requires no calibration and no complex hardware assembly or disassembly. We demonstrate successful interactive applications of SmartVR Pointer in a VR environment with a demo where the user navigates in the virtual environment using teleportation points on the floor and then solves a Tetris-style key-and-lock challenge.

In recent years, extensive research has been conducted on the IoT, one of its challenges has been the field security and penetration in these networks. security solutions it Require more planning and awareness to ensure system security and privacy protection.it has also been shown that adjusting the weights of neural networks can help improve the accuracy of detection to what extent. the challenge in the attack detection field is to increase the accuracy of attack detection by machine learning methods, in this paper, a new method is presented to adjust weights of the random neural network for attack detection. Evaluations of the proposed method show that compared to random neural network methods, nearest neighbor, and support vector machine, the accuracy of attack detection improves up to 99.49 percent, and the random neural network method has been able to improve by 99.01 percent, placing the best methods together in these experiments in the form of a multi-learning model showed that the results also had an increase in accuracy up to 99.56 percent, while the training time in the proposed model is less compared to the random neural network method.

Principal Component Analysis (PCA) is a method that identifies common directions within multivariate data and presents the data in as few dimensions as possible. One of the advantages of PCA is its objectivity, as the same results can be obtained regardless of who performs the analysis. However, PCA is not a robust method and is sensitive to noise. Consequently, the directions identified by PCA may deviate slightly. If we can teach PCA to account for this deviation and correct it, the results should become more comprehensible. The methods for doing this and an issue with this are presented.

Monogenity is a classical area of algebraic number theory that is very actively researched even today. This paper is a collection of the results obtained during the last few years in this area. Several of these results were presented at the series of online conferences "Monogenity and power integral bases".

The obtention of simple formulae for the Lebesgue constants arising in the the classical Fourier series approximation is presented. Both even and odd cases are treated enlarging Fejér result. Asymptotic formulae are also obtained.

Although Lov\'{a}sz introduced the graph exponential $G^K$ in 1967, this product has received little attention. This paper focuses on the number of components in $G^K$ when exponent $K$ is a complete graph $K_n$. For a connected bipartite $G$, when $K$ is $K_2$, $G^{K_2}$ has three components; and when $K$ is $K_n$ with $n>2$, $G^{K_n}$ produces $\lceil\frac{n+1}{2}\rceil$ components. A connected $G$ with an odd cycle produces one component in $G^{K_n}$.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all efficient solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.

Droughts have a substantial effect on water resources, agriculture, and ecosystems on a worldwide scale. In the Mekong Delta of Vietnam, droughts exacerbated by climate change are significantly endangering the region's agricultural sustainability and output. Conventional forecasting techniques frequently do not capture the intricate dynamics of meteorological phenomena associated to drought effectively, prompting the exploration of more advanced methodologies. This work utilises artificial intelligence, par-ticularly machine learning methods like Gradient Boosting and Extreme Gradient Boosting (XGBoost), to enhance drought pre-diction in the Mekong Delta. The study utilises data from 11 meteorological stations spanning from 1990 to 2022 to create and evaluate Machine Learning models based on several climatic factors. We utilise Gradient Boosting and XGBoost algorithms to estimate the Standardised Precipitation-Evapotranspiration Index (SPEI) and evaluate their effectiveness in comparison to con-ventional forecasting techniques. The results show that Machine Learning, particularly XGBoost, surpasses traditional approaches in predicting SPEI accuracy at various time scales. XGBoost demonstrates skill in understanding the complex relationships between climatic factors, with R² values falling between 0.90 and 0.94 for 1-month forecasts. The progress highlights the potential of Machine Learning in improving drought management and adaptation tactics, proposing the incorporation of Machine Learning forecasting models into decision-making processes to enhance drought resistance in susceptible areas.

With the rapid growth of large language models (LLMs), there is increasing demand for memory and computation in LLMs. Recent efforts on post-training pruning of LLMs aim to reduce the model size and computation requirements, yet the performance is still sub-optimal. In this paper, we present a plug-and-play solution for post-training pruning of LLMs. The proposed solution has two innovative components: 1) Relative Importance and Activations (RIA), a new pruning metric that jointly considers the weight and activations efficiently on LLMs; and 2) Channel Permutation, a new approach to maximally preserve important weights under N:M sparsity. The two proposed components can be readily combined to further enhance the N:M semi-structured pruning of LLMs. Our empirical experiments show that RIA alone can already surpass all existing post-training pruning methods on prevalent LLMs, e.g., LLaMA ranging from 7B to 65B. Furthermore, N:M semi-structured pruning with channel permutation can even outperform the original LLaMA2-70B on zero-shot tasks, together with practical speed-up on specific hardware. Our code is available at: https://github.com/biomedical-cybernetics/Relative-importance-and-activation-pruning

Introduced in 1967 by Lov\'{a}sz, graph exponentiation has received little attention over the past several decades. Since graph exponentiation produces large graphs and any graph can be constructed utilizing its adjacency matrix, we provide a four step linear construction algorithm that generates the adjacency matrix for the graph exponential.

Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultra-sparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage against fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi- means new) Learning is via link prediction: predicting the likelihood of non-observed links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Meta-deep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is meta-deep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4-step training methodology that puts ESML at its heart. We conduct experiments on 7 datasets and 5 network structures comparing CHT to dynamic sparse training SOTA algorithms and the fully connected counterparts. The results indicate that, with a mere 1% of links retained during training, CHT surpasses fully connected networks on VGG16, GoogLeNet, ResNet50, and ResNet152. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle that adopts CH3-L3-based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers the first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size. Our code is available at: https://github.com/biomedical-cybernetics/Cannistraci-Hebb-training.

The increasing demand for water in agriculture and the need for more efficient irrigation systems has led to the development of smart irrigation systems based on the Internet of Things. In this system, an Arduino microcontroller is used to control and monitor the watering of crops. The system is equipped with sensors that measure soil moisture which are used to optimize the irrigation process. The data collected by the sensors is transmitted to the Arduino, which then adjusts the watering schedule based on the information received. The use of IoT in smart irrigation systems provides several benefits, including reduced water waste, increased crop yields, and improved plant health. The implementation of this system using an Arduino platform is relatively simple, cost-effective, and can be easily integrated into existing irrigation systems. Overall, the use of IoT in smart irrigation using an Arduino platform has the potential to revolutionize the way we manage water resources in agriculture.

The event camera generates an event stream based on changes in brightness, retaining only the characteristics of moving objects, addresses the high power consumption associated with using high-frame-rate cameras for high-speed eye tracking tasks. However, the asynchronous incremental nature of event camera output has not been fully utilized, and there are also issues related to missing event datasets. Combining the temporal information encoding and state-preserving properties of spiking neural network (SNN) with event camera, a near-range eye tracking algorithm is proposed as well as a novel event-based dataset for validation and evaluation. According to experimental results, the proposed solution outperforms artificial neural network (ANN) algorithms, while computational time remains only 12.5\% of that of traditional SNN algorithms. Furthermore, the proposed algorithm allows for self-adjustment of time resolution, with a maximum achievable resolution of 0.081ms, enhancing tracking stability while maintaining accuracy.

Design plays a critical role and creates a positive user experience, establishing a solid brand identity and staying competitive in the digital world. This research investigates the impact of user data collecting and analysis in improving user experience. The Data-driven User interface design can create an optimized and relevant UI with individual preferences, which leads to increasing user engagement and usability. The proposal explores methodologies to implement data collection and user research for tailoring digital products.

Recently several papers have been published on the Liénard equation x'' +L x+m x^3+n x^5=0, where the authors studied their explicit solutions and their applications. Here we describe the complete dynamics of these differential equations in the Poincar\'e disc. The Poincar\'e disc is the closed disc centered at the origin of coordinates of radius one, the whole plane R^2 is identified with the interior of this disc, and its boundary, the circle $\sss^1$ is identified with the infinity of R^2.

The introduction of the Industrial Internet of Things (IIoT) has led to major changes in the industry. Thanks to machine data, business process management methods and techniques could also be applied to them. However, one data source has so far remained untouched: The network data of the machines. In the business environment, process mining, for example, has already been carried out based on network data, but the IIoT, with its particular protocols such as OPC UA, has yet to be investigated. With the help of design science research and on the shoulders of CRISP-DM, we first develop a framework for process mining in the IIoT in this paper. We then apply the framework to real-world IIoT network traffic data and evaluate the outcome and performance of our approach in detail. We find tremendous potential in network traffic data but also limitations. Among other things, due to the dependence on process experts and the existence of case IDs.

In an era marked by digitization and automation, extracting relevant information from business documents, like electricity invoices, remains a major challenge. To address this, we need to use machine-learning techniques to automate the process, reduce manual labor, and minimize errors. This work introduces a new method for extracting key values from this type of invoice, including customer personal data, bill breakdown, electricity consumption, or marketer data. We evaluate several machine learning techniques, such as Naive Bayes, Logistic Regression, Random Forests, or Support Vector Machines. Our approach uses a bag-of-words strategy and custom-designed features specifically tailored for electricity data. We tested the method on the IDSEM dataset, which includes 75.000 electricity invoices with eighty-six different fields. The method converts PDF invoices into text and processes each word separately using a context of eleven words. The results of our experiments indicate that Support Vector Machines and Random Forests perform exceptionally well in capturing numerous values with high precision. The study also explores the advantages of our custom features and evaluates the performance of the model on unseen documents. The precision obtained with Support Vector Machines is 91,86%, peaking at 98,47% for one document template. These results demonstrate the effectiveness of our method in accurately extracting key values from invoices.

Repetitive elements, often referred to as selfish genes, pose significant challenges to genome assembly and read mapping in bioinformatics. These elements can replicate within the genome without providing functional benefits to the host organism, leading to complexities in accurate genome analysis. This study presents a simulation-based approach to illustrate the impact of repetitive elements on read mapping accuracy. By comparing genome sequences with and without repetitive elements, we demonstrate how these selfish genes create ambiguities and errors in read alignment. The findings underscore the importance of developing advanced bioinformatics tools aligned with artificial intelligence to mitigate the effects of repetitive sequences and improve the reliability of genomic analyses.

In this work, an improved collocation method based on the Bernoulli polynomials is presented to solve the Volterra integral equation (VIE) of the second kind. The main idea of the proposed method is to improve the results of the classic Bernoulli collocation method (BCM) by dividing the interval into some sub-intervals and considering the collocation points on each of them. Here, the zeros of the shifted Chebyshev polynomials (SCPs) are considered as collocation points. Then, BCM is applied step by step from the first sub-interval to the last one. By this process, a system of algebraic equations is attained for each sub-interval that could be easily solved. Convergence of the scheme is analyzed. For the purpose of demonstrating the validity, applicability, and efficiency of the suggested scheme several numerical examples are provided. Numerical results illustrate that the accuracy of the improved Bernoulli collocation method (IBCM) is more than BCM.

The deaf-mute and individuals with hearing disabilities who communicate through sign language should not be overlooked or excluded. It is a social responsibility to strive for an inclusive world without inequality. Advances in technology offer various solutions to address the communication gap, one of which is the use of computer-based sign language recognition systems. This project proposes a Malaysian Sign Language recognition model utilizing MobileNetV1, a convolutional neural network-based algorithm, to interpret sign language in real-time settings through a website application using Streamlit. The outcome of the model test shows that it has achieved a recognition rate of 96 percent. Although the proposed model has demonstrated the ability to recognize sign language, it is suggested that further improvement can be achieved by enhancing the quality and diversity of the dataset. The implementation of a more comprehensive dataset would lead to improved performance and increased accuracy of the model. This project underscores the importance of considering and accommodating the needs of the deaf-mute and individuals with hearing disabilities and highlights the potential of technology to bridge communication barriers and achieve a more inclusive society.

In the ground-based infrared optical remote sensing system, the target signal is very weak due to the dynamic strong light background and the movement of small and small targets. In order to improve the limit detection capability, the background suppression and target enhancement methods are required to be more suitable for this scene. To solve this problem, we first analyze the image features in the current scene, and propose a more perfect point target and noise model. Then, we propose a new WY distribution function based on the Fermi Dirac distribution function, and propose an anisotropic filtering method based on this function, and further suppress the back-ground through the difference results of two steps. Then, based on the distribution function, we further designed an energy concentration accumulation strategy in 9 scale directions, through which the SNR of the target is effectively improved and the suppression ability of the background is enhanced. Through quantitative and qualitative experimental analysis, compared with the same type of algorithms, the proposed method has better robustness against extremely weak targets and dynamic backgrounds.