This research optimizes handover between fog nodes in vehicular IoT using machine learning.
problem Smooth transition of device connections and offloaded tasks between fog nodes in vehicular IoT.
method Proposes a three-layer feed-forward neural network and a dual stacked RNN with LSTM cells to predict fog nodes and minimize service interruption.
result Achieved 99.2% accuracy in predicting fog nodes with a test set.
Bayesian method predicts runtime metrics for fog manufacturing.
problem Accurate prediction of runtime performance metrics in fog manufacturing.
method Bayesian sparse regression for multivariate mixed responses.
result Enhanced prediction and statistical inferences of runtime metrics.
Fog learning distributes ML model training across heterogeneous devices and networks.
problem Challenges with conventional federated learning in heterogeneous networks.
method Intelligent distribution of ML model training across nodes from edge devices to cloud servers.
result Enhanced federated learning with multi-layer hybrid framework considering network, heterogeneity, and proximity.
Machine Learning (ML) algorithms, like Convolutional Neural Networks (CNN), Support Vector Machines (SVM), etc. have become widespread and can achieve high statistical performance. However their accuracy decreases significantly in energy-constrained mobile and embedded systems space, where all computations need to be c…
Paper tackles caching in fog radio access networks using RL.
problem Distributed edge caching in fog radio access networks with fluctuating traffic demands.
method Q-learning framework for optimal caching policy, value function approximation.
result Proposed method outperforms traditional methods in simulations.
Paper presents a biometric system using footfalls for person identification.
problem Natural movement and privacy concerns in biometric systems.
method Fog computing architecture with geophones and data compression.
result Achieved high accuracy (73-95%) in person identification.
Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…
Adversarial fog tests autonomous navigation models.
problem Neural networks are fooled by adversarial perturbations, but fog naturally creates similar perturbations.
method Introduced a new type of adversarial perturbation using generative models and Cycle-Consistent Generative Adversarial Networks.
result Generated adversarial fog images help test autonomous navigation models.
The method constructs arbitrage-free option surfaces from noisy quotes using Chebyshev bases and a fog post-fit layer.
problem Constructing arbitrage-free option price surfaces from noisy bid-ask quotes.
method Chebyshev tensor bases, linear sampling, no-arbitrage operators, quadratic objective, OSQP solvers, fog post-fit layer, Hamiltonian energy.
result High inside-spread coverage (98-99%) and low no-arbitrage violations (below 1%) in stable periods, controlled leakage in stressed periods.
Task offloading is an emerging technology in fog-enabled networks. It allows users to transmit tasks to neighbor fog nodes so as to utilize the computing resources of the networks. In this paper, we investigate a stochastic task offloading model and propose a multi-armed bandit framework to formulate this model. We con…
Deep RNN detects FoG episodes in Parkinson's disease with high accuracy.
problem Detecting freezing episodes in Parkinson's disease patients.
method Deep Recurrent Neural Network (RNN) with Long Short-Term Memory cells on 3D-accelerometer measurements.
result Frequency domain features from trunk sensor achieve an AUC score of 93% in subject-independent method.
DefogGAN predicts hidden RTS game information to aid strategic decision-making.
problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.
A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.
problem Energy and resource constraints in edge devices for deep learning models.
method Conditionally deep hybrid neural network with quantized layers at edge and full-precision layers at cloud.
result Early classification at the edge reduces energy consumption by 5.5x on CIFAR-10 dataset.
This paper introduces early exits in neural networks for faster inference.
problem Reducing inference time and preventing overfitting in neural networks.
method Designing and training multi-output neural networks with early exits.
result Significant reductions in inference time and improved robustness.
SparseIDS uses RL to significantly reduce packet inspection in IDSs.
problem Efficiently inspecting large volumes of network packets for security threats.
method SparseIDS employs RL to learn optimal packet sampling strategies.
result SparseIDS reduces packet inspection by more than 75% while maintaining high accuracy.
LUNAR uses cellular automata for real-time data classification in fast streams.
problem Real-time machine learning challenges with fast data streams and concept drift.
method Streamified cellular automata approach for incremental learning and adaptation.
result Competitive performance in classification compared to established online learning methods.
This paper explores deep reinforcement learning for IoT autonomy.
problem Autonomous control of IoT devices without human intervention.
method Deep reinforcement learning applied to IoT systems.
result A comprehensive survey of DRL applications in AIoT.
Paper proves extended Minkowski Inequality using nonlinear potential theory.
problem Proving an extended Minkowski Inequality for smooth bounded sets.
method Using monotonicity formulas derived from p-capacitary potentials and level set flow. result Stronger conclusions in dimensions n≥8 compared to previous methods. Geometric quantization extended to arbitrary connected spaces using path integration.
problem Constructing a Prequantum Groupoid for arbitrary connected parasymplectic spaces.
method Define a Total Group of Periods and a Prequantum Groupoid with connected isotropy.
result The Prequantum Groupoid Tω is isomorphic to the group of symmetries of the Dynamical System. New framework tackles deep financial reporting bottleneck by improving hallucination and coherence.
problem Statistical smoothing trap in LLMs limits deep financial reporting quality.
method DeepNews Framework integrates information foraging, schema-guided planning, and adversarial prompting.
result DeepNews system achieves 25% acceptance rate in blind test, significantly outperforming SOTA.
Optimizes QoS in FSO links over South Africa using ensemble learning.
problem Impact of weather on QoS in FSO links.
method Ensemble learning models (Random Forest, ADaBoost Regression, Stacking Regression, Gradient Boost Regression, Multilayer Neural Network) applied to meteorological data.
result Significant enhancement in QoS with RMSE and R-squared values of 0.0032 and 0.9906 respectively at George.
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
Hybrid approach reduces computation time and decoding complexity.
problem Straggling servers in distributed computing.
method Coded partial gradient computation (CPGC) that balances gradient accuracy and completion time.
result Reduces both computation time and decoding complexity.
The paper analyzes the pricing of a new compute futures asset.
problem Uncertainty in AI adoption and pricing of compute capital.
method An asset-pricing framework for compute futures, including synthetic futures pricing.
result Preliminary evidence suggests a positive compute risk premium.
Quantum computing offers energy savings over classical computing.
problem Energy efficiency in computing services.
method Cournot competition model constrained by energy usage.
result Quantum computing firms can outperform classical counterparts in energy efficiency.
The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
Knot theory applied to quantum computing models.
problem Using knot theory for quantum computing models.
method Exploring knot theory applications in quantum computing.
result Knot theory introduces topological concepts to quantum computing.
This work makes neural sequence models more efficient by controlling computation.
problem Fixed compute for all examples in neural networks.
method Conditional computation to adapt compute to example complexity.
result Conditional Computation Transformer (CCT) improves efficiency and performance.
Defines computable learning for binary classification over metric spaces.
problem Defines computable PAC learning for binary classification over computable metric spaces.
method Provides sufficient conditions for ERM learners to be computable and bounds the strong Weihrauch degree of an ERM learner.
result Gives a hypothesis class that does not admit any proper computable PAC learner with computable sample function.
Automatic computation speeds up crosscap number calculation for alternating knots.
problem Computing crosscap numbers for alternating knots efficiently.
method Introduced an automatic computation with complexity O(E3). result Crosscap numbers of alternating knots can be computed in O(E3) time. TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.
problem Modeling computation in a single step.
method Established Topological Kleene Field Theory (TKFT) as a new model of computation.
result Any computable function can be simulated in a single go of a dynamical system.
Predicts and classifies computational jobs for efficient resource allocation in cloud centers.
problem Efficiently scheduling and assigning resources to computational jobs in cloud centers.
method Applied LSTM neural network for job arrival prediction and BIRCH clustering for job classification.
result Improved accuracy in predicting and classifying computational jobs compared to existing methods.
Stochastic reservoir computing is shown to be a universal approximator.
problem Theoretical justification for using stochastic reservoirs in machine learning.
method Investigated stochastic reservoir computing using probabilities of reservoir states as readout.
result Stochastic reservoir computers are universal approximating classes.
Machine learning impacts computational math, offering new functions approximations.
problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.
Method for computing Khovanov homology of tangles.
problem Limited explicit computational studies of Khovanov homology for tangles.
method Arc reduction approach to compute Khovanov homology.
result Derived and computed Poincaré polynomials for simple and complex tangles.
This paper simplifies computing higher-order U-statistics efficiently.
problem The inefficiency of computing higher-order U-statistics in practice. method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute U-statistics. Quantum reservoir computing tackles noisy quantum computers for temporal tasks.
problem Efficiently process input sequences on noisy quantum computers.
method Quantum reservoir computing using dissipative quantum dynamics.
result Small and noisy quantum reservoirs can handle high-order nonlinear temporal tasks.
Survey on computational models in dynamical systems, including new universality concepts.
problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.
Computations for prime knots up to 11 crossings.
problem Computing HOMFLY homology for prime knots.
method Direct computations for all prime knots up to 11 crossings.
result HOMFLY homology determined for all prime knots up to 11 crossings.
Survey on quantum computing and neural networks.
problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.
New methods improve Reservoir Computing for chaotic time series prediction.
problem Chaotic time series prediction in Reservoir Computing.
method Established Recurrent Kernel limit, introduced Structured Reservoir Computing.
result Structured Reservoir Computing is faster and more memory-efficient.
Computer-generated proofs led to a mathematical result.
problem Discovering a mathematical result through computer-generated proofs.
method Combining computer-generated, human-readable proofs with mathematical abstraction.
result Abstracted lemma leading to an interesting mathematical result.
Quantum computing promises faster bioinformatics, but challenges remain.
problem Efficient bioinformatics processing and drug discovery.
method Quantum algorithms for optimization, simulation, and machine learning.
result Quantum computing can significantly speed up bioinformatics tasks.
This work shows how to compute subderivatives efficiently without errors.
problem Inefficient and incorrect computation of subderivatives in ML libraries.
method Developed a method to compute provably correct generalized subderivatives at a cost close to the function itself.
result Provable correct generalized subderivatives can be computed at a cost within a factor of 6 of the function itself.
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…
A DRL approach optimizes computation offloading in MEC systems for mobile users.
problem Optimizing computation offloading in MEC systems with mobile users and stochastic task arrivals.
method Deep Deterministic Policy Gradient (DDPG) for decentralized dynamic computation offloading.
result The DDPG-based strategy outperforms conventional strategies in terms of computation cost and power-delay tradeoff.
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the com…
Parallelizes feedforward computation using nonlinear equation solving.
problem Sequential nature of feedforward computation limits parallelization.
method Frame feedforward computation as solving nonlinear equations; use Jacobi or Gauss-Seidel methods for parallel updates.
result Accelerates feedforward computation with reduced parallelizable iterations.