Cloud computing refers to applications delivered as services over the Internet. Cloud systems employ policies that are inherently dynamic in nature and that depend on temporal conditions defined in terms of external events, such as the measurement of bandwidth, use of hosts, intrusion detection or specific time events. In this paper, we investigate an optimized resource management scheme named v-Mapper. The basic premise of v-Mapper is to exploit application-awareness concepts using software-defined networking (SDN) features. This paper makes three key contributions to the field: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. An evaluation was carried out with various benchmarks and demonstrated that v-Mapper shows improved performance over other state-of-the-art approaches in terms of average task completion time, service delay time and bandwidth utilization. Given the growing importance of supporting large-scale data processing and analysis in datacentres, the v-Mapper system has the potential to make a positive impact in improving datacentre performance in the future.

To address the problems of insufficient semantic fusion between text and questions and the lack of consideration of global semantic information encountered in machine reading comprehension models, we proposed a machine reading comprehension model called BERT_hybrid based on BERT and hybrid attention mechanism. In this model, BERT is utilized to separately map the text and questions into the feature space. Through the integration of Bi-LSTM, attention mechanism, and self-attention mechanism, the proposed model achieves comprehensive semantic fusion between text and questions. The probabilities distribution of answers is computed using Softmax. Experimental results on the public dataset DuReader demonstrate that the proposed model achieves improvements in BLEU-4 and ROUGE-L scores compared to existing models. Furthermore, to validate the effectiveness of the proposed model design, we analyze the factors influencing the model’s performance.

Users with Autism Spectrum Disorder may find human-computer interaction (HCI) challenging due to a number of symptoms experienced, one of which is difficulty coping with change. Through capturing, comparing and statistically analysing the reactions of autistic and neurotypical users to seven individual design changes, it has been possible to identify the changes that cause significant difficulty in autistic users. These difficulty points were then used to form heuristics that can followed by HCI practitioners in the industry to reduce the negative impact of software interface design change on autistic users, hence making software updates more accessible.

Multimodal knowledge graph completion necessitates the integration of information from multiple modalities (such as images and text) into the structural representation of entities to improve link prediction. However, most existing studies have overlooked the interaction between different modalities. To address this issue, this paper proposed a Transformer-based knowledge graph link prediction model (MM-Transformer) that fuses multimodal features. Different modal encoders are employed to extract structural, visual and textual features, and hybrid key-value calculations are performed on features from different modalities based on the Transformer architecture. The similarities of textual tags to structural tags and visual tags are calculated and aggregated respectively, and multimodal entity representations are modeled and optimized to reduce the heterogeneity of the representations. Experimental results demonstrate that, compared to the current multimodal state-of-the-art methods, the proposed method achieves significant performance improvements in knowledge graph link prediction tasks. This proves that the proposed method effectively addresses the problem of multimodal feature fusion in knowledge graph link prediction tasks.

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.

As Artificial Intelligence (AI) technology, particularly Machine Learning algorithms, becomes increasingly ubiquitous, our abilities to understand and interpret AI and machine learning algorithms are becoming increasingly desirable. Visualization has been used as a common tool to view and understand complex machine learning processes. In this paper, we will focus on developing a general framework for the visualization of machine learning models as a scalar valued multi-dimensional function to help users understand how the models behave over different viewing spaces. We first give a formal definition of the visualization problem. Interpolation-based morphing and subspace sampling techniques are applied to generate various renderings through projections and cross-sections of the model space as 3D surfaces or heatmap images. This method will be applied to two real-world datasets and applications: the diagnosis of Alzheimer's Disease (AD) using a human brain networks dataset and a real-world benchmark dataset for predicting home credit default risks. The visualizations show that different machine learning algorithms can behave quite differently under different conditions.

In addition to their importance in statistical thermodynamics, probabilistic entropy measurements are crucial for understanding and analyzing complex systems, with diverse applications in time series and one-dimensional profiles. However, extending these methods to two- and three-dimensional data still requires further development. In this study, we present a new method to classify spatiotemporal processes based on entropy measurements. To test and validate the method, we selected four classes of similar processes related to the evolution of random patterns: dynamic colored noises ((i)~white and (ii)~red); (iii)~weak turbulence from reaction-diffusion; (iv)~hydrodynamic fully developed turbulence, and (v)~plasma turbulence from MHD. Considering seven possible ways to measure entropy from a matrix, we present the method as a parameter space composed of the two best separating measures of the five selected classes. The results highlight better combined performance of Shannon Permutation Entropy ($S^p_H$) and a new approach based on Tsallis Spectral Permutation Entropy ($S^s_q$). Notably, our observations reveal the segregation of reaction terms in this $S^p_H \times S^s_q$ space, a result that identifies specific sectors for each class of dynamic process, and can be used to train machine learning models for automatic classification of complex spatiotemporal patterns.

This work presents a Fault-Tolerant Model Predictive Control (FTMPC) algorithm applied to a simulation model for sewer networks. The control system will aim to prevent contaminated water from escaping the network, especially during periods of heavy rainfall, that can cause combined sewer overflows (CSO), while maintaining the flow of water towards the wastewater treatment plant (WWTP) as close as possible to its nominal value. The main purpose of the work is to preserve the operation of the predictive controller as much as possible, in accordance with its operational objectives, when there may be anomalies affecting the elements of the control system, mainly sensors and actuators. Comparing the results obtained considering various types of faults, with situations of normal controlled operation and with the behavior of the sewer network when no control is applied, will allow some conclusions to be drawn at the end.

Incorrect sitting posture, characterized by asymmetrical or uneven positioning of the body, often leads to spinal misalignment and muscle tone imbalance. Prolonged maintenance of such postures can adversely impact well-being and contribute to the development of spinal deformities and musculoskeletal disorders. In response, smart-sensing chairs equipped with cutting-edge sensor technologies have been introduced as a viable solution for real-time detection, classification, and monitoring of sitting postures, aiming to mitigate the risk of musculoskeletal disorders and promote overall health. This comprehensive literature review evaluates the current body of research on smart-sensing chairs, with a specific focus on the strategies used for posture detection and classification, as well as the effectiveness of different sensor technologies. A meticulous search across MDPI, IEEE, and Google Scholar databases yielded 34 pertinent studies that utilize non-invasive methods for posture monitoring. The analysis reveals that Force Sensing Resistors (FSR) are the predominant sensors utilized for posture detection, whereas Convolutional Neural Networks (CNN) and Artificial Neural Networks (ANN) are the leading machine learning models for posture classification. However, it was observed that CNNs and ANNs do not outperform traditional statistical models in terms of classification accuracy, due to constrained size and lack of diversity within training datasets. These datasets often fail to comprehensively represent the array of human body shapes and musculoskeletal configurations. Moreover, this review identifies a significant gap in the evaluation of user feedback mechanisms, essential for alerting users to their sitting posture and facilitating corrective adjustments.

Medical image segmentation is a critical step in various healthcare applications, aiding in diagnosis, treatment planning, and disease monitoring. In this study, we investigate the efficacy of a segmentation approach based on the 2D wavelet transform. Leveraging a dataset comprising 10 diverse medical images, we evaluate the performance of our segmentation method using three key metrics: accuracy, precision, and recall. Our findings demonstrate that the proposed approach enhances segmentation accuracy, offering promising results compared to existing methods. By harnessing the multi-resolution feature extraction capabilities of the 2D wavelet transform, our method achieves improved delineation of medical image structures, paving the way for more accurate and efficient healthcare interventions.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

Cloud data centers play a vital role in modern computing infrastructure, offering scalable resources for diverse applications. However, managing costs and resources efficiently in these centers has become a crucial concern due to the exponential growth of cloud computing. User applications exhibit complex behavior, leading to fluctuations in system performance and increased power usage. To tackle these obstacles, we propose the consolidation of virtual machines (VMs) to optimize resource utilization and reduce operational costs. This paper introduces a novel algorithm, leveraging the Modified Artificial Feeding Birds Algorithm (ModAFBA), to manage cost optimally in cloud data centers by reducing power usage while meeting service level agreements (SLAs). The ModAFBA algorithm, inspired by bird foraging behavior, dynamically adjusts solutions based on environmental changes. Comprehensive experimental evaluation demonstrates the superiority of the proposed algorithm in terms of power usage, migration count, and SLA compliance. Through this research, we aim to advance cost management and resource optimization in cloud data centers, providing a valuable tool for cloud service providers to enhance infrastructure efficiency and achieve cost savings.

This paper presents a new semi-explicit algorithm for parameters estimation in a time-fractional generalization of dual-phase-lag heat conduction model with the Caputo fractional derivatives. It is shown that this model can be derived from a general linear constitutive relation for the heat transfer by conduction when the heat conduction relaxation kernel contains the Mittag-Leffler function. The model can be used to describe heat conduction phenomena in a material with power-law memory. The proposed algorithm of parameters estimation is based on the time integral characteristics method. The explicit representations of the thermal diffusivity and the fractional analogues of the thermal relaxation time and the thermal retardation are obtained via a Laplace transform of the temperature field and utilized in the algorithm. An implicit relation is derived for the order of fractional differentiation. In the algorithm, this relation is resolved numerically. An example illustrates the proposed technique.

A joint analysis of solar wind, geomagnetic field, and earthquake catalog data showed that before the catastrophic M7.8 and M7.5 Kahramanmaras earthquake sequence on February 6, 2023, the closed strong magnetic storm occurred on November 7, 2022, SYM/H=-117 nT. Storm started at 08:04 UT. At this time, the high latitudinal part of Turkey's longitudinal region of future epicenters was located under the polar cusp, where the solar wind plasma would directly access the Earth's environment. The time delay between storm onset and earthquake occurrence was ~91 days. We analyzed all seven strong (M7+) earthquakes from 1967 to 2020 to verify the initial findings. A similar pattern has been revealed for all events. The time delay between magnetic storm onset and earthquake occurrence varies from some days to some months. To continue these investigations, a retrospective analysis of seismic and other geophysical parameters just after preceded geomagnetic storms in the epicenter areas is desirable.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.

Multimodal emotion classification (MEC) involves analyzing and identifying human emotions by integrating data from multiple sources, such as audio, video, and text. This approach leverages the complementary strengths of each modality to enhance the accuracy and robustness of emotion recognition systems. However, one significant challenge is effectively integrating these diverse data sources, each with unique characteristics and levels of noise. Additionally, the scarcity of large, annotated multimodal datasets in Bangla limits the training and evaluation of models. In this work, we unveiled a pioneering multimodal Bangla dataset, MAViT-Bangla (Multimodal Audio Video Text Bangla dataset). This dataset, comprising 1002 samples across audio, video, and text modalities, is a unique resource for emotion recognition studies in the Bangla language. It features emotional categories such as anger, fear, joy, and sadness, providing a comprehensive platform for research. Additionally, we developed a framework for emotion recognition that employs a cross-modal attention mechanism among unimodal features. This mechanism fosters the interaction and fusion of features from different modalities, enhancing the model’s ability to capture nuanced emotional cues. The effectiveness of this approach was demonstrated by achieving an F1-score of 0.64, a significant improvement over unimodal methods.

Causality is the most important topic in the history of Western Science, and since the beginning of the statistical paradigm, it meaning has been reconceptualized many times. Causality entered into the realm of multi-causal and statistical scenarios some centuries ago. Despite of widespread critics, today Deep Learning and Machine Learning advances are not weakening causality but are creating a new way of finding indirect factors correlations. This process makes possible us to talk about approximate causality, as well as about a situated causality.

Cloud Computing is a promising and emerging technology that is rapidly being adopted by many IT companies due to a number of benefits that it provides, such as large storage space, low investment cost, virtualization, resource sharing, etc. Users are able to store a vast amount of data and information in the cloud and access it from anywhere, anytime on a pay-per-use basis. Since many users are able to share the data and the resources stored in the cloud, there arises a need to provide access to the data to only those users who are authorized to access it. This can be done through access control schemes which allow the authenticated and authorized users to access the data and deny access to unauthorized users. In this paper, a comprehensive review of all the existing access control schemes has been discussed along with analysis. Keywords: role-based access control, attribute-based access control, attribute-based encryption

Natural language Processing (NLP) has significantly transformed in the last decade, especially in the field of Language Modeling. Large Language Models (LLMs) have achieved SOTA performances on Natural Language Understanding (NLU) and Natural Language Generation (NLG) tasks by learning language representation in self-supervised ways. This paper provides a comprehensive survey to capture the progression of advances in Language Models. In this paper, we examine the different aspects of Language Models, which started with a few million parameters but have reached the size of a trillion in a very short time. We also look at how these LLMs transitioned from task-specific to task-independent to task-and-language-independent architectures. This paper extensively discusses different pre-training objectives, benchmarks, and transfer learning methods used in LLMs. It also examines different fine-tuning and In-Context learning techniques used in downstream tasks. It also explores how LLMs can perform well across many domains and datasets if sufficiently trained on a large and diverse dataset. Next, it discusses how, over time, the availability of cheap computational power and large datasets have improved LLM’s capabilities and raised new challenges. As part of our study, we also inspect LLMs from the lens of scalability to see how their performance is affected by the model’s depth, width, and data size. Lastly, we provide an empirical comparison of existing trends and techniques and a comprehensive analysis of where the field of LLM currently stand.

Floods are a common natural disaster whose severity in terms of duration, water resource volume, peak and accumulated rainfall-based damage are likely to differ significantly for different geographical regions. In this paper, we first propose a novel hourly flood index (SWRI24−hr−S), derived from normalising the existing 24-hourly water resources index (WRI24−hr−S) in literature, to monitor flash flood risks on an hourly scale. The proposed SWRI24−hr−S is adopted to identify a flood situation and derive its characteristics, such as the duration (D), volume (V) and peak (Q). The comprehensive result analysis establishes the practical utility of SWRI24−hr−S in identifying flood situations at seven study sites in Fiji between 2014 and 2018 and deriving their characteristics (i.e., D, V, and Q). Secondly, this study develops a vine copula-probabilistic risk analysis system that models the joint distribution of flood characteristics (i.e., D, V, and Q) to extract their joint exceedance probability for the seven study sites in Fiji, enabling probabilistic flood risk assessment. The vine copula approach, particularly suited to Fiji’s study sites, introduces a novel probabilistic framework for flood risk assessment. The results show moderate differences in the spatial patterns of joint exceedance probability of flood characteristics in different combination scenarios generated by the proposed vine copula approach. In the worst-case scenario, the probability of any flood event occurring where the flood volume, peak and duration are likely to exceed the 95th-quantile value (representing an extreme flood event) is found to be less than 5% for all study sites. The proposed hourly flood index and the vine copula approach can be feasible and cost-effective tools for flood risk monitoring and assessment. The methodologies proposed in this study can be applied to other data-scarce regions where only rainfall data is available, offering crucial information for flood risk monitoring, assessment, and the development of effective mitigation strategies.

Smart electronic devices and telemedicine are widely used in humans' daily lives. This provides remote treatment of patients using information and communications technology. New telemedicine technologies, such as the Internet of Medical Things (IoMT), make it easier for medical and computing devices to communicate regularly and effectively. Critical motivations for adapting the IoMT are reduced cost, increased quality of life, and timely medical intervention. IoMT is significant because it enables continuous, real-time patient monitoring during routine everyday activities using a variety of wearables and sensors. With big data, the IoMT technology makes excellent use of Artificial Intelligence (AI) to support disease detection and health condition prediction, alerting patients and healthcare providers. Many research studies have been conducted to explore various aspects of IoMT and its applications in the real world. However, it is challenging to comprehend all the techniques and solutions proposed by the research community. Therefore, this survey sheds light on some crucial aspects of IoMT technologies and explores the potential research gaps and directions the research community could tackle. The survey examines and discusses the characteristics of IoMT standards, protocols, and types. It then delves into the layers of IoMT and distinguishes them into Fog and edge. The studies published under each type were explored, and the limitations of these works were highlighted. The research gaps and directions on IoMT approaches and technologies were also highlighted. With such findings and research directions, further research endeavors could be carried out to address the issues and existing limitations in the IoMT.

This research delves into librarians' perceptions of artificial intelligence (AI) support in learning experiences, lifelong learning, and digital literacy within the library context, undertaking a comparative analysis between Malaysia and Indonesia. Employing a survey methodology, a self-developed questionnaire was administered to 59 librarians in Malaysia and 85 in Indonesia. The questionnaire, utilizing a Likert scale, systematically explored subjective judgments on AI's impact across various dimensions. A noteworthy finding is the consistent and harmonized perception among librarians in both countries, underscoring a universal recognition of AI's perceived support for learning experiences, lifelong learning, and digital literacy. Of particular interest is the emphasis on sustainability in librarians' perspectives, as they recognize the enduring value of AI in fostering educational growth. Despite the limitations inherent in perceptual measures and a relatively modest sample size, the empirical and practical contributions of this study are significant. It offers a nuanced exploration of librarians' viewpoints, providing valuable insights for future research endeavors. Moreover, the study's findings have immediate practical implications for the integration of AI tools in library services, policy-making, and professional development, with a focus on ensuring sustainable implementation for long-term benefits.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

Cancer is one of the leading causes of death, making timely diagnosis and prognosis very important. Utilization of AI (artificial intelligence) enables providers to organize and process patient data in a way that can lead to better overall outcomes. This review paper aims to look at the varying uses of AI for diagnosis and prognosis and clinical utility. PubMed and EBSCO databases were utilized for finding publications from January 1, 2013, to December 22, 2023. Articles were collected using key search terms such as “artificial intelligence” and “machine learning.” Included in the collection were studies of the application of AI in determining cancer diagnosis and prognosis using multi-omics data, radiomics, pathomics, clinical and laboratory data. The resulting 89 studies were categorized into eight sections based on the type of data utilized and then further subdivided into two subsections focusing on cancer diagnosis and prognosis, respectively. 8 studies integrated more than one form of omics, namely genomics, transcriptomics, epigenomics, and proteomics. Incorporating AI into cancer diagnosis and prognosis alongside omics and clinical data represents a significant advancement. Given the considerable potential of AI in this domain, ongoing prospective studies are essential to enhance algorithm interpretability and to ensure safe clinical integration.

A comprehensive modeling framework for the thermoforming of polymer matrix woven laminate composite was developed. Two numerical indicators, the slip path length and traction magnitude, have been identified to be positively correlated to matrix smearing and wrinkling defects. The material model has been calibrated with picture-frame experimental results, and the prediction accuracy for intra-ply shear and thickness distribution were examined with measurements on the physically formed parts. Finally, a parametric study was conducted to determine the relationship between various process parameters and the quality of the formed part. For the trapezoidal part, orienting the laminate at 45-degrees to the mold axis reduces the likelihood of matrix smear and wrinkling defects. Although this laminate orientation yielded a greater spatial variation of part thickness, the thickness deviation is lower than that for the 0-degree orientation case. Higher forming rates were found to result in more defects due to increased slip path lengths and traction magnitudes. Optimal forming speeds should balance rapid shaping within the operating temperature window while avoiding tear. It was discovered that shallower molds benefit from faster ramp rates, while deeper molds require slower rates to manage extensive shearing, stretching, and bending. Faster forming rates lead to smaller thickness increases at high intra-ply shear regions, indicating a shift from intra-ply shear to out-of-plane bending due to the visco-plastic effect of the molten laminate, and can negatively impact part quality. Lastly, it was shown that a well-conceived strategy using darts could improve the part quality by reducing the magnitude of the defect indicators.

For the purpose of improve the sustainability of products sold in the EU, Digital Product Passports is a mandatory solution. These passports would systematically gather information about products, such as detailing the materials involved to aid recycling and remanufacturing efforts, or recording the emissions produced throughout the manufacturing process. The overall goal is the establishment of a circular economy in the EU. Current research on Digital Product Passports is focused on collating content for sector-specific applications. However, achieving sustainability goals through Digital Product Passports will require new methods and technical solutions for digital collaboration between supply chain participants, especially in the manufacturing sector. Collaborative work on Digital Product Passports requires trust and traceability in data and access management to ensure privacy over the data contained. One way to enable this securely and confidentially is through the use of blockchain technology, in which stored data cannot be concealed, which is key to the traceability of digital product data documentation. This paper therefore presents a concept for the implementation of generically applicable cross-industry blockchain-based digital product passports. To this end, generic supply chain processes have been abstracted and condensed into the architecture of smart contracts. Great attention is paid to the establishment of traceability as well as privacy through the selection of the blockchain technology Secret Network in combination with Gaia-X functionalities. An illustrative use case for digital product passports in manufacturing is used to demonstrate the applicability of the presented concept. In this use case information about the digital nameplate and carbon footprint is exchanged securely and confidentially in a multi-tenant supply chain network based on the Industry 4.0 infomation model of the Asset Administration Shell.

Educational institutions must identify students who are academically struggling to provide them with necessary support to improve their performance. In this context, recommendation systems powered by deep learning techniques are vital for detecting and categorizing such students. These systems help students plan their future by uncovering patterns in their historical academic data. This study introduces a new deep learning model designed to classify academically underperforming students in educational settings. The model incorporates a Gated Recurrent Neural Network (GRU) and includes specific neural network features like a dense layer, max-pooling layer, and the ADAM optimization algorithm. The model's training and evaluation were conducted using a dataset comprising 15,165 student assessment records from various academic institutions. The performance of the developed GRU model was benchmarked against other educational recommendation systems, including Recurrent Neural Network models, AdaBoost, and the Artificial Immune Recognition System v2. The proposed GRU model demonstrated remarkable accuracy, achieving an overall rate of 99.70%.

Loneliness is becoming prevalent across Japan in spite of its a dense population and communal culture. Surveys show 40% of adults report isolation across demographics. The contradiction emerges due to deteriorating social structure with modernization, economic parity, urbanization, and fading conventional setup. The continually social withdrawals, called “hikikomori." Relief seekers have embraced AI based emotive robots, digital avatars, and immersive VR as low-stakes social surrogates despite limited capacity to cultivate human intimacy. To stabilise government attempts awareness through reforms, scheme and support services. But a concrete transformation can be brough in with work-life balance, gender equality and rewire the metrics for self-esteem. Even a perfectly personalized AI cannot replace the human affection lacking in the society. Lasting solutions demand technological aids be balanced by confronting and reinventing community purpose and bring in structural change. Overall Japan’s endemic isolation reveals the societal fraying when modernization privileges independence over interdependence. The path forward rests on restoring cultural foundations to reverse loneliness and social isolation.

The burden of hypertension remains unacceptably high globally, particularly in low- and middle-income countries (LMICs). Workplace offer enormous potential as an idea setting for early detection and treatment of hypertension among the working class. Analysis of such a Workplace Screening Programme can reveal information about its potential impact. Machine learning techniques such as k-Means Clustering are untapped tools for such analyses. We set out to deploy this tool for the analysis of our university annual medical screening of workforce for hypertension. An anonymized dataset containing the demography and blood pressure measurements values obtained from staffs of different departments/units in an academic institution was obtained. The total number of samples or data points are 1, 723 in which the input dataset contains six features, including year category (2018, 2019, 2021,2022), Department/Unit (academic and non-academic), gender (male and female), while the target output is the blood pressure status (low, normal and high) respectively. Analysis of the dataset was carried out using machine learning techniques. In this retrospective analysis, it was observed that the mean age for this working class is 42 years old. Similarly, it was discovered that hypertension was prevalent among members of staff above the age of 40 irrespective of their gender or professional category (academic or non-academic). The analysis also revealed that there was a steady decline in the prevalence of hypertension from 2018 to 2022. From the research, it is evident that the adoption of machine learning techniques for periodic analyses of workplace health status screening initiative (especially for hypertension) is effective, feasible, and sustainable to diagnose and control hypertension among the working class.

This research focuses on the Hopf bifurcation occurring at a singular point with high-order degeneracy in a class of three-dimensional systems. Based on center manifold theorem, by expanding the technique for determining singular point values of degenerate singularities in two-dimensional systems, the formal series method to determine the singular point values at the high-order degenerate critical point is discussed. Furthermore, a class of specific three-dimensional differential systems with high-order degenerate singularities is explored. By computing the singular point values and determining center conditions, we proved that a minimum of 5 small-amplitude limit cycles in the vicinity of the origin. This research provides new perspectives on the center problem and limit cycle bifurcation in high-dimensional systems with high-order degenerate singular points.

Mutual exclusion algorithms are at the heart of concurrent, distributed/parallel, real-time and operating systems. It is well-known that such algorithms are very difficult to analyze and in the literature different conjectures about starvation-freedom and the number of by-passes (also said the overtaking factor), which in turn affects the (hopefully) bounded waiting time that a process competing for entering the critical section has to suffer before accessing the shared resource, have been formulated for specific algorithms. This paper proposes a novel modelling approach based on Timed Automata and the Uppaal toolset, which proves effective for studying all the properties of a mutual exclusion algorithm for N≥2 processes, by exhaustive model checking. Although the approach, as already confirmed by similar experiments reported in the literature, is not scalable due to state explosion problems, and can be practically applied until N≤5, it is of great value for revealing true properties of analyzed algorithms. For dimensions N>5 the statistical model checker of Uppaal can be used which, although based on simulations, can confirm properties by estimations and probabilities. The paper describes the proposed modelling and verification method and applies it to several mutual exclusion algorithms, thus retrieving known properties but also showing new results about properties often studied only by peer-review and intuitive reasoning.

Let $(\{f_j\}_{j=1}^n, \{\tau_j\}_{j=1}^n)$ and $(\{g_k\}_{k=1}^n, \{\omega_k\}_{k=1}^n)$ be two p-orthonormal bases for a finite dimensional Banach space $\mathcal{X}$. If $ x \in \mathcal{X}\setminus\{0\}$ is such that $\theta_fx$ is $\varepsilon$-supported on $M\subseteq \{1,\dots, n\}$ w.r.t. p-norm and $\theta_gx$ is $\delta$-supported on $N\subseteq \{1,\dots, n\}$ w.r.t. p-norm, then we show that \begin{align}\label{ME} &o(M)^\frac{1}{p}o(N)^\frac{1}{q}\geq \frac{1}{\displaystyle \max_{1\leq j,k\leq n}|f_j(\omega_k) |}\max \{1-\varepsilon-\delta, 0\},\\ &o(M)^\frac{1}{q}o(N)^\frac{1}{p}\geq \frac{1}{\displaystyle \max_{1\leq j,k\leq n}|g_k(\tau_j) |}\max \{1-\varepsilon-\delta, 0\},\label{ME2} \end{align} where \begin{align*} \theta_f: \mathcal{X} \ni x \mapsto (f_j(x) )_{j=1}^n \in \ell^p([n]); \quad \theta_g: \mathcal{X} \ni x \mapsto (g_k(x) )_{k=1}^n \in \ell^p([n]) \end{align*} and $q$ is the conjugate index of $p$. We call Inequalities (\ref{ME}) and (\ref{ME2}) as \textbf{Functional Donoho-Stark Approximate Support Uncertainty Principle}. Inequalities (\ref{ME}) and (\ref{ME2}) improve the finite approximate support uncertainty principle obtained by Donoho and Stark \textit{[SIAM J. Appl. Math., 1989]}.

This paper introduces a novel 3D NoC router that combines buffered and bufferless routing with approximate priority comparison when deflecting flits. Our proposal is a modification of an asymmetrical router that is buffered in the z dimension ports and bufferless in the x and y dimension ports. Flits that request output ports in the x and y dimensions are granted or deflected based on approximate, instead of accurate, priority comparison. Experimental results show that the proposed router, besides effectively combining the advantages of both buffered and bufferless routers, it achieves additional performance and area gains due to the reduced logic required for approximate priority comparison in flit deflections. Experimental results using synthetic and realistic traffic show that the proposed router begins to saturate at a sifnificantly higher injection rate than a bufferless router, but at a slightly lower injection rate than when using accurate priority comparison. Furthermore, the proposed router achieves higher clock frequencies and reduced area compared to the simpler permutation network.

The recent past has witnessed a growing interest in technologies for creating chatbots. Advances in Large Language Models for natural language processing are underpinning rapid progress in chatbot development, and experts predict revolutionary changes in the labour market as many manual tasks are replaced by virtual assistants in a range of business functions. As the new technology becomes more accessible and advanced, more companies are exploring the possibilities of implementing virtual assistants to automate routine tasks and improve service. This article reports on qualitative inductive research undertaken within a chatbot development team operating in a major international enterprise. The findings identify critical success factors for chatbot projects, and, based on the in-depth case study, a model is put forward to aid the manageability of chatbot implementation. The presented model can serve as an exemplar guide for researchers and practitioners working on the design, development and implementation of virtual assistants. It is flexible and applicable in a wide range of business contexts, linking strategic business goals with execution steps. It is particularly applicable for teams with no experience of chatbot implementation, reducing uncertainty and managing decisions and risks throughout the project lifecycle, thereby increasing the likelihood of project success.

Microgrids (MGs) have evolved as critical components of modern energy distribution networks, providing increased dependability, efficiency, and sustainability. Effective control strategies are essential for optimising MG operation and maintaining stability in the face of changing environmental and load conditions. Traditional rule-based control systems are extensively used due to their interpretability and simplicity. However, these strategies frequently lack the flexibility for complex and changing system dynamics. This paper provides a novel method called hybrid intelligent control for adaptive MG that integrates basic rule-based-control and deep learning techniques, including gated recurrent units (GRU), basic recurrent neural network (RNN) and long short-term memory (LSTM). The main target of this hybrid approach is to improve MG management performance by combining the strengths of basic rule-based systems and deep learning techniques. These deep learning techniques readily enhance and adapt control decisions based on historical data and domain-specific rules, leading to increasing system efficiency, stability, and resilience in adaptive MG. Our results show that the proposed method optimises MG operation, especially under demanding conditions such as variable renewable energy supply and unanticipated load fluctuations. This study investigates special RNN architectures and hyper-parameter optimization techniques with the aim of predicting power consumption and generation within the adaptive MG system. Our promising results show the highest-performing models indicating high accuracy and efficiency in power prediction. The finest-performing model accomplishes an R2 value close to 1, representing a strong correlation between predicted and actual power values.

This article continues research efforts on performance and energy efficiency of intelligent algorithms and its role for green and sustainable computing. The introduction focusses on Bremermann's Limit and its effect on extensive approach for improvement of computers performance. The article aims to identify role of Intelligent Algorithms energy efficiency, how it differs from general software energy efficiency. An improved empirical investigation on heuristic methods for search and optimisation illustrates algorithms' energy efficiency. Experimental results and consideration of further work conclude the article.

Artificial intelligence (AI) systems of autonomous systems such as drones, robots and self-driving cars may consume up to 50% of total power available onboard, thereby limiting the vehicle’s range of functions and considerably reducing the distance the vehicle can travel on a single charge. Next-generation onboard AI systems need an even higher power since they collect and process even larger amounts of data in real time. This problem cannot be solved using the traditional computing devices since they become more and more power-consuming. In this review article, we discuss the perspectives of development of onboard neuromorphic computers that mimic the operation of a biological brain using nonlinear-dynamical properties of natural physical environments surrounding autonomous vehicles. Previous research also demonstrated that quantum neuromorphic processors (QNPs) can conduct computations with the efficiency of a standard computer while consuming less than 1% of the onboard battery power. Since QNPs is a semi-classical technology, their technical simplicity and low, compared with quantum computers, cost make them ideally suitable for application in autonomous AI system. Providing a perspective view on the future progress in unconventional physical reservoir computing and surveying the outcomes of more than 200 interdisciplinary research works, this article will be of interest to a broad readership, including both students and experts in the fields of physics, engineering, quantum technologies and computing.

To determine the photon emission or absorption probability for a diatomic system in the context of the semiclassical approximation it is necessary to calculate the characteristic canonical oscillatory integral which has one or more saddle points. Integrals like that appear in a whole range of physical problems, e.g. the atom-atom and atom-surface scattering and various optical phenomena. A uniform approximation of the integral, based on the stationary phase method is proposed, where the integral with several saddle points is replaced by a sum of integrals each having only one or at most two real saddle points and is easily soluble. In this way we formally reduce the codimension in canonical integrals of "elementary catastrophes" with codimensions greater than 1. The validity of the proposed method was tested on examples of integrals with three saddle points ("cusp" catastrophe) and four saddle points ("swallow-tail" catastrophe).

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

The performance of OpenFOAM in strong scaling tests on HPC systems with AMD EPYC processors exhibits a pronounced superlinear speedup. Simple test cases show superlinear speedups of over 300%, which significantly impacts the efficient use of computing resources. With the last generation of HPC architectures, a superlinear speedup of about 10% to 20% was well expected and accepted by CFD users. The measured superlinear speedup is much more pronounced and withstands the communication overhead to even larger scales. A detailed performance analysis of OpenFOAM follows, employing various High-Performance Computing (HPC) architectures, including AMD, ARM and Intel systems. The performance metric FVOPS (Finite VOlumes solved Per Second) is introduced to compare the performance of Computational Fluid Dynamics (CFD) applications when varying the grid size, as occurs in a strong scaling test. The achievable FVOPS depends on various factors, including the simulation type, boundary conditions, and especially the grid size of a use case. Analysing FVOPS on a single node level with varying grid size shows a significant difference in performance and cache utilization, which explains the large superlinear speedups seen in the strong scaling tests. Furthermore, FVOPS can be used as a simple benchmark to determine the optimal number of grid elements per rank to simulate a given use case at peak efficiency on a given platform, resulting in time, energy, and cost savings. The FVOPS metric also facilitates the direct comparison between different HPC architectures. The tests using AMD, ARM, and Intel processors show a peak in performance when employing around 10,000 grid elements per core. The presence of a large L3 cache on AMD processors is particularly advantageous, as indicated by L3 cache miss rates observed on AMD EPYC processors. Our results suggest that future HPC architectures with larger caches and higher memory bandwidth would benefit the CFD community.

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.

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

We approximate the trigonometric function sine and cosine on the interval . This analysis provides two formulas to approximate sine and cosine. At first, we try to derive the formula which involves a square root, and then we derive another formula that does not require any use of a square root. Nevertheless, after deriving the procedure which requires no square root, we further try to increase its accuracy and then derive another formula that approximates trigonometric functions more accurately on the interval [0, pi/2]. So, this analysis provides mainly two types of procedures. One uses square roots, whereas the other does not. We also focus on ensuring the accuracy of these trigonometric functions in the interval [0,pi/2]. This accuracy analysis is portrayed using the graph. This graph shows the difference between the values generated by the functions defined here and the actual value of these functions. So, these graphs also indicate the error of these functions on that interval. Finally, we compare our approximation with the approximation formula of the 7th-century Indian Mathematician Bhaskara I.

The use of Retrieval-augmented generation (RAG) using large language models (LLMs) has shown potential for addressing issues such as hallucinations and inadequately contextualized responses. A pivotal stage in the RAG process involves a retriever for retrieving chunks based on semantic similarity with the query. In this study, we advocate for and provide experimental evidence supporting integrating and maintaining questions and answers (QA) formatted databases to improve retrieved-context representations and response quality. Our experiments evaluate our approach on benchmark RAG datasets using standard evaluation metrics and provide comparative analyses against state-of-the-art retrieval methods, showing the potential of our approach.

This paper proposes that intelligent processes can be completely explained by thermodynamic principles. They can equally be described by information-theoretic principles that, from the standpoint of the required optimizations, are functionally equivalent. The underlying theory arises from two axioms regarding distinguishability and causality. Their consequence is a theory of computation that applies to the only two kinds of physical processes possible—those that reconstruct the past and those that control the future. Dissipative physical processes fall into the first class, whereas intelligent ones comprise the second. The first kind of process is exothermic and the latter is endothermic. Similarly, the first process dumps entropy and energy to its environment, whereas the second reduces entropy while requiring energy to operate. It is shown that high intelligence efficiency and high energy efficiency are synonymous. The theory suggests the usefulness of developing a new computing paradigm called Thermodynamic Computing to engineer intelligent processes. The described engineering formalism for the design of thermodynamic computers is a hybrid combination of information theory and thermodynamics. Elements of the engineering formalism are introduced in the reverse-engineer of a cortical neuron. The cortical neuron provides perhaps the simplest and most insightful example of a thermodynamic computer possible. It can be seen as a basic building block for constructing more intelligent thermodynamic circuits.

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.

Enhancing the management and monitoring of oil and gas processes demands developing precise predictive analytics techniques. Over the past two years, oil and its prediction have advanced significantly using conventional and modern Machine Learning techniques. Several review articles detail the developments in predictive maintenance and technical and non-technical aspects of influencing the uptake of big data. The absence of references for machine learning techniques impacts the effective optimization of predictive analytics in the oil and gas sector. This review paper offers readers thorough information on the latest machine learning methods utilized in this industry's predictive analytical modelling. The review covers forms of Machine Learning techniques used in predictive analytic modelling from 2021 to 2023 (91 articles). It provides an overview of the details of the papers that were reviewed, comprising of the model’s categories, the data's temporality, field, and name, the dataset's type, predictive analytics (classification or clustering or prediction), the models' input and output parameters, performance metrics, optimal model, and benefits and its drawbacks. Additionally, suggestions for future research directions are provided to raise the potential of the associated knowledge and increase the accuracy of oil and gas predictive analytics models.

The radio spectrum is a scarce and extremely valuable resource that demands careful real-time monitoring and dynamic resource allocation. Dynamic spectrum access (DSA) is a new paradigm for managing the radio spectrum, which requires AI/ML driven algorithms for optimum performance under rapidly changing channel conditions and possible cyber-attacks in the electromagnetic domain. Fast sensing across multiple directions using array processors, with subsequent AI/ML based algorithms for sensing and perception of the waveforms that are measured from the environment is critical for providing decision support in DSA. As part of directional and wideband spectrum perception, the ability to finely channelize wideband inputs using efficient Fourier analysis is much needed. However, a fine-grain fast Fourier transform (FFT) across a large number of directions is computationally intensive and leads to high chip area and power consumption. We address this issue by exploiting recently proposed approximate discrete Fourier transforms (ADFT) which has its own sparse factorization for real-time implementation at low complexity and power consumption. The ADFT is used to create a wideband multi-beam RF digital beamformer and temporal spectrum-based attention unit which monitors 32~discrete directions across 32~sub-bands in real-time using a multiplierless algorithm having low computational complexity. The output of this spectral attention unit is applied as a decision variable to an intelligent receiver that adapts its center frequency and frequency resolution via FFT channelizers that are custom-built for real-time monitoring at high resolution. This two-step process allows the fine-gain FFT to be applied only to directions and bands of interest as determined by the ADFT based low-complexity 2D spacetime attention unit. The fine-grain FFT provides a spectral signature that can find future use cases in neural network engines for achieving modulation recognition, IoT device identification, and RFI identification. Beamforming and spectral channelization algorithms, digital computer architecture, and early prototypes using a 32-element fully digital multichannel receiver and field programmable gate array (FPGA)-based high-speed software defined radio (SDR) is provided.

The challenging terrain and deep ravines characteristic of mountainous regions often result in slower path planning and suboptimal flight paths for Unmanned Aerial Vehicles (UAVs) when traditional meta-heuristic optimization algorithms are employed. This study investigates the application of an Improved Enhanced Snake Optimizer (IESO) for three-dimensional path planning in a simulated rugged mountainous terrain. The initialization process in the enhanced snake optimizer is refined by integrating the Chebyshev chaotic map. Additionally, a non-monotonic factor is introduced to modulate the "temperature," and a boundary condition is incorporated into the dynamic opposition learning mechanism. These modifications collectively reduce the likelihood of population convergence to local optima during optimization. The feasibility of IESO is validated through time complexity and global convergence analyses. Comparative simulation experiments benchmarked IESO against five state-of-the-art optimization algorithms across test functions and path-planning simulated scenarios. The experimental results indicate that the enhanced algorithm achieves superior optimization precision, faster convergence speeds, and improved quality in the planned trajectories by 30%.

This paper investigates the feasibility of a backend design for real-time, multiple-channel processing digital phased array system, particularly for high-performance embedded computing platforms constructed of using general purpose digital signal processors. Frist, we obtained the lab-scale backend performance benchmark from simulating beamforming, pulse compression, and Doppler filtering based on MicroTCA chassis using Serial RapidIO protocol in backplane communication. Next, a field-scale demonstrator of a multifunctional phased array radar is emulated by using the similar configuration. Interestingly, the performance of a barebone design is compared to that of emerging tools that systematically take advantage of parallelism and multicore capabilities, including Open Computing Language.

In the study of rough sets, there are many covering approximation spaces, how to classify covering approximation spaces has become a hot issue. In this paper, we propose concepts covering approximation $T_{1}$-space, $F-$symmtry, covering rough continuous mapping, covering rough homeomorphism mapping to solve this question. We also propose a new method for constructing topology in Theorem 5.1, and get the following properties: (1) For each $x\in U$, $\{X_{i}:i\in I\}\subseteq \mathcal{P}(U)$ is all the subsets of $U$ which contains $x$ and $*$ is a reflexive relation on $U$. If $V\in \tau$ is a subset of $U$ and $x\in V$, then $\underline{*}(\bigcap \limits_{i\in I}X_{i})$ is the smallest subset of $U$ and $x \in \underline{*}(\bigcap \limits_{i\in I}X_{i})\subseteq V$. Denoted by $C(x)=\bigcap \{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$. (2)If $V\in \tau$ is a subset of $U$, then $V =$ $\bigcup \limits_{x\in V} C(x)$. (3) Let $\{\underline{*}(X_{i}):x\notin \underline{*}(X_{i}), i\in I\}$, then $\overline{\{x\}}$ $=$ $U \setminus \bigcup \limits_{x\notin \underline{*}(X_{i}), i\in I}\underline{*}(X_{i})$; (4) Let $*$ be a reflexive relation on $U$. For every $X\subseteq U$, we have $int(\underline{*}(X))=\underline{*}(X)$. Where $int(\underline{*}(X))$ represents the interior of $\underline{*}(X)$. (5) Let $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ be a family subsets of $U$, then $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ is a base for $(U,\tau)$ at the point $x$. \\

Cyberattacks are rapidly evolving both in terms of techniques and frequency, from low-level attacks through to sophisticated Advanced Persistent Threat (APT). There is a need to consider how testbed environments such as cyber ranges can be readily deployed to improve examination of attack characteristics and the assessment of defences. Whilst cyber ranges are not new, they can often be computational expensive, require significant setup and configuration, or may not provide full support for areas such as logging or ongoing learning. In this paper, we propose GoibhniUWE, a container-based cyber range that provides a flexible platform for investigating the full lifecycle of a cyber attack. Adopting a modular approach, users can seamlessly switch out existing, containerised vulnerable services, deploying multiple different services at once allowing for the creation of complex and realistic deployments. The range is fully instrumented with logging capabilities from a variety of sources including Intrusion Detection Systems (IDS), service logging, and network traffic captures. To demonstrate the effectiveness of our approach, we deploy the GoibhniUWE range under multiple conditions to simulate various vulnerable environments, reporting on and comparing key metrics such as CPU and memory usage. We simulate complex attacks which span multiple services and networks, with logging at multiple levels, modelling an Advance Persistent Threat (APT) and their associated Tactics, Techniques, and Procedures (TTPs). We find that even under continuous, active and targeted deployment GoibhniUWE averaged a CPU usage of less than 2 processors and memory usage of less than 4.5 GB.

Quantum computing is tipped to lead the future of global technological progress. However, the obstacles related to quantum software development are an actual challenge to overcome. In this scenario, this work presents an implementation of the quantum search algorithm in Atos Quantum Assembly Language (AQASM) using the quantum software stack my Quantum Learning Machine (myQLM). We present the creation of a virtual quantum processor whose configurable architecture allows the analysis of induced quantum noise effects on the quantum algorithms. The codes are available throughout the manuscript so that readers can replicate them and apply the methods discussed in this article to solve their own quantum computing projects. The presented results are consistent with theoretical predictions and demonstrate that AQASM and myQLM are powerful tools for building, implementing, and simulating quantum hardware.

Quantum computing arrives. Preceded by Mādhava of Sangamagrāma and other Hindu mathematicians, around 1,500 CE, and our previous work, we show at least 4 quantum properties that are indeed universal in some number systems; here we use them to enable quantum computing. Using the sets B={0,1}, B^n, N, Z, Q, and Q*, one has +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum consciousness. Therefore, this work applies to computer calculations, apps in cell phones, algebra, atoms, mathematics, physics, and the human mind.

Market turbulence with fiscal investment influences has altered IT infrastructure performance as business pursue extravagant new technology adoption. Yet, few studies have examined how shareware solution goes beyond Medium Size Enterprise that pushes efficiency and sustainability. This PLS-SEM integrated with dual primary compilation approach lessens shallow perceptions coupled with outlooks that streamline each phenomenal activity that is worthy of the necessity for competitive innovation. This unified model was applied to sampling respondents and analyzed using an ordinal regression relationship that generates a robust association that triggers the hypothesis acceptance. The adopting of BOINC shareware mesh network towards unified processing designs that were employed to build the yield by promising financial possibility using coordinated interworks hence improved group accomplishment and establishing greater esteem. This paper showcases a flexible inner IT infrastructure alongside the economic uncertainty with the framework advancement for Exostructure as a Service. Associated theoretical and practical implications were discussed.

Moore’s law will cease to be relevant once transistors are the size of electrons. Once this occurs, we will no longer be able to use silicon for technological advancement. However, breakthroughs will continue in the form of a sixth paradigm: a 3D molecular computing model such as quantum comput- ing. Some of the promising areas of quantum computing researched in this study are (i) algorithmic advancements - such as Shor’s, Grover’s, error correction, fault tolerance and other new algorithms; (ii) hardware - such as the quantum system architecture, circuit models, entanglement, superposition and no-cloning qubits; (iii) market segments - such as finance, healthcare, and chemistry; (iv) the supremacy established over classical computing; and (v) areas of applicability. Significant progress has been made in these areas in recent decades, and they have garnered immense interest, attention and the funding required to make good progress.

A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.

A single qubit may be represented on the Bloch sphere or similarly on the $3$-sphere $S^3$. Our goal is to dress this correspondence by converting the language of universal quantum computing (uqc) to that of $3$-manifolds. A magic state and the Pauli group acting on it define a model of uqc as a POVM that one recognizes to be a $3$-manifold $M^3$. E. g., the $d$-dimensional POVMs defined from subgroups of finite index of the modular group $PSL(2,\mathbb{Z})$ correspond to $d$-fold $M^3$- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few \lq universal' knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on SnapPy. Further connections between POVMs based uqc and $M^3$'s obtained from Dehn fillings are explored.

The rapid growth of equipment tasks in 5G large-scale machine-type communication scenarios presents challenges due to user equipment’s (UE) limited computing power and power constraints. To address these limitations, task offloading to unmanned aerial vehicles (UAVs) has gained attention. However, traditional cloud computing centres far from the UE fail to meet latency requirements. Mobile Edge Computing (MEC) emerges as a solution by deploying computing servers at the edge of the cellular network to enhance service responsiveness. However, traditional MEC solutions need more flexibility. This paper explores the advantages of UAVs, including flexibility and rapid deployment, and considers UAV power constraints. It proposes a joint optimization approach for user offloading strategies and UAV trajectories to minimize the overall energy consumption of UE. By leveraging the benefits of UAVs and MEC, the proposed method aims to improve task execution efficiency in energy-constrained 5G machine-type communication scenarios.

Recommendation systems are crucial in navigating the vast digital market. However, user data’s dynamic and non-stationary nature often hinders their efficacy. Traditional models struggle to adapt to the evolving preferences and behaviours inherent in user interaction data, posing a significant challenge for accurate prediction and personalisation. Addressing this, we propose a novel theoretical framework, the Non-stationary Transformer, designed to capture and leverage the temporal dynamics within data effectively. This approach enhances the traditional transformer architecture by introducing mechanisms accounting for non-stationary elements, offering a robust and adaptable solution for recommendation systems. Our experimental analysis, encompassing deep learning and reinforcement learning paradigms, demonstrates the framework’s superiority over benchmark models. The empirical results confirm the efficacy of our proposed framework, which not only provides significant performance enhancements, approximately 8% in Logloss reduction and up to 2% increase in F1 score but also underscores its potential applicability across accumulative reward scenarios. These findings advocate adopting Non-stationary Transformer models to tackle the complexities of today’s recommendation tasks.

The fractional reduced differential transform method is a finite iterative method based on infinite fractional expansions. The result obtained is the approximation of the real value. There are few reports on the approximate error and the applicable condition. In this paper, according to the fractional expansions, we study the factors related to the approximate errors. Our research shows that the approximate errors relate not only to fractional order but also to time $t$ and increase rapidly with time $t$. This method can only be applied within a certain time range and the time range is relevant to fractional order and fractional expansions. Then, many obtained achievements may be incorrect if the applicable conditions are not satisfied. Some examples presented in this paper verify our analysis.

Linear mixed models are frequently used for analysing heterogeneous data in a broad range of applications. The restricted maximum likelihood method is often preferred to estimate co-variance parameters in such models due to its unbiased estimation of the underlying variance parameters. The restricted log-likelihood function involves log determinants of a complicated co-variance matrix. An efficient statistical estimate of the underlying model parameters and quantifying the accuracy of the estimation requires the first derivatives and the second derivatives of the restricted log-likelihood function, i.e., the observed information. Standard approaches to compute the observed information and its expectation, the Fisher information, is computationally prohibitive for linear mixed models with thousands random and fixed effects. Customized algorithms are of highly demand to keep mixed models analysis scalable for increasing high-throughput heterogeneous data sets. In this paper, we explore how to leverage an averaged information splitting technique and dedicate matrix transform to significantly reduce computations and to accelerate computing. Together with a fill-in reducing multi-frontal sparse direct solver, the averaged information splitting approach improves the performance of the computation process.

The quality of healthcare services is a very important indicator of social welfare in developed and emerging countries. Good quality levels are critical to ensuring patient safety, improving health outcomes, increasing patient satisfaction, optimizing resource utilization, and meeting regulatory requirements. The stable and sustainable operation of medical institutions urgently requires the establishment of a reliable and effective medical quality performance evaluation platform. However, the complexity of the evaluation process, involving numerous evaluators and the consideration of different subjective and objective criteria, poses significant challenges and essentially constitutes a group multi-criteria decision-making problem. This article uses the overall medical environment of the institution, medical service attitude, medical security, administrative service measures, etc. as measurement standards to deal with this challenge. It proposes a medical service quality measurement model suitable for both qualitative and quantitative analysis. In view of the heterogeneity of information, the two-tuple fuzzy language calculation method is introduced to enable evaluators to skillfully manage diverse information and effectively avoid potential information omission problems in the subjective evaluation integration process. The effectiveness and feasibility of the model were demonstrated by applying it to the operational framework of a medical institution in central Taiwan.

Presently, smartphones support a large range of applications, many of which require high computing power. This presents a problem because smartphones offer limited computing power, storage, and energy. Fortunately, Cloud computing (CC) is rapidly becoming known as the state of the art technology in the computer world. CC allows users to use unlimited dynamic resources when necessary. Mobile Cloud Computing (MCC) is integration into a mobile environment of the concept of cloud computing which eliminates barriers to the performance of mobile devices. The demand for mobile cloud applications and mobile user services is strong. This gives MCC a great opportunity to do business and research. However, security problems are a major obstacle to the adaptability of mobile cloud computing. This study presents the definitions of Cloud Computing, Mobile Computing (MC) and Mobile Cloud Computing including the architecture and applications of MCC. Furthermore, it discusses the challenges and opportunities faced in MCC.

String matching is an important part in many real world applications. It must robust against variations in string field. In record linkage for two different datasets matching should detect two patients in common in spite of small variations. But it becomes difficult in case of confidential data because sometimes data sharing between organizations become restricted for privacy purposes. Several techniques have been proposed on privacy-preserving approximate string matching such as Secure Hash Encoding etc. Relative to other techniques for approximate string matching Homomorphic encryption is very new. In this paper we have proposed a Homomorphic Encryption based approximate string matching technique for matching multiple attributes. There is no solution currently available for multiple attributes matching using Homomorphic encryption. We have proposed two different methods for multiple attributes matching. Compare to other existing approaches our proposed method offers security guarantees and greater matching accuracy.

The application of evolutionary optimization algorithms in problem solving is currently gaining wide popularity. Use of Differential Evolution (DE) algorithm in obtaining analytically approximate solution of unstable second order initial value Ordinary Differential Equation (ODE) is presented in this work. The methodology involves solving an associated problem of optimization with con-strains to get an analytically approximate solution for the ODE under consider-ation. Three test cases were used to demonstrate the efficiency of our method. In comparison with other methods discussed in the literature, our method gave significant improvement on the accuracy of the obtained results.

In this paper a new approximate procedure is developed for calculating the inclination angle of the end points of statically determinate beams. The method is based on the topology comparison of simple (hinge-roller combination) supported beam and a resemblant cantilever beam. Assuming that the support reactions of the beam are active forces, the virtual displacements at the points of the reaction forces are calculated. Based on these values the inclination angle is calculated. Several examples are considered and the suggested in this paper, while the procedure is applied for various types of structures and loadings. The results, obtained by the suggested numerical procedure, are compared with analytical ones, and they are in good agreement.

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts on solving the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL) based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding-Tao’s OL algorithm, the well-know LLL reduction is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. The experimental comparisons towards the Ding-Tao’s algorithm and ours are also provided for validating our improvements.

This article has two objectives. Firstly, we will use the vector variational-like inequalities problems to achieve local approximate (weakly) efficient solutions of Vector Optimization Problem within the novel field of the Hadamard manifolds. Previously, we will introduce the concepts of generalized approximate geodesic convex functions and illustrate them with examples. We will see the minimum requirements under which critical points, solutions of Stampacchia and Minty weak variational-like inequalities and local approximate weakly efficient solutions can be identified, extending previous results from the literature for linear Euclidean spaces. Secondly, we will show an economical application, using again solutions of the variational problems to identify with Stackelberg equilibrium points on Hadamard manifolds and under geodesic convexity assumptions.

Financial fraud poses a severe threat to the integrity of corporate financial statements and market efficiency. While auditors play a crucial role in detecting and preventing such fraud, the unique characteristics of this domain, including class imbalance, high misclassification costs, and am-biguous attributes, pose significant challenges. Traditional classification algorithms may not be optimally suited for this task. This paper proposes a novel stacking ensemble learning approach to enhanced detecting of Financial Statement Scam. By combining the strengths of multiple base learners, including Random Forest, XGBoost, and Gradient Boosting Decision Trees, our model leverages their diverse predictions to improve overall performance. A Logistic Regression me-ta-learner is employed to integrate the outputs of the base learners, capturing their collective wisdom while mitigating individual weaknesses. Extensive experimentation using a real-world dataset shown the superiority of our approach, achieving remarkable recall, precision, accuracy, and area under the curve metrics. The proposed model outperforms individual base learners, under-scoring the efficacy of ensemble learning in tackling the intricate problem of financial fraud detection. This research contributes to the creation of substantial and robust fraud detection systems, fostering trust and transparency in financial markets.

For Convolutional Neural Network (CNN), Depthwise Separable CNN (DSCNN) is a preferred architecture for Application Specific Integrated Circuit (ASIC) implementation on edge devices. It can benefit from a multi-mode approximate multiplier proposed in this work. The proposed approximate multiplier uses two 4-bit multiplication operations to implement a 12-bit multiplication operation by reusing the same multiplier array. With this approximate multiplier, sequential multiplication operations are pipelined in a modified DSCNN to fully utilize the PE array in the convolutional layer. This Approximate (A-DSCNN) was implemented on TSMC 40-nm CMOS process with a supply voltage of 0.9 V. At the clock frequency of 200 MHz, the design achieves 4.78 GOPs/mW while occupying 1.24 mm x 1.24 mm silicon area. Compared to conventional DSCNN implemented in a similar process node, the chip area and power consumption were reduced by 53% and 25%, while the throughput was improved by 17%.

This article develops applications of the generalized method of lines to numerical solutions of the time-independent, incompressible Navier-Stokes system in fluid mechanics. We recall that for such a method, the domain of the partial differential equation in question is discretized in lines (or more generally in curves), and the concerning solutions are written on these lines as functions of the boundary conditions and the domain boundary shape.

Based on some geometrical properties of the Rabinovich system the closed-form solutions of the equations has been established. Moreover the Rabinovich system is reduced to a nonlinear differential equation depending on an auxiliary unknown function. The approximate analytical solutions are built using the Optimal Auxiliary Functions Method (OAFM). A good agreement between the analytical and corresponding numerical results has been performed. The accuracy of the obtained results emphasizes that this procedure could be successfully applied for more dynamical systems with these geometrical properties.

The development of the Internet of Things (IoT) has triggered a virtual wave of interconnection and intercommunication among an enormous number of universal things. This has caused an exceptional surge of colossal heterogeneous information, known as an information explosion. Until now, cloud computing has filled in as a proficient method to process and store these data. Still, it came to light that by utilizing just cloud computing, pesky issues like, the expanding requests of actual-time or speed-sensitive applications and the restrictions on system transfer speed could not be solved. Consequently, another computing platform, called fog computing has been advanced as a supplement to the cloud arrangement. Fog computing spreads the cloud administrations and services to the edge of the system, and brings processing, communications and reserving and storage capacity closer to edge gadgets and end-clients and, in the process, aims at enhancing versatility, low latency, transfer speed and safety and protection. This paper takes an extensive and wide-ranging view of fog computing, covering several aspects. At the outset is outlined the many-layered structural design of fog computing and its attributes. After that, chief advances like communication and inter-exchange, computing, reserving and storage, asset administration, naming, safety and safeguarding of privacy are delineated while showing how this backup and facilitate the installations and various applications. Then, numerous applications like augmented reality (AR), healthcare, gaming and brain-machine interface, vehicular computing, smart scenarios etc. are highlighted to explain the fog computing application milieu. Following that, it is shown that how, despite fog computing being a features-rich platform, it is dogged by its susceptibility to several security, privacy and safety concerns, which stem from the nature of its widely distributed and open architecture. Finally, some suggestions are advanced to address some of the safety challenges discussed so as to propel the further growth of fog computing.

In this paper, we introduce new formulas for calculating the restoring and repulsive magnetic forces between two non-coaxial circular loops with parallel axes. These formulas are derived from a modified version of Grover’s formula for mutual inductance between the coils in question. Utilizing these formulas, we compute the restoring and repulsive magnetic forces between two non-coaxial thick coils of rectangular cross-sections with parallel axes. In these calculations, we apply the filament method and conduct investigations to determine the optimal number of subdivisions for the coils in terms of computational time and accuracy. The method presented in this paper is also applicable to all conventional non-coaxial coils, such as disks, solenoids, and non-conventional coils like Bitter coils, all with parallel axes. This paper emphasizes the accuracy and computational efficiency of the calculations. Furthermore, the new method is validated according to several previously established methods

The discrete element method (DEM) coupled with computational dynamics (CFD) has been considered one of the most sensitive ways of studying fluidized beds. This paper presents gas-solid fluidized bed simulations by use of CFD-DEM. The two-phase interaction is calculated in a way of decoupling. Within the effective neighborhood of the particles, the kernel approximation method is used to calculate the local porosity, thereby calculating the drag force on the particles. At the grid scale, the momentum exchange coefficient is calculated using a two fluid model based method, thereby calculating the source term of the phase interaction in the fluid control equation. The simulated form, size and motion process of the big bubble are all consistent with experimental observations. The simulated solid volume fraction and relative pressure averaged in a horizontal plane at 45 mm above the bottom are in reasonable agreement with the experimental data. The fluctuation of the simulated bed height over time is similar to the experimental measurement results. The reproduction of these qualitative and quantitative results indicates that the proposed method effectively improves simulation performance and accuracy.

The reliance on cloud computing services and related technologies has increased due to their many benefits, including resource sharing and the need for organizations to maintain their competitive advantage in the digital market. Also, the pace of cloud growth has significantly increased because of COVID-19. Many companies and businesses have shifted their core processes to the cloud for seamless operations during the pandemic. This migration of legacy systems to the cloud creates many opportunities for businesses. However, on the other hand, it may also bring substantial challenges. Hence, a careful decision is needed to align with company goals. In this paper, we demonstrate the need and advantages of cloud computing, followed by highlighting AWS's characteristics as one of the leading cloud service providers. We also discuss the merger of AWS with SDN to improve cloud data security and performance. The outcomes of this study can provide a data migration strategy and guide decision-makers toward a secure and sustainable migration to a cloud computing environment.

The reversible computation paradigm aims to provide a new foundation for general classical digital computing that is capable of circumventing the thermodynamic limits to the energy efficiency of the conventional, non-reversible paradigm. However, to date, the essential rationale for and analysis of classical reversible computing (RC) has not yet been expressed in terms that leverage the modern formal methods of non-equilibrium quantum thermodynamics (NEQT). In this paper, we begin developing an NEQT-based foundation for the physics of reversible computing. We use the framework of Gorini-Kossakowski-Sudarshan-Lindblad dynamics (a.k.a. Lindbladians) with multiple asymptotic states, incorporating recent results from resource theory, full counting statistics, and stochastic thermodynamics. Important conclusions include that, as expected: (1) Landauer's Principle indeed sets a strict lower bound on entropy generation in traditional non-reversible architectures for deterministic computing machines when we account for the loss of correlations; and (2) implementations of the alternative reversible computation paradigm can potentially avoid such losses, and thereby circumvent the Landauer limit, potentially allowing the efficiency of future digital computing technologies to continue improving indefinitely. We also outline a research plan for identifying the fundamental minimum energy dissipation of reversible computing machines as a function of speed.

An exploding demand for processing capabilities related to the emergence of the IoT, AI and big data, has led to the quest for increasingly efficient ways to expeditiously process the rapidly increasing amount of data. These ways include different approaches like improved devices capable of going further in the more Moore path, but also new devices and architectures capable of going beyond Moore and getting more than Moore. Among the solutions being proposed, Stochastic Computing has positioned itself as a very reasonable alternative for low-power, low-area, low-speed, and adjustable precision calculations; four key-points beneficial to edge computing. On the other hand, chaotic circuits and systems appear to be an attractive solution for (low-power, green) secure data transmission in the frame of edge computing and IoT in general. Classical implementations of this class of circuits require intensive and precise calculations. This paper discusses the use of the SC framework for the implementation of nonlinear systems, showing that it can provide results comparable to those of classical integration, with much simpler hardware, paving the way for relevant applications.

Relationships among near set theory, shape maps and recent accounts of the Quantum Hall effect pave the way to quantum computations performed in higher dimensions. We illustrate the operational procedure to build a quantum computer able to detect, assess and quantify a fourth spatial dimension. We show how, starting from two-dimensional shapes embedded in a 2D topological charge pump, it is feasible to achieve the corresponding four-dimensional shapes, which encompass a larger amount of information. This novel, relatively straightforward architecture not only permits to increase the amount of available qbits in a fixed volume, but also converges towards a solution to the problem of optical computers, that are not allowed to tackle quantum entanglement through their canonical superposition of electromagnetic waves.

This work emphasizes some geometrical properties of the Maxwell--Bloch equations. Based on these properties the closed-form solutions of their equations are established. Thus, the Maxwell-Bloch equations are reduced to a nonlinear differential equation depending on an auxiliary unknown function. The approximate analytical solutions were built using the Optimal Homotopy Asymptotic Method (OHAM). A good agreement between the analytical and corresponding numerical results was found. The accuracy of the obtained results is validated through the representative figures. This procedure could be successfully applied for more dynamical systems with geometrical properties.

The famous singlet correlations of a composite quantum system consisting of two spatially separated components exhibit notable features of two kinds. The first kind consists of striking certainty relations: perfect correlation and perfect anti-correlation in certain settings. The second kind consists of a number of symmetries, in particular, invariance under rotation, as well as invariance under exchange of components, parity, or chirality. In this note, I investigate the class of correlation functions that can be generated by classical composite physical systems when we restrict attention to systems which reproduce the certainty relations exactly, and for which the rotational invariance of the correlation function is the manifestation of rotational invariance of the underlying classical physics. I call such correlation functions classical EPR-B correlations. It turns out that the other three (binary) symmetries can then be obtained "for free": they are exhibited by the correlation function, and can be imposed on the underlying physics by adding an underlying randomisation level. We end up with a simple probabilistic description of all possible classical EPR-B correlations in terms of a "spinning coloured disk" model, and a research programme: describe these functions in a concise analytic way.

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.

Axial resolution is one of the most important characteristics of a microscope. In all microscopes, a high axial resolution is desired in order to discriminate information efficiently along the longitudinal direction. However, when studying thick samples that do not contain laterally overlapping information, a low axial resolution is desirable as information from multiple planes can be recorded simultaneously from a single camera shot instead of plane-by-plane mechanical refocusing. In this study, we increased the focal depth of an infrared microscope non-invasively by introducing a binary axicon fabricated on barium fluoride substrate close to the sample. Preliminary results of imaging thick and sparse silk fibers showed an improved focal depth with a slight decrease in lateral resolution and increase in background noise.

Sensory integration is an essential function of human life, and its decline causes difficulties in the quality of life, especially in older adults. In this study, we proposed an arm-reaching task based on a virtual reality head-mounted display (VR-HMD) system to assess sensory integration in daily life, and examined whether reaching task performance was associated with age and resting-state functional connectivity (rsFC) between the brain regions of interest involved in sensory integration. We hypothesized that performance during a reaching task with multiple cognitive loadings would be affected by aging. The gap angle between the reaching hand and target positions was compared between older and middle-aged adults as a measure of sensory integration function. In addition, rsFC, which was significantly correlated with the gap angles of individual participants in the older adult group, was identified using resting-state functional magnetic resonance imaging data. The mean gap angle was significantly larger in the older adults than in the middle-aged group and was also significantly correlated with connections between the left primary motor area and the left inferior temporal gyrus, temporo-occipital part. Because the connectivity between the areas is known to be related to visuomotor integration, the results suggest the involvement of visuomotor integration in the decline of sensory integration function in old age and the validity of the gap angle during the proposed VR-HMD task as an index for the decline in function.

The unprecedented progress in Artificial Intelligence (AI), particularly in deep learning algorithms with ubiquitous internet connected smart devices, has created a high demand for AI computing on the edge devices. This review studied commercially available edge processors, and the processors that are still in industrial research stages. We categorized state-of-the-art edge processors based on the underlying architecture, such as dataflow, neuromorphic, and Processing in-Memory (PIM) architecture. The processors are analyzed based on their performance, chip area, energy efficiency, and application domains. The supported programming frameworks, model compression, data precision, and the CMOS fabrication process technology are discussed. Currently, most of the commercial edge processors utilize dataflow architectures. However, emerging non-von Neumann computing architectures have attracted the industry in recent years. Neuromorphic processors are highly efficient for performing computation with fewer synaptic operations, and several neuromorphic processors offer online training for secured and personalized AI applications. This review found that the PIM processors show significant energy efficiency and consume less power compared to dataflow and neuromorphic processors. The future direction of the industry would be to implement state-of-the-art deep learning algorithms in emerging non-Von Neumann computing paradigms for low power computing on the edge devices.

Microwave technology, foundational in quantum computing, utilizes precise control of quantum states via microwave pulses to manage quantum bits (qubits). This review explores the potential of leveraging these principles in neuroscience, where such technology could enable novel approaches to imaging, diagnosing, and treating neurological disorders. By comparing the techniques used in quantum computing with potential applications in neural circuit manipulation and brain activity monitoring, we highlight both the promising synergies and the significant challenges at the intersection of these fields. This interdisciplinary exploration not only underscores the transformative potential of microwave technology in neuroscience but also addresses the ethical considerations and technological hurdles that accompany the integration of advanced quantum mechanics into biological contexts. The convergence of microwave technology with neural science opens a pathway for breakthroughs in understanding and treating complex brain disorders, advocating for a cautious yet optimistic approach towards future research and application.

Reservoir computing is a machine learning method that uses the response of a dynamical system to a certain input in order to solve a task. As the training scheme only involves optimising the weights of the responses of the dynamical system, this method is particularly suited for hardware implementation. Furthermore, the inherent memory of dynamical systems which are suitable for use as reservoirs mean that this method has the potential to perform well on time series prediction tasks, as well as other tasks with time dependence. However, reservoir computing still requires extensive task dependent parameter optimisation in order to achieve good performance. We demonstrate that by including a time-delayed version of the input for various time series prediction tasks, good performance can be achieved with an unoptimised reservoir. Furthermore, we show that by including the appropriate time-delayed input, one unaltered reservoir can perform well on six different time series prediction tasks at a very low computational expense. Our approach is of particular relevance to hardware implemented reservoirs, as one does not necessarily have access to pertinent optimisation parameters in physical systems but the inclusion of an additional input is generally possible.

The impacts of inflation on international finance are generally reflected in the decline of buying power, risks of investment and deposit loss from currency devaluation. For the purpose of optimized allocation and management of asset values, i.e., annual income or research grants, a framework of a three-level model for static financial management is presented to maximize banking interests, bonuses, and the remaining balance after spending necessary expenditures. Meanwhile, in retrospect to higher-level financial inflation, strategies of dynamic investment, i.e., posing regular tests of flipping coins, exploiting variations of the currency exchange rate, as well as applying the theory of broad money, are presented to increase the appreciation rate of net assets in and post the era of COVID-19. Quantitative evaluations in case studies verify the feasibility of improving the financial situation, indicating broader applications for budgeting and investing when US inflation rate is below 3.0%. Besides, combining approaches of static and dynamic strategies, the expected annual growth rate of individual zero-risk asset investment is predicted as within the range of 8.30~9.62% according to budgeted appreciation on net assets in 12 months, which is capable of overcoming negative impacts from higher level annual inflation, i.e., those as highest as 8.01% in the Year 2022.

Deep learning neural networks require an immense amount of computation, especially in the training phase of the network when networks with multiple layers of intermediate neurons need to be built. In this paper, we will focus on the PSO algorithm with the aim of significantly accelerating the DLNN training phase by taking advantage of the GPGPU architecture and the Apache Spark analytics engine for large-scale data processing tasks. PSO is a bio-inspired stochastic optimization method whose goal is to iteratively improve the solution to a (usually complex) problem by attempting to approximate a given objective. However, parallelizing an efficient PSO is not a straightforward process due to the complexity of the computations performed on the swarm of particles and the iterative execution of the algorithm until a solution close to the objective with minimal error is achieved. In the present work, two parallelizations of the PSO algorithm have been implemented , both designed for a distributed execution environment. The synchronous parallel PSO implementation ensures consistency at the cost of potential idle time due to global synchronization, while the asynchronous parallel PSO approach improves execution time by reducing the need for global synchronization, making it more suitable for large datasets and distributed environments such as Apache Spark. Both variants of PSO have been implemented to distribute the computational load supported by this algorithm –due to the costly fitness evaluation and updating of particle positions– across the different Spark cluster executor nodes to effectively achieve coarse-grained parallelism, resulting in a significant performance increase over current sequential variants of PSO.

Edge computing helps radio-supported mobile systems to process computing tasks on the side of servers. The proximity to an edge computing node avoids excessive latencies, which benefits the calculation of real-time algorithms. Special computing needs arise because mobile systems are often so limited in weight and energy that they cannot carry powerful on-board computers. We propose the use of FPGA-based co-processors (FPGA: Field Programmable Gate Array) to handle computations in an edge node. The calculation of the Fast Fourier Transformation (FFT) will be presented as an example of a co-processor. The use of FPGA-based co-processors poses a particular challenge when a mobile system leaves its radio cell, and the computing context must be transferred to another edge node. The article first addresses specific edge computing requirements, such as case-by-case reconfiguration of computing hardware and the handover mechanism from one edge node to another. Using the example of an FPGA-based FFT co-processor, we describe its development, which was carried out under the condition that mobile clients can request different co-processors and that they can also change the edge node when changing the radio cell. The latter requires passing the co-processor context. For the FPGA, this means that the co-processor is part of a partially reconfigurable environment and must support the handover mechanisms in hardware. At the end we indicate the need for FPGA resources and compare this with alternative solutions.

The simultaneous advances in artificial neural networks and photonic integration technologies have spurred extensive research in optical computing and optical neural networks (ONNs). The potential to simultaneously exploit multiple physical dimensions of time, wavelength and space give ONNs the ability to achieve computing operations with high parallelism and large-data throughput. Different photonic multiplexing techniques based on these multiple degrees of freedom have enabled ONNs with large-scale interconnectivity and linear computing functions. Here, we review the recent advances of ONNs based on different approaches to photonic multiplexing, and present our outlook on key technologies needed to further advance these photonic multiplexing/hybrid-multiplexing techniques of ONNs.

Optical neural networks (ONNs), or optical neuromorphic hardware accelerators, have the potential to dramatically enhance the computing power and energy efficiency of mainstream electronic processors, due to their ultra-large bandwidths of up to 10’s of terahertz together with their analog architecture that avoids the need for reading and writing data back-and-forth. Different multiplexing techniques have been demonstrated to demonstrate ONNs, amongst which wavelength-division multiplexing (WDM) techniques make sufficient use of the unique advantages of optics in terms of broad bandwidths. Here, we review recent advances in WDM-based ONNs, focusing on methods that use integrated microcombs to implement ONNs. We present results for human image processing using an optical convolution accelerator operating at 11 Tera operations per second. The open challenges and limitations of ONNs that need to be addressed for future applications are also discussed.

There are two reasons to have an efficient algorithm for identifying all maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the knowledge of maximal Lyndon substrings of the input string. Among the presented were two well-known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on iterated Duval's algorithm for Lyndon factorization, and a linear algorithmic scheme based on linear suffix sorting, computing inverse suffix array, and applying to it the Next Smaller Value algorithm. Duval's algorithm works for strings over any ordered alphabet, while for linear suffix sorting, a constant or an integer alphabet is required. The authors at that time were not aware of Baier's algorithm. In 2017, our research group proposed a novel algorithm for the Lyndon array. Though the proposed algorithm is linear in the average case and has O(n log(n)) worst-case complexity, it is interesting as it emulates the fast Fourier algorithm's recursive approach and introduces tau-reduction that might be of independent interest. In 2018, we presented a linear algorithm to compute the Lyndon array of a string inspired by Phase I of Baier's algorithm for suffix sorting. This paper presents theoretical analysis of these two algorithms and provides empirical comparisons of both their C++ implementations with respect to iterated Duval's algorithm.

Data from sensor bearing satellites requires processing aboard terrestrial data centers that use water for cooling at the expense of high data transfer latency. The reliance of terrestrial data centers on water increases their water footprint and limits the availability of water for other applications. Therefore, data centers with low data transfer latency and reduced reliance on earth’s water resources are required. This paper proposes space habitat data centers (SHDCs) with low latency data transfer and that use asteroid water to address these challenges. The paper investigates the feasibility of accessing asteroid water and the reduction in computing platform access latency. Results show that the mean asteroid water access period is 319.39 days. The use of SHDCs instead of non-space computing platforms reduces access latency and increases accessible computing resources by (11.9% – 33.6%) and (46.7% – 77%) on average respectively.

Quality of Service (QoS) has a significant role in the provision of resources within service oriented distributed systems. In Quality of Service, cloud computing creates new challenges for improvements using the concept of virtualization. Currently, Cloud Computing is very emerging technology in every field of data storage and resource distribution over the network. Considering this new emerging technology, for the ease of data accessibility, price, resource use, restoration, response time and number of constraints the quality performance measures need to be upgraded. The paper highlights the research gap in providing a solution to achieve a Quality of Services in Cloud Computing. We also review the issues and challenges arising in cloud computing to guarantee quality.

We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrations on the graph and the resulting complex. The persistent homology computation part of Flagser is based on the program Ripser [2], but is optimised specifically for large computations. The construction of the directed flag complex is done in a way that allows easy parallelisation by arbitrarily many cores. Flagser also has the option of working with undirected graphs. For homology computations Flagser has an Approximate option, which shortens compute time with remarkable accuracy. We demonstrate the power of Flagser by applying it to the construction of the directed flag complex of digital reconstructions of brain microcircuitry by the Blue Brain Project and several other examples. In some instances we perform computation of homology. For a more complete performance analysis, we also apply Flagser to some other data collections. In all cases the hardware used in the computation, the use of memory and the compute time are recorded.

Cognitive Computing has become somewhat of a rallying call in the technology world, with the promise of new smart services offered by industry giants like IBM and Microsoft. The recent technological advances in Artificial Intelligence (AI) have thrown into the public sphere some old questions about the relationship between machine computation and human intelligence. Much of the industry and media hype suggests that many traditional challenges have been overcome. On the contrary, our simple examples from language processing demonstrate that present day Cognitive Computing still struggles with fundamental, long-standing problems in AI. An alternative interpretation of cognitive computing is presented, following Licklider's lead in adopting man-computer symbiosis as a metaphor for designing software systems that enhance human cognitive performance. A survey of existing proposals on this view suggests a distinction between weak and strong versions of symbiosis. We propose a Strong Cognitive Symbiosis which dictates an interdependence rather than simply cooperation between human and machine functioning, and introduce new software systems which were designed for cognitive symbiosis. We conclude that strong symbiosis presents a viable new perspective for the design of cognitive computing systems.