The paper describes schemes for the resource-efficient generation of twiddle factors for the fixed-radix version of the ubiquitous fast Fourier transform (FFT) algorithm. The schemes, which are targeted at a parallel implementation of the FFT, provide one with the facility for trading off arithmetic complexity, as expressed in terms of the required numbers of multiplications and additions (or subtractions), against the memory requirement, as expressed in terms of the amount of random access memory (RAM) required for constructing the look-up tables (LUTs) needed for the storage of the two twiddle factor components – one component being derived from the sine function and the other from the cosine function. Examples are provided which illustrate the advantages and disadvantages of each scheme – which are very much dependent upon the length of the FFT to be computed – for both the single-level and multi-level LUTs, highlighting those situations where their adoption might be most appropriate. More specifically, it is seen that the adoption of a multi‑level LUT scheme may be used to facilitate significant reductions in memory – namely, from an O(N) to an memory requirement, for the case of an N‑point FFT, where β ≥ 2 corresponds to the number of distinct angular resolutions used – at a relatively small cost in terms of increased FFT latency and arithmetic complexity.

Software quantum simulators are the most accessible tools for designing and testing quantum algorithms. This paper presents a comprehensive approach to building a software-based quantum simulator based on classical computing architectures. We explore fundamental quantum computing concepts, including state vector representations, quantum gates, and memory management techniques. The simulator prototype implements various memory optimization strategies, such as full-state representation, dynamic state pruning, and shared memory parallelization with OpenMP and distributed memory models using MPI. Additionally, data compression techniques, like ZFP, are explored to enhance simulation performance by reducing memory footprint. The results are validated through performance comparisons with leading open-source quantum simulators, such as Intel-QS, QuEST, and qsim. Our findings highlight the trade-offs between computational overhead and memory efficiency. This demonstrates that a hybrid approach using distributed memory and compression offers the best scalability for simulating large quantum systems. This work provides a foundation for developing efficient quantum simulators supporting more complex quantum algorithms on classical hardware.

With the development of engineering technology, engineering has higher requirements for the accuracy and the scale of simulation calculation. The computational efficiency of traditional se-rial program can not meet the requirements of engineering。Therefore, reducing the calcula-tion time of temperature control simulation program has important engineering significance for real-time simulation of temperature field and stress field, and then adopting more reasona-ble temperature control and crack prevention measures. GPU parallel computing is introduced into the temperature control simulation program of massive concrete to solve this problem and the optimization is carried out. Considering factors such as GPU clock rate, number of cores, parallel overhead and Parallel Region, The improved GPU parallel algorithm analysis indicator formula is proposed. It makes up for the shortcomings of traditional formula that focus only on time. According to this formula, when there are enough threads, the parallel effect is limited by the size of the parallel domain, and when the parallel domain is large enough, the efficiency is limited by the parallel overhead and the clock rate. This paper studies the optimal Kernel execu-tion configuration. Shared Memory is utilized to improve memory access efficiency by 155%. After solving the problem of bank conflicts, an accelerate rate of 437.5x was realized in the sub-routine of the matrix transpose of the solver. The asynchronous parallel of data access and logi-cal operation is realized on GPU by using CUDA Stream , which can overlap part of the data access time. On the basis of GPU parallelism, asynchronous parallelism can double the compu-ting efficiency. Compared with the serial program, the accelerate rate of inner product matrix multiplication of the GPU asynchronous parallel program is 61.42x. This study further proposed a theoretical formula of data access overlap rate to guide the selection of the number of CUDA streams to achieve the optimal computing conditions. The GPU parallel program compiled and optimized by CUDA Fortran platform can effectively improve the computational efficiency of the simulation program for concrete temperature control, and better serve for engineering computing.

In this paper, a new approach is proposed for designing ultra-low-power FFT (Fast Fourier Transform) system suitable for use in energy harvesting powered sensors. Bit-serial architecture is adopted to reduce the power consumption of butterfly operation. Simulation results show that, compared with state-of-the-art bit-serial and conventional parallel processors, the proposed technique is superior in terms of silicon area, power consumption, dynamic energy use due to variable precision arithmetic. A sample design of a 64-point FFT shows that the implementation can save about 40% area and 36% leakage power compared with a conventional parallel counterpart, accordingly achieving significant power benefits at a low sample rate and low voltage domain. The dynamic variation of the arithmetic precision can be achieved through a simple modification of the controller with hardware area overhead of 10% gate count.

Nowadays the practice of developing algorithms to maintain the confidentiality of data shows that there is a lack of some features, such as velocity, predictability, etc. Generating pseudorandom numbers is one such problem that lies in the basement of many algorithms, even in hardware microprograms. An unreliable generator can cause cyberattacks on it, despite the security in the upper layers. At the same time, the algorithm should be fast enough to provide uninterrupted circuit work for the entire system. The paper presents a new algorithm generating pseudorandom numbers on cellular automata, which is not only fast and easy-repeating, but unpredictable enough and can be used in cryptographic systems. Using the NIST statistical test suite for random and pseudorandom number generators (PRNG), it is shown that the presented algorithm is more than three times superior to the state-of-the-art methods and algorithms in terms of ? − ?????. A high level of the presented algorithm’s parallelization allows for implementation it effectively on calculators with parallel structure. CPU-based architecture, FPGA-based architecture, CUDA- based architecture of PRNG and different PRNG implementations are presented to confirm high performance of the proposed solution.

This research explores the application of ARIMA (Autoregressive Integrated Moving Average) models and parallel computing techniques to analyze and forecast anemia diagnoses in children under 36 months in the Junín region of Peru. Using health data from 2023-2024, including insurance type, patient information, diagnosis dates, hemoglobin levels, and treatment details, we develop predictive models to understand trends and patterns in childhood anemia. The study aims to demonstrate the effectiveness of time series analysis and high-performance computing in addressing this critical public health issue. Results indicate improved forecasting accuracy and computational efficiency, potentially aiding in resource allocation and policy development for anemia prevention and treatment programs.

Conventional data visualization software have greatly improved the efficiency of the mining and visualization of biomedical data. However, when one applies a grid computing approach the efficiency and complexity of such visualization allows for a hypothetical increase in research opportunities. This paper will present data visualization examples presented in conventional networks, then go into higher details about more complex techniques related to leveraging parallel processing architecture. Part of these complex techniques include the attempt to build a basic general adversarial network (GAN) in order to increase the statistical pool of biomedical data for analysis as well as an introduction to the project utilizing the decentralized-internet SDK. This paper is meant to show you said conventional examples then go into details about the deeper experimentation and self contained results.

Real-time image processing is crucial in applications such as video surveillance, diagnostic medicine, and autonomous vehicle systems. Parallel computing is essential to address the demands of real-time processing, but challenges persist in its practical implementation. This review analyzes parallel computing techniques applied to real-time image processing, examining parallel architectures and algorithms, identifying effective applications, and evaluating challenges and limitations. The results of this study will contribute to the development of more efficient solutions for real-time image processing. Keywords: Parallel computing, real-time image processing, video surveillance, diagnostic medicine, autonomous vehicle systems.

In this paper we show how to efficiently implement parallel discrete simulations on Multi-Core and GPU architectures through a real example of application: a cellular automata model of laser dynamics. We describe the techniques employed to build and optimize the implementations using OpenMP and CUDA frameworks. We have evaluated the performance on two different hardware platforms that represent different target market segments: high-end platforms for scientific computing, using an Intel Xeon Platinum 8259CL server with48cores and also an NVIDIA Tesla6V100 GPU, both running on Amazon Web Server (AWS) Cloud, and on a consumer-oriented platform, using an Intel Core i9 9900k CPU and an NVIDIA GeForce GTX 1050 TI GPU. Performance results are compared and analysed in detail. We show that excellent performance and scalability can be obtained in both platforms, and we extract some important issues that imply a performance degradation for them. We also found that current Multi-Core CPUs with large core numbers can bring a performance very near to that of GPUs, even similar in some cases.

We consider the problem of finding the largest clique of a graph. This is an NP-hard problem and no exact algorithm to solve it exactly in polynomial time is known to exist. Several heuristic approaches have been proposed to find approximate solutions, Markov Chain Monte Carlo being one of those. In the context of Markov Chain Monte Carlo, we present a class of ``parallel dynamics'', known as Probabilistic Cellular Automata, which can be used in place of the more standard choice of sequential ``single spin flip'' to sample from a probability distribution concentrated on the largest cliques of the graph. We perform a numerical comparison between the two classes of chains both in terms of the quality of the solution and in terms of computational time. We show that the parallel dynamics are considerably faster than the sequential one while providing solutions of comparable quality.

The NOSTR is a communication protocol for the social web, based on the w3c websockets standard. Although it is still in its infancy, it is well known as a social media protocol, thousands of trusted users and multiple user interfaces, offering a unique experience and enormous capabilities. To name a few, the NOSTR applications include but are not limited to direct messaging, file sharing, audio/video streaming, collaborative writing, blogging and data processing through distributed AI directories. In this work, we propose an approach that builds upon the existing protocol structure with end goal a decentralized marketplace for federated learning and LLM training. In this proposed design there are two parties: on one side there are customers who provide a dataset that they want to use for training an AI model. On the other side, there are service providers, who receive (parts of) the dataset, train the AI model, and for a payment as an exchange, they return the optimized AI model. The decentralized and censorship resistant features of the NOSTR enable the possibility of designing a fair and open marketplace for training AI models and LLMs.

A methodology for selecting rational parameters of atmospheric aircrafts at the initial stages of design using an optimization algorithm of differential evolution and numerical mathematical modeling of aerodynamics problems is proposed. The technique involves the implementation of weight and aerodynamic balance in the main flight modes, has the ability to consider atmospheric aircrafts with one or two lifting surfaces, apply parallel calculations and automatically generate a three-dimensional geometric model of aircraft appearance based on the optimization results. A method for accelerating the process of optimizing the parameters of an aircraft in terms of take-off weight by more than three times by introducing a objective function into a set of design variables is proposed and demonstrated. The results of assessing the reliability of the used mathematical models of aerodynamics and the correctness of the calculation the objective function, taking into account various constraints, are presented. A comprehensive test of the performance and efficiency of the methodology is considered by solving demonstration problems to optimize more than ten main design parameters the appearance of two existing heavy-class unmanned aerial vehicles with known characteristics from open sources.

One of the non-linear phenomena that affect high bandwidth and long reach communication systems is the non-linear phenomenon called four-wave mixing (FWM). Unfortunately, the simulation of such systems aiming to obtain their design parameter limitations require more time as the number of channels increases. In this paper, we propose a new high-performance computational model to obtain optimal design parameters in a multi san Dense Wavelength Division Multiplexing (DWDM) system, limited by FWM and the intrinsic Amplified Spontaneous Emission (ASE) noise of optical amplifiers employed in each segment. The simulation in this work provides a complete optical design characterization and compares the efficiency and speed improvement of the proposed parallelization model versus a previous sequential model. Additionally, an analysis of the computational complexity of parallel model is presented, where two parallel implementations are used. First, Open Multi−Processing (OpenMP), based on the use of a central, multi-core processing unit is used and secondly the Compute Unified Device Arquitecture (CUDA), which is based on the use of graphics processing unit. Results show that parallelism improves to up to 40 times the performance of the simulation when nested parallelization with CUDA is used, over de sequential method and up to 6 times compared with the implementation with OpenMP using 12 processors. Within our parallel implementation, it is possible to simulate with an increased number of channels, that was unpractical in the sequential simulation.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

The paper proposes a universal algorithm for parallelizing calculations that arise when using highly-optimized minimization functions available in many computing packages. The main idea of the proposed algorithm is based on the fact that although the “inner workings” of the minimization function used may not be known to the user, it inevitably uses in its work auxiliary functions that implement the calculation of the minimized functional and its gradient, which are usually implemented by the user, which means that in most cases they can be parallelized relatively easily. The paper discusses in detail both the parallelization algorithm and its software implementation using MPI parallel programming technology. Examples of the software implementation of the proposed algorithm are demonstrated using the Python programming language, but can be easily rewritten using the C/C++/Fortran programming languages.

The performance of lattice-Boltzmann solver implementations usually depends mainly on memory access patterns. Achieving high performance requires then complex code which handles careful data placement and ordering of memory transactions. In this work, we analyse the performance of an implementation based on a new approach called the data-oriented language, which allows the combining of complex memory access patterns with simple source code. As a use case, we present and provide the source code of a solver for D2Q9 lattice and show its performance on GTX Titan Xp GPU for dense and sparse geometries up to 4096 2 nodes. The obtained results are promising, around 1000 lines of code allowed us to achieve performance in the range of 0.6 to 0.7 of maximum theoretical memory bandwidth (over 2.5 and 5.0 GLUPS for double and single precision, respectively) for meshes of size above 1024 2 nodes, which is close to the current state-of-the-art. However, we also observed relatively high and sometimes difficult to predict overheads, especially for sparse data structures. The additional issue was also a rather long compilation, which extended the time of short simulations, and a lack of access to low-level optimisation mechanisms.

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

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.

A Twi-English parallel corpus is certainly an important resource for Machine Translation of Twi (ISO 639-3), a Low-Resource African Language (LRAL) which is mainly spoken in Ghana and Ivory Coast. Currently large-scale multi-domain Twi-English parallel corpus is still unavailable partly due to the difficulties and the arduous efforts required in its design. In this paper, we present TWIENG: a large-scale multi-domain Twi-English parallel corpus. We crawled the sentences from the web using web crawlers, translated, aligned, tokenized and compiled to create the corpus. We crawled English sentences from Ghanaian indigenous electronic news portals, Ghanaian Parliamentary Hansards, Twi Bible and crowdsourcing via google forms. The sentences were translated by professional translators and linguists, they were then aligned, tokenized and compiled. The corpus was curated using the sketch engine, a corpus manager and analysis software developed by Lexical Computing Limited. The corpus was manually evaluated by Twi professional linguists. The Corpus has 5,419 parallel sentences.

Background: The protocol described in this paper is part of a research project coordinated 1 between three Spanish universities where a technology aimed at improving the quality of life of 2 people suffering from cerebral palsy will be developed. Part of the technology developed will consist 3 of developing an interface and a series of applications to increase motivation for daily physical activity. 4 The basis of these developments is based on the measurement of the emotional state of the subjects. 5 Methods: The experimental protocol is designed with two objectives, on the one hand to identify the 6 emotional state through physiological signals, and on the other to determine whether music can be 7 a motivating factor to promote physical activity. It has been specifically designed for subjects with 8 cerebral palsy taking into account the special characteristics of this population. These are people with 9 whom it is difficult to use questionnaires to have a basis to contrast with the measured physiological 10 signals, so measurements must be taken in carefully chosen daily life situations Discussion: As results 11 we hope to obtain which physiological parameters are the most robust to measure the emotional state 12 and how to design rehabilitation and physical activity promotion routines that are motivating, in 13 addition to being able to avoid risk factors during the performance of these routines. Trial registration: 14 NCT05621057. https://clinicaltrials.gov/ct2/show/NCT05621057

The concept of graphs with clique-width at most was first introduced by Courcelle et al.to be the graphs that can be characterized using -expressions derived from graph operations that use labels of vertices. If the clique-width for some graph is bounded then a grand number of algorithmic problems, in general NP-hard, can be solved in polynomial time when restricted to this graph. This important fact motivated the researchers to prove that the clique-width of certain graphs is bounded. Following this research direction, we prove in this paper that the clique-width of series-parallel digraphs is at most 6 and we present an time algorithm to construct a 6-expression for this class of digraphs. In another part, we present a linear time recognition algorithm for a similar class of series-parallel digraphs and prove that the clique-width of this class is at most 3.

The number of documents published on the Web other languages than English grows every year. As a consequence, it increases the necessity of extracting useful information from different languages, pointing out the importance of researching Open Information Extraction (OIE) techniques. Different OIE methods have been dealing with features from a unique language. On the other hand, few approaches tackle multilingual aspects. In such approaches, multilingual is only treated as an extraction method, which results in low precision due to the use of general rules. Multilingual methods have been applied to a vast amount of problems in Natural Language Processing achieving satisfactory results and demonstrating that knowledge acquisition for a language can be transferred to other languages to improve the quality of the facts extracted. We state that a multilingual approach can enhance OIE methods, being ideal to evaluate and compare OIE systems, and as a consequence, to applying it to the collected facts. In this work, we discuss how the transfer knowledge between languages can increase the acquisition from multilingual approaches. We provide a roadmap of the Multilingual Open IE area concerning the state of the art studies. Additionally, we evaluate the transfer of knowledge to improve the quality of the facts extracted in each language. Moreover, we discuss the importance of a parallel corpus to evaluate and compare multilingual systems.

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.

Reliability is essential in industrial networks. In addition, most of the data from nodes of industrial Internet of Things (IIoT) are generated in real time. Thus, those data are mainly used for the time-sensitive applications. Furthermore, device failures should be considered when modeling reliable fog computing for IIoT. In this paper, we provide fundamental aspects to model reliable fog computing for IIoT. First, existing models of fog computing are compared. Then, the most feasible communication type to achieve a reliable system is determined from model analysis. Interaction modes are elaborated to study the advantages and drawbacks when communication is deployed in fog computing for IIoT, and challenges and solutions for reliable fog computing are discussed.

Cable-Driven Parallel Robots (CDPRs) are a special kind of parallel manipulator which use cables to control the position and orientation of the mobile platform or end-effector. The usage of cables instead of rigid links offer some advantages over their conventional rigid counterparts. As cables can only pull, but not push, the number of cables (n) required to command the end-effector is always n+1. This configuration is known as fully-constrained and it is the most extended configuration for CDPRs. Although CDPRs have many advantages, such as their ability to cover large working areas, one of their main problems is that their working area (workspace) is limited in comparison to its frame area (planar case), or frame volume (spatial case), due to the minimum and maximum allowed tensions. Depending of these tensions values the workspace can be notoriously decreased. In order to tackle this problem, lots of works focus on solving kinematics or dynamics problems for cable sagging, i.e., they take into account sagging when modelling the robot kinematic and include these poses inside the usable robot workspace. Taking into account phenomenons like this increases the mathematical complexity of the problem, and much more complex techniques are required. On the other hand, the lack of workspace problem can be tackled by adding active or passive elements to the robot design. In this sense, this paper proposes two mechanical modifications: to add passive carriages to the robot frame and to use a single cable loop to command the end-effector position and orientation. This work presents the kinematic, static and dynamic models of the novel design and shows the gain of workspace for a planar case while taking into account different parameters of the robot.

The Planck Legacy recent release revealed a closed and positively curved early universe with a confidence level greater than 99%. In this study, the Friedmann–Lemaîtree–Robertson–Walker (FLRW) metric is enhanced to model early universe plasma, incorporating its reference curvature radius upon the emission of the cosmic microwave background (CMB) and the reference scale factor of the energy flux. The universe evolution from early plasma is modelled utilising quantised spacetime worldlines, where they revealed both positive and negative solutions implying that matter and antimatter in the plasma could be separated by electromagnetic fields and evolved in opposite directions as distinct sides of the universe, corroborating the CMB dipole anisotropy. The model indicates a nascent hyperbolic expansion is followed by a first phase of decelerating expansion during the first 10 Gyr, and then, a second phase of accelerating expansion. The model theoretically resolves the tension in Hubble parameter measurements, with a predicted density at the phase transition of 1.16. Further, it predicts a final time-reversal phase of rapid spatial contraction leading to a Big Crunch, signalling a cyclic universe. Simulations of the quantised spacetime continuum flux through its travel along the predicted worldlines demonstrated the fast-orbital speed of stars resulting from an external momentum exerted on galaxies via the spatial curvature through imaginary time dimension. These findings indicate that early universe plasma could be separated and evolved into distinct sides, collectively and geometrically influencing the universe evolution.

Flaxseed (Linum usitatissinum L.) oil is an important source of α-linolenic (C18:3 ω-3), this polyunsaturated fatty acid is well known for its nutritional role in human and animal diet. Understanding storage lipid biosynthesis in developing flaxseed embryos can lead to an increase in seed yield. While a tremendous amount of work has been done on different plant species to highlight their metabolism during embryos development, flaxseed metabolic flux analysis is still lacking. In this context, we have developed an in vitro cultured developing embryos of flaxseed and determined net fluxes by performing three complementary parallel labeling experiments with 13C-labeled glucose and glutamine. Metabolic fluxes were estimated by computer- aided modeling of the central metabolic network including 11 cofactors of 118 reactions of the central metabolism, 12 pseudo fluxes. A focus on lipid storage biosynthesis and the associated pathways was done in comparison with rapeseed, arabidopsis, maize and sunflower embryos. In our conditions, glucose was the main source of carbone of flaxseed embryos, leading to the conversion of phosphoenolpyruvate to pyruvate. The oxidative pentose phosphate pathway (OPPP) was identified as the producer of NADPH for fatty acid biosynthesis. Overall, the use of 13C-metabolic flux analysis provided new insight into flaxseed embryos metabolic processes involved in storage lipids biosynthesis. The elucidation of the metabolic network of this important crop plant reinforces the relevance of the application of this technique to the analysis of complex plant metabolic systems.

RAxML-NG is a new phylogentic inference tool that replaces the widely-used RAxML and ExaMLtree inference codes. Compared to its predecessors, RAxML-NG offers improvements in accur-acy, flexibility, speed, scalability, and user-friendliness. In this chapter, we provide practicalrecommendations for the most common use cases of RAxML-NG: tree inference, branch supportestimation via non-parametric bootstrapping, and parameter optimization on a fixed tree topo-logy. We also describe best practices for achieving optimal performance with RAxML-NG, inparticular, with respect to parallel tree inferences on computer clusters and supercomputers. AsRAxML-NG is continuously updated, the most up-to-date version of the tutorial described inthis chapter is available online at: https://cme.h-its.org/exelixis/raxml-ng/tutorial .

In the realm of the Internet of Things (IoT), a network of sensors and actuators collaborates to fulfill specific tasks. As the demand for IoT networks continues to rise, it becomes crucial to ensure the stability of this technology and adapt it for further expansion. Through an analysis of related works including Feedback-based Optimized Fuzzy Scheduling Approach (FOFSA) algorithm, Adaptive Task Allocation Technique (ATAT) and Osmosis Load Balancing algorithm (OLB), we identify their limitations in achieving optimal energy efficiency and fast decision-making. To address these limitations, this research introduces a novel approach to enhance the processing time and energy efficiency of IoT networks. The proposed approach achieves this by efficiently allocating IoT data resources in the Mist layer during the early stages. We apply the approach to our proposed system known as the Mist-based Fuzzy Healthcare System (MFHS) that demonstrates promising potential to overcome the existing challenges and pave the way for efficient Industrial Internet of Healthcare Things (IIoHT) of the future.

Despite the increasing role of machine learning in various fields, very few works considered artificial intelligence for frequency estimation (FE). This work presents a comprehensive analysis of deep-learning (DL) approach for frequency estimation of single-tones. It is shown that DL network with two layers having a few nodes can estimate frequency more accurately than well-known classical techniques. The study is comprehensive, filling gaps of existing works, where it analyzes error under different signal-to-noise ratios, numbers of nodes, and numbers of input samples; also, under missing SNR information. It is found that DL-based FE is not significantly affected by SNR bias or number of nodes. DL-based approach can work properly using minimal number of input nodes N at which classical methods fail. It is possible for DL to use as little as two layers with two or three nodes each, with complexity of O{N} versus O{Nlog2 (N)} for DFT-based FE, noting that less N is required for DL. Hence, DL can significantly reduce FE complexity, memory, cost, and power consumption, making DL-based FE attractive for resource-limited systems like some IoT sensor applications. Also, reduced complexity opens the door for hardware-efficient implementation using short word-length (SWL) or time-efficient software-defined radio (SDR) communications.

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.

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.

Ocean exploration is crucial for utilizing its extensive resources. Images captured by underwater robots suffer from issues such as color distortion and reduced contrast. To address the issue, we propose an innovative enhancement algorithm that integrates Transformer and Convolutional Neural Network (CNN) in a parallel fusion manner. Firstly, a novel transformer model is intro-duced to capture local features, employing peak-signal-to-noise ratio (PSNR) attention and linear operations. Subsequently, to extract global features, both temporal and frequency domain features are incorporated to construct convolutional neural network. Finally, the Fourier’s high and low-frequency information of the original image are utilized to fuse different features. To demon-strate the algorithm's effectiveness, underwater images with various levels of color distortion are selected for both qualitative and quantitative analyses. The experimental results demonstrate that our approach surpasses other mainstream methods, achieving superior PSNR and structural sim-ilarity index measure (SSIM) metrics and leading to a detection performance improvement of over ten percent.

Matrix Factorization is a long established method employed for analyzing and extracting valuable insight recommendations from complex networks containing user ratings. The execution time and computational resources demanded by these algorithms pose limitations when confronted with large datasets. Community detection algorithms play a crucial role in identifying groups and communities within intricate networks. To overcome the challenge of extensive computing resources, we present a novel parallel computation framework utilizing community information available in the rating network. Our proposed approach named as Community-based Matrix Factorization(CBMF), parallelizes matrix factorization technique by dividing the network into communities using existing community detection algorithms. We prove that this parallel approach not only increases the quality of recommendations in connection with Root Mean Square Error (RMSE), but also yields substantial performance improvement. We empirically evaluate our idea on diverse datasets and present comprehensive experimental results. These results serve as empirical evidence of the effectiveness and performance gains offered by our parallel computation framework.

Small RNAs (sRNA) are epigenetic regulators of essential biological processes that have been linked to the onset and progression of leukemia, including acute adult T-cell leukemia-lymphoma (ATLL) caused by the retrovirus Human T-lymphotropic virus type 1. Here, we describe the sRNA profile of a 30-year-old female with ATLL at diagnosis and after maintenance therapy, with the goal of correlating their expression levels with response to therapy.

The microgrid is a small-scale, autonomous decentralized power plant with its own distributed generation, storage capacity and multiple loads, with the capacity to function in grid interconnected and an island mode. The decentralized control of microgrids with parallel operated voltage source converters (VSCs) is proposed in this paper to improve power quality using a machine learning approach. The DNN based MPPT controller is proposed and its best performance is presented. The SRF-PLL is utilized for AC side synchronization in VSC control. The proposed microgrid involves two PV arrays fed to two voltage source converters along with their independent controls, connected in parallel through LC filters and line coupling transformers and serves the loads at PCC. The proposed model is simulated using MATLAB/Simulink. The dq-framed inner loop control is employed to individually regulate the real and reactive power at the point of common coupling. Furthermore, the proposed model is analyzed and compared by employing a mathematical model of AC system dynamics, inner loop control, output voltage quality, AC harmonic spectrum analysis, and total harmonic distortion (THD) in both grid interconnected and island mode. In island mode, AC harmonic spectrum and THD are accomplished within the permissible range.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

The holy grail of Artificial Intelligence (AI) has been to mimic human intelligence using computing machines. Autopoiesis which refers to a system with well-defined identity and is capable of re-producing and maintaining itself and cognition which is the ability to process information, apply knowledge, and change the circumstance are associated with resilience and intelligence. While classical computer science (CCS) with symbolic and sub-symbolic computing has given us tools to decipher the mysteries of physical, chemical and biological systems in nature and allowed us to model, analyze various observations and use information to optimize our interactions with each other and with our environment, it falls short in reproducing even the basic behaviors of living organisms. We present the foundational shortcomings of CCS and discuss the science of infor-mation processing structures (SIPS) that allows us to fill the gaps. SIPS allows us to model su-per-symbolic computations and infuse autopoietic and cognitive behaviors into digital machines. They use common knowledge representation from the information gained using both symbolic and sub-symbolic computations in the form of system-wide knowledge networks consisting of knowledge nodes and information sharing channels with other knowledge nodes. The knowledge nodes wired together fire together to exhibit autopoietic and cognitive behaviors.

Weak signal spectral detection is a serious problem in many applications, especially the target possesses certain frequency band and under low signal-to-noise ratio (SNR). A kind of novel technique based on pre-whitening scale-transformation symmetric bistable parallel stochastic resonance (SR) is proposed to solve the problem. Firstly, the pre-whitening can ensure the even distribution of the receiving signal to fit the requirement of SR processing. Secondly, the scale- transformation can help to utilize the weak signal improvement property especially under low frequency band more effectively. Thirdly, the symmetric bistable parallel SR can try to reduce the variance of the clutter and additive noise fluently. Fourthly, by subtracting the steady state re-sponse of the selected symmetric bistable SR system from the parallel SR output, the weak signal spectral detection objective can be realized successfully. Simulation results based on the real sea clutter radar data guarantee the effectiveness and applicability of the proposed symmetric bistable PSR processing approach.

The Global Navigation Satellite Systems (GNSS) software-defined receivers offer greater flexibility, cost-effectiveness, customization, and integration capabilities compared to traditional hardware-based receivers, making them essential for a wide range of applications. The continuous evolution of GNSS research and the availability of new features require these software-defined receivers to upgrade continuously to facilitate the latest requirements. The Finnish Geospatial Research Institute (FGI) has been supporting the GNSS research community with its open-source implementations, such as a MATLAB-based GNSS software-defined receiver ’FGI-GSRx’ and a Python-based implementation ’FGI-OSNMA’ for utilizing Galileo’s Open Service Navigation Message Authentication (OSNMA). In this context, longer datasets are crucial for GNSS software-defined receivers to support adaptation, optimization and facilitate testing to investigate and develop future-proof receiver capabilities. In this paper we present an updated version of FGI-GSRx, namely FGI-GSRx-v2.0.0, which is also available as an open-source resource for the research community. FGI-GSRx-v2.0.0 offers improved performance as compared to its previous version, especially for the execution of long datasets. This is carried out by optimizing the receiver’s functionality and offering a newly added parallel processing feature to ensure faster capabilities to process the raw GNSS data. This paper also presents an analysis of some key design aspects of previous and current versions of FGI-GSRx for a better insight into the receiver’s functionalities. The results show that FGI-GSRx-v2.0.0 offers about 40% run time execution improvement over FGI-GSRx-v1.0.0 in case of sequential processing mode and about 59% improvement in case of parallel processing mode with 17 GNSS satellites from GPS and Galileo. In addition, an attempt is made to execute v2.0.0 with MATLAB’s own parallel computing toolbox. A detail performance comparison reveals an improvement of about 43% in execution time over v2.0.0 parallel processing mode for the same GNSS scenario.

Human T-lymphotropic virus type 1 (HTLV-1)–associated myelopathy/tropical spastic paraparesis (HAM/TSP) is a slowly progressive spinal cord disorder with no effective treatment. There is much of interest in developing potential biomarkers for predicting the pathogenesis of HAM/TSP disorder. This study used Illumina massive parallel sequencing (MPS) technology to assess the cellular global noncoding RNAome expression profile in HAM/TSP patients (n = 10), asymptomatic HTLV-1 infected carriers (ASP, n = 8), and a second group of healthy controls (n = 5). Using various bioinformatics tools, the sRNA MPS reads were aligned, annotated, and profiled. There were 251 known and 50 potential novel sRNAs among the 402 detected sRNAs in the HAM and ASP groups versus the HC group. Sixty-eight known sRNAs were found to be significantly different between the ASP and HAM groups. In HAM vs ASP subjects, 88 mature miRNAs were downregulated. Three of these miRs (hsa-miR-185-5p, 32-5p, and 192-5p) have the potential to be used as biomarkers for predicting the pathogenesis of HAM/TSP. The top seven deregulated miRS target genes were linked to a variety of biological processes and molecular functions. Relevant reactome pathways to our findings provide a rich source of data and an opportunity to further understand sRNA regulation and function in HTLV-1 pathophysiology.

The steady-state multiplicity of the porous, non-isothermal, catalyst pellet when two parallel and consecutive chemical reactions take place was analysed in this work. The geometry selected for the catalyst pellet is finite hollow cylinder. A numerical multigrid continuation technique with the preconditioned conjugate gradient squared as coarse grid solver was used. The continuation parameter is the dimensionless adiabatic heat rise (Prater number) for the first chemical reaction. The effect of the other governing parameters was analysed and the results are compared to those provided by the single chemical reaction.

Parallel lives is a model which provides an interpretation of quantum theory that is both local and realistic. This model assumes that all quantum fields are composed of point beings called ”lives”. Lives interact locally and have a memory of their previous interactions. The reduction of the state vector is not included in this model: lives can be divided into different worlds. This feature resembles many worlds interpretation. However in the parallel lives model, the division of lives into different worlds takes place locally. The parallel lives model is expected to be compatible with special relativity, as the lives propagate at a speed that does not exceed the speed of light and interact locally. On the other hand, it is open to paradoxes based on counterfactual propositions, as it provides a realistic interpretation of quantum theory. In this paper, we confront the parallel lives model with the paradox proposed by Hardy. We show that the parallel lives model cannot overcome the dilemma in Hardy’s paradox. We discuss implications of this confrontation on special theory of relativity, and speculate a solution that we believe, fits the spirit of the parallel lives model.

This paper presents a novel micro-segmented genetic algorithm (μsGA) to identify the best solution for the locomotion of a quadruped robot designed on a rectangular ABS plastic platform. We compare our algorithm with three similar algorithms found in the specialized literature: a standard genetic algorithm (GA), a micro-genetic algorithm (μGA), and a micro artificial immune system (μAIS). The quadruped robot prototype guarantees the same conditions for each test. The platform was developed using 3D printing for the structure and can accommodate the mechanisms, sensors, servomechanisms as actuators. It also has an internal battery and a multicore embedded system (mES) to process and control the robot locomotion. This research proposes a μsGA that segments the individual into specific bytes. μGA techniques are applied to each segment to reduce the processing time; the same benefits as the GA are obtained, while the use of a computer and the high computational resources characteristic of the GA are avoided. This is the reason why some research in robot locomotion is limited to simulation. The results show that the performance of μsGA is better than the three other algorithms (GA, μGA and AIS). The processing time was reduced using a mES architecture that enables parallel processing, meaning that the requirements for resources and memory were reduced. This research solves the problem of continuous locomotion of a quadruped robot, and gives a feasible solution with real performance parameters using a μsGA bio-micro algorithm and a mES architecture.

This study examines a new approach to hybdrid neuromorphic devices by studying the impact of omeprazole-proteinoid complexes on Izhikevich neurone models. We investigate the influence of these metabolic structures on five specific patterns of neuronal firing: accommodation, chattering, triggered spiking, phasic spiking, and tonic spiking. By combining omeprazole, a proton pump inhibitor, with proteinoids, we create a unique substrate that interfaces with neuromorphic models. The Izhikevich neurone model is used because it is computationally efficient and can accurately simulate various behaviours of cortical neurones. The results of our simulations show that omeprazole-proteinoid complexes have the ability to affect neuronal dynamics in different ways. This suggests that they could be used as adjustable components in bio-inspired computer systems. We have noticed a notable alteration in the frequency of spikes, patterns of bursts, and rates of adaptation, especially in chattering and triggered spiking behaviours. The findings indicate that omeprazole-proteinoid complexes have the potential to serve as adaptable elements in neuromorphic systems, presenting novel opportunities for information processing and computation that have origins in neurobiological principles. This study makes a valuable contribution to the expanding field of biochemical neuromorphic devices and establishes a basis for the development of hybrid bio-synthetic computational systems.

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

One of the most popular developments today that potentially address security issues with cloud computing is the use of blockchain. Blockchain is a decentralized data management platform that offers data integrity, security, and anonymity without the involvement of a third party. This work presents a comprehensive study of blockchain-based data storage system and their security concerns with their solutions to address these concerns. We provide a thorough overview of how blockchain is used in the cloud computing model to provide security services, and we examine the research trends of blockchain-related technologies in the current cloud computing models. As we examine, we also quickly look into how cloud computing may impact blockchain, particularly the performance enhancements that cloud computing may offer. This paper performs a review of the cutting-edge investigations of the blockchain-based system with a selfish-mining attack and the primary focus on IPFS. We also note their challenges, open issues, and future directions. The findings demonstrate that blockchain offers a productive platform in this area. However, one of the most significant problems that still need more research is security-related issues. The article offers a platform for future research and action as well.

We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on QUBO (quadratic unconstrained binary optimization) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as ‘cost oracle’ operations UC, which when combined with the standard Grover diffusion operator Us lead to high probabilities of measurement for states corresponding to the optimal and near optimal solutions. In order to achieve these probabilities, a single scalar parameter ps is required, which we show can be found through a variational quantum-classical hybrid approach.

The Internet of Things (IoT) is a concept based on the integration of various devices and methods of communication to exchange information in order to contribute to the improvement of everyday life, business and environment. This paper focuses on the establishment of a modern Internet of Things platform to ensure secure collection, processing and storage of data, under unexpected events. This platform establishes reliable connectivity which enhance system uptime; the key to success when implementing an IoT strategy. For this purpose, we proposed a hybrid approach combining different connectivity technologies to ensure the availability and smooth operation of the system and the prevention of data loss in unforeseen cases.

Considering the great growth of IoT networks and the need for highly reliable networks and also considering the manufacturing divides of IoT equipment which are highly limited by their memory, processing power and battery; we need a highly efficient routing for guaranteeing our network's high life span. So, this paper has suggested an efficient energy routing method based on the overlapping clustering method which is inspired from the Grey theory. The Overlap clustering method means that some Things collect data that must be sent to two or more Fog nodes for processing. In the suggested method the best node is selected as the cluster head based on factors such as remaining energy, distance, link expiration time, signal power for receiving data from things by the Fog nodes. In the next step the Fog node's data are sent in a hierarchical method using a symmetrical tree of processed data to the server. Thus, the main issue here is making using a proper routing method for data sending to the Cloud that doesn't just focus on energy, but also considers other factors such as delay and network life span. The simulation results show that the HR-IoT reduces the average end to end delay more than 17.2% and 23.1%, decreases the response time more than 20.1% and 25.78% and increase packet delivery rate more than 23.1% and 28.78% and lifetime more than 25.1% and 28.78% compared to EECRP and ERGID approaches.

The ubiquity of mobile sensors (such as GPS, accelerometer and gyroscope) together with increasing computational power have enabled an easier access to contextual information, which proved its value in next generation of the recommender applications. The importance of contextual information has been recognized by researchers in many disciplines, such as ubiquitous and mobile computing, to filter the query results and provide recommendations based on different user status. A context-aware recommendation system (CoARS) provides a personalized service to each individual user, driven by his or her particular needs and interests at any location and anytime. Therefore, a contextual recommendation system changes in real time as a user’s circumstances changes. CoARS is one of the major applications that has been refined over the years due to the evolving geospatial techniques and big data management practices. In this paper, a CoARS is designed and implemented to combine the context information from smartphones’ sensors and user preferences to improve efficiency and usability of the recommendation. The proposed approach combines user’s context information (such as location, time, and transportation mode), personalized preferences (using individuals past behavior), and item-based recommendations (such as item’s ranking and type) to personally filter the item list. The context-aware methodology is based on preprocessing and filtering of raw data, context extraction and context reasoning. This study examined the application of such a system in recommending a suitable restaurant using both web-based and android platforms. The implemented system uses CoARS techniques to provide beneficial and accurate recommendations to the users. The capabilities of the system is evaluated successfully with recommendation experiment and usability test.

Information is commonly considered as a mathematical quantity that forms the basis of computing. In mathematics, information can propagate instantly, so its transfer speed is not the subject of information science. In all kinds of implementations of computing, whether technological or biological, some material carrier for the information exists, so the information’s propagation speed cannot exceed the speed of the carrier. Because of this limitation, for any implementation, one must consider the transfer time between computing units. We need a different mathematical method to take this limitation into account: classic mathematics can only describe infinitely fast and infinitely small computing system implementations. The difference between the mathematical handling methods leads to different descriptions of the behavior of the systems. The correct handling also explains why biological implementations can have lifelong learning and technological ones cannot. The conclusion about learning evidences matches others’ experimental evidence, both in technological and biological computing.

We consider a system of two coupled parallel queues, queue 1 and queue 2, with infinite waiting rooms. The time setting is discrete. In either queue, the service of a customer requires exactly one discrete time slot. Arrivals of new customers occur independently from slot to slot, but the numbers of arrivals of both types within a slot may be mutually interdependent. Their joint probability generating function (pgf) is indicated as A(z1, z2) and characterizes the whole model. It is well-known that, in general, determining the steady-state joint probability mass function (pmf) u(m, n), m, n ≥ 0 or the corresponding joint pgf U(z1, z2) of the system contents (i.e., numbers of customers present) in both queues is a formidable task. Only in a number of isolated cases, for very specific choices of the arrival pgf A(z1, z2), explicit results are known in the literature. In this paper, we identify a multiparameter, generic class of arrival pgfs A(z1, z2), for which we can explicitly determine the system-content pgf U(z1, z2). We find that, for arrival pgfs of this class, U(z1, z2) has a denominator which is a product, say r1(z1)r2(z2) of two univariate functions. This property allows a straightforward inversion of U(z1, z2), resulting in a pmf u(m, n) which can be expressed as a finite linear combination of bivariate geometric terms. We also observe that our generic model encompasses most of the previously known results as special cases.

We present an any-to-one voice conversion (VC) system, using an autoregressive model and LPCNet vocoder, aimed to enhance the converted speech in terms of naturalness, intelligibility, and speaker similarity. As the name implies, non-parallel any-to-one voice conversion does not require paired source and target speeches and can be employed for arbitrary speech conversion tasks. Recent advancements in neural-based vocoders, such as WaveNet, have improved the efficiency of speech synthesis. However, in practice, we find that the trajectory of some generated waveforms is not consistently smooth, leading to occasional voice errors. To address this issue, we propose to use an autoregressive (AR) conversion model along with the high-fidelity LPCNet vocoder. This combination not only solves the problems of waveform fluidity but also produces more natural and clear speech, with the added capability of real-time speech generation. To precisely represent the linguistic content of a given utterance, we use speaker-independent PPG features (SI-PPG) computed from an automatic speech recognition (ASR) model trained on a multi-speaker corpus. Next, a conversion model maps the SI-PPG to the acoustic representations used as input features for the LPCNet. The proposed autoregressive structure enables our system to produce the following prediction step outputs from the acoustic features predicted in the previous step. We evaluate the effectiveness of our system by performing any-to-one conversion pairs between native English speakers. Experimental results show that the proposed method outperforms state-of-the-art systems, producing higher speech quality and greater speaker similarity.

As an important component of modern service industry, tourism is regarded as a "green" driver to regional economic growth and industrial upgrading. Applying the "quasi-natural experiment" advocated by the “The Belt and Road” Initiative, this paper, based on the method of DID, as-sessed the influence of this initiative on regional tourism development by analyzing panel data collected from 286 prefecture-level cities in China over the period of 2007-2018. It is found that the "The Belt and Road" initiative has stimulated market dynamics and promoted tourism de-velopment in the regions along the route, and has significantly improved indicators such as per capita domestic and inbound tourism revenue and per capita domestic and inbound tourist re-ceipt. Also, the degree of contribution of domestic tourists to the tourism economy of the re-gions where the policy has been implemented is stronger than that of inbound tourists. In sum, the results of this paper not only confirm that the “The Belt and Road” Initiative has significantly contributed to the high-quality tourism development of Chinese provinces along the routes, but also provide important policy enlightenment for the upgrading of regional tourism industry and regional economic balance.

The energy efficient problem of parallel-connected pumps in heating, ventilation, and air-conditioning (HVAC) systems has received an increasing attention in recent years. While many pump optimization methods are proposed and show great performance, pumps are not always energy efficient and lack flexibility. In this paper, we propose a distributed control algorithm for parallel pumps in HVAC system in a peer-to-peer setting. Based on a spanning tree of the network of the intelligent nodes and a population of potential solutions randomly sampled, the algorithm makes optimal control decision for pumps to minimize energy consumption and meet the system demand. The theoretical analysis on convergence of the algorithm is established. Unlike traditional control structure, the whole system is fully distributed and each pump is controlled by an intelligent node that runs identical control code and coordinates with other nodes through direct data exchange. Simulation experiments on 6 parallel-connected pumps are provided for different working cases to demonstrate the effectiveness of the proposed algorithm and compare with other four methods. The results show that our method strictly satisfies the demand constraint and presents a good energy saving potential, the convergence guarantee, the flexibility. The maximum energy saving can be up to 29.92%. Besides, the hardware test clearly presents that our method can perform on low-cost Raspberry Pi3 and reduce system cost.

Consider a robot that is navigating in a space modeled by a graph, and that wants to know its current location. It can send a signal to determine how far it is from each landmark among a set of fixed landmarks. We study the problem of computing the minimum required number of landmarks, and where they should be placed so that the robot can always determine its location. Since the problem is an NP-complete problem, the robot's responses to the actions are slow. To accelerate this response, we can use the parallel version of this problem. In this work, we introduce a new parallel implementation for determining the metric dimension of a given graph. We run the proposed algorithm on a symmetric multi-processing (SMP) cluster using C programming language and the Message Passing Interface (MPI) library. Finally, we run our implementation on four categories of graphs (the tracks in which the robot moves): a cycle graph Cn, a path graph Pn, a triangular snake graph and a ladder graph Ln. Preliminary computational results indicate that the metric dimension problem is an NP-complete problem and prove the ability of the proposed algorithm to achieve a speedup of 6 for 8 processors.

Long-range radio transmissions open new sensor application fields, in particular for environment monitoring. As an example, the {\sl LoRa} radio protocol enables to connect remote sensors at distance as long as ten kilometers in line-of-sight. However, the large area covered also bring several difficulties, such as the placement of sensing devices in regard to geography topology, or the variability of communication latency. Sensing the environment also carries constraints related to the interest of sensing points in relation with a physical phenomenon. Criteria for designs are thus evolving a lot from the existing methods, especially in complex terrains. This article describes simulation techniques based on geography analysis to compute long-range radio coverages and radio characteristics in these situations. As radio propagation is just a particular case of physical phenomena, it is shown how a unified approach also allows to characterize the behavior of potential physical risks. The case of heavy rainfall and flooding is investigated. Geography analysis is achieved using segmentation tools to produce cellular systems which are in turn translated into code for high-performance computations. The paper provides results from practical complex terrain experiments using LoRa, that confirm the accuracy of the simulation, scheduling characteristics for sample networks, and performance tables for simulations on middle range Graphics Processing Units (GPUs).

Parallel manipulators with multiple end-effectors bring us interesting advantages over conventional parallel manipulators such as improved manipulability, workspace and avoidance of singularities. In this work the kinematics of a five-bar planar parallel manipulator equipped with two end-effectors is approached by means of the theory of screws. As an intermediate step the displacement analysis of the robot is also investigated. The input-output equations of velocity and acceleration are systematically obtained by resorting to reciprocal-screw theory. In that regard the Klein form of the Lie algebra se(3) of the Euclidean group SE(3) plays a central role. In order to exemplify the method of kinematic analysis, a case study is included. Furthermore, the numerical results obtained by means of the theory of screws are confirmed with the aid of special software like ADAMS.^TM

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

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

Cloud computing is a strong and efficient technology facing some efficiency challenges attributable to its decentralized nature. The emergence of fog computing has subdivided the expansive cloud into numerous smaller units known as "cloudlets." Fog computing is one of the most recent advancements in today’s cloud computing landscape. Each cloudlet is a novel and diminutive architectural element extending the contemporary cloud computing infrastructure. The term "cloudlets" has been integrated with fog computing due to its augmenting impact on the attributes of cloud computing. F fog computing is a significant foundation and an indispensable cloud component. Consequently, this technology holds the potential to address efficiency concerns effectively. As a result, this paper focuses on enhancing the efficiency of the cloud computing environment by fine-tuning the efficiency parameters derived from fog computing. These parameters encompass response time, latency, and network utilization. The proposed solution involves developing a simulation system to minimize task redundancy and increase performance levels in the healthcare environment. The outcomes manifest a substantial improvement in the performance of the suggested system, with a clear increase depending on the three key parameters (response time, network utilization, and latency). Therefore, these findings are encouraging and carry significant implications, promoting the application of the proposed system in the real healthcare environment.

This study analyses some of the leading technologies for the construction and configuration of IT infrastructures to provide services to users. For modern applications, guaranteeing service continuity even in very high computational load or network problems is essential. Our configuration has among the main objectives of being highly available (HA) and horizontally scalable, that is, able to increase the computational resources that can be delivered when needed and reduce them when they are no longer necessary. Various architectural possibilities are analysed, and the central schemes used to tackle problems of this type are also described in terms of disaster recovery. The benefits offered by virtualisation technologies are highlighted and are bought with modern techniques for managing Docker containers that will be used to build the back-end of a sample infrastructure related to a use-case we have developed. In addition to this, an in-depth analysis is reported on the central autoscaling policies that can help manage high loads of requests from users to the services provided by the infrastructure. The results we have presented show an average response time of 21.7 milliseconds with a standard deviation of 76.3 milliseconds showing excellent responsiveness. Some peaks are associated with high-stress events for the infrastructure, but the response time does not exceed 2 seconds even in this case. The results of the considered use case studied for nine months are presented and discussed. In the study period, we improved the back-end configuration and defined the main metrics to deploy the web application efficiently.

The wide adoption of the recently coined fog and edge computing paradigms alongside conventional cloud computing creates a novel scenario, known as the cloud continuum, where services may benefit from the overall set of resources to optimize their execution. To operate successfully, such a cloud continuum scenario demands for novel management strategies, enabling a coordinated and efficient management of the entire set of resources, from the edge up to the cloud, designed in particular to address key edge characteristics, such as mobility, heterogeneity and volatility. The design of such a management framework poses many research challenges and has already promoted many initiatives worldwide at different levels. In this paper we present the results of one of these experiences driven by an EU H2020 project, focusing on the lessons learnt from a real deployment of the proposed management solution in three different industrial scenarios. We think that such a description may help understand the benefits brought in by a holistic cloud continuum management and also may help other initiatives in their design and development processes.

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.

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.

Computing in the cloud-edge continuum, as opposed to cloud computing, relies on high performance processing on the extreme edge of the IoT hierarchy. Hardware acceleration is a mandatory solution to achieve the performance requirements, yet it can be tightly tied to particular computation kernels, even within the same application. Vector-oriented hardware acceleration has gained renewed interest to support AI applications like convolutional networks or classification algorithms. We present a comprehensive investigation of the performance and power efficiency achievable by configurable vector acceleration subsystems, obtaining evidence of both the high potential of the proposed microarchitecture and the advantage of hardware customization in total transparency to the software program.

An increasing amount of electric energy is consumed by computers as they progress in function and capabilities. All of it is dissipated in heat during the computing and communicating operations and we reached the point that further developments are hindered by the unbearable amount of heat produced. In this paper we briefly review the fundamental limits in energy dissipation, as imposed by the laws of physics, with specific reference to computing and memory storage activities.

In this paper, to make the missile intercept the maneuvering target, the parallel approaching guidance law is developed. In order to estimate the target maneuver more accurately and reduce that’s influence on guidance accuracy, the distance-scalar disturbance observer is employed. Specifically, the estimation accuracy of the observer designed is regardless of the relative distance. The finite-time prescribed performance is employed to ensure that the line-of-sight angular rate is capable of converging to a predesigned small region in the specified finite time. All signals of interception system can guarantee ultimately uniformly boundedness proved by the Lyapunov stability theory. Finally, the availability of the parallel approaching guidance law is demonstrated by the numerical simulation.

In-depth research on the rehabilitation mechanism and motion characteristics of a rehabilitation training robot based on 4-UPUS parallel mechanism. The overall design and the working principle of each key component are explained, and the robot rehabilitation scheme is described. The static analysis and modal analysis of the robot bearing structure are carried out to verify whether the static mechanical characteristics of the mechanism meet the application requirements under working conditions.A simplified mathematical model of the six-bar linkage mechanism is established, and the kinematics of the mechanism is solved by the geometric analysis method. The motion characteristic diagram of each key point is obtained through simulation calculation. Establish the motion model of the parallel mechanism, and discuss the working space and motion performance analysis of the mechanism. The forward solution analysis of the mechanism position is carried out by using the numerical analysis method, and the three-dimensional graphics of the attitude angle and linear displacement of the reachable working space are obtained.Taking the UPUS single branch chain as the analysis object, the single open chain analysis method is used to solve the kinematics image of the corresponding surface in the working space of the mechanism, which verifies the correctness of the kinematics theoretical solution and the feasibility of simulation.The research results show that the 4-UPUS parallel mechanism rehabilitation training robot can cooperate with the ankle joint for rehabilitation training. It makes up for the single movement of the current lower limb rehabilitation robot and the unsatisfactory rehabilitation effect, and provides a reference for the practical application of the subsequent ankle joint rehabilitation robot system.

The paper presents an innovative hexapod walking robot built with 3-UPU parallel mechanism. In the robot, the parallel mechanism is used as both an actuator to generate walking and also a connecting body to connect two groups of three legs, thus enables the robot to walk with simple gait by very few motors. In the paper, the forward and inverse kinematics solutions are obtained. The workspace of the parallel mechanism is analyzed using limit boundary search method. The walking stability of the robot is analyzed, which yields the robot’s maximum step length. The gait planning of the hexapod walking robot is studied for walking on both flat and uneven terrains. The new robot, combining the advantages of parallel robot and walking robot, has a large carrying capacity, strong passing ability, flexible turning ability, and simple gait control for its deployment for uneven terrain.

Many fundamental molecular techniques (PCR, Microarray, Southern and northern hybridization, siRNA, CRISPR/Cas9 etc.) developed so far shows errors. I wish to highlight these molecular techniques are developed on basis of Watson-Crick DNA model, ignoring the concept of parallel stranded DNA. Through this opinion article, I wish to highlight specificity and accuracy of these molecular techniques can be enhanced by considering both parallel and anti parallel hybridization of DNA. Hopefully my views will also solve issue of irreproducibility in life science research.

Cloud computing has become a widespread technology due to ICT advancements. It allows businesses to move and take advantage of the pay-as-you-go price model. Enterprises pay for what they use and don't have to buy, setup, or maintain resources. However, outsourcing core resources such as storage, servers, operating systems, and software applications from a third party needs careful decisions to take advantage of cloud facilities. Choice of appropriate service provider, deployment and service model must be aligned with business needs and goals. In this paper, we will present cloud computing benefits, cloud deployment methods, services, state-of-the-art migration methods, tools and techniques and will conclude with the role of SDN in cloud computing.

Cloud infrastructure provides computing services where computing resources can be adjusted on-demand. However, the adoption of cloud infrastructures brings concerns like reliance on the service provider network, reliability, compliance for service level agreements (SLAs), etc. Software-defined networking (SDN) is a networking concept that suggests the segregation of a network’s data plane from the control plane. This concept improves networking behavior. In this paper, we present an SDN-enabled resource-aware topology framework. The proposed framework employs SLA compliance, Path Computation Element (PCE) and shares fair loading to achieve better topology features. We also present an evaluation, showcasing the potential of our framework.

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.

To overcome the time-consuming drawbacks of Computational Fluid Dynamics (CFD) numerical simulations, this paper proposes a hybrid model based on a parallel architecture based on the concept of intelligent aerodynamics, named PA-TLA (Parallel Architecture combining TCN, LSTM, and Attention mechanism). This model utilizes CFD data to drive efficient predictions of aircraft wake evolution at different initial altitudes during the approach phase. Initially, CFD simulations of continuous initial altitudes during the approach phase are used to generate aircraft wake evolution data, which are then validated against real-world LIDAR data to verify their reliability. The PA-TLA model is designed based on a parallel architecture, combining Long Short-Term Memory networks (LSTM), Temporal Convolutional Networks (TCN), and a tensor concatenation module based on the attention mechanism, which ensures computational efficiency while fully leveraging the advantages of each component in a parallel processing framework. The study results show that the PA-TLA model outperforms both the LSTM and TCN models in predicting the three characteristic parameters of aircraft wake: vorticity, circulation, and Q-criterion. Compared to the serially structured TCN-LSTM, PA-TLA achieves an average reduction in mean squared error (MSE) by 6.80%, mean absolute error (MAE) by 7.70%, and root mean square error (RMSE) by 4.47%, with an average increase in the coefficient of determination (R²) by 0.36%, and a 35% improvement in prediction efficiency. Lastly, this study combines numerical simulation and the PA-TLA deep learning architecture to analyze the characteristics of wake evolution during the near-ground phase, providing theoretical value for further reducing aircraft wake intervals and enhancing airport operational efficiency.

This paper addresses the input coupling problem for the shape memory alloy (SMA) actuated parallel platform with completely unknown nonlinear dynamics. The problem means that in a parallel platform with multiple SMA actuators acting together, the displacement of one of the actuators will simultaneously affect the remaining actuators to change. Due to the coupling problem and nonlinear characteristics of the SMA actuators, it is not easy to control the platform to achieve bi-directional swing with completely unknown nonlinear dynamics. Therefore, a model-free adaptive sliding mode control method is proposed to improve the control accuracy of the complex motion of the platform, avoiding the complex modeling process of the SMA actuated parallel platform. Based on the model-free adaptive control (MFAC) theory, a multiple input and multiple output (MIMO) dynamic linearized mathematical model of the parallel platform is established using the online input and output data of the system. Then, a sliding mode controller is designed based on the dynamic model. A rigorous theoretical analysis proves that the proposed model-free adaptive sliding mode controller is able to stably control the SMA actuated parallel platform, and its tracking error is uniformly ultimately bounded (UUB). Finally, experiments are conducted on the established SMA actuated parallel platform. The results show that the proposed model-free controller is feasible and effective, and can control the system well to achieve the complex motion of bi-directional swing.

To solve the problem of a uneven load for a dual-input counter-rotating transmission system, this research is based on Small Displacement Torsor Jacobian-Torsor theory.Considering the influence of the local parallel chain of a gearbox on the calculation accuracy of the backlash,the processing method of a meshing tooth pair parallel chain is proposed. The probability distribution of the tolerance band of gearbox manufacturing and assembly errors is modeled, the three-dimensional tolerance analysis model of a dual-input counter-rotating gearbox is established, and the Monte Carlo method is used to solve the backlash of the output end. The output backlash is solved with the Monte Carlo method, and the theoretical design backlash is combined with the output backlash to derive the gearbox side clearance range. The gearbox shaft system is analyzed statically, the range of the equal load coefficient is calculated, and the equal load performance optimization method based on the matching relationship between the gear backlash and the elastic shaft torsional stiffness is proposed. The correctness of the three-dimensional tolerance analysis combined with the elastic deflection angle used to optimize the equal load performance of the dual-input counter-rotating transmission system is verified by comparison with the relevant test data.

In the present protocol, we determined the presence and concentrations of bisphenol A (BPA) spiked in surface water samples using EEM fluorescence spectroscopy in conjunction with modelling using partial least squares (PLS) and parallel factor (PARAFAC). PARAFAC modelling of the EEM fluorescence data obtained from surface water samples contaminated with BPA unraveled four fluorophores including BPA. The best outcomes for BPA concentration (R2 = 0:996; Standard deviation to prediction error's root mean square ratio (RPD) = 3.41; and a Pearson's r value of 0.998). With these values of R2 and Pearson's r, the PLS model showed a strong correlation between the predicted and measured BPA concentrations. The detection and quantification limits of the methods were 3.512 and 11.708 micro molar (µM), respectively. In conclusion, BPA can be precisely detected and its concentration in surface water predicted using the PARAFAC and PLS models developed in this study and fluorescence EEM data collected from BPA-contaminated water. It is necessary to spatially relate surface water contamination data with other datasets in order to connect drinking water quality issues with health, environmental restoration, and environmental justice concerns.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

With the development of higher voltage power grid, the high and low voltage parallel loops are emerging, which lead to energy losses, even threaten the security and stability of power system. The multi-infeed HVDC configurations widely appearing in AC/DC interconnected power system make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating condition with high and low voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN algorithm. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP). And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

With the fast growth of smartphones and digital cameras, massive images are generated every day in the world. They are easily transmitted on the insecure channel-Internet. It has been a hot spot for protecting sensitive images during communication. A new cryptosystem is proposed using a six dimensional (6D) hyperchaotic system and DNA computing. The hash value is obtained with the function of SHA-512. It keeps the encrypted result closely connected with the original image. The initial values of the cryptosystem are produced with the hash value and the secret key. The pixel is divided into four parts, and a large matrix is formed. Scrambling is performed on the new image. DNA coding, modern DNA complementary rules, DNA computing, and DNA decoding are performed on the new image. Diffusion is also executed, and ciphered image is achieved finally. The experimental result reveals the outcome of the proposed algorithm. Security analysis shows that the designed algorithm has a huge secret key space, low correlation, and high sensitivity. It also signifies that the designed algorithm could protect against common attacks and is more secure than some existing methods.

Edge computing reduces the response time of real-time services with handling dynamic traffics reliably. Edge servers with limited resources utilize container technology that provides a lightweight execution environment. When deploying containers in edge servers, a container image is required and is downloaded from a remote registry. Therefore, these operations are dependent on network overhead between the container deployment system and the remote registry. Through motivation experiments, we show that container pooling time increases in proportion to physical distance and has characteristics that vary flexibly depending on runtime time. In this study, we define a system model for high-speed registry deployment in this edge system and propose a clustering technique into k groups based on the network overhead and affinity of the regionally distributed edge servers that make up the edge system. Also, considering idle resources, we propose a technique to deploy a registry after electing a leader for each cluster. A simulation experiment is conducted to verify the performance of the proposed technique and shows that performance improvement can be achieved regardless of the number of edge servers and the k value.

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.

In recent years, significant progress has been observed in cloud computing. As the number of companies using the cloud increases, so does the need to protect user data. Today, the major challenges facing cloud computing include the security, protection, and processing of data belonging to users. This study aims to investigate security issues and identify appropriate security techniques in the world of cloud computing. Also, the identification of security challenges that may arise in the field of cloud computing in the future has been evaluated. In this research, we used two different research methods: systematic literature review (SLR), and survey and interview with different security experts who work in the field of cloud computing. All the security challenges, most compromised attributes, and identified mitigation techniques from both SLR and survey were presented and discussed.

The analysis of network structure is essential to many scientific areas, ranging from biology to sociology. As the computational task of clustering these networks into partitions, i.e., solving the community detection problem, is generally NP-hard, heuristic solutions are indispensable. The exploration of expedient heuristics has led to the development of particularly promising approaches in the emerging technology of quantum computing. Motivated by the substantial hardware demands for all established quantum community detection approaches, we introduce a novel QUBO based approach that only needs number-of-nodes many qubits and is represented by a QUBO-matrix as sparse as the input graph's adjacency matrix. The substantial improvement on the sparsity of the QUBO-matrix, which is typically very dense in related work, is achieved through the novel concept of separation-nodes. Instead of assigning every node to a community directly, this approach relies on the identification of a separation-node set, which - upon its removal from the graph - yields a set of connected components, representing the core components of the communities. Employing a greedy heuristic to assign the nodes from the separation-node sets to the identified community cores, subsequent experimental results yield a proof of concept. This work hence displays a promising approach to NISQ-ready quantum community detection, catalyzing the application of quantum computers for the network structure analysis of large scale, real world problem instances.}

The goal of finding a commutative group of gates from the set of unitary matrices is to simplify the process of quantum computing. If a set of gates is commutative, then we can apply the gates in any order without affecting the final outcome. This is important because quantum systems are very sensitive to errors and decoherence, and any disruption to the system can cause errors in the computation.By having a commutative group of gates, we can simplify the process of designing quantum algorithms and reduce the risk of errors. This is particularly important for solving complex computational problems that cannot be solved by classical computers.

This study describes the development of an image-based insect trap diverging from the plug-in camera insect trap paradigm. In short, a) it does not require manual annotation of images to learn how to count targeted pests and, b) it self-disposes the captured insects, and therefore is suitable for long-term deployment. The device consists of an imaging sensor integrated with Raspberry Pi microcontroller units with embedded deep learning algorithms that count agricultural pests inside a pheromone-based funnel trap. The device also receives commands from the server which configures its operation while an embedded servomotor can automatically rotate the detached bottom of the bucket to dispose of hydrated insects as they begin to pile up. Therefore, it completely overcomes a major limitation of camera-based insect traps: the inevitable overlap and occlusion caused by the decay and layering of insects during long-term operation, thus extending the autonomous operational capability. We study cases that are underrepresented in literature such as counting in situations of congestion and significant debris using crowd counting algorithms encountered in human surveillance. Finally, we perform comparative analysis of the results from different deep-learning approaches (YOLO7/8, crowd counting, deep learning regression) and we open-source the code and a large database of Lepidopteran plant pests.

In recent decades, power consumption has become an essential factor in attracting the attention of integrated circuit (IC) designers. Multiple-valued logic (MVL) and approximate computing are some techniques that could be applied to integrated circuits to make power-efficient systems. By utilizing MVL-based circuits instead of binary logic, the information conveyed by digital signals increases, and this reduces the required interconnections and power consumption. On the other hand, approximate computing is a class of arithmetic computing used in systems where the accuracy of the computation can be traded-off for lower energy consumption. In this paper, we propose novel designs for exact and inexact ternary multipliers based on carbon-nanotube field-effect transistors (CNFETs). The unique characteristics of CNFETs make them a desirable alternative to MOSFETs. The simulations are conducted using Synopsys HSPICE. The proposed design is compared against existing ternary multipliers. The results show that the proposed exact multiplier reduces energy consumption by up to 6X. At the same time, the best inexact design improves energy efficiency by up to 35X compared to the latest state-of-the-art methods. Using the imprecise multipliers for image processing provides evidence that these proposed designs are a low-power system with an acceptable error.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

The article provides detailed information about the new technologies based on cluster computing Hadoop and Apache Spark. The experimental task of processing logistic regression with the help of these technologies is considered. The findings on the comparison of the performance of cluster computing of Hadoop and Apache Spark are revealed and substantiated.

Neuromorphic computing, a brain inspired non-Von Neumann computing system, addresses the challenges posed by the Moore’s law memory wall phenomenon. It has the capability to increasingly enhance performance while maintaining power efficiency. Neuromorphic chip architecture requirements vary depending on the application and optimizing it for large-scale applications remains to be a challenge. Neuromorphic chips are programmed using spiking neural networks which provide them with important properties such as parallelism, asynchronism, and on-device learning. Widely used spiking neuron models include the Hodgkin-Huxley Model, Izhikevich model, integrate-and-fire model and spike response model. Hardware implementation platforms of the chip follow three approaches: analog, digital, or a combination of both. Each platform can be implemented using various memory topologies which interconnects with the learning mechanism. Current neuromorphic computing systems typically use the unsupervised learning spike timing-dependent plasticity algorithms. However, algorithms such as voltage-dependent synaptic plasticity have the potential to enhance performance. This review summarizes the potential neuromorphic chip architecture specifications and highlights which applications they are suitable for.

Digital image compression is applied to reduce camera bandwidth and storage requirements, but real-time lossless compression on a high-speed high-resolution camera is a challenging task. The article presents hardware implementation of a Bayer colour filter array lossless image compression algorithm on an FPGA-based camera. The compression algorithm reduces colour and spatial redundancy and employs Golomb-Rice entropy coding. A rule limiting the maximum code length is introduced for the edge cases. The proposed algorithm is based on integer operators for efficient hardware implementation. The algorithm is first verified as a C++ model and later implemented on Xillinx Zynq UltraScale+ device using VHDL. An effective tree-like pipeline structure is proposed to concatenate codes of compressed pixel data to generate a bitstream representing data of 16 parallel pixels. The proposed parallel compression achieves up to 56% reduction in image size for high resolution images. Pipelined implementation without any state machine ensures operating frequencies up to 320 MHz. Parallelised operation on 16 pixels effectively increases data throughput to 40 Gbit/s while keeping total memory requirements low due to real-time processing.

This paper presents the design and analysis of a novel 3-degree-of-freedom (3-DOF) parallel ma-nipulator equipped with self-sensing Ni-Ti (Nitinol) actuators. The manipulator's architecture and mechanical design are elucidated, emphasizing the integration of Nitinol actuators. The self-sensing technique implemented in a previous work was extended to a 20 mm actuator length, and the actuator was used to design the 3 DOF manipulator. Kinematic analyses were conducted to eval-uate the manipulator's performance under various operating conditions. A dynamic model was implemented for the dynamic dimensioning of the actuators, which work synergistically with a bias spring. The manipulator was realized, and a control strategy was implemented. Experimental tests, although documenting some positioning accuracy issues, show the efficacy and potential applica-tions of the proposed manipulator in robotics and automation systems, highlighting the advantages of self-sensing Nitinol actuators in small parallel manipulator designs.

Similarly to his special theory of relativity, Einstein's special principle of relativity extends beyond the limits currently known to it. Up to now, the principle has not been suspected to have the potential to translate laws. However, the principle holds an inherent capacity to translate physical laws and, in so doing, speeds up our understanding and control of physical reality. Such a translation of laws leads to the faster discovery of other laws, such as the Laws of Electronic Motion, characterizing the motion of electrons around the atomic nucleus, and the Third Law of Biological Resistance, facilitating the successful control of drug resistance in medicine. The ability of the special principle of relativity to translate laws shines forth once the said principle is duly interpreted. This interpretation exposes a parallelism between experimental frames of reference and justifies the applicability of the laws of one frame of reference in other parallel frames of reference. This process opens the door to our faster discovery of the laws governing a multiplicity of frames parallel to a frame we already know the laws of. In practice, the interpretation of Einstein's special principle of relativity speeds up our understanding of the workings of physical reality and strengthens our capacity to subdue matter.

Some traditional robots are based on offline programming reciprocal motion, and with the continuous upgrading of vision technology, more and more tasks are replaced by machine vision. For the current problem of insufficient accuracy of robot target localization based on binocular vision, and an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance For the current problem of insufficient accuracy of robot target localization based on binocular vision, an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance of multi Firstly, the RANSAC algorithm is improved based on the SURF algorithm; then the parallax gradient method is applied to iterate the matched point pairs several times to further optimize the data; then the 3D reconstruction is completed by the program technique; finally the obtained data is finally the obtained data is input into the robot arm and the camera internal and external parameters are obtained by the calibration method so that the robot can accurately locate and The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi- The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi-vision system.

We numerically study surface models defined on hexagonal disks with a free boundary. 2D surface models for planer surfaces have recently attracted interest due to the engineering applications of functional materials such as graphene and its composite with polymers. These 2D composite meta-materials are strongly influenced by external stimuli such as thermal fluctuations if they are sufficiently thin. For this reason, it is very interesting to study the shape stability/instability of thin 2D materials against thermal fluctuations. In this paper, we study three types of surface models including Landau-Ginzburg (LG) and Helfirch-Polyakov models defined on triangulated hexagonal disks using the parallel tempering Monte Carlo simulation technique. We find that the planer surfaces undergo a first-order transition between the smooth and crumpled phases in the LG model and continuous transitions in the other two models. The first-order transition is relatively weaker compared to the transition on spherical surfaces already reported. The continuous nature of the transition is consistent with the reported results, although the transitions are stronger than that of the reported ones.

The Industrial Internet of Things (IIoT) paradigm is a key research area derived from the Internet of Things (IoT). The emergence of IIoT has enabled a revolution in manufacturing and production, through the employment of various embedded sensing devices connected with each other by an IoT network, along with a collection of enabling technologies such as artificial intelligence (AI) and edge/fog computing. One of the unrivaled characteristics of IIoT is the inter-connectivity provided to industries; however, this characteristic might open the door for cyber-criminals to launch various attacks. In fact, one of the major challenges hindering the prevalent adoption of the IIoT paradigm is IoT security. Inevitably, an increasing number of research proposals have been introduced over the last decade to overcome these security concerns. To obtain an overview of this research area, conducting a literature survey of the published research is necessary, eliciting the various security requirements and their considerations. This paper provides a literature survey of IIoT security, focused on the period from 2017 to 2023. We identify IIoT security threats and classify them into three categories, based on the IIoT layer they exploit to launch these attacks. Additionally, we characterize the security requirements that these attacks violate. Finally, we highlight how emerging technologies, such as AI and edge/fog computing, can be adopted to address security concerns and enhance IIoT security.

The practice of quantified-self sleep tracking is increasingly common nowadays among healthy individuals as well as patients with sleep problems. However, existing sleep-tracking technologies only support simple data collection and visualization, and are incapable of providing actionable recommendations that are tailored to users' physical, behavioral and environmental context. Here we coined the term context-aware sleep health recommender system (CASHRS) as an emerging multidisciplinary research field that bridges ubiquitous sleep computing and context-aware recommender systems. In this paper, we presented a narrative review to analyze the type of contextual information, the recommendation algorithms, the context filtering techniques, the behavior change techniques, the system evaluation, and the challenges in peer-reviewed publications that meet the characteristics of CASHRS. Analysis results identified current research trends, the knowledge gap, and future research opportunities in CASHRS.

This paper thoroughly assesses the ARM and RISC-V architectures in the context of High-Performance Computing (HPC). It includes an analysis of Docker, Kubernetes, and KVM virtualization integration. Our study aims to evaluate and compare these systems' performance, scalability, and practicality in a general context and then assess the impact that might have on special use cases, like HPC. ARM-based systems exhibited better performance and seamless integration with Docker and Kubernetes, underscoring their advanced development and effectiveness in managing high-performance computing workloads. On the other hand, despite their open-source architecture, RISC-V platforms presented considerable intricacy and difficulties in coordinating with Kubernetes, which hurt their overall effectiveness and ease of management. The results of our study offer valuable insights into the practical consequences of implementing these architectures for HPC, highlighting ARM's preparedness and the potential of RISC-V while acknowledging the increased complexity involved and significant trade-offs at this point.