Recent advancement of deep learning has been elevated the multifaceted nature in various applications of this field. Artificial neural networks are now turning into a genuinely old procedure in the vast area of computer science; the principal thoughts and models are more than fifty years of age. However, in this modern computing era, 3rd generation intelligent models are introduced by scientists. In the biological neuron, actual film channels control the progression of particles over the layer by opening and shutting in light of voltage changes because of inborn current flows and remotely led to signals. A comprehensive 3rd generation, Spiking Neural Network (SNN) is diminishing the distance between deep learning, machine learning, and neuroscience in a biologically-inspired manner. It also connects neuroscience and machine learning to establish high-level efficient computing. Spiking Neural Networks initiate utilizing spikes, which are discrete functions that happen at focuses as expected, as opposed to constant values. This paper is a review of the biological-inspired spiking neural network and its applications in different areas. The author aims to present a brief introduction to SNN, which incorporates the mathematical structure, applications, and implementation of SNN. This paper also represents an overview of machine learning, deep learning, and reinforcement learning. This review paper can help advanced artificial intelligence researchers to get a compact brief intuition of spiking neural networks.

In recent years, Edge Intelligence (EI) has emerged, combining edge computing with AI, specifically deep learning, to run AI algorithms directly on edge devices. In practical applications, EI faces challenges related to computational power, power consumption, size, and cost, with the primary challenge being the trade-off between computational power and power consumption. This has rendered traditional computing platforms unsustainable, making heterogeneous parallel computing platforms a crucial pathway for implementing EI. In our research, we leveraged the Xilinx Zynq 7000 heterogeneous computing platform, employed High-Level Synthesis (HLS) for design, and implemented two different accelerators for LeNet-5 using loop unrolling and pipelining optimization techniques. The experimental results show that when running at a clock speed of 100 MHz, the PIPELINE accelerator, compared to the UNROLL accelerator, experiences an 8.09% increase in power consumption but speeds up by 14.972 times, making the PIPELINE accelerator superior in performance. Compared to the CPU, the PIPELINE accelerator reduces power consumption by 91.37% and speeds up by 70.387 times, while compared to the GPU, it reduces power consumption by 93.35%.This study provides two different optimization schemes for edge intelligence applications through design and experimentation, and demonstrates the impact of different quantization methods on FPGA resource consumption. These experimental results can provide a reference for practical applications, thereby providing a reference hardware acceleration scheme for edge intelligence applications.

Spiking neural networks (SNNs) promise to perform tasks currently done by classical artificial neural networks (ANNs) faster, in smaller footprints and using less energy. Neuromorphic processors are set out to revolutionize computing at a large scale, but the move to edge-computing applications calls for finely-tuned custom implementations to keep pushing towards more efficient systems. To that end, we have examined the architectural design space for executing spiking neuron models on FPGA platforms, focusing on achieving ultra-low area and power consumption. This work presents an efficient clock-driven spiking neuron architecture used for the implementation of both fully-connected cores and 2D convolutional cores, which rely on deep pipelines for synaptic processing and distributed memory for weight and neuron states. With them, we have developed an accelerator for an SNN version of the LeNet-5 network trained on the MNIST dataset. At around 5.5 slices/neuron and only 348 mW, it is able to use 33% less area and 4 times as less power per neuron as current state-of-the-art implementations while keeping low simulation step times.

In view of intensified disasters and fatalities caused by natural phenomena and geographical expansion, there is a pressing need for a more effective environment logging for a better management and urban planning. This paper proposes a novel utility computing model (UCM) for structural health monitoring (SHM) that would enable dynamic planning of monitoring systems in an efficient and cost-effective manner. The proposed UCM consists of network-attached data drive that stores data from SHM logger, population count system and Geographic Information System (GIS) enhanced with a Cloud IoT data backup, display, and analysis server. The UCM using this data and data from building information systems applies a simple machine learning algorithm to generate real-time structure health and suggests re-planning of SHM units. The health of structure varies dynamically with disturbances created by higher occupancy and structure density per zone. The proposed SHM-UCM is unique in terms of its capability to manage heterogeneous SHM resources. This was tested in a case study on Qatar University (QU) in Doha Qatar, where it looked at where SHM nodes are distributed along with occupancy density in each building. This information was taken from QU simulated occupation and zone calculation models and then compared to ideal SHM system data. Results show the effectiveness of the proposed model in logging and dynamically planning SHM.

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.

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

Building a widely distributed hotspot network is a very tedious task due to its complexity. Providing security, fully distributed network services, and cost-conscious impact are the major challenges behind this goal. To overcome these issues, we have presented a novel distributed hotspot network architecture with five layers that can provide large-scale hotspot coverage as an assimilated result. Our contributions to this new architecture highlight important aspects. First, scalability can be increased by including many Internet-of-Things (IoT) devices with sensors and Wi-Fi and/or LoraWAN connectivity modules. Second, hotspot owners can rent out their hotspots to create a distributed hotspot network in which the hotspots can act as an ordinary data gateway, a full-fledged hotspot miner, and a lightweight hotspot miner to earn crypto tokens as rewards for certain activities. Third, the advantages of Wi-Fi and LoraWAN can be seamlessly leveraged to achieve optimal coverage, higher network security, and suitable data transmission rate for transferring sensor data from IoT devices to remote application servers and users. Fourth, blockchain is used to enhance the decentralized behavior of the architecture presented here by providing immutability and independence from a centralized regulator and making the network architecture more reliable and transparent. The main feature of our paper is the use of the tau-computing paradigm along with hotspots to improve availability, Internet backhaul-agnostic network coverage, and synchronous update capability, and tau-aware leasing to strengthen and improve coverage. We also discuss the key challenges and future roadmap that require further investment and deployment.

This project designed a set of network security mechanisms for cloud applications in VANETs. At present, cloud computing is one of the government’s development priorities in the industry. We divide cloud into public, private, and hybrid clouds in this project. Vehicles or passengers can access road conditions or public transport information through the public cloud; public transportation can access current driving records and users can access relevant enterprise information on the private cloud and hybrid cloud is a combination of public and private clouds. Both cloud computing or VANETs require network and information security. At present, many researches on VANETs security only focus on message communication, and neglect information storage. Researches on cloud computing security only focus on information protection, and neglect user privacy and anonymity. This project designed a set of network and information security mechanisms in line with the requirements of Confidentiality, Authentication, Non-repudiation, Conditional Anonymity, and Conditional Untraceability. This project primarily needs to achieve the following: 1.an authentication mechanism to verify the identity of each other between the passenger and the vehicle and to verify the identity with Single Sign-On; 2. vehicle or user privacy and anonymity, which need to be able to replace the anonymous ID and related parameters for the vehicle or the user; 3. a private communication mechanism, which enables any vehicle or user to communicate privately; and 4. an information security encryption method, which can encrypt the information on a cloud server to avoid unauthorized access by internal personnel or hackers.

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

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.

In this paper we present a successful implementation of the Hindmarsh–Rose model within a SC environment. The merits of the proposed approach are design simplicity, due to stochastic computing, and the ease of implementation. Simulation results showed that the approximation achieved is equivalent to introducing a noise source into the original model. A study for the level of noise introduced, according to the number of bits in the stochastic sequence, has been performed. Additionally, we demonstrate that such an approach, even though it is noisy, it reproduces the behaviour of biological systems, which are intrinsically noisy. It is also demonstrated that a speedup of x2 compared to biological systems is easily achievable, with a very small number of gates, thus paving the road for the in silico implementation of large neuron networks.

The Ising model, a cornerstone in the understanding of critical points, phase transitions, and magnetic systems, has been pivotal in advancing our knowledge of statistical physics. Although analytical solutions exist for the 1D and 2D Ising models, complexities rise significantly with the inclusion of external magnetic fields and in higher dimensions. Here, we demonstrate a novel quantum computational approach to simulate the 1D Ising model with basic quantum gates in the QISKIT(Python) that is both accessible to beginners and executable on personal computers, bypassing the need for advanced computational infrastructure. By initializing the system in a comprehensive superposition state, we effectively utilize quantum gates to replicate the intricate interactions between spins and external fields. This method offers a more intuitive and direct observational means of the system's evolution, distinguishing it from previous methodologies. Our results not only repeat all the physics behavior in the 1D Ising model but also showcase the expanding capabilities of quantum computing to tackle complex physical systems, promising advancements in both theoretical and applied physics.

The colossal depths of the deep neural network sometimes suffer from ineffective backpropagation of the gradients through all its depths. Whereas, The strong performance of shallower multilayer neural structures prove their ability to increase the gradient signals in the early stages of training which easily gets backpropagated for global loss corrections. Shallow neural structures are always a good starting point for encouraging the sturdy feature characteristics of the input. In this research, a shallow, deep neural structure called PrimeNet is proposed. PrimeNet is aimed to dynamically identify and encourage the quality visual indicators from the input to be used by the subsequent deep network layers and increase the gradient signals in the lower stages of the training pipeline. In addition to this, the layerwise training is performed with the help of locally generated errors which means the gradient is not backpropagated to previous layers, and the hidden layer weights are updated during the forward pass, making this structure a backpropagation free variant. PrimeNet has obtained state-of-the-art results on various image datasets, attaining the dual objective of (1) compact dynamic deep neural structure, which (2) eliminates the problem of backwards-locking. The PrimeNet unit is proposed as an alternative to traditional convolution and dense blocks for faster and memory-efficient training, outperforming previously reported results aimed at adaptive methods for parallel and multilayer deep neural systems.

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

Memristive spiking neural networks are a promising emerging technology in the field of deep learning. These models can be implemented using neuromorphic hardware and therefore offer low power consumption and low latency, crucial to edge-computing applications. These systems, however, pose several challenges, including on-chip training and connectivity reduction. The latter is essential to ease the manufacturing complexity of the system. On-chip training can be realized using synaptic plasticity enabled by memristors. In this work, we compare two methods of connectivity reduction applicable to memristive spiking networks: an ensemble-based approach and a probabilistic sparse connectivity approach. We evaluate both of these methods in conjunction with a three-layer spiking neural network on the handwritten and spoken digits classification tasks using two memristive plasticity models and a classical time-dependent plasticity rule. On the handwritten digits recognition task, both methods achieve the F1-score of 0.89–0.93, and yield the 0.80–0.96 F1-score on the spoken digits recognition task.

IoT is a new communication paradigm that gains a very high importance in the past few years. This communication paradigm supports various heterogeneous applications in many fields and with the dramatic increase of the number of sensor devices, it becomes a demand. Designing IoT networks faces many challenges that include security, massive traffic, high availability, high reliability and energy constraints. Thus, new communication technologies and paradigms should be deployed for IoT networks to overcome these challenges and achieve high system performance. Distributed computing techniques (e.g. fog and MEC), software defined networking (SDN), network virtualization and blockchain are common recent paradigms that should be deployed for IoT networks, either combined or individually, to achieve the main requirements of the IoT networks at a high system performance. Fog computing is a form of edge computing that has been developed to provide the computing capabilities (e.g. storage and processing) at the edge of the access network. Employing Fog computing in IoT networks, as an intermediate layer between IoT devices and the remote cloud, becomes a demand to make use of the edge computing benefits. In this work, we provide a framework for the IoT system structure that employs an edge computing layer of Fog nodes controlled and managed by SDN network with the blockchain technology to achieve a high level of security for latency sensitive IoT applications. The proposed system employs SDN network with distributed controllers and distributed OpenFlow switches; these switches are enabled with limited computing and processing capabilities. Furthermore, a data offloading algorithm is developed to allocate different processing and computing tasks to the distributed OpenFlow switches with available resources. Moreover, a traffic model is proposed to model and analyze the traffic among different parts of the network. The proposed work achieves various benefits to the IoT network, such as the latency reduction, security improvement and high efficiency of resources utilization. The proposed algorithm is simulated and also the proposed system is experimentally tested over a developed testbed to validate the proposed structure. Experimental results show that the proposed system achieves higher efficiency in terms of latency, security and resource utilization.

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.

Resource pricing in cloud computing has become one of the main challenges for cloud providers. The challenge is determining a fair and appropriate price to satisfy users and resource providers. To determine a fair price, it is necessary to consider the conditions and needs of both parties: provider and user. This research tries to provide a pricing mechanism for cloud computing based on game theory. The proposed mechanism takes into account three factors including fault possibility, interaction between virtual machines, and energy consumption to reach a fair price. In the proposed game, the provider decides on the price of the virtual machine which can be offered to the user on each physical machine and the user decides between the virtual machines offered to run its application. The whole game is implemented as a function of the resource broker component. The proposed mechanism is simulated and evaluated using the CloudSim simulator. Its performance is compared with several previous recent mechanisms. According to the results, the proposed mechanism has been able to determine a more reasonable price for the user and the provider which increases the overall profitability of the cloud system.

Many factors drive land desertification, especially in arid and semi-arid regions. However, the numerous driving factors of desertification make analyses computer expensive. Cloud computing comes along to address this problem, especially in developing countries. The objective of this work was to assess the sensitivity of the East Atlantic Basin, Brazil, to desertification using the Mediterranean Desertification and Land Use (MEDALUS) model and Google Earth Engine (GEE). The model is composed of four environmental Quality Indices (QIs) associated with soil (SQI), vegetation (VQI), climate (CQI) and management (MQI), and contains factors influencing the desertification process. Digital databases of the factors were pre-processed and uploaded to GEE for analysis. We report Environmentally Sensitive Areas (ESAs) and Environmentally Critical Factors (ECF) maps of the East Atlantic Basin, which showed that most of the basin is in either critical (49.4%) or fragile (35.7%) state of sensitivity. In contrast, only a smaller portion of the area is unaffected (5%) or potentially affected (10.1%). Sensitivity to desertification was inversely correlated with the presence of vigorous vegetation. A joint analysis of ESAs and ECF shed light on the importance of each factor in the sensitivity to desertification. The East Atlantic Basin shows a high degree of sensitivity to desertification, thereby demanding more attention and establishment of measures to mitigate the negative impacts of the desertification process.

Many factors drive land desertification, especially in arid and semi-arid regions. However, the numerous driving factors of desertification make analyses computer expensive. Cloud computing comes along to address this problem, especially in developing countries. The objective of this work was to assess the sensitivity of the East Atlantic Basin, Brazil, to desertification using the Mediterranean Desertification and Land Use (MEDALUS) model and Google Earth Engine (GEE). The model is composed of four environmental Quality Indices (QIs) associated with soil (SQI), vegetation (VQI), climate (CQI) and management (MQI), and contains factors influencing the desertification process. Digital databases of the factors were pre-processed and uploaded to GEE for analysis. We report Environmentally Sensitive Areas (ESAs) and Environmentally Critical Factors (ECF) maps of the East Atlantic Basin, which showed that most of the basin is in either critical (49.4%) or fragile (35.7%) state of sensitivity. In contrast, only a smaller portion of the area is unaffected (5%) or potentially affected (10.1%). Sensitivity to desertification was inversely correlated with the presence of vigorous vegetation. A joint analysis of ESAs and ECF shed light on the importance of each factor in the sensitivity to desertification. The East Atlantic Basin shows a high degree of sensitivity to desertification, thereby demanding more attention and establishment of measures to mitigate the negative impacts of the desertification process.

Convolutional neural networks (CNNs), inspired by biological visual cortex systems, are a powerful category of artificial neural networks that can extract the hierarchical features of raw data to greatly reduce the network parametric complexity and enhance the predicting accuracy. They are of significant interest for machine learning tasks such as computer vision, speech recognition, playing board games and medical diagnosis [1-7]. Optical neural networks offer the promise of dramatically accelerating computing speed to overcome the inherent bandwidth bottleneck of electronics. Here, we demonstrate a universal optical vector convolutional accelerator operating beyond 10 Tera-FLOPS (floating point operations per second), generating convolutions of images of 250,000 pixels with 8-bit resolution for 10 kernels simultaneously — enough for facial image recognition. We then use the same hardware to sequentially form a deep optical CNN with ten output neurons, achieving successful recognition of full 10 digits with 900 pixel handwritten digit images with 88% accuracy. Our results are based on simultaneously interleaving temporal, wavelength and spatial dimensions enabled by an integrated microcomb source. This approach is scalable and trainable to much more complex networks for demanding applications such as unmanned vehicle and real-time video recognition.

The primary attraction of IaaS is providing elastic resources on demand. It becomes imperative that IaaS-users have an effective methodology for learning what resources they require, how many resources and for how long they need. However, the heterogeneity of resources, the diversity resource demands of different cloud applications and the variation of application-user behaviors pose IaaS-users big challenge. In this paper, we purpose a unified resource demand forecasting model suiting for different applications, various resources and diverse time-varying workload patterns. With the model, taking input from parameterized applications, resources and workload scenarios, the corresponding resources demands during any time interval can be deduced as output. The experiments configure concrete functions and parameters to help understanding the above model.

Classroom resource allocation is a challenging problem in educational institutions. The use of cloud computing can aid in the optimization of this process by allowing resource providers to allocate resources to users in a timely and efficient manner. In this paper, we propose a modified Salp Swarm Algorithm (SSA) to optimize the allocation of classroom resources. The proposed approach involves generating a population of salps representing potential solutions to the resource allocation problem and updating the positions of the salps iteratively based on a fitness function and mathematical equations. We conducted simulations of the proposed algorithm on various numbers of tasks and sources to evaluate its performance. The results indicate that the modified SSA algorithm can efficiently allocate classroom resources, achieving lower completion time of tasks (makespan) with lower costs. This paper contributes to the literature by introducing an effective approach to solve the classroom resource allocation problem.

In this work, we present a model of the atom that is based on a nonclassical logic called paraconsistent logic (PL), which has the main property of accepting the contradiction in logical interpretations without the conclusions being annulled. The proposed model is constructed with an extension of PL called paraconsistent annotated logic with annotation of two values (PAL2v), which is associated with an interlaced bilattice of four vertices. We use the logarithmic function of the Shannon entropy H_(s) to construct the paraconsistent equations and thus adapt a probabilistic model for representations in quantum physics. Through analyses of the interlaced bilattice, comparative values are obtained for some of the phenomena and effects of quantum mechanics, such as superposition of states, quantum entanglement, wave functions, and equations that determine the energy levels of the layers of an atom. At the end of this article, we use the hydrogen atom as a basis of the representation of the PAL2v model, where the values of the energy levels in six orbital layers are obtained. As an example, we present a possible method of applying the PAL2v model to the use of Raman spectroscopy signals in the detection of lubricating mineral oil quality.

Peer-to-peer (P2P) content distribution or file sharing system aims to facilitate the dissemination of large files over unreliable networks. Network coding is a new transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

Biological neural network (BNN) is the core brain for creature to accomplish its intelligent behaviors through unique network structure and mechanisms. It also inspires controlling human-designed autonomous agents including robots to generate more advanced intelligent behaviors by mimicking the neural control mechanism of creatures at a deeper and more interactive level. Here, we constructed a whole-brain neural network model of Caenorhabditis elegans (C. elegans), which characterizes the electrochemical processes at the level of cellular synapse. The neural network simulation integrates computational programming and visualization of neurons and synapse connections of C. elegans, containing the specific controllable circuits summarization with their dynamic characteristics within the whole network. To illustrate its particular intelligent control capability in terms of robotics, we introduce the first innovative methodology for applying the BNN model to a 12-legged robot’s movement control based on the established numerical simulation platforms. We accomplished and designed two methods and corresponding encoding processes, one involving orientation control and the other involving locomotion generation, to demonstrate the intelligent control performance of BNN. Both simulation and experiment results indicate that the robot exhibits stronger autonomy and more intelligent moving performance under the control of BNN. We then summarized the contributions for digitalizing the C. elegans’ whole-brain neural network in real-time and utilizing it to control robot in a closed loop to validate its advanced intelligence control ability in terms of a scientific robot.

Since the implementation of the Materials Genome Project by the Obama administration in the United States, the development of various computational materials databases has fundamentally expanded the choices of industries such as materials and energy. In the field of thermoelectric materials, the thermoelectric figure of merit ZT quantifies the performance of the material. From the viewpoint of calculations for vast materials, the ZT values are not easily obtained due to their computational complexity. Here, we show how to build a database of thermoelectric materials based on first-principles calculations for the electronic and heat transport of materials. Firstly, the initial structures are classified according to the values of bandgap and other basic properties using the clustering algorithm K-means in machine learning, and high-throughput first principles calculations are carried out for narrow-bandgap semiconductors which exhibiting potential thermoelectric application. The present framework of calculations mainly includes deformation potential module, electrical transport performance module, mechanical and thermodynamic properties module. We have also set up a search webpage for the calculated database of thermoelectric materials, providing searching and viewing the related physical properties of materials. Our work may inspire the construction of more computational databases of first-principle thermoelectric materials and accelerate research progress in the field of thermoelectrics.

Most IoT systems meant for implementing mission-critical systems are multi-layered based. The majority of the computing is done in the services and gateway layer. The Gateway layer connects the Internal section of the IoT to the cloud through the Internet. The failure of any node between the services servers and the gateways will isolate the entire network leading to zero tolerance. A networking topology is required to connect the service servers to the gateways, yielding 100% fault tolerance. Empirical formulation of the model chosen to connect the service’s servers to gateways through routers is required to compute the fault tolerance of the network. Rectangular and Interstitial Mesh have been proposed in this paper to connect the service servers to the gateways through the servers that yield 0.999 fault tolerance of the IoT network. An empirical formulation is also presented using which the Fault tolerance of the IoT network can be computed. An enhancement of 11% in the fault tolerance capability of an IoT network has been achieved by implementing Rectangular and Interstitial Mesh in the gateway layer of the network.

The ongoing revolution in Deep Learning is redefining the nature of computing that is driven by the increasing amount of pattern classification and cognitive tasks. Specialized digital hardware for deep learning still holds its predominance due to the flexibility offered by the software implementation and maturity of algorithms. However, it is being increasingly desired that cognitive computing occurs at the edge, i.e. on hand-held devices that are energy constrained, which is energy prohibitive when employing digital von Neumann architectures. Recent explorations in digital neuromorphic hardware have shown promise, but offer low neurosynaptic density needed for scaling to applications such as intelligent cognitive assistants (ICA). Large-scale integration of nanoscale emerging memory devices with Complementary Metal Oxide Semiconductor (CMOS) mixed-signal integrated circuits can herald a new generation of Neuromorphic computers that will transcend the von Neumann bottleneck for cognitive computing tasks. Such hybrid Neuromorphic System-on-a-chip (NeuSoC) architectures promise machine learning capability at chip-scale form factor, and several orders of magnitude improvement in energy efficiency. Practical demonstration of such architectures has been limited as performance of emerging memory devices falls short of the expected behavior from the idealized memristor-based analog synapses, or weights, and novel machine learning algorithms are needed to take advantage of the device behavior. In this work, we review the challenges involved and present a pathway to realize ultra-low-power mixed-signal NeuSoC, from device arrays and circuits to spike-based deep learning algorithms, with ‘brain-like’ energy-efficiency.

Reservoir computers (RCs) are a biology inspired computational framework for signal processing typically implemented using recurrent neural networks. Recent work has shown that Boolean networks (BN) can also be used as reservoirs. We analyze the performance of BN RCs, measuring their flexibility and identifying factors that determine effective approximation of Boolean functions that are applied in a sliding-window fashion over a binary signal, either non-recursively or recursively. We train and test BN RCs of different sizes, signal connectivity, and in-degree to approximate 3-bit, 5-bit and 3-bit recursive binary functions. We analyze how BN RC parameters and function average sensitivity, a measure of function smoothness, affect approximation accuracy as well as the spread of accuracies for a single reservoir. We found that approximation accuracy and reservoir flexibility are highly dependent on RC parameters. Overall, our results indicate that not all reservoirs are equally flexible and RC instantiation and training can be more efficient if this is taken into account. The optimum range of RC parameters opens up an angle of exploration for understanding how biological systems might be tuned to balance system restraints with processing capacity.

Social media platforms have been entirely an undeniable part of the lifestyle for the past decade. Analyzing the information being shared is a crucial step to understanding human behavior. Social media analysis aims to guarantee a better experience for the user and risen user satisfaction. For deriving any further conclusion, first, it is necessary to know how to compare users. In this paper, a hybrid model has been proposed to measure Twitter profiles’ similarity and quantifies the likeness degree of profiles by calculating features considering users’ behavioral habits. For this, first, the timeline of each profile has been extracted using the official TwitterAPI. Then, in parallel, three aspects of a profile are deliberated. Behavioral ratios are time-series-related information showing the consistency and habits of the user. Dynamic time warping has been utilized to compare the behavioral ratios of two profiles. Next, the audience network is extracted for each user, and for estimating the similarity of two sets, Jaccard similarity is used. Finally, for the Content similarity measurement, the tweets are preprocessed respecting the feature extraction method; TF-IDF and DistilBERT for feature extraction are employed and then compared using the cosine similarity method. Results have shown that TF-IDF has slightly better performance; therefore, the more straightforward solution is selected for the model. Similarity level of different profiles. As in the case study, a Random Forest classification model was trained on almost 20000 users revealed a 97.24% accuracy. This comparison enables us to find duplicate profiles with nearly the same behavior and content.

Synesthesia is a psychological phenomenon where sensory signals become mixed. Input to one sensory modality produces an experience in a second, unstimulated modality. In “grapheme-color synesthesia”, viewed letters and numbers evoke mental imagery of colors. The study of this condition has implications for increasing our understanding of brain architecture and function, language, memory and semantics, and the nature of consciousness. In this work, we propose a novel application deep learning to model perception in grapheme-color synesthesia. Achromatic letter images, taken from database of handwritten characters, are used to induce synesthesia. Results show the model learns to accurately create a colored version of the inducing stimulus, according to a statistical distribution from experiments on a sample population of grapheme-color synesthetes. The spontaneous, creative mental imagery characteristic of the synesthetic perceptual experience is reproduced by the model. A model of synesthesia that generates testable predictions on brain activity and behavior is needed to complement large scale data collection efforts in neuroscience, especially when articulating simple descriptions of cause (stimulus) and effect (behavior). The research and modeling approach reported here begins to address this need.

This paper explores the transformative impact of computational pharmaceutics, integrating AI, multi-scale modeling, quantum computing, AI-driven drug discovery, and blockchain frameworks. Molecular dynamics simulations provide insights into atomic behaviors crucial for drug design. Quantum computing reduces computational costs for simulating protein-drug interactions. AI and Graph Neural Networks accelerate drug discovery and personalized medicine. Blockchain frameworks facilitate secure pharmacogenetic data sharing. These advancements revolutionize drug development, offering unprecedented efficiency, innovation, and personalized treatments.

Recently, a layer-stacked ESN model named deep echo state Network (DeepESN) has been established. As an interactional model of recurrent neural network and deep neural network, investigations of DeepESN are of significant importance in both areas. Optimizing the structure of neural networks remains a common task in artificial neural networks, and the question of how many neurons should be used in each layer of DeepESN must be stressed. In this paper, our aim is to solve the problem of choosing the optimized size of DeepESN. Inspired by the sensitive iterative pruning algorithm, a neuronal similarity-based iterative pruning merging algorithm (NS-IPMA) is proposed to iteratively prune or merge the most similar neurons in DeepESN. Two chaotic time series prediction tasks are applied to demonstrate the effectiveness of NS-IPMA. The results show that the DeepESN pruned by NS-IPMA outperforms unpruned DeepESN with the same network size, and NS-IPMA is a feasible and superior approach to improving the generalization performance of DeepESN.

Silica on Silicon is a major optical integration platform, while the emergent class of integrated Laser written circuits' platform offers additionally high customizability, and flexibility for rapid prototyping. However, the inherent waveguides' low core/cladding refractive index contrast characteristic compared to other photonic platforms in silicon or silicon nitride, sets serious limitations for on-chip efficient coupling with single photon emitters, like semiconductor nanowires with quantum dots limiting the applications in quantum computing. A new light coupling scheme proposed here overcomes this limitation providing means for light coupling >50%. The scheme is based on the incorporation of an optical microsphere between the nanowire and the waveguide, properly optimized and arranged in terms of: size, refractive index, distance of microsphere between nanowire and waveguide. Upon suitable design of the optical arrangement, the photonic nanojet emitted by the illuminated microsphere excites efficiently the guided eigenmodes of the input channel waveguide, thus launching light with high coupling efficiency. The method is tolerant in displacements, misalignments, and imperfections and is fabricationally feasible by current state of the art techniques. The proposed method enables the on-chip multiple single photon emitters' integration thus allowing the development of highly customizable and scalable quantum photonic integrated circuits for quantum 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.

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

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.

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

In this paper we introduce a computational model for the simulation of hypervelocity impact (HVI) phenomena which is based on the Discrete Element Method (DEM). Our paper constitutes the first application of DEM to the modeling and simulating of impact events for velocities beyond 5 kms⁻¹. We present here the results of a systematic numerical study on HVI of solids. For modeling the solids, we use discrete spherical particles that interact with each other via potentials. In our numerical investigations we are particularly interested in the dynamics of material fragmentation upon impact. We model a typical HVI experiment configuration where a sphere strikes a thin plate and investigate the properties of the resulting debris cloud. We provide a quantitative computational analysis of the resulting debris cloud caused by impact and a comprehensive parameter study by varying key parameters of our model. We compare our findings from the simulations with recent HVI experiments performed at our institute. Our findings are that the DEM method leads to very stable, energy–conserving simulations of HVI scenarios that map the experimental setup where a sphere strikes a thin plate at hypervelocity speed. Our chosen interaction model works particularly well in the velocity range where the local stresses caused by impact shock waves markedly exceed the ultimate material strength.

: The significance of heating load (HL) accurate approximation is the primary motivation of this research to distinguish the most efficient predictive model among several neural-metaheuristic models. The proposed models are through synthesizing multi-layer perceptron network (MLP) with ant lion optimization (ALO), biogeography-based optimization (BBO), dragonfly algorithm (DA), evolutionary strategy (ES), invasive weed optimization (IWO), and league champion optimization (LCA) hybrid algorithms. Each ensemble is optimized in terms of the operating population. Accordingly, the ALO-MLP, BBO-MLP, DA-MLP, ES-MLP, IWO-MLP, and LCA-MLP presented their best performance for population sizes of 350, 400, 200, 500, 50, and 300, respectively. The comparison was carried out by implementing a ranking system. Based on the obtained overall scores (OSs), the BBO (OS = 36) featured as the most capable optimization technique, followed by ALO (OS = 27) and ES (OS = 20). Due to the efficient performance of these algorithms, the corresponding MLPs can be promising substitutes for traditional methods used for HL analysis.

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

Using insights from cybernetics and an information-based understanding of biological systems, a precise, scientifically inspired, definition of free-will is offered and the essential requirements for an agent to possess it in principle are set out. These are: a) there must be a self to self-determine; b) there must be a non-zero probability of more than one option being enacted; c) there must be an internal means of choosing among options (which is not merely random, since randomness is not a choice). For (a) to be fulfilled, the agent of self-determination must be organisationally closed (a `Kantian whole'). For (c) to be fulfilled: d) options must be generated from an internal model of the self which can calculate future states contingent on possible responses; e) choosing among these options requires their evaluation using an internally generated goal defined on an objective function representing the overall `master function' of the agent and f) for `deep free-will', at least two nested levels of choice and goal (d-e) must be enacted by the agent. The agent must also be able to enact its choice in physical reality. The only systems known to meet all these criteria are living organisms, not just humans, but a wide range of organisms. The main impediment to free-will in present-day artificial robots, is their lack of being a Kantian whole. Consciousness does not seem to be a requirement and the minimum complexity for a free-will system may be quite low and include relatively simple life-forms that are at least able to learn.

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

In this work, an IoT system with edge computing capability is proposed facilitating postoperative surveillance of patients who have undergone knee surgery. The main objective is to reliably identify whether a set of orthopedic rehabilitation exercises are executed correctly, which is critical since, it is often necessary to supervise patients during the rehabilitation period so as to avoid injuries or long recovery periods. The proposed system leverages Internet of Things (IoT) paradigm, in combination with Deep Learning and Edge Computing to classify the extend-flex movement of one’s knee via embedded Machine Learning (ML) classification algorithms. The contribution of the proposed work is multilayered. Furthermore as an outcome of this work a dataset of labeled knee movements is freely available on https://www.kaggle.com/datasets/billskarm/knee-range-of-motion to the research community. It also provides real time movement detection with an accuracy reaching 100%, which is achieved with a ML model trained to fit a low cost, off the shelf, Bluetooth Low Energy platform. The proposed Edge Computing approach allows predictions to be performed on-device rather than solely relying on a cloud service. This yields critical benefits in terms of wireless bandwidth and power conservation, drastically enhancing device autonomy, while delivering reduced event detection latency. In particular, the “on device” implementation is able to yield a drastic 99,9% wireless data transfer reduction, a critical 39% prediction delay reduction and a valuable 17% increase of prediction event. Finally, enhanced privacy comprises another significant benefit from the implemented Edge Computing ML model as sensitive data can be processed on-site and only events or predictions are shared with the medical personnel.

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

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

This paper describes the first results of an Image Recognition Based Location (IRBL) for mobile application focusing on the procedure to generate a Database of range images (RGB-D). In an indoor environment, to estimate the camera position and orientation, a prior spatial knowledge of the surrounding is needed. In order to achieve this objective a complete 3D survey of two different environment (Bangbae metro station of Seoul and E.T.R.I. building in Daejeon – Republic of Korea) was performed using LiDAR (Light Detection And Ranging) instrument and the obtained scans were processed in order to obtain a spatial model of the environments. From this, two databases of reference images were generated using a specific software realized by the Geomatics group of Politecnico di Torino (ScanToRGBDImage). This tool allow to generate synthetically different RGB-D images) centered in the each scan position in the environment. Later, the external parameters (X, Y, Z, ω, φ, κ) and the range information extracted from the DB images retrieved, are used as reference information for pose estimation of a set of acquired mobile pictures in the IRBL procedure. In this paper the survey operations, the approach for generating the RGB-D images and the IRB strategy are reported. Finally the analysis of the results and the validation test are described.

This study empirically analyzes the effectiveness of resource optimization utilizing artificial intelligence (AI) within cloud computing environments. It compares systems that have been transitioned from a Monolithic structure to Microservices Architecture (MSA) with those adopting a simple Rehost strategy, to validate the operational efficiency of two systems whose resource efficiency has been enhanced compared to traditional legacy systems. The research is based on systems that determined resource efficiency post-cloud migration using APM tools. It points out the limitations of traditional heuristic operation methods in resource optimization, which lead to issues such as application performance degradation, resource over-allocation, and increased operational costs. This study aims to overcome the conventional resource optimization standards that depended on the average peak usage of CPU and memory infrastructure, by introducing AI-based optimization tools, and applying on-premise standards to cloud and container environments to achieve resource optimization. The paper emphasizes the importance of resource optimization through AI-based automation tools, exploring the possibilities of resolving real-world application performance issues in cloud environments, reducing unnecessary resource usage costs, and cutting down on labor risks and operational expenses. Through this, it presents strategic directions on how AI technology can offer financial and operational advantages in managing cloud resources.

We find at least 4 quantum properties that are indeed universal in some number systems; and we can use them for quantum consciousness. Using the sets B={0,1}, N, Z, or Q has the +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum computing. This paper proposes the use of Bayesian geometry to reduce the space of possible results, reducing or increasing initial beliefs by successive experimentation. This is exemplified in biology and mathematics, and can be applied to physics and other sciences. The conclusion is that an experimental fact can be absolutely verified. Any mathematical choice (as verified by computers) militating against R=Q, is under an absolutely low chance to succeed. Infinitesimals are denied based on 3^16 independent factors. This is not a probabilistic result, but based on reduction of the Bayes geometry for updating beliefs. This work applies to non-probabilistic and unknown phenomena, such as those found in oscillations (neutrino, health), evolution, and quantum computing, denies Gödel's uncertainty, and solves the liar's paradox by reflection. This connects different scientific fields with one another, in an internet, i.e., in a network of connections of multiple open networks, using the set Q, resembling a hologram, and includes entanglement.

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.

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.

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.

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.

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.

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.

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.

Cloud computing transformed IT organizations with its on-demand model, notably Infrastructure as a Service (IaaS). Cloud providers manage extensive physical devices, consuming substantial energy and bandwidth for data traffic during virtual machine deployment. Balancing energy and bandwidth are critical. This thesis presents BOHGOA integrated with ACO to optimize virtual machine placement in clouds, simultaneously considering bandwidth and energy. It yields Pareto-optimal solutions for this trade-off. Using CloudSim, BOHGOA outperformed GA, ACO, and FFD algorithms, reducing bandwidth consumption by 54.14%, 32.11%, 57.47% (240 VMs) and 38.12%, 22.76%, 47.05% (500 VMs) respectively. Additionally, it decreased physical machine energy usage by 37.70%, 34.01%, 40.14% (240 VMs) and 27.50%, 22.28%, 30.52% (500 VMs) respectively. These results underscore BOHGOA's effectiveness in optimizing cloud VM placement.

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.

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.

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

In this discussion paper, I give an account for non-experts of, arguably, quantum dynamics in the brain, underlying the modeling of affective behavior of humanoid robots in the making. Outreach to the larger audience inevitably leads to abbreviations and simplifications; nonetheless, I try to offer the backgrounds of why it is important to study the virtual aspects of ‘people’ we meet online, what dimensions play a role in assessing such creatures, what humanities, psychology, communication, and computer science provide to help us understand how we become attached to non-existent others. As its capstone for the time being, an approach derived from physics is discussed for a robot to handle emotional ambiguity and vagueness of its user. Two computational models, Silicon and Quantum Coppélia, are discussed for their potential and limitations in explaining human affective behavior while dealing with mediated characters.

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

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.

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.

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.

Advanced state-of-the-art technologies, mainly computational intelligence including Machine/Deep Learning and Fuzzy Computing, through applied research, can provide added value to modern science and, in general, to entrepreneurship and the economy. Artificial intelligence is the field of computer science that attempts to model concepts such as learning, adaptability and perception to synthesize intelligent behavior in solving complex problems, utilizing elements of adaptation to the environment and philosophical reasoning. About the science of civil engineering and, in general, the construction industry, which is one of the most important in economic entrepreneurship, both in terms of the size of the workforce employed and the amount of capital invested, the penetration of artificial intelligence is possible to change industry business models, eliminate costly mistakes, reduce Jobsite injuries and generally make large-scale engineering projects more efficient. The purpose of the paper is to present the recent research on artificial intelligence methods (machine-deep learning, computer vision, natural language processing, fuzzy systems, robotics, etc.) and the corresponding related technologies related to it (extensive data analysis, blockchain, cloud computing, internet of things, augmented reality), in the fields of application of civil engineering science, including structural engineering, geotechnical engineering, hydraulics and water resources management, marine and coastal technology, transport and transportation infrastructure, planning and technical project management, critical infrastructure security and disaster mitigation..

Drops are the most important and most common energy dissipator in irrigation networks and erodible canals and consequently, their performance must be well understood. This study was designed to evaluate the capability of Artificial Intelligence (AI) methods including ANN, ANFIS, GRNN, SVM, GP, MLR, and LR to predict the relative energy dissipation (∆E/E0) in vertical drops equipped with a horizontal screen. For this study, 108 experiments were carried out to investigate energy dissipation with variable discharge, varying drop height, and porosity of the horizontal screens. Parameters yc/h, yd/yc, and p are considered as input variables and ∆E/E0 is the output variable. The efficiency of models was compared using Taylor's diagram, Box Plot of the applied error distribution, correlation coefficient (CC), mean absolute error (MAE) and root-mean-square error (RMSE). Results indicate that the performance of the ANFIS_gbellmf based model with CC value of 0.9953, RMSE value of 0.0069 and MAE value of 0.0042 was superior to other applied models. Also, the linear regression model with CC=0.9933, RMSE=0.0083, and MAE= 0.0067performs better than the multiple linear regression model in this study. Results of a sensitivity study suggest that yc/h is the most effective parameter for predicting ∆E/E0.

The continuous advancement of Artificial Intelligence (AI) technology depends on the efficient processing of unstructured data, encompassing text, speech, and video. Traditional serial computing systems based on the von Neumann architecture, employed in information and communication technology development for decades, not suitable for the concurrent processing of massive unstructured data tasks with relatively low-level operations. As a result, there arises a pressing need to develop novel parallel computing systems. Recently, there has been a burgeoning interest among developers in emulating the intricate operations of the human brain, which efficiently processes vast datasets with remarkable energy efficiency. This has led to the proposal of neuromorphic computing systems. Of these, Spiking Neural Networks (SNNs), designed to closely resemble the information processing mechanisms of biological neural networks, are subjects of intense research activity. Nevertheless, a comprehensive investigation into the relationship between spike shapes and Spike-Timing-Dependent Plasticity (STDP) to ensure efficient synaptic behavior remains insufficiently explored. In this study, we systematically explore various input spike types to optimize the resistive memory characteristics of Halfnium-based Ferroelectric Tunnel Junction (FTJ) devices. Among the various spike shapes investigated, the square-triangle (RT) spike exhibited good linearity and symmetry, and a wide range of weight values could be realized depending on the offset of the RT spike. These results indicate that the spike shape serves as a crucial indicator in the alteration of synaptic connections, representing the strength of the signals.

Rapid growth of IoT applications and their interference in our daily lives led to many different IoT devices which generates enormous data. The IoT devices’ resources are very limited, so storing and processing IoT data in the devices is very inefficient. Several resources of cloud-computing are efficiently used to handle some IoT resources issues. While using resources in the cloud centers cause some other issues, like latency in the IoT applications, which are time-critical. Thus, the technology of edge cloud has evolved recently. This technology permits storage and data processing at the network edge. This paper studies edge computing in-depth for timeless sensitive devices in IoT. In-depth, cutting-edge IoT computing systems (ECAs-IoT) are evaluated and characterized in this paper according to numerous criteria, such as information placement, improvisation facilities, reliability, and data visualization. Moreover, according to distinctive properties, the paper aims at comparing each structure in detail. The paper also highlights the significant limitations of the new ECAs-IoT and recommends solutions to them. The studies also introduce and propose solutions to some of the most important restrictions of the current ECAs-IoT. Consequently, in the edge computing domain, this survey outlines the IoT implementations. Lastly, with the use of IoT implementations for ECAs-IoT, the paper suggests four distinct scenarios.

The supply of feed has a significant effect on fish growth and operation costs, making it a critical factor in aquaculture. Owing to the repetitive nature of feed supply, feeding techniques have undergone a shift from manual feeding to systems allowing operators to set feed quantities and timing, reducing labor efforts. However, unlike manual feeding, automatic systems cannot ad-just the amount of feed supplied according to the feeding activities of fish, potentially resulting in overfeeding or underfeeding. Such overfeeding causes marine pollution and increases operational costs, whereas underfeeding hinders fish growth. In this paper, we present an intelligent feeding system that observes the depth-specific feeding behavior of red seabream during the feeding process and determines whether feed supply must be continued. The performance of the feeding algorithm is evaluated by comparing the feed loss rate measured during a feeding experiment at a red seabream sea cage farm with that of the traditional manual feeding method. The results reveal that the feed supply per unit time of the manual method and the developed intelligent feed supply system is at an equivalent level. Moreover, the difference in the average feed loss rate is a negligible 1.16%, confirming that the new system is slightly more advantageous.

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.

Music is capable of conveying many emotions. The level and type of emotion of the music perceived by a listener, however, is highly subjective. In this study, we present the Music Emotion Recognition with Profile information dataset (MERP). This database was collected through Amazon Mechanical Turk (MTurk) and features dynamical valence and arousal ratings of 54 selected full-length songs. The dataset contains music features, as well as user profile information of the annotators. The songs were selected from the Free Music Archive using an innovative method (a Triple Neural Network with the OpenSmile toolkit) to identify 50 songs with the most distinctive emotions. Specifically, the songs were chosen to fully cover the four quadrants of the valence arousal space. Four additional songs were selected from DEAM to act as a benchmark in this study and filter out low quality ratings. A total of 277 participants participated in annotating the dataset, and their demographic information, listening preferences, and musical background were recorded. We offer an extensive analysis of the resulting dataset, together with a baseline emotion prediction model based on a fully connected model and an LSTM model, for our newly proposed MERP dataset.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (Cc) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, Cc was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e0). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate Cc such as Oedometer test. This study presents a novel prediction model for Cc of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate Cc based on LL, PL, and e0. The performance of developed GEP-based model was evaluated through coefficient of determination (R2), root mean squared error (RMSE), and mean average error (MAE). High R2 and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R2, RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining Cc of fine-grained soils.

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

The combination of artificial intelligence algorithms and numerical methods has recently become popular in the prediction of macroscopic and microscopic hydrodynamics parameters of bubble column reactors. The multi inputs and outputs machine learning can cover small phase interactions or large fluid behavior in industrial domains. This numerical combination can develop the smart multiphase bubble column reactor with the ability of low-cost computational time. It can also decrease case studies for the optimization process when big data is appropriately used during learning. There are still many model parameters that need to be optimized for a very accurate artificial algorithm, including data processing and initialization, the combination of inputs and outputs, number of inputs and model tuning parameters. For this study, we aim to train four inputs big data during learning process by an adaptive neuro-fuzzy inference system or adaptive-network-based fuzzy inference system (ANFIS) method, and we consider the superficial gas velocity as one of the input variables, while for the first time, one of the computational fluid dynamics (CFD) outputs named gas velocity is used as an output of the artificial algorithm. The results show that the increasing number of input variables improves the intelligence of the ANFIS method up to , and the number of rules during learning process has a significant effect on the accuracy of this type of modeling. The results also show that propper selection of model parameters results in more accuracy in prediction of the flow characteristics in the column structure.

This study applies several natural language processing techniques for characterizing social groups by analyzing published text in social media. The resulting computed values are proposed as features for modeling social groups and measure distances or similarities among them, along further data that could help understanding group behavior according to language usage. In this study, we have analyzed the messages published on Twitter regarding patriotism by the main political parties in Spain. The results show that lexical resources and topic modelling algorithms are useful to model different groups and serve as comparison tools to better understand the topics these groups are talking about.

In recent years, Cloud Computing and Big Data have been considered the most attractive areas that are revolutionizing the IT world. Cloud Computing paradigm has recently appeared that allows running proprietary or difficult portable applications outside their original software environment on one or more virtual hardware platforms. Therefore, we are to developing such techniques which make it possible to secure communication between the communicating Cloud entities. These techniques must take into account several factors due to the data transmitted in this type of environment is proprietary and of significant size. Conventional data security techniques are not suitable for today's cloud usage. Hence, the main research of this thesis is to define an adaptable architecture with the aim to propose a scalable system that supports cloud services. We will define feasible security solutions dedicated to the Cloud computing context in order to robustly protect data stored in the Cloud. We are more precisely looking for working on NoSQL databases. We also intend to propose a secure solution based on the blockchain that has powerful features like decentralization, autonomy, security, reliability, and transparency.

In this paper, we introduce a simple yet powerful and working version of the molecular dynamics code using the Python 3.9 language. The code contents are published in the link given in the appendix 1. The structure and components of the program is given in detail using flowcharts and code snippets. The program consists of major features like velocity verlet integrator, thermostats, COM removal, input and output modules, virial, pressure, and other thermodynamic quantities estimation etc. The author believes that this program will be helpful to graduate students who perform research in molecular dynamics simulations who intend to write their own code instead of the sophisticated open source packages.

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.

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

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 resource allocation for tasks in heterogeneous distributed system is a well known NP-hard problem. For the sake of making the makespan is minimized, it is hard to distribute the tasks to proper processors. The problem is even more complex and challenging when the processors have unavailable time and the tasks type are various. This paper investigates a resource allocation problem for hybrid tasks comprising both divisible and bag-of-tasks(BoT) in heterogeneous distributed system when the processors has unavailable time. First, the mathematical model, which minimizes the makespan of the hybrid tasks when the processors have unavailable time, is established. Second, we propose a scheduling algorithm referred to as bag-of-tasks allocate-pull and divisible task allocation (BoTAPDTA) algorithm for handling hybrid tasks on heterogeneous distributed systems. In addition, to solving the optimization model efficiently, a generic algorithm(GA) is proposed. For the sake of reducing the search space and solving the optimization model effectively, a two step scheduling algorithm(TSGA), which first allocate bag-of-tasks(BoT) using generic algorithm and then assign divisible task to processors like BoTAPDTA, is designed. Finally, numerical simulation experiments are conducted, and experimental results indicate the effectiveness of the proposed model and algorithm.

A full connected world is expected to gain in the 6th generation mobile network (6G). As a typi-cal fully connected scenario, the internet of vehicle (IoV) enables intelligent vehicle operations via artificial intelligence (AI) and edge computing technologies. In the future of vehicular net-works, wide variety of services need powerful computing resources and higher quality of ser-vice (QoS). Existing resources are insufficient to match these requirements. Aim to this problem, An intelligent service offloading framework is provided. Based on the framework, an Algorithm of Improved Gradient Descent (AIGD) is created to accelerate the speed of iteration. So, the con-vergence of convolutional neural network (CNN) based on AIGD is able to be accelerated too. Then, an Algorithm of convolutional long short-term memory (CN_LSTM) Based Traffic Predic-tion (ACLBTP) is designed to gain the predicted number of vehicles belonged to the edge node. At last, an Algorithm of Service Offloading Based on CN_LSTM (ASOBCL) is conducted to of-fload these services to the vehicles belonged to the edge node. In ASOBCL, sorting technique is adopted to speed up the offloading work. Simulation results demonstrate the fact that the pre-diction strategy designed in this paper has high accuracy. The low offloading time and main-taining stable load balance is gained via running ASOBCL. Low offloading time means short response time. And, the QoS is guaranteed. So, these strategies designed in this paper are effec-tive and valuable.

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

The development of quantum computers seeks software developers' attention regarding security in the era of Information Technology, software security is the primary goal for our quantitative assessment of software security in the development cycle of software. Security assessment of software is identifying the key security factors of the software. A security elective provides ex-tensive strategies and calculations to ensure product safety. The security assessment is the key factor in surveying, administering, and controlling security to further enhance the nature of safety. It should be acknowledged that assessing security early on in the development process is beneficial in identifying worms, hazards, flaws, and threats. The definition and portrayal of Quantum Computing (QC) in software security will be discussed in this study. Researchers use cryptography calculations to secure our financial institutions, medical devices, military weaponry, planes, ships, vehicles, and pilots. Here authors of this study use the Fuzzy Technique for Order Preference by Similarity to Ideal Situation (FTOPSIS) to quantitatively assess the weight/rank of the quantum enable security alternatives like (Diffie-Hellman key-exchange algorithm, Quantum key distribution algorithm, Deutsch-Jozsa Algorithm, Special Deutsch-Jozsa Algorithm, Grover’s Algorithm and Quantum key distribution algorithm in GHZ state) with security factors like (Confidentiality, Integrity, Authenti-cation, Privacy, Reliability, Maintainability, Authorization, Integrity, Possessions, and Availability). Additionally, they critically analyze and select the six alternatives of quantum-based security algorithms. The nature of safety infers the ability to execute a thing on time in this exploration study, specifically 'software security'.

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

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.

In recent years, CPU caches have revealed themselves as one of the most powerful sources of information leakage. This information leakage affects any implementation whose memory accesses, to data or instructions, depend on sensitive information such as private keys. In most cases, side-channel cache attacks do not require any specific permission and just need access to a shared cache. This fact, combined with the spread of cloud computing, where the infrastructure is shared between different customers, have made these attacks quite popular. In this paper, we present a novel approach to exploit the information obtained from the CPU cache. First, we introduce a non-access attack that provides a 97\% reduction in the number of encryptions required to obtain a 128-bit AES key. Next, this attack is adapted and extended in what we call the encryption-by-decryption cache attack or EBD, to obtain a 256-bit AES key. When EBD is applied to AES-256, we are able to obtain the 256 bits of the key with less than 10000 encryptions. These results make EBD, to the best of our knowledge, the first practical attack on AES-256 and also demonstrate that AES-256 is only about 3 times more complex to attack than AES-128 via cache attacks. In both cases the target is the AES T-table-based implementation, and we also demonstrate that our approach works in a cross-VM scenario.

Good estimators are characterized as robust, unbiased, efficient, and consistent. However, the commonly used estimators are weak or lack one or more of these properties. In this article, eight (8) estimators for statistical and geometrical estimations of symmetry/asymmetry, similarity/dissimilarity, identity/unidentity, and feature transformation were proposed following Kabirian-based optinalysis and other operations. The proposed estimators are characterized as invariant (robust) under scaling, location shift, and rotation or reflection. A computing code was written in python language for each of the proposed estimators so that peers can have working codes for application and performance evaluation.