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.

Musyakalah is one of the Arabic linguistic styles included under the category of majaz. This style is commonly used in Al-Quran. The Indonesian translation of Al-Quran is a case where many of the figures of speech are translated literally, thereby causing serious semantic problems. Thus, the research problem of this is formulated with the following questions: 1) How many musyakalah ayahs are there in Al-Quran?; 2) How are the musyakalah ayahs translated, literally (harfiyya) or interpretatively (tafsiriyya)?; 3) How many ayahs are translated literally and how many are translated interpretatively?; and 4) Which translated musyakalah ayahs have the potential to raise semantic and theological problems? The corpus in this research consists of all musyakalah ayahs in Al-Quran and their translation to Indonesian published by the Department of Religious Affairs of Indonesia. The research adopted a descriptive-semantic method. The findings of this research are: 1) There are only eleven ayahs in Al-Quran using musyakalah style, namely: Alhasyr ayah 19, Ali Imran ayah 54, Annaml ayah 50, Alanfal ayah 30, Asysyura ayah 40, Albaqarah ayah 15, Almaidah 116, Aljatsiah ayah 34, Attaubah ayah 79, Annisa ayah 142, and Albaqarah 194; 2) The musyakalah ayahs translated literally are: Aljatsiah 34, Almaidah 116, Asysura 40, Annaml 50, and Alhasyr 19, whereas the musyakalah ayahs translated interpretatively are Albaqarah 194, Annisa 142, Attaubah 79, Albaqarah 15, Alanfal 30, and Ali Imran 54; 3) Of the eleven musyakalah ayahs, only Alhasyr ayah 19 that is translated correctly and does not have the potential of creating misinterpretation. Meanwhile, the interpretation of the other four ayahs can potentially cause misinterpretation or are against the basic principles of Islam. The six remaining ayahs are translated interpretatively and thus do not have the potential to be misinterpreted; 4) The findings suggest that musyakalah ayahs are more appropriately translated interpretatively. Therefore, the following is recommended: 1) Considering the different characteristics of Arabic and Indonesian languages, studies on Al-Quran translation into Indonesian should continuously be carried out; 2) In order to avoid misinterpretation, it is better that the translation of musyakalah ayahs uses tafsiriyya (interpretative) approach; 3) The harfiyya (literal) and tafsiriyya (interpretative) approaches should be developed for other styles beside musyakalah..

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.

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.

Domain generalization has led to remarkable achievements in Hyperspectral Image (HSI) classification. Inspired by contrastive language-image pre-training (CLIP), the language-aware domain generalization method has been explored to learn cross-domain-invariant representation. However, existing methods face some challenges: 1) The weak capacity to extract long-range contextual information and inter-class correlation. 2) Due to the inadequacies of the large-scale pre-training for HSI data, the spatial-spectral features of HSI and linguistic features can not be straightforwardly alignment. To address the above problems, a novel network has been proposed with a CLIP framework, which consists of an image encoder, based on an encoder-only transformer to obtain the global contextual information and inter-class correlation, a frozen text encoder, and a cross-attention mechanism, named Linguistic-Interact-with-Visual Engager (LIVE), enhances the interaction between two modalities. Extensive experiments demonstrating superior performance over state-of-the-art methods in HSI Domain Generalization with a CLIP framework.

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.

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.

Supply Chain Management (SCM) encompasses a wide variety of decision-making problems that affect business and supply chain performance as a whole. Since most of these problems involve uncertainty and hesitation on the part of Decision Makers (DMs), various studies have emerged recently that present SCM applications of techniques based on Hesitant Fuzzy Linguistic Term Sets (HFLTSs) and HFLTS extensions. Given the relevance of this subject and the lack of literature review studies, this study presents a systematic review of HFLTS and HFLTS extension applications to SCM decision-making problems. In order to answer a set of research questions, the selected papers have been classified in accordance with a group of factors that are pertinent to the origins of these studies, SCM, HFLTSs, and decision-making. The results demonstrate that the Source and Enable processes have been studied with greater frequency, while the most common problems have to do with supplier selection, failure evaluation, and performance evaluation. The companies of the automotive sector and Sustainable SCM and Green SCM strategies predominate in the analyzed studies. Even though most of the studies use techniques based on HFLTSs, we have identified applications of seven distinct HFLTS extensions, with Double Hierarchy Hesitant Fuzzy Linguistic Term Sets and Probabilistic Linguistic Term Sets being the most utilized. The identification of gaps in the literature presents avenues for future studies focused on innovative applications, integrations of techniques, comparisons of techniques, group decision-making, and validation procedures for new models. The results of this study offer a panorama of the state of the art in regard to this subject and can help researchers and practitioners develop new studies which involve the use of methods that employ HFLTSs and HFLTS extensions in SCM decision-making problems.

Fermatean fuzzy linguistic (FFL) set theory provides an efficient tool for modeling a higher level of uncertain and imprecise information, which cannot be represented using intuitionistic fuzzy linguistic (IFL)/Pythagorean fuzzy linguistic (PFL) sets. On the other hand, the linguistic scale function is the better way to consider the semantics of the linguistic terms during the evaluation process. In the present paper, we first define some new modified operational laws for Fermatean fuzzy linguistic numbers (FFLNs) based on linguistic scale function (LSF) to overcome the shortcomings of the existing operational laws and prove some important mathematical properties of them. Based on it, the work defines several new aggregation operators (AOs), namely, the FFL-weighted averaging (FFLWA) operator, the FFL-weighted geometric (FFLWG) operator, the FFL-ordered weighted averaging (FFLOWA) operator, the FFL-ordered weighted geometric (FFLOWG) operator, the FFL-hybrid averaging (FFLHA) operator and the FFL-hybrid geometric (FFLHG) operator under FFL environment. Several properties of these AOs are investigated in detail. Further, based on these operators, a multiple attribute group decision-making (MAGDM) approach with FFL information is developed. Finally, to illustrate the effectiveness of the present approach, a real-life supplier selection problem is presented where the evaluation information of the alternatives is given in terms of FFLNs.

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.

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

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.

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.

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%.

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.

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.

In order to comprehensively evaluate the employee satisfaction of mine occupational health and safety management system, an analytic method based on fuzzy analytic hierarchy process and 2- tuple linguistic model was established. Firstly, based on the establishment of 5 first- grade indicators and 20 second- grade ones, the weight of each indicator is calculated and validated by method of FAHP and root mean square model. Secondly, a path based on the time-ordered Weighted Averaging Operator (T-OWA) model is constructed. Finally, the model is validated by empirical analysis. The results demonstrate that the employee satisfaction of the mine occupational health and safety management system is of the “general” rank. The method including the comprehensive evaluation of employee satisfaction and the quantitative analysis of language evaluation information ensures the authenticity of the language evaluation information.

The realm of natural language processing has always been fascinated by the intricacies of sentence semantics. The emergence of context-aware word representations, especially from pre-trained models like ELMO and BERT, has revolutionized several semantic tasks including but not limited to, question answering, text categorization, and sentiment analysis. Despite these advancements, the integration of supplementary knowledge, particularly syntactic, to augment semantic comprehension in models remains an area ripe for exploration. This paper introduces the Syntactic Enhancement Network (SEN), a pioneering method for synergizing syntactic elements with established pre-trained language models. Our approach encompasses a dual-phase evaluation: initially, we delve into the syntactic augmentation of both RNN-based and Transformer-based language models; subsequently, we test our SEN's proficiency in two specific domains: the task of sentence completion and the extraction of biological relationships. The results are striking, with SEN achieving a stellar 91.2% accuracy in sentence completion—surpassing baseline models by a substantial 37.8%. In the context of biological relation extraction, SEN demonstrates competitive prowess with a 75.1% F1 score.

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.

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.

The multiphase motors due to their reliability find new areas of application in the industry and transportation. Developing of any system with multiphase motors at first requires elaborate model of the system, define control mode and controllers. The model of control system for the six-phase drive is based on its conventional d-q mathematical model and indirect field-oriented control. Simulink model of six-phase drive with indirect field-oriented control and simulated with two types PID and PID fuzzy controllers. The simulation results, reflecting step response and provided speed reference law as well as load application at constant speed, are presented and analyzed. Fuzzy controller with 49 rules is considered and applied. Six-phase electric drive with field-oriented control at well-tuned PID controller has good step response specifications: settling time 0.13 s at starting without load, step response has no overshoot, small about 1 % short time decrease of speed at load of 5 Nm application. The system employing PID fuzzy controller shows slightly better results in response to torque application: the decrease in speed 1 % is eliminated in shorter time. Simulation results indicate the robustness of both systems with six-phase drive to disturbance and provide high quality transient specifications at determined reference speed.

The Transformer architecture, while adept at capturing context through self-attention, falls short in encapsulating complex syntactic structures effectively. Addressing this gap, we introduce the Linguistic Structure through Graphical Interpretation with BERT (LSGIB) approach in Machine Translation (MT) frameworks. Combining the strengths of Graph Attention Network (GAT) and BERT, LSGIB intricately captures syntactic dependencies as explicit knowledge from the source language. This enhances the source language representation and aids in more accurate target language generation. Our empirical analysis leverages gold-standard syntax-annotated sentences and employs a Quality Estimation (QE) model. This approach enables us to assess translation improvements in terms of syntactic accuracy, extending beyond traditional BLEU score metrics. The LSGIB model demonstrates superior translation quality across diverse MT tasks, maintaining robust BLEU scores. Our study delves into the optimal sentence lengths benefiting from LSGIB and identifies which syntactic dependencies are more precisely captured. We observe that GAT's ability to learn specific dependency relations directly influences the translation quality of sentences with those relations. Additionally, we discover that incorporating syntactic structure into BERT's intermediate and lower layers offers a novel approach to modeling linguistic structure in source sentences.

This study attempts to classify compound words on the basis of Cognitive Linguistics and compares their usage trends using Computational Linguistics. Using Noam Chomsky’s concept of deep and surface structures of a sentence, Lees treated compound words, not as separate units but as a kind of embedded sentences and hinted for possible presence of deep and surface structures in compound words, which this study tries to investigate. Then on the basis of the Idealized Cognitive Model proposed by Lakoff and Fauconnier, compound words have been classified into transparent, opaque and counterintuitive compound words. Using Google Books Corpus, this study also compares their usage trends. This is done using usage frequency, defined in this work, which is analogous to productivity for affixed words calculated by G.E.Booij. Each class of compound word formed on the basis of ICM is found to have different usage frequency. The possible reasons for this are discussed.

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.

Recent advancements in neural language models, particularly attention-based architectures like the Transformer, have substantially surpassed traditional methods in various natural language processing tasks. These models adeptly generate nuanced token representations by considering contextual relations within a sequence. However, augmenting these models with explicit syntactic knowledge, such as part of speech tags, has been found to remarkably bolster their effectiveness, especially under constrained data scenarios. This study introduces the Linguistic Enhanced Transformer (LET), which integrates multiple syntactic features, showing a notable increase in translation accuracy, evidenced by an improvement of up to 1.99 BLEU points on subsets of the WMT '14 English-German dataset. Furthermore, this paper demonstrates that enriching BERT models with syntax-aware embeddings enhances their performance on several GLUE benchmark tasks.

The E-learning system has achieved great development after the pandemic. In this work, we proposed three artificial intelligence-based enhancements to our linguistic interactive E-learning system from different aspects. Compared with the original phonetic transcription exam system, our enhancements include an MFCC+CNN-based disordered speech classification module, a Transformer-based Grapheme-to-Phoneme converter, and a Tacotron2-based IPA-to-Speech speech synthesis system. This work not only provides a better experience for the users of this system but also explores the utilization of artificial intelligence technologies in the E-learning field and linguistic field.

Two well-known drawbacks in fuzzy clustering are the requirement of assign in advance the number of clusters and random initialization of cluster centers.; the quality of the final fuzzy clusters depends heavily on the initial choice of the number of clusters and the initialization of the clusters, then it is necessary to apply a validity index to measure the compactness and the separability of the final clusters and run the clustering algorithm several times. We propose a new fuzzy C-means algorithm in which a validity index based on the concepts of maximum fuzzy energy and minimum fuzzy entropy is applied to initialize the cluster centers and to find the optimal number of clusters and initial cluster centers in order to obtain a good clustering quality, without increasing time consumption. We test our algorithm on UCI machine learning classification datasets comparing the results with the ones obtained by using well-known validity indices and variations of FCM using optimization algorithms in the initialization phase. The comparison results show that our algorithm represents an optimal trade-off between the quality of clustering and the time consumption.

This paper presents an innovative testing framework, testFAILS, designed for the rigorous evaluation of AI Linguistic Systems, with a particular emphasis on various iterations of ChatGPT. Leveraging orthogonal array coverage, this framework provides a robust mechanism for assessing AI systems, addressing the critical question, "How should we evaluate AI?" While the Turing test has traditionally been the benchmark for AI evaluation, we argue that current publicly available chatbots, despite their rapid advancements, have yet to meet this standard. However, the pace of progress suggests that achieving Turing test-level performance may be imminent. In the interim, the need for effective AI evaluation and testing methodologies remains paramount. Our research, which is ongoing, has already validated several versions of ChatGPT, and we are currently conducting comprehensive testing on the latest models, including ChatGPT-4, Bard and Bing Bot, and the LLaMA model. The testFAILS framework is designed to be adaptable, ready to evaluate new bot versions as they are released. Additionally, we have tested available chatbot APIs and developed our own application, AIDoctor, utilizing the ChatGPT-4 model and Microsoft Azure AI technologies

This study combines insights from psycholinguistics and text analysis to identify linguistic markers of intercultural competence (ICC) in 1,635 blogs about intercultural experiences, written by 672 Hotel Management students. By combining holistic ICC frameworks with a text-analytical approach at word level, we were able to demonstrate that blogs with a high perceived level of ICC contain significantly more I-words, more insights words and less quantifiers. These markers of ICC constitute concrete cues for teachers when assessing reflective writing assignments and allow them to pinpoint concrete areas for improvement in their feedback and interaction with students.

Arabic was the language of philosophy, logic, Islamic sciences and rhetorical linguistic sciences. It was used in the writing of all sciences generally and became the language of world culture. Although the other languages of the Islamic world had a little share, but all peoples of Islamic countries; Arabs and non-Arabs, Muslims and non-Muslims attributed to that movement appreciated. Hence, Arab sciences flourished in their bright ages. Arabic language was a cultural container of the ancient Greek and Latin intellectual heritage. As the ancient Greek and Latin sciences and literatures were translated into Arabic in the bright ages of Islam. Arab language was a strong bond for them, as a common human heritage for the centuries to save it from being lost, as Muslims used it to develop their sciences and arts, as Muslims in the East used the Western sciences and literatures in the modern age, because they are not Eastern or Western, but the common efforts of all humanity. Arabic language opened for the dictionaries ​​and other tongues of cross-fertilization, civil friction and simulation. Arabic had become the language of sciences: mathematics, astronomy, engineering, logic, philosophy, mysticism, agriculture, industry and economics by the continuous efforts of scientists in their scientific research, invention, experimentation, knowledge collection and classification in various fields, where orientalists recognized the Arab leadership. That scientific and literary civilization moved to Europe through Italy, Andalusia, Crusades and the Ottoman Caliphate. Europeans learned Arabic language, literature and sciences in the centers of Toledo, Fez and cities of Maghreb.

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.

Agricultural greenhouse is largely answered in the agricultural sphere, despite the shortcomings it has, including overheating during the day and night cooling which sometimes results in the thermal inversion mainly due to its low inertia. The glasshouse dressed chapel is relatively more efficient than the conventional tunnel greenhouse. Its proliferation on the ground is more or less timid because of its relatively high cost[14-22]. Agricultural greenhouse aims to create a favorable microclimate to the requirements of growth and development of culture, from the surrounding weather conditions, produce according to the cropping calendars fruits, vegetables and flower species out of season and widely available along the year. It is defined by its structural and functional architecture, the quality thermal, mechanical and optical of its wall, with its sealing level and the technical and technological accompanying[12-13]. The greenhouse is a very confined environment, where multiple components are exchanged between key stakeholders and them factors are light, temperature and relative humidity[8]. This state of thermal evolution is the level sealing of the cover of its physical characteristics to be transparent to solar, absorbent and reflective of infrared radiation emitted by the enclosure where the solar radiation trapping effect otherwise called "greenhouse effect" and its technical and technological means of air that accompany. The socio-economic analysis of populations in the world leaves appear especially the last two decades of rapid and profound transformations These changes are accompanied by changes in eating habits, mainly characterized by rising consumption spread along the year[14]. To effectively meet this demand, greenhouse-systems have evolved, particularly towards greater control of production conditions (climate, irrigation, ventilation techniques, CO2 supply, etc ...). Technological progress has allowed the development of greenhouses so that they become increasingly sophisticated and of an industrial nature (heating, air conditioning, control, computer, regulation, etc ...). New climate driving techniques have emerged, including the use of control devices from the classic to the use of artificial intelligence[10-11] such as neural networks and / or fuzzy logic, etc... As a result, the greenhouse growers prefer these new technologies while optimizing the investment in the field to effectively meet the supply and demand of these fresh products cheaply and widely available throughout the year.

The reviews usefulness has been the aim of several research studies. However, results regarding the significance of usefulness determinants are often contradicting, thus decreasing the accuracy of reviews’ helpfulness estimation. Also, bias in user reviews attributed to differences e.g. in gender, nationality, etc., may result into misleading judgments thus diminishing reviews’ usefulness. Research is needed for sentiment analysis algorithms that incorporate bias embedded in reviews, thus improving their usefulness, readability, credibility, etc. This study utilizes fuzzy relations and fuzzy synthetic evaluation (FSE) in order to calculate reviews’ usefulness by incorporating users’ biases as expressed in terms of reviews’ articulacy and sentiment polarity. It selected and analysed 95.678 hotel user reviews from Tripadvisor, for five nationalities. The findings indicate that there are differences among nationalities. The British are most consistent in their judgments expressed in titles and review documents. The British and the Greek review titles suffice to convey any negative sentiments. The Dutch use fewer words in their reviews than the other nationalities. This study suggests that fuzzy logic captures subjectivity which is often found in reviews, and it can be used to quantify users’ behavioral differences, calculate reviews usefulness, and provide the means for developing more accurate voting systems.

Exploiting the linguistic knowledge of the source language for neural machine translation (NMT) has recently achieved impressive performance on many large-scale language pairs. However, since the Turkish→English machine translation task is low-resource and the source-side Turkish is morphologically-rich, there are limited resources of bilingual corpora and linguistic information available to further improve the NMT performance. Focusing on the above issues, we propose a multi-source NMT approach that models the word feature in parallel to external linguistic features by using two separate encoders to explicitly incorporate linguistic knowledge into the NMT model. We extend the word embedding layer of the knowledge-based encoder to accommodate for each word’s linguistic annotations in the context. Moreover, we share all parameters across encoders to enhance the representation ability of the NMT model on the source language. Experimental results show that our proposed approach achieves substantial improvements of up to 2.4 and 1.1 BLEU scores in Turkish→English and English→Turkish machine translation tasks, respectively, which points to a promising way to utilize the source-side linguistic knowledge for the low-resource NMT.

This paper proposes two fully-automatic machine-extracted linguistic features from an unlimited text input for Mandarin prosody generation. One is the punctuation confidence (PC) which measures the likelihood of inserting a major punctuation mark (PM) at a word boundary. Another is the quotation confidence (QC) which measures the likelihood of a word string to be quoted as a meaningful or emphasized unit in text. Because a major PM in a text is highly correlated with a prosodic break, and a quoted word string plays an important role in human language understanding, the two features potentially could provide useful information for prosody generation. The idea is first realized by employing conditional random field (CRF)-based models to predict major PMs, quoted word string locations, and their associated confidences, i.e., the PC and the QC, for each word boundary. Then, the predicted punctuations and their confidences are combined with traditional contextual linguistic features to predict prosodic-acoustic features. Both objective and subjective tests showed that the prosody generation with the proposed linguistic features performed better than the one without the proposed features. So, the proposed PC and QC are promising features for Mandarin prosody generation.

In fuzzy decision problems, the ordering of fuzzy numbers is the basic problem. Among which, the fuzzy preference relation is the reasonable one to represent preference relation by a fuzzy membership function. This paper studies the Nakamura’s and Kołodziejczyk’s preference relations. Eight cases of representing different level of overlapping between two triangular fuzzy numbers are considered. We analyze the ranking behaviors of all possible combinations of decomposition and intersection of two fuzzy numbers for the Nakamura’s and Kołodziejczyk’s preference relations of these test cases. The results indicate that the decomposition and intersection can affect the fuzzy preference relations, thereby the final total order relation of fuzzy numbers.

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.

In this paper, we employ fuzzy Sumudu transform for solving system of linear fuzzy differential equations with fuzzy constant coefficients. The system with fuzzy constant coefficients is interpreted under strongly generalized differentiability. For this purpose, new procedures for solving the system are proposed. A numerical example is carried out for solving system adapted from fuzzy radioactive decay model. Conclusion is drawn in the last section and some potential research directions are given.

In this paper, we first define the concepts of r-fuzzy soft α-open (semi-open and δ-open) sets on fuzzy soft topological spaces based on the article Aygunoglu et al. (Hacet. J. Math. Stat., 43 (2014), 193-208), and the relations of these sets with each other are established. In addition, we introduce the concepts of fuzzy soft δ-closure (δ-interior) operators, and study some properties of them. Also, the concept of r-fuzzy soft δ-connected sets is introduced and studied with help of fuzzy soft δ-closure operators. Thereafter, we define the concepts of fuzzy soft α-continuous (β-continuous, semi-continuous, pre-continuous and δ-continuous) functions, which are weaker forms of fuzzy soft continuity, and some properties of these functions along with their mutual relationships are discussed. Moreover, a decomposition of fuzzy soft α-continuity and a decomposition of fuzzy soft semi-continuity is obtained. Finally, as a weaker form of a fuzzy soft continuity, the concepts of fuzzy soft almost (weakly) continuous functions are defined, and some properties are specified. Additionally, we explore the notion of continuity in a very general setting called, fuzzy soft (L, M, N, O)-continuous functions and a historical justification is introduced.

We generalize the concept of a fuzzy metric by introducing its approximating counterpart in order to make it more appropriate for the study of some problems related to words combinatorics. We establish close relations between fuzzy approximating metrics in case of special $t$-norms and approximating parametrized metrics, discuss some relations between fuzzy approximating metrics and fuzzy partial metrics as well as show some possible applications of approximating parametrized metrics in the problems of words combinatorics.

How people recognize linguistic and emotional prosody in different listening conditions is essential for understanding the complex interplay between social context, cognition, and communication. The perception of both lexical tones and emotional prosody depends on prosodic features including pitch, intensity, duration, and voice quality. However, it is unclear which aspect of prosody is perceptually more salient and resistant to noise. This study aimed to investigate the relative perceptual robustness of emotional prosody and lexical tone recognition in quiet and in the presence of multi-talker babble noise. Forty young adults with normal hearing listened to monosyllables either with or without background babble noise and completed two identification tasks, one for emotion recognition and the other for lexical tone recognition. Compared with emotional prosody, lexical tones were more perceptually salient in multi-talker babble noise. Native Mandarin Chinese participants identified lexical tones more accurately and quickly than vocal emotions at the same signal-to-noise ratio. Lexical tone perception is also more robust against babble speech noise degradation than emotional prosody perception for native Mandarin Chinese listeners. Acoustic and cognitive dissimilarities between linguistic prosody and emotional prosody may have led to the phenomenon, which calls for further explorations into the underlying psychobiological and neurophysiological mechanisms.

We study two fundamental linguistic channels ‒ the Sentences and the Interpunctions channels ‒ and show they can reveal deeper connections between texts. The theory applied does not follow the actual paradigm of linguistic studies. As study‒case, we consider the Greek New Testament, with the purpose of determining mathematical connections between its texts and possible differences in writing style (mathematically defined) of writers, and in reading skill required to their readers. The analysis is based on deep‒language parameters and communication/information theory. To set the New Testament texts in the larger Greek Classical Literature, we consider texts written by Aesop, Polybius, Flavius Josephus and Plutarch. The results largely confirm what scholars have found about the New Testament texts giving, therefore, credibility to the theory. The gospel according to John is very similar to Fables written by Aesop. Surprisingly, the Epistle to the Hebrews and Apocalypse, are each other “photocopy” in the two linguistic channels, and not linked to all other texts. These two texts deserve further study by historians of the early Christian Church Literature at the level of meaning, readers and possible Old Testament texts which might have influenced them. The theory can guide scholars to study any literary corpus.

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.

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 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.

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.

Water footprint has been widely used to illustrate the consumption of water in many situations; for instance, in products, processes or regions of interest. In this work, we analyzed – using a sensitivity analysis approach – the effect of some variables in the calculation of the water footprint in the viticulture in Brazilian Serra Gaúcha (the major producing region of Brazilian Wine).The classical Penman-Monteith model for evapotransporation was considered, with uncertainties in some parameters (dead mulch covering fraction in the vineyard, maximum temperatures for some months, altitudes and latitudes of the site). The sensitivity analysis was conducted using the SAFE toolbox under Octave framework. The results indicated that the the portion of the water footprint corresponding to the evapotranspiration is more sensitive to the values of mulch covering fraction and the altitude of the site in comparison with the latitude and the maximum temperatures.

This paper discusses a passive control issue for Nonlinear Time-Varying (NTV) systems subject to stability and attenuation performance. Based on the modeling approaches of Takagi-Sugeno (T-S) fuzzy model and the Linear Parameter-Varying (LPV) model, a Parameter-Dependent Polynomial Fuzzy (PDPF) model is constructed to represent the NTV systems. According to Parallel Distributed Compensation (PDC) concept, a parameter-dependent polynomial fuzzy controller is built to achieve robust stability and passivity of PDPF model. Furthermore, the passive theory is applied to achieve the performance constraining the disturbance effect on the PDPF systems. To develop the stability criteria, by introducing a parameter-dependent polynomial Lyapunov function, one can derive some stability conditions which belong to the term of Sum-Of-Squares (SOS) form. Based on the Lyapunov function, two stability criteria are proposed to design the corresponding PDPF controller such that the NTV system is robustly stable and passive. Finally, a numerical example is applied to demonstrate the effectiveness of the proposed stability criterion.

In this paper, we examine the performance of several classifiers in the process of searching for very negative opinions. More precisely, we do an empirical study that analyzes the influence of three types of linguistic features (n-grams, word embeddings, and polarity lexicons) and their combinations when they are used to feed different supervised machine learning classifiers: Support Vector Machine (SVM), Naive Bayes (NB), and Decision Tree (DT).

An article's tone and framing not only influence an audience's perception of a story but may also reveal attributes of author identity and bias. Building upon prior media, psychological, and machine learning research, this neural network-based system detects those writing characteristics in ten news agencies' reporting, discovering patterns that, intentional or not, may reveal an agency's topical perspectives or common contextualization patterns. Specifically, learning linguistic markers of different organizations through a newly released open database, this probabilistic classifier predicts an article's publishing agency with 74% hidden test set accuracy given only a short snippet of text. The resulting model demonstrates how unintentional 'filter bubbles' can emerge in machine learning systems and, by comparing agencies' patterns and highlighting outlets' prototypical articles through an open source exemplar search engine, this paper offers new insight into news media bias.

Wikipedia is the most popular and the largest user-generated source of knowledge on the Web. Quality of the information in this encyclopedia is often questioned. Therefore, Wikipedians have developed an award system for high quality articles, which follows the specific style guidelines. Nevertheless, more than 1.2 million articles in Polish Wikipedia are unassessed. This paper considers over 100 linguistic features to determine the quality of Wikipedia articles in Polish language. We evaluate our models on 500,000 articles of Polish Wikipedia. Additionally, we discuss the importance of linguistic features for quality prediction.

In this article, we first defined a stronger form of (r,s)-generalized fuzzy semi-closed sets (briefly, (r,s)-gfsc sets) called (r,s)-g*fsc sets and investigated some of its features. Moreover, we showed that (r,s)-fsc set → (r,s)-g*fsc set → (r,s)-gfsc set, but the converse may not be true. In addition, we explored novel types of fuzzy generalized mappings between double fuzzy topological spaces (U, τ, τ*) and (V, η, η*), and the relationships between these classes of mappings were examined with the help of some illustrative examples. Thereafter, we introduced novel types of higher separation axioms called (r,s)-GFS-regular and (r,s)-GFS-normal spaces with the help of (r,s)-gfsc sets and discussed some topological properties of them. Finally, some novel types of compactness via (r,s)-gfso sets were defined and the relationships between them were introduced.

This paper will present the torque control design of an AFPMSM, one stator, and one rotor, using an FLC and ANFIS in-wheels fed by a three-level T-type inverter. The Surgeon ambiguous inference file of the FLC controller is built by two input vectors, the stator current error and the derivative of the stator error. These input variables include five membership functions, Negative big (NB), Negative small (NS), Equal zero (ZE), Positive small (PS), and Positive big (PB). The FLC controller is implemented with a 5x5 matrix so that the output stator voltage of the controller is required. The ANFIS controller for the neural network-based feature set and the fuzzy system. The neural network develops the dataset on the stator current error (e) and error integral (∆e). Then, the generated dataset is fed to the fuzzy logic method, and the control rules are developed. This ANFIS controller is caused by the training and testing phases. Finally, the FLC and ANFIS torque controllers are compared with the PI controller. The correctness of the proposed control structured solution is demonstrated by the simulation results of MATLAB/SIMULINK.

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.

We propose a new Mamdani fuzzy rule-based system in which the fuzzy sets in the antecedents and consequents are assigned in a discrete set of points and approximated by using the extended inverse fuzzy transforms, whose components are calculated by verifying that the dataset is sufficiently dense with respect to the uniform fuzzy partition. We test our system in the problem of spatial analysis consisting in the evaluation of the liveability of residential housings in all the municipalities of the district of Naples (Italy). Comparisons are done with the results obtained by using trapezoidal fuzzy numbers in the fuzzy rules.

Objective: The Acute Cystitis Symptom Score (ACSS) was developed and validated as a self-reporting questionnaire for diagnosing and monitoring acute, uncomplicated cystitis (AC) in female patients. The study aims at the translation of the ACSS into Greek from original Russian as a source and American English as a new master version and at its linguistic validation. Material and Methods: Three independent professional native Greek translators, two of them experts in Russian and one in English, translated the ACSS from Russian and American English into Greek. The second group of three translators translated each of the three versions back into the original language to detect or correct any important discrepancies. These three Greek versions were then used for linguistic validation. Results: The English to Greek translation reflected more the spoken language, the two Russian to Greek translations more the written, formal language. A total of 60 randomly selected females and 30 healthcare professionals was asked about their preferences and to comment on each of the three translations. Considering all comments the scientific committee (SC) developed the Greek consensus version. For cognitive assessment additional 30 healthcare professionals and 30 females were asked to comment on the intelligibility of all items. Considering their comments the linguistically validated Greek study version was established by the SC. Conclusion: The linguistically validated Greek version of the ACSS can now be used for the clinical validation study.

Hidden markov models are a very useful tool in the modelling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden markov model to analyze the underlying structure of an ancient and complex manuscript, known as Voynich's manuscript, that remains still undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscript we train the network by means of the $\alpha$ and $\beta$-pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices in order to compare with known languages concerning the frequency of consonant and vowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.

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

Sentiment analysis to characterize properties of Bitcoin prices and their forecasting is here developed thanks to the capability of the Fuzzy transform to capture stylized facts and mutual connections between time series having different nature. Six years of daily Bitcoin Prices and Google Trends are analyzed in order to establish new perspectives in the management of their dynamics.

Decomposed fuzzy sets are the resent extension of intuitionistic fuzzy sets by incorporating functional and dysfunctional points of views to the definition of membership functions. This paper extends the Technique of Order Preference Similarity to the Ideal Solution (TOPSIS) method to the Decomposed Fuzzy TOPSIS (DF TOPSIS) method and applies it to a multi-criteria risk-based supplier selection problem under fuzziness. DF TOPSIS involves finding a positive ideal solution and a negative ideal solution and measuring the distance of each alternative to these solutions. The final ranking is obtained based on the proportion of distances to the positive and negative ideal solutions. The developed DF TOPSIS method incorporates the accuracy and consistency of expert judgments, enhancing the decision-making process. A sensitivity analysis is also presented in order to show the robustness of the obtained rankings by DF TOPSIS.

In this research paper an algorithm for the derivation of methods based on theorems and axioms of fuzzy logic is presented, analyzed and applied. This new proposed procedure generates fuzzy methods and evaluates the value of fuzzy propositions through fuzzy implication. The new implications of the family should satisfy a number of axioms. Also, we denote the conditions in order to satisfy the maximum number of axioms. Moreover, authors state and prove theorems focusing on fuzzy implication, observing the rule: the fuzzy function of fuzzy implication is strong and that lead to fuzzy negation. In addition, the optimal number of repetitions is calculated according to the expected truth value. The formulas produced are verified through the use of temperature and humidity values over a certain period of time and in a certain geographical area in Greece. The basic steps of the methodology are the fuzzification of the data given ​​using four membership degree functions and the application of the membership degrees of temperature and humidity values on a new type of fuzzy implication. Finally, we observed that the isosceles trapezium gave the best results and the type of fuzzy implication can be effectively applied.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

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.

Quantitative and qualitative fuzzy measures have been proposed to hesitant fuzzy sets (HFSs) from different points. However, few of the existing HFSs fuzzy measures refer to the grey relational analysis (GRA) theory. Actually, the GRA theory is very useful in the fuzzy measure domain, which has been developed for such the intuitionistic fuzzy sets. Therefore, in this paper, we apply the GRA theory to the HFSs and interval-valued hesitant fuzzy sets (IVHFS) domain. We propose the HFSs grey relational degree, HFSs slope grey relational degree, HFSs synthetic grey relational degree and IVHFSs grey relational degree, which describe the closeness, the variation tendency and both the closeness and variation tendency of HFSs and closeness of IVHFSs, respectively, greatly enriching the fuzzy measures of HFSs. Furthermore, with the help of the TOPSIS method, we develop the grey relational based MADM methodology to solve the HFSs and IVHFSs MADM problems. Finally, combined with two practical MADM examples about energy policy selection with HFSs information and emergency management evaluation with IVHFSs information, we obtain the most desirable decision results, and compared with the previous methods, the validity, effectiveness and accuracy of the proposed grey relational degree for HFSs and IVHFSs are demonstrated in detail.

This study addresses the prediction of recurring failures in water supply networks, a complex and costly task, but essential for the effective maintenance of these vital infrastructures. Using historical failure data provided by Companhia de Água e Esgotos da Paraíba (CAGEPA), the research focuses on predicting the time until the next failure at specific points in the network. The authors divided the failures into two categories: Occurrences of New Faults (ONF) and Recurrences of Faults (RF). To make the predictions, they used predictive models based on Machine Learning, more specifically on MLP (Multi Layer Perceptron) neural networks. The study revealed that, by analyzing data from past failures and considering factors such as altitude, number of failures on the same street and days between failures, it is possible to achieve an accuracy greater than 80% in predicting failures within a 90-day interval. This demonstrates the feasibility of using fault history to predict future water supply outages with significant accuracy. These forecasts allow water utilities to plan and optimize their maintenance, minimizing inconvenience and losses. The article contributes to the field of water infrastructure management by suggesting that the data-driven approach can be applied in other cities or in networks of different types, such as energy or communication networks. The conclusions highlight the importance of data collection and analysis in preventing failures and optimizing water utilities’ resources.

Ontology is a formalized representation of the problem area (PrA). Representation of the PrA in the form of an domain ontology is often used in the process of development of intelligent software systems and used as a knowledge base. The process of building an ontology is complex and requires an expert in the PrA. A large number of researchers are working to solve this problem. The basis of our approach is the use of a pipeline of different linguistic methods of text analysis. The set of rules developed by us is used to build an ontology based on the content analysis of a text resource. This article describes the method of building a domain ontology based on the linguistic analysis of content of text resources, presents an example of the proposed approach, and also presents the architecture of our pipeline.

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.

The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as "Kannan-graph-fuzzy contraction." This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

New notion of dimension as set, as two optimal numbers including metric number, dimension number and as optimal set are introduced in individual framework and in formation of family. Behaviors of twin and antipodal are explored in fuzzy(neutrosophic) graphs. Fuzzy(neutrosophic) graphs, under conditions, fixed-edges, fixed-vertex and strong fixed-vertex are studied. Some classes as path, cycle, complete, strong, t-partite, bipartite, star and wheel in the formation of individual case and in the case, they form a family are studied in the term of dimension. Fuzzification(neutrosofication) of twin vertices but using crisp concept of antipodal vertices are another approaches of this study. Thus defining two notions concerning vertices which one of them is fuzzy(neutrosophic) titled twin and another is crisp titled antipodal to study the behaviors of cycles which are partitioned into even and odd, are concluded. Classes of cycles according to antipodal vertices are divided into two classes as even and odd. Parity of the number of edges in cycle causes to have two subsections under the section is entitled to antipodal vertices. In this study, the term dimension is introduced on fuzzy(neutrosophic) graphs. The locations of objects by a set of some junctions which have distinct distance from any couple of objects out of the set, are determined. Thus it’s possible to have the locations of objects outside of this set by assigning partial number to any objects. The classes of these specific graphs are chosen to obtain some results based on dimension. The types of crisp notions and fuzzy(neutrosophic) notions are used to make sense about the material of this study and the outline of this study uses some new notions which are crisp and fuzzy(neutrosophic). Some questions and problems are posed concerning ways to do further studies on this topic. Basic familiarities with fuzzy(neutrosophic) graph theory and graph theory are proposed for this article.

Given a fuzzy normed space $ \left( X,N \right) $‎, ‎we will introduce the notion of fuzzy near best approximation within a relative distance $ \rho \geq 0 $‎. ‎Some basic properties are characterized and also many examples for illustration are presented‎.

In this paper, the concept of fuzzy locally convex spaces generated by a family of fuzzy seminorms is introduced. We prove that a Minkowski functional of zero neighborhoods generates a seminorm and finally deduce that the topology generated by the family of seminorms coincides with that of the Minkowski functional.

The aim of this expository article is to present recent developments in the centuries-old discussion on the interrelations between several types of domination in graphs. However, the novelty even more prominent in the newly discovered simplified presentations of several older results. Domination can be seen as arising from real-world application and extracting classical results as first described by this article.The main part of this article, concerning a new domination and older one, is presented in a narrative that answers two classical questions: (i) To what extend must closing set be dominating? (ii) How strong is the assumption of domination of a closing set? In a addition, we give an overview of the results concerning domination. The problem asks how small can a subset of vertices be and contain no edges or, more generally how can small a subset of vertices be and contain other ones. Our work was as elegant as it was unexpected being a departure from the tried and true methods of this theory that had dominated the field for one fifth a century. This expository article covers all previous definitions. The inability of previous definitions in solving even one case of real-world problems due to the lack of simultaneous attentions to the worthy both of vertices and edges causing us to make the new one. The concept of domination in a variety of graphs models such as crisp, weighted and fuzzy, has been in a spotlight. We turn our attention to sets of vertices in a fuzzy graph that are so close to all vertices, in a variety of ways, and study minimum such sets and their cardinality. A natural way to introduce and motivate our subject is to view it as a real-world problem. In its most elementary form, we consider the problem of reducing waste of time in transport planning. Our goal here is to first describe the previous definitions and the results, and then to provide an overview of the flows ideas in their articles. The final outcome of this article is twofold: (i) Solving the problem of reducing waste of time in transport planning at static state; (ii) Solving and having a gentle discussions on problem of reducing waste of time in transport planning at dynamic state. Finally, we discuss the results concerning holding domination that are independent of fuzzy graphs. We close with a list of currently open problems related to this subject. Most of our exposition assumes only familiarity with basic linear algebra, polynomials, fuzzy graph theory and graph theory.

We introduce a new variation on the domination theme which we call vertex domination as reducing waste of time in transportation planning and optimization of transport routes. We determine the vertex domination number $\gamma_v$ for several classes of fuzzy graphs. The bounds is obtained for it. In fuzzy graphs, monotone decreasing property and monotone increasing property are introduced. We prove both of the vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for vertex domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. The relationship between several classes of operations on fuzzy graphs with the vertex domination number of them is studied. Finally, we discuss about vertex dominating set of a fuzzy tree by using the bridges and $\alpha$-strong edges equivalence.

In an increasingly interconnected world, the internationalization of languages plays a pivotal role in shaping global linguistic landscapes. This qualitative study delves into the intriguing realm of Cebuano, a language with a rich cultural heritage and a vibrant community of speakers. Through a meticulous exploration of language variation, adaptation, and policy dynamics, the researcher unravels the complex interplay between Cebuano and the global linguistic tapestry. Drawing upon a comprehensive literature review and qualitative research, including in-depth interviews and focus group discussions, this paper illuminates the nuanced manifestations of Cebuano beyond its traditional borders and sheds light on its presence in diverse international settings. The findings reveal the intricate dance of language and identity, offering insights into the processes of language maintenance, shift, and revitalization. As the researcher navigates the multifaceted dimensions of Cebuano's internationalization, not only is its global significance unraveled, but also the intricate connections between language, culture, and human experience are investigated. This study not only contributes to the scholarly discourse on language dynamics but also raises compelling questions about the preservation of linguistic diversity, the power of language in shaping identities, and the role of language in fostering intercultural understanding. By embracing the kaleidoscope of Cebuano's global journey, this paper invites readers to contemplate the broader implications for language diversity, communication, and cultural preservation in an increasingly interconnected world.

COVID-19 is the first known coronavirus pandemic. Nevertheless, the seasonal circulation of the four milder coronaviruses of humans – OC43, NL63, 229E and HKU1 – raises the possibility that these viruses are the descendants of more ancient coronavirus pandemics. This proposal arises by analogy to the observed descent of seasonal influenza subtypes H2N2 (now extinct), H3N2 and H1H1 from the pandemic strains of 1957, 1968 and 2009, respectively. Recent historical revisionist speculation has focussed on the influenza pandemic of 1889-1892, based on molecular phylogenetic reconstructions that show the emergence of human coronavirus OC43 around that time, probably by zoonosis from cattle. If the “Russian influenza”, as The Times named it in early 1890, was not influenza but caused by a coronavirus, the origins of the other three milder human coronaviruses may also have left a residue of clinical evidence in the 19th century medical literature and popular press. In this paper, we search digitised 19th century British newspapers for evidence of previously unsuspected coronavirus pandemics. We conclude that there is little or no corpus linguistic signal in the UK national press for large-scale outbreaks of unidentified respiratory disease for the period 1785 to 1890.

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.

This work is mainly focused on improving the differential evolution algorithm with the utilization of shadowed and general type 2 fuzzy systems to dynamically adapt one of the parameters of the evolutionary method. In this case, the mutation parameter is dynamically moved during the evolution process by using a shadowed and general type-2 fuzzy systems. The main idea of this work is to make a performance comparison between using shadowed and general type 2 fuzzy systems as controllers of the mutation parameter in differential evolution. The performance is compared with the problem of optimizing fuzzy controllers for a D.C. Motor. Simulation results show that general type-2 fuzzy systems are better when higher levels of noise are considered in the controller.

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.

A hybrid fuzzy MADM method is proposed in this paper for evaluating airline service quality. Fuzzy set theory is used since it helps in measuring the ambiguity of concepts associated with human being’s subjective judgment. After reviewing service quality evaluation models especially in airline industry, SSQAI model was adopted as a construct for evaluating airline service quality in Iran. Fuzzy DEMATEL was applied to determine the degree of influence and impact of criteria on each other and extract cause and effect relations between them that helped in ranking criteria based on degree of relationship. Then, ANP network map was constructed based on the relation map generated from Fuzzy DEMATEL analysis. Fuzzy ANP approach assisted in prioritizing criteria based on the need for improvement and enabled in a more accurate measurement in decision making process taking the advantage of using linguistic variables. Fuzzy DEMATEL results demonstrates that expertise, Problem-solving, and conduct has the most influence on other factors and in opposite Valence, Waiting Time, Comfort are the factors which get the most impact from other factors and according to Fuzzy ANP analysis Valence, Convenience, Problem-solving, and Safety&Security are the factors with most priorities that need improvement.

Studies in the area of cross-linguistic influence (CLI) have attracted the focus of multi-linguistic learners. However, little research on CLI deals with Asian learners, particularly Chinese-speaker with knowledge of two or more foreign languages. The present study explores CLI in L1 Chinese learners with both English (L2) and Spanish (L3) as foreign languages who are studying in Madrid, a Spanish-speaking community; their studies coincided with data collection. English learners were instructed to speak for analysis purposes, with the following aims: (i) to observe the most frequent category (functional transfer, code-switching, borrowing and coinage) in the CLI instances; (ii) to determine the source language of CLI; (iii) to investigate whether CLI factors, including language distance, L2 status, proficiency and recency of use, intervene in the appearance of CLI instances in the participants. Data was gathered from 16 female Chinese students at Complutense University of Madrid (UCM). These were master students aged 22 to 26, who visited Spain for more than 5 months when they participated in the present study. The instrument used was an English semi-structured interview. Results primarily reveal that (a) borrowing is the most prevalent category, accounting for 70% of the CLI instances; (b) Spanish is the main source language of CLI while Chinese plays a functional role in the transfer process; (c) language distance proves to be the strongest predictor of CLI.

Simultaneous Localization and Mapping (SLAM) is a crucial function for most autonomous systems, allowing them to both navigate through and create maps of unfamiliar surroundings. Traditional Visual SLAM, also commonly known as VSLAM, relies on frame-based cameras and structured processing pipelines, which face challenges in dynamic or low-light environments. However, recent advancements in event camera technology and neuromorphic processing offer promising opportunities to overcome these limitations. Event cameras inspired by biological vision systems capture the scenes asynchronously consuming minimal power but with higher temporal resolution. Neuromorphic processors, which are designed to mimic the parallel processing capabilities of the human brain, offer efficient computation for real-time data processing of event-based data streams. This paper provides a comprehensive overview of recent research efforts in integrating event cameras and neuromorphic processors into VSLAM systems. It discusses the principles behind event cameras and neuromorphic processors, highlighting their advantages over traditional sensing and processing methods. Furthermore, an in-depth survey was conducted on state-of-the-art approaches in event-based SLAM, including feature extraction, motion estimation, and map reconstruction techniques. Additionally, the integration of event cameras with neuromorphic processors, focusing on their synergistic benefits in terms of energy efficiency, robustness, and real-time performance was explored. The paper also discusses the challenges and open research questions in this emerging field, such as sensor calibration, data fusion, and algorithmic development. Finally, the potential applications and future directions for event-based SLAM systems are outlined, ranging from robotics and autonomous vehicles to augmented reality.

The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

This paper mainly used database technology, machine learning, thermodynamic calculation, experimental verification, etc., on integrated computational materials engineering. The interaction between different alloying elements and the strengthening effect of precipitated phases are investigated mainly for martensitic ageing steels. Modelling and parameter optimization were performed by machine learning, and the highest prediction accuracy was 98.58%. Investigated the influence of composition fluctuation on performance and correlation tests to analyze the influence of elements from multiple perspectives. Furthermore, screen out the three-component composition process parameters with composition and performance with high contrast. Thermodynamic calculations studied the effect of alloying element content on the nano-precipitation phase, Laves phase, and austenite in the material. The heat treatment process parameters of the new steel grade were also developed based on the phase diagram. A new type of martensitic ageing steel was prepared by selected vacuum arc melting. The sample with the highest overall mechanical properties had a yield strength of 1887 MPa, a tensile strength of 1907 MPa, and a hardness of 58 HRC. The sample with the highest plasticity had an elongation of 7.8%. The machine learning process for the accelerated design of new ultra-high tensile steels was found to be generalizable and reliable.