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.

A challenge in building large-scale superconducting quantum processors is the precise control and manipulation of the qubit state. However, the crosstalk between the microwave control lines impedes the parallel execution of high-fidelity digital and analog quantum operations. Here, we propose and demonstrate a universal compensation protocol for calibrating the microwave signal crosstalk. We also introduce amplified error sequences to optimize the accuracy. Furthermore, we show a definitive improvement in parallel gate operations with crosstalk cancellation, demonstrating the technique's effectiveness. This work paves the way for superconducting hardware that features automated calibration of microwave crosstalk, leading to enhanced fidelities in multiqubit circuits.

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.

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

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.

Tremendous progress has been witnessed in artificial intelligence within the domain of neural network backed deep learning systems and its applications. As we approach the post Moore’s Law era, the limit of semiconductor fabrication technology along with a rapid increase in data generation rates have lead to an impending growing challenge of tackling newer and more modern machine learning problems. In parallel, quantum computing has exhibited rapid development in recent years. Due to the potential of a quantum speedup, quantum based learning applications have become an area of significant interest, in hopes that we can leverage quantum systems to solve classical problems. In this work, we propose a quantum deep learning architecture; we demonstrate our quantum neural network architecture on tasks ranging from binary and multi-class classification to generative modelling. Powered by a modified quantum differentiation function along with a hybrid quantum-classic design, our architecture encodes the data with a reduced number of qubits and generates a quantum circuit, loading it onto a quantum platform where the model learns the optimal states iteratively. We conduct intensive experiments on both the local computing environment and IBM-Q quantum platform. The evaluation results demonstrate that our architecture is able to outperform Tensorflow-Quantum by up to 12.51% and 11.71% for a comparable classic deep neural network on the task of classification trained with the same network settings. Furthermore, our GAN architecture runs the discriminator and the generator purely on quantum hardware and utilizes the swap test on qubits to calculate the values of loss functions. In comparing our quantum GAN, we note our architecture is able to achieve similar performance with 98.5% reduction on the parameter set when compared to classical GANs. With the same number of parameters, additionally, QuGAN outperforms other quantum based GANs in the literature for up to 125.0% in terms of similarity between generated distributions and original data sets.

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.

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.

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.

Quantum computing represents a paradigm shift in computational power, promising exponential speedups for solving certain classes of problems. However, harnessing the full potential of quantum computers requires effective utilization of data science techniques. In this review paper, we explore the intersection of data science and quantum computing, focusing on the role of data analytics in advancing quantum computing applications. We begin with an overview of quantum computing fundamentals, including quantum mechanics principles and quantum algorithms. We then delve into topics such as quantum data representation, manipulation, and machine learning algorithms tailored for quantum computing environments. Additionally, we discuss quantum error correction and noise mitigation strategies essential for reliable quantum computation. Furthermore, we survey the landscape of quantum software development tools and frameworks, highlighting their importance in facilitating quantum algorithm design and optimization. Through case studies and examples, we demonstrate the practical applications of data science techniques in quantum computing, including quantum cryptography and quantum-enhanced data analysis. Finally, we identify future research directions and challenges in the field, emphasizing the need for interdisciplinary collaboration between the data science and quantum computing communities to unlock the full potential of quantum data science.

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.

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.

It is shown that the representation theory of some finitely presented groups thanks to their $SL_2(\mathbb{C})$ character variety is related to algebraic surfaces. We make use of the Enriques-Kodaira classification of algebraic surfaces and the related topological tools to make such surfaces explicit. We study the connection of $SL_2(\mathbb{C})$ character varieties to topological quantum computing (TQC) as an alternative to the concept of anyons. The Hopf link $H$, whose character variety is a Del Pezzo surface $f_H$ (the trace of the commutator), is the kernel of our view of TQC. Qutrit and two-qubit magic state computing, derived from the trefoil knot in our previous work, may be seen as TQC from the Hopf link. The character variety of some two-generator Bianchi groups as well as that of the fundamental group for the singular fibers $\tilde{E}_6$ and $\tilde{D}_4$ contain $f_H$. A surface birationally equivalent to a $K_3$ surface is another compound of their character varieties.

The shortage of quantum computers, and their current state of development, constraints research in many fields that could benefit from quantum computing. Although the work of a quantum computer can be simulated with classical computing, personal computers take so long to run quantum experiments that they are not very useful for the progress of research. This manuscript presents an open quantum computing simulation platform that enables quantum computing researchers to have access to high performance simulations. This platform, called QUTE, relies on a supercomputer powerful enough to simulate general purpose quantum circuits of up to 38 qubits, and even more under particular simulations. This manuscript describes in-depth the characteristics of the QUTE platform and the results achieved in certain classical experiments in this field, which would give readers an accurate idea of the system capabilities.

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

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.

Harnessing Quantum Energy States for Unprecedented Computing Capabilities In this proposal, we advocate for the use of energy states as fundamental units of quantum computer programming. Each unit of programming is conceptualized as an energy state, manifested as an essence-unit. An essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach enables the recording of various forms of matter on quantum computers in essence-units, portraying their energy states. The recording of energy states is achieved through the creation of four distinct coherent potentials, facilitated by quantum dots or crystals. Crucially, these energy states embodied in essence-units resist subdivision. The study explores the intricate relationship among similarity, fractals, and uniqueness in quantum dot operations, revealing their profound implications for information transfer efficiency. Normalized entropy characterizes charge localized in quantum dot impurities in systems that have distortions. Through the utilization of N-level recording and entropy-fractal dimension equivalence, the paper elucidates the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology signifies a paradigm shift in quantum computing, presenting unparalleled possibilities for tackling hitherto insurmountable challenges.

Revealing the time structure of physical or biological objects is usually performed thanks to the tools of signal processing like the fast Fourier transform, Ramanujan sum signal processing and many other techniques. For space-time topological objects in physics and biology, we propose a type of algebraic processing based on schemes in which the discrimination of singularities within objects is based on the space-time-spin group SL(2,C). Such topological objects possess an homotopy structure encoded in their fundamental group and the related SL(2,C) multivariate polynomial character variety contains a plethora of singularities somehow analogous to the frequency spectrum in time structures. Our approach is applied to an Akbulut cork in exotic R4, to an hyperbolic model of topological quantum computing based on algebraic surfaces and to microRNAs in genetics. Such diverse topics reveal the manifold of possibilities of using the concept of a scheme spectrum.

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.

We study Einstein's gravity coupled to nonlinear electrodynamics with two parameters in Anti-de Sitter spacetime. Magnetically charged black holes in an extended phase space is investigated. We obtain the mass and metric functions, their asymptotic and corrections to the Reissner--Nordstr\"{o}m metric function when the cosmological constant vanishes. The first law of black hole thermodynamics in extended phase space is formulated and the magnetic potential and the thermodynamic conjugate to the coupling are obtained. We proved the generalized Smarr relation. The heat capacity and the Gibbs free energy are computed and phase transitions are studied. It was shown that the electric field of charged objects at the origin and electrostatic self-energy are finite within the nonlinear electrodynamics proposed.

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.

The rapid development of quantum computing devices promises powerful machines with capabilities that solve a wide range of problems that traditional computers cannot. Therefore, quantum computers generate new threats at unprecedented speed and scale and specifically pose an enormous threat to encryption. Lattice-based cryptography is considered to be the rival to a quantum computer attack and the future of post-quantum cryptography. So, cryptographic protocols based on lattices have a variety of benefits, like security, efficiency, lower energy consumption, and speed. In this work, we study the most well-known lattice-based cryptosystems while a systematic evaluation and comparison is presented also, and focuses on their strengths and weaknesses.

Hybrid Classical-Quantum computing has already arrived at several commercial quantum computers, offered to researchers and businesses. Here, application is made to a classical-quantum model of human neocortex, Statistical Mechanics of Neocortical Interactions (SMNI), which has had its applications published in many papers since 1981. However, this project only uses Classical (super-)computers. Since 2015, a path-integral algorithm, PATHINT, used previously to accurately describe several systems in several disciplines, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space described by SMNI applies nonlinear nonequilibrium multivariate statistical mechanics to synaptic neuronal interactions, while the quantum space described by qPATHINT applies synaptic contributions from Ca2+ waves generated by astrocytes at tripartite neuron-astrocyte-neuron sites. Previous SMNI publications since 2013 have calculated the astrocyte Ca2+ wave synaptic interactions from a closed-form (analytic) expression derived by the author. However, more realistic random shocks to the Ca2+ waves from ions entering and leaving these wave packets should be included using qPATHINT between electroencephalographic (EEG) measurements which decohere the quantum wave packets. This current project extends calculations to multiple scales of interaction between classical events and expectations over the Ca2+ quantum processes to include these random shocks in previous codes used to fit EEG data to the SMNI model, that included the analytic forms for the quantum processes but now replaced by qPATHINT. The author's Adaptive Simulated Annealing (ASA) importance-sampling optimization code is used for fitting the combined classical-quantum system. Gaussian Quadratures is used for numerical calculation of momenta expectations of the astrocyte processes that contribute to SMNI synaptic interactions. This project thereby demonstrates how some hybrid classical-quantum systems may be calculated quite well using only classical (super-)computers.

Hybrid Classical-Quantum computing has already arrived at several commercial quantum computers, offered to researchers and businesses. Here, applications are made to a model of financial options, Statistical Mechanics of Financial Markets (SMFM). These applications were published in many papers since the 1980's. This project only uses Classical (super-)computers to include quantum features of these models. Since 1989, an optimization code, Adaptive Simulated Annealing (ASA), has been to fit parameters in such models. Since 2015, a path-integral algorithm, PATHINT, used previously to accurately describe several systems in several disciplines, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space by SMFM applies nonlinear nonequilibrium multivariate statistical mechanics to fit parameters in conditional short-time probability distributions, while the quantum space described by qPATHINT deals specifically with quantum systems, e.g., quantum money. This project thereby demonstrates how some hybrid classical-quantum systems may be calculated quite well using only classical (super-)computers.

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

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.

Two opposed p–n diodes are connected with another junction that causes cancellation of the electric field in the depletion layer of each diode by the field of the other diode. This derived quantum diode is called the A system. Another dual diode, constructed by the same process but with the p- and n-types positioned as duality, called the B system. When a bias voltage is applied between the A and B systems, Lorentz conservation imparts a momentum (i.e., a wave number) to the carriers in the absence of any internal voltage. Thus, a superconducting bias current density appears without the need for cooling. The reappearances of electron–hole pairs on the junction surfaces are assumed to be described by entire wavefunctions normalized by the band gap. Based on the bias superconducting current, NOT and NAND gates were constructed from the quantum diode systems. Numerical calculations revealed that the constant phases of the entire wavefunctions of the p-and n-types converged. Accordingly, it was clarified that Bose–Einstein condensation and the Meissner effect (described by the London equation) occurred in the quantum diode systems. Moreover, the systems exhibited rectification characteristics and a switching speed of the order of 10^-14 s. Combining this switching property with the large bias superconducting current (of the order of several V), we developed NOT and NAND gates with direct quantum correlations among many qubits, which are unaffected by random and thermal noises. These gates have memorization and initialization properties and are compatible with existing and accumulating programing algorithms. Moreover, when harvesting a divergent current output from these systems, the bias superconducting current and memorization property preserve the formed quantum correlations.

In this paper we try to demonstrate that the classical model of certainty factos for dealing with innacurate knowledge can be efficiently implemented in a quantum environment. For this, we assume that certainty factors are strongly correlated with the quantum probability. We first explore the certainty factors approach for inexact reasoning from a classical point of view. Next, we introduce some basic aspects of quantum computing, and we pay special attention to quantum rule-based systems. We then build a use case: an inferential network to be implemented in both, the classical approach and the corresponding quantum circuit. Both implementations have been used to compare the behavior of the classical and the quantum approaches when confronted with the same hypothetical case. We analyze three different situations: (1) Only Imprecision (which refers to inaccuracy in declarative knowledge or facts) is present in the use case, (2) Only Uncertainty (which refers to inaccuracy in procedural knowledge or rules) is present in the use case, and (3) Both Imprecision and Uncertainty are present in the use case. Finally, we analyze the results to reach a conclusion about the eventually intrinsic probabilistic nature of the certainty factors model and to pave the way for future quantum implementations of this method for handling inaccurate knowledge.

Chemistry has been viewed as one of the most fruitful near-term applications to science of quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Much less effort has been placed on how one finishes these calculations by using the results from the quantum computer (on the active region of the molecule) and embeds them back into the remainder of the molecule in order to determine the properties of the entire molecule. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with classical algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

The structural, electronic and magnetochemical properties of the star-shaped polyoxopalladate [Pd₁₅O₁₀(SeO₃)₁₀]¹⁰⁻ (POPd) and its lanthanide functionalized derivatives have been investigated on the basis of density functional theory followed by a ligand field analysis using the Radial Effective Charge (REC) model. Our study predicts that heteroPOPd is a robust cryptand that enforces D_5h symmetry around the encapsulated Ln³⁺ centers. This rigid coordination environment favors interesting potential magnetic behavior in the Er and Ho derivatives, which may be of interest for molecular spintronics and quantum computing applications.

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

This study presents a modest attempt to interpret, formulate, and manipulate emotion of robots within the precepts of quantum mechanics. Our proposed framework encodes the emotion information as a superposition state whilst unitary operators are used to manipulate the transition of the emotion states which are recovered via appropriate quantum measurement operations. The framework described provides essential steps towards exploiting the potency of quantum mechanics in a quantum affective computing paradigm. Further, the emotions of multi-robots in a specified communication scenario are fused using quantum entanglement thereby reducing the number of qubits required to capture the emotion states of all the robots in the environment, and fewer quantum gates are needed to transform the emotion of all or part of the robots from one state to another. In addition to the mathematical rigours expected of the proposed framework, we present a few simulation-based demonstrations to illustrate its feasibility and effectiveness. This exposition is an important step in the transition of formulations of emotional intelligence to the quantum era.

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.

The potential of quantum computing for scientific and industrial breakthroughs is immense, however, we are still in the Noisy Intermediate-Scale Quantum (NISQ) era, where the currently available quantum devices contain small numbers of qubits, are very sensitive to environmental conditions and prone to quantum decoherence. Even so, existing NISQ computers have already been shown to outperform conventional computers on specific problems and the key question is how to make use of today’s NISQ devices to achieve quantum advantage in the field of computational science and engineering (CSE). In this direction, this work proposes a hybrid computing formulation by combining quantum computing with machine learning for accelerating the solution of parameterized linear systems in NISQ devices. In particular, it focuses on the Variational Quantum Linear Solver (VQLS), which is a hybrid quantum- classical algorithm for solving linear systems of equations. VQLS employs a short-depth quantum circuit to efficiently evaluate a cost function related to the system solution. The algorithm’s circuit consists of a quantum gate sequence (unitary operators) that involves a set of tunable parameters. Then, well-established classical optimizers are utilized to tune the parameters of the sequence in order to minimize the cost function, which is equivalent to finding the system solution at an acceptable level of accuracy. In this work, it is demonstrated that machine learning tools such as feed-forward neural networks and nearest-neighbor interpolation techniques can be successfully employed to accelerate the convergence of the VQLS algorithm towards the optimal values for the circuit parameters when applied to parameterized linear systems that need to be solved for multiple parameter instances.

Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than fully-connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multi-features in multidimensional data. In this paper, we present a multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multi-feature quantum convolution with average and Euclidean pooling and thus adapting the CNN structure to a variational quantum algorithm (VQA). Average pooling is based on the quantum Haar transform (QHT) and Euclidean pooling is based on partial quantum measurement. The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results showed favorable characteristics of our proposed techniques compared to existing work with respect to a number of quantitative metrics such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count.

In this study, based on a new quantum integral identity, the authors establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.

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.

Quantum correlations, especially time correlations, are crucial in ghost imaging in order to significantly reduce the background noise on the one hand while increasing the imaging resolution. Moreover, the time correlations serve as a critical reference, distinguishing between signal and noise, which in turn enable clear visualization of biological samples. Quantum imaging also addresses the challenge involved in imaging delicate biological structures with minimal photon exposure and sample damage. Here we explore the recent progress in quantum correlation-based imaging, notably its impact on secure imaging and remote sensing protocols as well as on biological imaging. We also exploit the quantum characteristics of heralded single-photon sources (HSPS) combined with decoy-state methods for secure imaging. This method uses Quantum Key Distribution (QKD) principles to reduce measurement uncertainties and protect data integrity. It is highly effective in low-photon-number regimes for producing high-quality, noise-reduced images. The versatility of decoy-state methods with WCSs (WCS) is also discussed, highlighting their suitability for scenarios requiring higher photon numbers. We emphasize the dual advantages of these techniques: improving image quality through noise reduction and enhancing data security with quantum encryption, suggesting significant potential for quantum imaging in various applications, from delicate biological imaging to secure quantum communication.

Social media has become the most influential battleground for political and societal debate. The reach, the speed, and the fact that everybody can participate make this medium very popular but also highly manipulative, subject to biases and extremely precious to control. Misinformation spreads in an unforeseeable way. Sometimes it just follows usual non-malicious social interaction patterns, but often a targeted and designed-for-purpose manner. In this paper, we propose a novel method to identify the most effective opportunities to moderate the social media debate at a large scale using the properties of social signed graphs, such as structural balance. After building the topic universe for a particular political debate in a given time frame, we extract the most active and influential users and mine their position regarding the topic based on their interactions with other users. The result is a signed graph where each edge represents either support or challenge between a pair of users in the context of the topic. This graph can be modelled as an Ising model, with the goal of minimizing its energy state by using the advantages of Adiabatic Quantum Computing. Applying this principle, we use a Quantum Annealing implementation to solve the problem of finding the edges violating the structural balance of this graph, which in classic computing is known to be an NP-hard problem. We then provide a non-intrusive moderation technique for those violations to mitigate or increase the structural imbalance, depending on the desired strategy. The methodology is shown in the context of the COVID-19 skeptics’ debate in Twitter and implemented using a D-Wave 2000Q-6 quantum annealer.

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.

We introduce optically clear and resilient free-form micro-optical of pure (non-photosensitized) organic-inorganic SZ2080 material made by femtosecond 3D laser lithography (3DLL). This is advantageous for rapid printing of 3D micro-/nanooptics, including their integration directly onto optical fibers. A systematic study on the fabrication peculiarities and quality of resultant structures is performed. Comparison of microlenses’ resiliency to CW and femtosecond pulsed exposure is determined. Experimental results prove that pure SZ2080 is ∼3 fold more resistant to high irradiance as compared with a standard photo-sensitized material and can sustain up to 1.91 GW/cm² intensity. 3DLL is a promising manufacturing approach for high-intensity micro-optics for emerging fields in astro-photonics and atto-second pulse generation. Additionally, pyrolysis is employed to shrink structures up to 40% by removing organic SZ2080 constituents. This opens a promising route towards downscaling photonic lattices and creation of mechanically robust glass-ceramic structures.

In recent years, advancements in brain science and neuroscience have significantly influenced the field of computer science, particularly in the domain of reinforcement learning (RL). Drawing insights from neurobiology and neuropsychology, researchers have leveraged these findings to develop novel mechanisms for understanding intelligent decision-making processes in the brain. Concurrently, the emergence of quantum computing has opened new frontiers in artificial intelligence, leading to the development of quantum machine learning (QML). This study introduces a novel model that integrates Quantum Spiking Neural Networks (QSNN) and Quantum Long Short-Term Memory (QLSTM) architectures, inspired by the complex workings of the human brain. Specifically designed for reinforcement learning tasks in energy-efficient environments, our approach progresses through two distinct stages mirroring sensory and memory systems. In the initial stage, analogous to the brain’s hypothalamus, low-level information is extracted to emulate sensory data processing patterns. Subsequently, resembling the hippocampus, this information is processed at a higher level, capturing and memorizing correlated patterns. We conduct a comparative analysis of our model against existing quantum models such as Quantum Neural Networks and their classical counterparts, elucidating its unique contributions. Through empirical results, we aim to underscore the effectiveness of our approach in optimizing energy consumption in practical scenarios.

RNA transcripts play a crucial role as witnesses of gene expression health. Identifying disruptive short sequences in RNA transcription and regulation is essential for potentially treating diseases. Let’s delve into the mathematical intricacies of these sequences. We’ve previously devised a mathematical approach for defining a “healthy” sequence (10.14218/GE.2023.00079). This sequence is characterized by having at most four distinct nucleotides (denoted as nt≤4). It serves as the generator of a group denoted as fp. The desired properties of this sequence are as follows: fp should be close to a free group of rank nt−1, it must be aperiodic, fp should not have isolated singularities within its SL2(C) character variety (specifically within the corresponding Groebner basis). Now, let’s explore the concept of singularities. There are cubic surfaces associated with the character variety of a four-punctured sphere denoted as S24. When we encounter these singularities, we find ourselves dealing with some algebraic solutions of a dynamical second-order differential (and transcendental) equation known as the Painlevé VI equation (10.3390/dynamics4010001). In certain cases, S24 degenerates, in the sense that two punctures collapse, resulting in a “wild” dynamics governed by the Painlevé equations of an index lower than VI. In our paper, we provide examples of these fascinating mathematical structures within the context of miRNAs. Specifically, we find a clear relationship between decorated character varieties of Painlevé equations and the character variety calculated from the seed of oncomirs. These findings should find applications in cancer research.

This paper draws upon the theory of turbulence in physics to explore the similarities and differences between volatility in financial markets and turbulent phenomena at a statistical physics level. By analogizing the dynamics of financial markets with fluid turbulence, we have developed an innovative analytical framework aimed at deepening the understanding of the complexity inherent in financial markets. Our research methodology includes a comparative analysis of simulated time series data for the Standard & Poor's 500 Index and fully developed turbulent velocity time series. We focus on the similarities in key statistical physical properties, including probability distributions, correlation structures, and power spectral densities. Furthermore, we have established a model of capital flow in financial markets and proposed corresponding solutions. Through computational simulations and data analysis, we find that while financial market volatility shares some statistical characteristics with turbulent phenomena, significant differences exist in the shapes of probability distributions and the temporal scales of correlations. This suggests that although financial markets exhibit patterns akin to turbulence, the behavior of this complex, multi-variable driven system does not completely correspond to natural turbulence, highlighting the limitations of directly applying turbulence theory to financial market analysis. Our study offers a new perspective for the theories of financial markets and the field of econophysics, providing fresh insights into the complexity of financial markets and contributing to the prevention and management of financial risk.

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.

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.

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.

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.

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.

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.

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.

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.

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.

1) We shall discuss what modern interpretations say about the Heisenberg's uncertainties. These interpretations explain that a quantity begins to 'lose' meaning when a conjugate property begins to 'acquire' definite meaning. We know that a quantity losing meaning means that it has no fixed value and has an uncertainty . In this paper we look deeper into this interpretation and the outcome reveals more evidence of the quantity losing meaning. Newer insights appear. 2) We consider two extreme cases of hypothetical processes nature undergoes, without interference by a measurement: One, a system collapses to an energy eigenstate under the influence of a Hamiltonian instantaneously at a time $t$. This is thus what would happen if we would measure the system's energy. Next, when a particle becomes localised to a point at a time $t_0$ under the influence of a Hamiltonian. This is thus what would happen if we would measure the system's position. We shall prove that both these situations cannot arise under ordinary circumstances and thus measurement processes cannot be modelled by physical Hamiltonians.

Huperzine A is an herbal reversible inhibitor of Acetylcholinesterase (AChE). A molecular docking analysis on Huperzine A molecule has been carried out to understand its structure, conformational flexibility, intermolecular interaction and the binding affinity in the active site of AChE enzyme. Further, the charge density distribution of huperzine A molecule (lifted from the active site of AChE) was determined from the high level quantum chemical calculations coupled with charge density analysis. The binding affinity of Huperzine A towards AChE was calculated from the molecular docking; the lowest docked energy is -8.46 kcal/mol. In the active site, huperzine A molecule interacts with acyl binding pocket-Phe330 of AChE, that is, the bicyclo ring group of huperzine A forms an intermolecular interaction with the oxygen atom of main chain of the amino acid residue Phe330 at the distances 3.02 and 3.25 Å respectively. On the other hand, a gas phase study on huperzine A molecule also performed using HF and DFT (B3LYP) methods with the basis set 6-311G**. The molecular structure, conformation, and the charge density distribution of huperzine A molecule in the gas phase have determined using quantum chemical calculations and the charge density analysis. The comparative studies between the gas phase and the active site forms of huperzine A molecule, explicitly reveals the degree of conformational modification and the charge density redistribution of huperzine A when present in the active site. The dipole moment of the molecule in the active site is 6.85 D, which is slightly higher than its gas phase value (5.91 D). The electrostatic potential (ESP) surface of active site molecule clearly shows the strong electronegative and positive ESP regions of the molecule, which are the expected strong reactive locations of the molecule.

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.

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.

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.

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.

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.

Nearest-neighbour clustering is a simple yet powerful machine learning algorithm that finds natural application in the decoding of signals in classical optical-fibre communication systems. Quantum k-means clustering promises a speed-up over the classical k-means algorithm; however, it has been shown to currently not provide this speed-up for decoding optical-fibre signals due to the embedding of classical data, which introduces inaccuracies and slowdowns. Although still not achieving an exponential speed-up for NISQ implementations, this work proposes the generalised inverse stereographic projection as an improved embedding into the Bloch sphere for quantum distance estimation in k-nearest-neighbour clustering, which allows us to get closer to the classical performance. We also use the generalised inverse stereographic projection to develop an analogous classical clustering algorithm and benchmark its accuracy, runtime and convergence for decoding real-world experimental optical-fibre communication data. This proposed `quantum-inspired' algorithm provides an improvement in both the accuracy and convergence rate with respect to the k-means algorithm. Hence, this work presents two main contributions. Firstly, we propose the general inverse stereographic projection into the Bloch sphere as a better embedding for quantum machine learning algorithms; here, we use the problem of clustering quadrature amplitude modulated optical-fibre signals as an example. Secondly, as a purely classical contribution inspired by the first contribution, we propose and benchmark the use of the general inverse stereographic projection and spherical centroid for clustering optical-fibre signals, showing that optimizing the radius yields a consistent improvement in accuracy and convergence rate.

Every finite simple group P can be generated by two of its elements. Pairs of generators forP are available in the Atlas of finite group representations as (not necessarily minimal) permutation representations P . It is unusual but significant to recognize that a P is a Grothendieck’s dessin d’enfant D and that a wealth of standard graphs and finite geometries G - such as near polygons and their generalizations - are stabilized by a D. In our paper, tripods P − D − G of rank larger than two,corresponding to simple groups, are organized into classes, e.g. symplectic, unitary, sporadic, etc (as in the Atlas). An exhaustive search and characterization of non-trivial point-line configurationsdefined from small index representations of simple groups is performed, with the goal to recognize their quantum physical significance. All the defined geometries G's have a contextuality parameterclose to its maximal value 1.

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.

We discuss the fate of the correspondence principle beyond quantum mechanics, specifically in quantum field theory and quantum gravity, in connection with the intrinsic limitations of the human ability to observe the external world. We conclude that the best correspondence principle is made of unitarity, locality, proper renormalizability (a refinement of strict renormalizability), combined with fundamental local symmetries and the requirement of having a finite number of fields. Quantum gravity is identified in an essentially unique way. The gauge interactions are uniquely identified in form. Instead, the matter sector remains basically unrestricted. The major prediction is the violation of causality at small distances.

In this paper we will show that standard physics to a large degree consists of derivatives of a deeper reality. This means standard physics is both overly complex and also incomplete. Modern physics has typically started from working with first understanding the surface of the world, that is typically the macroscopic world, and then forming theories about the atomic and subatomic world. And we did not have much of a choice, as the subatomic world is very hard to observe directly, if not impossible to observe directly at the deepest level. Despite the enormous success of modern physics, it is therefore no big surprise that we at some point have possibly taken a step in the wrong direction. We will claim that one such step came when one thought that the de Broglie wavelength represented a real matter wavelength. We will claim that the Compton wavelength is the real matter wavelength. Based on such a view we will see that many equations in modern physics are only derivatives of much simpler relations. Second, we will claim that in today’s physics one uses two different mass definitions, one mass definition that is complete or at least more complete, embedded in gravity equations without being aware of it, as it is concealed in GM, and the standard, but incomplete, kg mass definition in non-gravitational physics. First, when this is understood, and one uses the more complete mass definition that is embedded in gravity physics, not only in gravity physics, but in all of physics, then one has a chance to unify gravity and quantum mechanics. Our new theory shows that most physical phenomena when observed over a very short timescale are probabilistic for masses smaller than a Planck mass and dominated by determinism at or above Planck mass size. Our findings have many implications. For example, we show that the Heisenberg uncertainty principle is rooted in a foundation not valid for rest-mass particles, so the Heisenberg uncertainty principle can say nothing about rest-masses. When re-formulated based on a foundation compatible with a new momentum that is also compatible with rest-masses, we obtain a re-defined Heisenberg principle that seems to become a certainty principle in the special case of a Planck mass particle. Furthermore, we show that the Planck mass particle is linked to gravity and that we can easily detect the Planck scale from gravity observations. The Planck mass particle is unique as it only lasts the Planck time, and in that very short time period it can only be observed directly from itself, and it therefore closely linked to absolute rest.

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.

We investigate a possible reduction mechanism from (bosonic) Quantum Field Theory (QFT) to Quantum Mechanics (QM), in a way that could explain the apparent loss of degrees of freedom of the original theory in terms of quantum information in the reduced one. This reduction mechanism consists mainly in performing an ansatz on the boson field operator, which takes into account quantum foam and non-commutative geometry. Through the reduction mechanism, QFT reveals its hidden internal structure, which is a quantum network of maximally entangled multipartite states. In the end, a new approach to the quantum simulation of QFT is proposed through the use of QFT's internal quantum network

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.

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.

Mobile Cloud Computing(MCC) is a recent technology used by various users worldwide. In 2015, more than 240 million users used mobile cloud computing which gives a profit of $5.2 billion to service providers. MCC is a combination of Mobile computing and cloud computing. By the combination of these two, it gives various challenges like network access, elasticity, management, availability, security, privacy, etc. Here security issues are considered because both the security issues of mobile computing and cloud computing are considered as important like data security, virtualization security, partitioning security, Mobile cloud application security, Mobile device security. This paper gives a detailed study of security issues in mobile cloud computing and its prevention measures.

This article will provide an overview on internet of things (IoT), 5G communication System and Distributed Clouds. The basic concepts and benefits will be briefly presented, along with current standardization activities. In a nutshell, but the research will focus on relating internet of things, 5G and Distributed Cloud Computing.

In the era when the market segment of Internet of Things (IoT) tops the chart in various business reports, it is apparently envisioned that the field of medicine expects to gain a large benefit from the explosion of wearables and internet-connected sensors that surround us to acquire and communicate unprecedented data on symptoms, medication, food intake, and daily-life activities impacting one’s health and wellness. However, IoT-driven healthcare would have to overcome many barriers, such as: 1) There is an increasing demand for data storage on cloud servers where the analysis of the medical big data becomes increasingly complex; 2) The data, when communicated, are vulnerable to security and privacy issues; 3) The communication of the continuously collected data is not only costly but also energy hungry; 4) Operating and maintaining the sensors directly from the cloud servers are non-trial tasks.This book chapter defined Fog Computing in the context of medical IoT. Conceptually, Fog Computing is a serviceoriented intermediate layer in IoT, providing the interfaces between the sensors and cloud servers for facilitating connectivity, data transfer, and queryable local database. The centerpiece of Fog computing is a low-power, intelligent, wireless, embedded computing node that carries out signal conditioning and data analytics on raw data collected from wearables or other medical sensors and offers efficient means to serve telehealth interventions. We implemented and tested an fog computing system using the Intel Edison and Raspberry Pi that allows acquisition, computing, storage and communication of the various medical data such as pathological speech data of individuals with speech disorders, Phonocardiogram (PCG) signal for heart rate estimation, and Electrocardiogram (ECG)-based Q, R, S detection. The book chapter ends with experiments and results showing how fog computing could lessen the obstacles of existing cloud-driven medical IoT solutions and enhance the overall performance of the system in terms of computing intelligence, transmission, storage, configurable, and security. The case studies on various types of physiological data shows that the proposed Fog architecture could be used for signal enhancement, processing and analysis of various types of bio-signals.

This paper gives both a general canonical quantum gravity theory and the general canonical quantum gravity theories of the Universe and general black hole, and discovers the relations reflecting symmetric properties of the standard nonlinear gravitational Lagrangian, which are not relevant to any concrete metric models. This paper concretely shows the general commutation relations of the general gravitational field operators and their zeroth, first, second and third style, respectively, of high order canonical momentum operators for the general nonlinear system of the standard gravitational Lagrangian, and then has finished all the four styles of the canonical quantization of the standard gravity.

Helical (frontier) molecular orbitals [Chem. Sci. 2013, 4, 4278] have been reported almost a decade ago. Yet, helical molecular spin densities [Mol. Phys. 2022, e2157774] have been observed by us only very recently. In this work, we have observed that some chiral boron clusters (B–16, B–20, B–24, and B–28) can simultaneously have helical molecular orbitals and helical spin densities. To our best knowledge, it is the first time we have discovered that inorganic boron clusters assume such an unprecedented property. We have unambiguously unraveled that it is chiral Jahn-Teller distortion of quasi-planar boron clusters that drives the formation of helical molecular spin densities. More interestingly, we have shown that elongation/enhancement of helical molecular orbitals can be achieved by simply adding more building blocks via a linker. Aromaticity properties of these boron clusters are also discussed. Implication of this work is straightforward that boron clusters may find potential applications in spintronics, such as molecular magnets.

“For me then this is the real problem with quantum theory: the apparently essential conflict between any sharp formulation and fundamental relativity. That is to say, we have an apparent incompatibility, at the deepest level, between the two fundamental pillars of contemporary theory...” J. S. Bell (2004, p. 171) The inability to delineate a unified physical ontology that accounts simultaneously for the laws of special relativity and the results of quantum experiments has been a defining problem in physics for more than 100 years. Although various primitive ontologies (including Bohmian pilot wave, spontaneous collapse, and objective collapse theories) along with wave function realism ontologies, many-worlds interpretations, and multi-field theories address the tension between special relativity and quantum mechanics, none has successfully resolved it. This analysis addresses the problem by positing an ontic, mixed ontology composed of a “discrete” 4D spacetime and a physical, ultra-high dimensional (3 x N) “Planck Space.” Together, Planck Space and the three spatial dimensions of 4D spacetime form a tightly integrated ((3 x N) + 3) hyperspace (the “Dual Ontology”). 4D spacetime’s three spatial dimensions and the N dimensions of Planck Space are composed of two substructures: discrete, three-dimensional, quantized units of space ("Planck Spheres") and an ontic State of Absolute Nothingness (the "SOAN") whose sole physical characteristic is onticness. Critically, the Dual Ontology’s structure replaces 1) the continuous, differentiable manifold of 4D spacetime with a discrete 4D spacetime and 2) mathematical 3N configuration spaces with a physical (3 x N) Planck Space. Moreover, structurally and dynamically, the Dual Ontology is predicated on the one-to-one mapping and identity between the Planck Spheres that simultaneously form 4D spacetime and Planck Space. The one-to-one mapping and identity physically and theoretically support an integrated quantum dynamics based upon the dynamic evolution of single and N-body quantum states in 4D spacetime in full compliance with the laws of special relativity and the instantaneous collapse of all quantum states in an ontic Planck Space, where special and general relativity and more generally, 4D spacetime’s laws of physics, do not apply.

This article provides a general overview of the bio-inspired computing method called DNA-Based Computing (DBC), including its theory and applications. The main theme of DBC is the central dogma of molecular biology (once information of DNA/RNA has got into a protein, it can’t get out again), i.e., DNA to RNA (sequences of four types of nucleotides) and DNA/RNA to protein (sequence of twenty types of amino acids) are allowed, not the reverse ones. Thus, DBC transfers few-element information (DNA/RAN-like) to many-element information (protein-like), solving a given cognitive problem. DBC can take many forms; this article elucidates two main forms, denoted as DBC-1 and DBC-2. Using arbitrary numerical examples, it is shown that DBC-1 can solve the following cognitive problems: “similarity indexing between seemingly different but inherently identical objects” and “recognizing regions of an image separated by a complex boundary.” DBC-2 can solve the following cognitive problem: “pattern recognition when the relevant information is insufficient.” Smart manufacturing-based systems (digital twins and big data analytics) must solve the abovementioned problems to make the manufacturing enablers (machine tools and monitoring systems) more self-reliant and autonomous. Consequently, DBC can improve the cognitive problem-solving ability of smart manufacturing-relevant systems and, thereby, can enhance its biologicalization.

Recently, there has been a growing interest in distributed edge computing resource scheduling. For example, application scenarios such as intelligent traffic systems and Internet of Things(IoT) intelligent monitoring require the scheduling and migration of distributed resources. Distributed resource scheduling needs to consider the cost of resource scheduling, with the primary goal of finding the optimal strategy among various feasible solutions. There are different definitions for optimization objectives in different application scenarios, such as cost, transmission delay, energy consumption, etc. Current research mainly considers the optimization problem of local resource scheduling but needs more consideration of global resource scheduling. This paper defines a global resource scheduling problem for distributed edge computing and proves that the problem is NP-Hard. A heuristic solution strategy based on the Ant Colony Algorithm(ACO) was proposed, and Particle Swarm Optimization(PSO) was used to optimize the parameters of the ACO. Finally, an experimental comparative analysis was conducted to demonstrate that the algorithm proposed in this paper has good accuracy and iteration cost performance.

The Internet of Things (IoT) generates a large volume of data whenever devices are interconnected and exchange data across a network. As a result, there is a range of services with varying needs, for example, capacity requirements, data quality, and latency demands. These services operate on fog computing devices, which are limited in power and bandwidth compared to the cloud. The main challenge is deciding where to implement services on the fog, the cloud, or the hybrid. This paper proposes an efficient allocation technique that pushes processing closer to the network's fog side. It investigates which devices and services may best allocate while preserving resource usage in the IoT architecture. It also examines the importance of allocating services to devices and optimizing resource use in fog computing. In IoT settings, there is a wide range of services and devices; thus, it is critical to effectively assign the services to the devices. We propose Priority-based Service allocation (PSA) and Sort-based Service Allocation (SSA) techniques, which are used to enable an optimum order to employ devices to perform the various services. The experimental results indicate that our proposed technique minimize the data communication over the network by 82% by allocating most of the services locally in fog. We have maximized the number of distributed services to fog devices by 90% while minimizing the wastage of fog resources.

Whether it’s cellphones, personal computers, or gaming consoles, technology is a part of everyone’s everyday lives, and storage is frequently a problem. One of the solutions we have for this difficulty is the on-demand accessibility of computer framework assets, which enables cloud storage and makes it accessible in any format and from any device. It is a major benefit of cloud computing. Amazon Web Administrations (or basically AWS) may be a secure cloud services stage advertising about everything businesses ought to construct advanced applications with adaptability, versatility, and unwavering quality. Another advantage is that it is significantly less expensive than purchasing items with comparable functionality, such as an SSD storage device. For many enterprises, it is also preferable to host their servers in the cloud using services like Google Cloud and Oracle Cloud. Our main topic of the paper is to compare three different major cloud computing services—AWS, Google, and Azure. Since there are different types of cloud computing services available, we would compare them to determine which is best for usage by individuals or organizations. We can also look at the services’ shared features and unique aspects that they provide to consumers.

Due to the increased use of memristors, and its many applications, the use of emulators has grown in parallel to avoid some of the difficulties presented by real devices such as variability and reliability. In this paper, we present a memristive emulator designed using a Switched Capacitor (SC), this is, an analog component/ block and a control part or block implemented using stochastic computing (SCo) and therefore fully digital. Our design is thus a mixed signal circuit. Memristor equations are implemented using stochastic computing to generate the control signals necessary to work with the controllable resistor implemented as switched capacitor.

Cellular Nonlinear Networks (CNN) are a concept introduced in 1988 by Leon Chua and Lin Yang as a bio-inspired architecture, capable of massively parallel computation. Later on, CNN have been enhanced by incorporating designs that incorporate memristors to profit from their processing and memory capabilities. In addition, Stochastic Computing (SC) can be used to optimize the quantity of required processing elements; thus it provides a lightweight approximate computing framework, quite accurate and effective, though. In this work, we propose utilization of SC in designing and implementing a memristor-based CNN. As a proof of the proposed concept, an example of application is presented. This application combines Matlab and a FPGA in order to create the CNN. The implemented CNN has then been used to perform three different real-time applications on a 512x512 gray-scale and a 768x512 color image: storage of the image, edge detection, and image sharpening. It has to be pointed out that the same CNN has been used for the three different tasks, with the sole change of some programmable parameters. Results show an excellent capability with significant accompanying advantages, like the low number of needed elements further allowing for a low cost FPGA-based system implementation, something confirming the system’s ability for real time operation.

Abstract—as the complexity in the cloud services increases day by day the role of brokers used in the cloud gain more importance. Here we basically resolve this issue by discussing preference based cloud service recommender that support MCDM approach.^[24] The implementation and specifications details are properly discussed in a unified way to deal with the problem. SC3 is a tool that compromises capabilities of the quality assurance dimension of CSB and also it strengthen the flexibility of cloud services. The anxieties between definition procedure and implementation procedure are separated by service completeness compliance checker (SC3). Now a days companies use cloud computing for their economic benefits and market competitions that increase the demand of “cloud computing”. So for the calculation of critical success factor of “cloud computing” we focus on plan do check act strategy.

In this paper, we introduce a novel controlled quantum communication protocol utilizing a quantum random walk involving one sender, one receiver, and multiple controllers. Inspired by classical random walk theory, quantum random walk serves as the foundation of our proposed protocol. With this protocol, we demonstrate the ability to transfer any n- dimensional quantum state to any party facilitated by any m number of controllers. Furthermore, any of the (m+1) individuals has the freedom to accept the role of the receiver. Rigorous testing of the protocol’s performance is conducted through quantum state tomography. We have run different variations of the circuits in IBMQ QASM simulator. Additionally, we explore the effectiveness of a weak measurement-based protocol designed to mitigate amplitude-damping noise’s detrimental effects on quantum states. By analyzing fidelity versus amplitude damping noise-strength plots for scenarios with and without the weak measurement protocol, we provide valuable insights into its protective capabilities across various levels of noise. These find- ings illuminate the protocol’s potential applications in quantum information processing

The non-contact patient monitoring paradigm moves patient care into their homes and enables long-term patient studies. The challenge, however, is to make the system non-intrusive, privacy-preserving, and low-cost. To this end, we describe an open-source edge computing and ambient data capture system, developed using low-cost and readily available hardware. We describe five applications of our ambient data capture system. Namely: (a) Estimating occupancy and human activity phenotyping; (b) Medical equipment alarm classification; (c) Geolocation of humans in a built environment; (d) Ambient light logging; and (e) Ambient temperature and humidity logging. We obtained an accuracy of 94% for estimating occupancy from video. We stress-tested the alarm note classification in the absence and presence of speech and obtained micro averaged F1 scores of 0.98 and 0.93, respectively. The geolocation tracking provided a room-level accuracy of 98.7%. The root mean square error in the temperature sensor validation task was 0.3°C and for the humidity sensor, it was 1% Relative Humidity. The low-cost edge computing system presented here demonstrated the ability to capture and analyze a wide range of activities in a privacy-preserving manner in clinical and home environments and is able to provide key insights into the healthcare practices and patient behaviors.

In this paper, a new full-Newton step feasible interior point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative variable weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm.

In this paper, we critically examine the burgeoning role of advanced computational methodologies in deciphering the complex tapestry of farm animal behaviors and emotions. Leveraging digital imaging and artificial intelligence, we unearth nuanced behavioral patterns and micro-expressions, offering predictive insights into animal emotional states. Sound vocalization analysis, often overlooked, emerges as a pivotal tool, decoding intricate communicative nuances and emotional undertones. Cognitive tests, including mirror and bias assessments, challenge long-standing perceptions, revealing surprising depths of animal self-awareness and cognitive sophistication. However, the paper also underscores the imperative of integrating these tools with a profound understanding of animal psyche, ensuring technology serves as an enhancer, not a replacement, of traditional observational methods. This research not only highlights the transformative potential of cognitive computing in animal welfare but also calls for a judicious application, ensuring technology augments, not undermines, the intrinsic value of human-animal interactions and understanding.