Problem In Computing Research Articles

Solving a real-world package delivery routing problem using quantum annealers.

Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered. Anyway, it is undeniable that it is often difficult to translate complex requirements into these classical formulations. The main objective of this research is to present a solving scheme for dealing with realistic instances while maintaining all the characteristics and restrictions of the original real-world problem. Thus, a quantum-classical strategy has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.

Effective data reduction for strongly stable matching in very sparse graphs

We provide a linear-time computable problem kernel of linear size for Strongly Stable Roommates parameterized by the feedback edge number of the acceptability graph (which encodes which agents may be matched to each other).

Quantum annealing for nearest neighbour compliance problem

Quantum Computing has emerged as a promising alternative, utilising quantum mechanics for faster computations. This paper explores the nearest neighbour compliance (NNC) Problem in Gate-based Quantum Computers, where quantum gates are constrained to operate on physically adjacent qubits. The NNC problem aims to optimise the insertion of SWAP-gates to ensure compliance with these constraints while minimising their count. This work introduces Quantum Annealing to tackle the NNC problem, proposing two Quadratic Unconstrained Optimisation Problem formulations. The formulations are tested on a contemporary Quantum Annealer, and their performance is compared with previous methods. It shows that the prospect of using Quantum Annealing is promising, however, the current state of the hardware makes that finding the embedding is the limiting factor.

Interest-aware joint caching, computing, and communication optimization for mobile VR delivery in MEC networks

In the upcoming B5G/6G era, Virtual Reality (VR) over wireless has become a typical application, which is an inevitable trend in the development of video. However, in immersive and interactive VR experiences, VR services typically exhibit high delay, while simultaneously posing challenges for the energy consumption of local devices. To address these issues, this paper aims to improve the performance of VR service in the edge-terminal cooperative system. Specifically, we formulate a joint Caching, Computing, and Communication (3C) VR service policy problem by optimizing the weighted sum of the total VR delivery delay and the energy consumption of local devices. To design the optimal VR service policy, the optimization problem is decoupled into three independent subproblems to be solved separately. To improve the caching efficiency within the network, a Bert-based user interest analysis method is first proposed to accurately characterize the content request behavior. Based on this, a service cost minimum-maximization problem is formulated under the consideration of performance fairness among users. Then, the joint caching and computing scheme is derived for each user with a given allocation of communication resources while a bisection-based communication scheme is acquired with the given information on the joint caching and computing policy. With alternative optimization, an optimal policy for joint 3C based on user interest can be finally obtained. Simulation results are presented to demonstrate the superiority of the proposed user interest-aware caching scheme and the effectiveness of the joint 3C optimization policy while considering user fairness. Our code is available at https://github.com/mrfuqaq1108/Interest-Aware-Joint-3C-Optimization.

PHOTONIC INTEGRATED CIRCUITS: GIANT LEAP IN COMPUTING TECHNOLOGY

There is a continued demand for increase in computing requirements from sensor, smartphones, to servers. However, the technology improvements in clock speed, power, and memory bandwidth from traditional electronic integrated circuits (EIC) has started to saturate. This has triggered further research in exploration of photon integrated circuits (PIC) that utilize photons (or particles of light) as opposed to electrons to form a functioning circuit. Research suggests that by integrating the benefits of EIC and PIC, one is able to harness the best of both worlds. The inherent advantages of photonics technology such as speed, energy-efficiency, and density, coupled with the advances in material technology, make them suitable to address the challenge of designing heterogeneous chips. This paper presents the fundamentals of the photonic technology, applicability to solving digital computing problems, ability to integrate into PICs, and its capability to complement electronic integrated circuits for powering the computing demands of emerging applications.

Cloud Computing Security Issues, Challenges, and Solutions

Cloud computing has revolutionized the way agencies manage and deliver their IT offerings by means of imparting scalable, bendy, and fee-effective solutions. However, with these good sized blessings come complicated protection demanding situations. The allotted nature of cloud environments, coupled with multi-tenant infrastructures, offers new risks that require sturdy and adaptive security frameworks. This paper goals to provide an in-intensity exploration of the primary security problems in cloud computing, the underlying challenges companies face in securing cloud services, and the solutions designed to mitigate these dangers

Incompleteness Theorem for Computable Problems

Incompleteness Theorem for Computable Problems

Typology of Big Data Algorithms for Solving Computing Problems in Transport

Typology of Big Data Algorithms for Solving Computing Problems in Transport

Energy-efficiency optimization for heterogeneous computing-assisted NOMA-MEC edge AI tasks

Edge artificial intelligence (AI) is an emerging paradigm that leverages edge computing to pave the last-mile delivery of AI. To satisfy the increasing demand for high-performance computing and low latency of edge service, heterogeneous computing accelerators, especially Neural Processor Units (NPUs), are widely deployed on edge nodes. However, the edge AI heterogeneous computing system encounters the challenge of energy constraints. In this paper, we investigate the energy efficiency (EE) optimization problem in heterogeneous computing-assisted non-orthogonal multiple access mobile edge computing (NOMA-MEC) network model. Edge devices are configured with CPU-NPU heterogeneous computing processors to improve the AI task processing, and NOMA is applied to edge task offloading to enable massive connectivity. The system-centric energy efficiency maximization problem is studied. We formulate a system-centric energy efficiency maximization problem. To solve this problem, we decouple the original problem into two subproblems, i.e., the optimization problems of heterogeneous computing workload splitting and task offloading. A heuristic algorithm and binary search algorithm are proposed to optimize NOMA user pairing and task offloading delay, respectively. Furthermore, we propose a multi-objective alternative iterative algorithm to optimize system energy efficiency. Numerical results show that the proposed scheme can significantly improve the energy efficiency of heterogeneous computing-assisted NOMA-MEC networks compared to the existing baselines.

Variational Feature Extraction in Scientific Visualization

Across many scientific disciplines, the pursuit of even higher grid resolutions leads to a severe scalability problem in scientific computing. Feature extraction is a commonly chosen approach to reduce the amount of information from dense fields down to geometric primitives that further enable a quantitative analysis. Examples of common features are isolines, extremal lines, or vortex corelines. Due to the rising complexity of the observed phenomena, or in the event of discretization issues with the data, a straightforward application of textbook feature definitions is unfortunately insufficient. Thus, feature extraction from spatial data often requires substantial pre- or post-processing to either clean up the results or to include additional domain knowledge about the feature in question. Such a separate pre- or post-processing of features not only leads to suboptimal and incomparable solutions, it also results in many specialized feature extraction algorithms arising in the different application domains. In this paper, we establish a mathematical language that not only encompasses commonly used feature definitions, it also provides a set of regularizers that can be applied across the bounds of individual application domains. By using the language of variational calculus, we treat features as variational minimizers, which can be combined and regularized as needed. Our formulation not only encompasses existing feature definitions as special case, it also opens the path to novel feature definitions. This work lays the foundations for many new research directions regarding formal definitions, data representations, and numerical extraction algorithms.

A Multi-Agent Reinforcement Learning-Based Task-Offloading Strategy in a Blockchain-Enabled Edge Computing Network

In recent years, many mobile edge computing network solutions have enhanced data privacy and security and built a trusted network mechanism by introducing blockchain technology. However, this also complicates the task-offloading problem of blockchain-enabled mobile edge computing, and traditional evolutionary learning and single-agent reinforcement learning algorithms are difficult to solve effectively. In this paper, we propose a blockchain-enabled mobile edge computing task-offloading strategy based on multi-agent reinforcement learning. First, we innovatively propose a blockchain-enabled mobile edge computing task-offloading model by comprehensively considering optimization objectives such as task execution energy consumption, processing delay, user privacy metrics, and blockchain incentive rewards. Then, we propose a deep reinforcement learning algorithm based on multiple agents sharing a global memory pool using the actor–critic architecture, which enables each agent to acquire the experience of another agent during the training process to enhance the collaborative capability among agents and overall performance. In addition, we adopt attenuatable Gaussian noise into the action space selection process in the actor network to avoid falling into the local optimum. Finally, experiments show that this scheme’s comprehensive cost calculation performance is enhanced by more than 10% compared with other multi-agent reinforcement learning algorithms. In addition, Gaussian random noise-based action space selection and a global memory pool improve the performance by 38.36% and 43.59%, respectively.

Cost-aware workflow offloading in edge-cloud computing using a genetic algorithm

The edge-cloud computing continuum effectively uses fog and cloud servers to meet the quality of service (QoS) requirements of tasks when edge devices cannot meet those requirements. This paper focuses on the workflow offloading problem in edge-cloud computing and formulates this problem as a nonlinear mathematical programming model. The objective function is to minimize the monetary cost of executing a workflow while satisfying constraints related to data dependency among tasks and QoS requirements, including security and deadlines. Additionally, it presents a genetic algorithm for the workflow offloading problem to find near-optimal solutions with the cost minimization objective. The performance of the proposed mathematical model and genetic algorithm is evaluated on several real-world workflows. Experimental results demonstrate that the proposed genetic algorithm can find admissible solutions comparable to the mathematical model and outperforms particle swarm optimization, bee life algorithm, and a hybrid heuristic-genetic algorithm in terms of workflow execution costs.

Mathematical Analysis for GPU Framework for High Performance Computing with Improved Scalability, Reliability and Seamless Configurability

In the field of High Performance Computing (HPC), which is changing very quickly, using Graphics Processing Units (GPUs) has become essential for getting a lot of computing power and speed. This study gives a thorough mathematical analysis of a GPU system that is meant to improve scalability, stability, and configurability, all of which are very important for next-generation HPC apps. The suggested framework uses complex mathematical models and methods to make the best use of GPU resources, cut down on delay, and guarantee strong performance across a wide range of tasks. Scalable parallel processing methods are built into the framework so it can adapt to changing computing needs, making the most of speed and resource use. Fault-tolerant methods that lessen the effects of hardware breakdowns and computing mistakes also improve reliability, making sure that results are always correct and consistent. The framework can be set up in different ways because it is based on flexible design, which makes it easy to change and adapt to the needs of each application without affecting speed. In diverse computer settings, where different apps may have different working needs, this ability to change is very important. The mathematical analysis includes performance measures like speed, delay, and mistake rates, which give a solid basis for judging how well the system works. Additionally, tests comparing the suggested system to current GPU tools show that it is more reliable and scalable. This study helps make better, more reliable computer systems by looking at some of the biggest problems in GPU-based high-performance computing. The results show that using this method can greatly improve the skills of HPC systems, which can lead to progress in scientific study, data analysis, and complex models. In the end, this work shows how advanced GPU systems can help drive innovation in HPC, leading to more powerful, reliable, and flexible computing options.

Salient Applications and Obstacles in IOT Edge Computing

Abstract: The Internet of Things (IoT) is a new technology that has emerged in recent years as a result of the exponential rise of linked gadgets. The IoT benefits from cloud computing. Applications to store the data and carry the calculations, that the enormous volume of data produced by these IoT devices may be managed and controlled. However, fulfilling the demands of numerous Internet of Things, real-time applications remains the main problem in cloud computing. On the other hand, Edge or Fog computing is a computing architecture that facilitates data management, processing, storing, and communication while providing a prompt response. By putting these functions closer to the end consumers, this is made possible. For many applications, edge and cloud computing are complementary technologies that work independently of one another. The overview of IoT and communication technologies and IoT protocols, as well as data transit in IoT. We look into cloud services for processing, storing, and analysing the data produced by Internet of Things devices.

Assembly Theory of Binary Messages

Using assembly theory, we investigate the assembly pathways of binary strings (bitstrings) of length N formed by joining bits present in the assembly pool and the bitstrings that entered the pool as a result of previous joining operations. We show that the bitstring assembly index is bounded from below by the shortest addition chain for N, and we conjecture about the form of the upper bound. We define the degree of causation for the minimum assembly index and show that, for certain N values, it has regularities that can be used to determine the length of the shortest addition chain for N. We show that a bitstring with the smallest assembly index for N can be assembled via a binary program of a length equal to this index if the length of this bitstring is expressible as a product of Fibonacci numbers. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that this problem is NP-complete, while the problem of creating the bitstring so that it would have a predetermined largest assembly index is NP-hard. The proof of this conjecture would imply P ≠ NP since every computable problem and every computable solution can be encoded as a finite bitstring. The lower bound on the bitstring assembly index implies a creative path and an optimization path of the evolution of information, where only the latter is available to Turing machines (artificial intelligence). Furthermore, the upper bound hints at the role of dissipative structures and collective, in particular human, intelligence in this evolution.

Modality aware contrastive learning for multimodal human activity recognition

SummaryHuman activity recognition is a well‐established research problem in ubiquitous computing. The increased dependency on various smart devices in our daily lives allows us to investigate the sensor data world produced by multimodal sensors embedded in smart devices. However, the raw sensor data are often unlabeled and annotating this vast amount of data are a costly exercise that can often lead to privacy breaches. Self‐supervised learning‐based approaches are at the forefront of learning semantic representation from unlabeled sensor data, including when applied to human activity recognition tasks. As inferring human activity depends on multimodal sensors, addressing the modality difference and inter‐modality dependencies in a model is an important process. This paper proposes a novel self‐supervised learning approach, modality aware contrastive learning (MACL), for representation learning using multimodal sensor data. The approach uses different sensing modalities to create different views of an input signal. Thus, the model is able to learn the representations by maximizing the similarity among different sensing modalities of the same input signal. Extensive experiments were performed on four publicly available human activity recognition data sets to verify the effectiveness of our proposed MACL method. The experimental evaluation results show that the MACL method attains a comparable performance for human activity recognition to the compared baseline models, directly exceeding the performance of models using standard augmentation transformation strategies.

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based homologous, QAOA with proven performance, has attracted a lot of attention to the NISQ era. Several numerical benchmarks try to compare these two metaheuristics, however, classical computational power highly limits the performance insights. In this work, we introduce a parametrized version of QA enabling a precise 1-local analysis of the algorithm. We develop a tight Lieb–Robinson bound for regular graphs, achieving the best-known numerical value to analyze QA locally. Studying MaxCut over cubic graph as a benchmark optimization problem, we show that a linear-schedule QA with a 1-local analysis achieves an approximation ratio over 0.7020, outperforming any known 1-local algorithms.

Elite‐guided equilibrium optimiser based on information enhancement: Algorithm and mobile edge computing applications

AbstractThe Equilibrium Optimiser (EO) has been demonstrated to be one of the metaheuristic algorithms that can effectively solve global optimisation problems. Balancing the paradox between exploration and exploitation operations while enhancing the ability to jump out of the local optimum are two key points to be addressed in EO research. To alleviate these limitations, an EO variant named adaptive elite‐guided Equilibrium Optimiser (AEEO) is introduced. Specifically, the adaptive elite‐guided search mechanism enhances the balance between exploration and exploitation. The modified mutualism phase reinforces the information interaction among particles and local optima avoidance. The cooperation of these two mechanisms boosts the overall performance of the basic EO. The AEEO is subjected to competitive experiments with state‐of‐the‐art algorithms and modified algorithms on 23 classical benchmark functions and IEE CEC 2017 function test suite. Experimental results demonstrate that AEEO outperforms several well‐performing EO variants, DE variants, PSO variants, SSA variants, and GWO variants in terms of convergence speed and accuracy. In addition, the AEEO algorithm is used for the edge server (ES) placement problem in mobile edge computing (MEC) environments. The experimental results show that the author’s approach outperforms the representative approaches compared in terms of access latency and deployment cost.

The dihedral hidden subgroup problem

Abstract The hidden subgroup problem (HSP) is a cornerstone problem in quantum computing, which captures many problems of interest and provides a standard framework algorithm for their study based on Fourier sampling, one class of techniques known to provide quantum advantage, and which succeeds for some groups but not others. The quantum hardness of the HSP problem for the dihedral group is a critical question for post-quantum cryptosystems based on learning with errors and also appears in subexponential algorithms for constructing isogenies between elliptic curves over a finite field. In this article, we give an updated overview of the dihedral hidden subgroup problem as approached by the “standard” quantum algorithm for HSP on finite groups, detailing the obstructions for strong Fourier sampling to succeed and summarizing other known approaches and results. In our treatment, we “contrast and compare” as much as possible the cyclic and dihedral cases, with a view to determining bounds for the success probability of a quantum algorithm that uses m m coset samples to solve the HSP on these groups. In the last sections, we prove a number of no-go results for the dihedral coset problem (DCP), motivated by a connection between DCP and cloning of quantum states. The proofs of these no-go results are then adapted to give nontrivial upper bounds on the success probability of a quantum algorithm that uses m m coset samples to solve DCP.

Multi-level optimization strategies for large-scale nonlinear process systems

With growing needs to develop and improve climate-friendly processes, optimization strategies are essential at all levels of decision-making in chemical and energy processes, including process development, process synthesis and design, as well as process operations, control, scheduling, and planning. Challenges include the formulation of well-posed and well-conditioned process models, and development and application of efficient, reliable optimization algorithms. Here we describe a synthesis of optimization concepts and algorithms that enable large-scale nonlinear programming, nonintrusive decomposition strategies and the inclusion of a wide class of surrogate models. All of these are crucial to address challenging nonconvex, multi-scale problems in Computer Aided Process Engineering (CAPE). These elements are demonstrated through dynamic optimization strategies for novel energy generation, demand-based optimization for specialty chemicals, and optimization with integrated heterogeneous models for carbon capture processes.