Paper uses DRL for automated power allocation in satellites.
problem Manual resource allocation is impractical for satellites with many power degrees of freedom.
method Continuous state and action spaces, Proximal Policy Optimization (PPO) algorithm.
result DRL shows promising results for minimum Unmet System Demand and power consumption.
Develops a new framework for integrating satellite allocations in small portfolios.
problem Feasibility constraints in small portfolios, not return predictability, are the primary concerns.
method A four-layer feasibility framework: physical, economic, structural, and epistemic.
result Closed-form feasibility bounds on satellite size, turnover, and breadth without return forecasts.
The study identifies core and satellite segments in the cryptocurrency market.
problem Identifying similar cryptocurrencies for strategic asset allocation.
method Segmentation of the cryptocurrency market using image / pattern recognition methods.
result Core and satellite segments identified in the cryptocurrency market.
In this paper, we present a method to determine the global horizontal irradiance (GHI) from the power measurements of one or more PV systems, located in the same neighborhood. The method is completely unsupervised and is based on a physical model of a PV plant. The precise assessment of solar irradiance is pivotal for …
Optimal resource allocation is a fundamental challenge for dense and heterogeneous wireless networks with massive wireless connections. Because of the non-convex nature of the optimization problem, it is computationally demanding to obtain the optimal resource allocation. Recently, deep reinforcement learning (DRL) has…
Optimizes power allocation for WDM in RoFSO systems.
problem Maximizing total capacity with power and eye safety constraints.
method Model-based Stochastic Dual Gradient algorithm and model-free Primal-Dual Deep Learning algorithm.
result Deep Learning algorithm outperforms average equal power allocation.
This work develops a novel power control framework for energy-efficient power control in wireless networks. The proposed method is a new branch-and-bound procedure based on problem-specific bounds for energy-efficiency maximization that allow for faster convergence. This enables to find the global solution for all of t…
Deep learning model predicts tropical cyclone intensification using satellite images.
problem Accurately predicting rapid intensification of tropical cyclones.
method Attention-based deep learning model using satellite images.
result Deep learning models outperform traditional methods in RI prediction.
Paper proposes decision-theoretic approach to combat wildfires.
problem Complexity and uncertainty in wildfire management.
method Partially-observable Markov decision process and data-driven model.
result Forecasting model accurately models wildfire spread.
This work demonstrates the potential of deep reinforcement learning techniques for transmit power control in wireless networks. Existing techniques typically find near-optimal power allocations by solving a challenging optimization problem. Most of these algorithms are not scalable to large networks in real-world scena…
The oriented framed Homfly skein C of the annulus provides the natural parameter space for the Homfly satellite invariants of a knot. It contains a submodule C+ isomorphic to the algebra of the symmetric functions. We collect and expand formulae relating elements expressed in terms of symmetric functions to Turaev's ge…
Develops deep learning for optimizing 5G radio resource allocation.
problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.
Scheduling and power allocation improve federated learning efficiency in NOMA networks.
problem Efficiently scheduling and allocating power for federated learning in bandwidth-limited wireless networks.
method Proposed a scheduling policy and power allocation scheme using NOMA to maximize data rate and convergence speed.
result Simulation results show improved federated learning accuracy in NOMA networks.
We establish relationships between two classes of invariants of Legendrian knots in R3: Representation numbers of the Chekanov-Eliashberg DGA and satellite ruling polynomials. For positive permutation braids, β⊂J1S1, we give a precise formula in terms of representation numbers for the m-graded …
A model predicts solar irradiance without local data using satellite and weather forecasts.
problem Forecasting solar irradiance without local measurements for geographically dispersed solar generators.
method Uses satellite data and weather forecasts with a deep neural network trained on a subset of ground data.
result Proposed model performs as well or better than local models across 25 locations and prediction horizons.
New satellite constructions create infinite Brunnian links.
problem Creating new Brunnian links from existing ones.
method Satellite sum and satellite tie constructions.
result Every Brunnian link has a unique tree-arrow structure.
Formula for τ-invariant of satellite knots derived from L-space satellite operators.
problem Calculating the τ-invariant of satellite knots using L-space satellite operators.
method Algorithm to compute knot Floer complexes and formula for τ-invariant.
result Formula recovers existing formulas and proves new properties of τ-invariant.
Cross-prediction improves inference from small labeled datasets.
problem Valid inference from small labeled datasets with imperfect predictions.
method Imputes missing labels via machine learning and debiases predictions.
result Inferences achieve desired error probability and are more powerful.
Adversaries manipulate wireless power allocation to reduce user rates.
problem Adversaries exploit deep learning for power control to decrease communication rates.
method Adversaries craft perturbations to inputs of a DNN to minimize power allocation.
result Adversarial attacks are highly effective and robust to uncertainties.
Satellite knots can be trivialized by a single band move.
problem Satellite knots and their trivialization.
method Infinite family of satellite knots and a single band move.
result No disjoint band unknotting exists for satellite knots.
We study classification problems where features are corrupted by noise and where the magnitude of the noise in each feature is influenced by the resources allocated to its acquisition. This is the case, for example, when multiple sensors share a common resource (power, bandwidth, attention, etc.). We develop a method f…
This study analyzes satellite communication latency using a stochastic geometry model.
problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.
Satellite links of fully positive braids are characterized.
problem Characterizing satellite links of fully positive braids.
method Analyzing fully positive braids and their satellites.
result Satellite links of fully positive braids are characterized by specific conditions.
An active learning approach reduces AoI violation in vehicular networks.
problem Dynamic nature of vehicular networks makes resource allocation challenging.
method Gaussian process regression (GPR) for online decentralized active learning.
result Significant improvement in AoI violation probability with at least 50% reduction.
Any knot in a solid torus, called a pattern or satellite operator, acts on knots in the 3-sphere via the satellite construction. We introduce a generalization of satellite operators which form a group (unlike traditional satellite operators), modulo a generalization of concordance. This group has an action on the set o…
Model predicts global financial market risks and asset allocation.
problem Predicting downside risk and market regime shifts.
method Dynamic regime switching model based on GARCH-DCC-Copula.
result Significantly improves risk and alpha-based asset allocation strategies.
Satellite links with many twists have simpler companions.
problem Relationship between satellite and companion links' complexity.
method Constructing satellite links with multiple full twists and analyzing their companion links.
result Satellite links with many twists have simpler companion links.
Study examines how liquidity constraints impact optimal retirement decisions.
problem Impact of liquidity constraints on optimal retirement decisions.
method Analytical solution using duality method with different liquidity constraints.
result Sensitivity analysis reveals the effect of liquidity constraints on retirement decisions.
Meta-DRL improves resource allocation in O-RAN networks.
problem Dynamic resource allocation in O-RAN networks.
method Meta Deep Reinforcement Learning (Meta-DRL) inspired by MAML.
result 19.8% improvement in network management performance.
FedSpace optimizes ML training on satellites and ground stations.
problem Training machine learning models on satellites with limited bandwidth.
method Federated Learning framework that dynamically schedules model aggregation based on satellite orbits.
result Reduces training time by 1.7 days over state-of-the-art algorithms.
New proof for minimizing tunnel systems in satellite chain links.
problem Minimizing the tunnel number of satellite chain links.
method Proving the tunnel number is minimized for links with a specific number of components and bridge number.
result The result is sharp for satellite chain links over a 2-bridge knot.
The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
problem Preserving the diffeomorphism type of satellite 2-knots under the Gluck twist.
method Using new descriptions of satellite 2-knots, the paper shows that the Gluck twist does not change the diffeomorphism type of certain satellite 2-knots in three ways.
result The Gluck twist preserves the diffeomorphism type of certain satellite 2-knots.
Researchers compute Khovanov polynomials for satellite knots.
problem Computing Khovanov polynomials for satellite knots.
method Explicit computation using a computer program for two families of satellite knots.
result Khovanov polynomials can be expressed as a linear combination of pattern and companion invariants, with a jump at a critical point.
Investigates ropelength of complex knots and links.
problem Establishing ropelength for knots and links beyond tested crossing numbers.
method Investigated torus knots up to 1023 crossings, satellite knots up to 42 crossings, and used a model of repeated Hopf links.
result Found power-law scaling in T(p,p+1) and derived formulae for predicting crossing-ropelength relationships.
New satellite knots counter a conjecture about Lorenz knots.
problem A conjecture about satellite knots and Lorenz knots was disproven.
method Constructed infinitely many counterexamples of satellite knots that are not cables.
result The conjecture was amended and shown to hold for many Lorenz knots.
Formula for satellite operators using knot Floer homology.
problem Computing knot Floer homology for satellite knots.
method Using Heegaard Floer Dehn surgery formulas and formal knot Floer complexes.
result Formulas to compute knot Floer homology for satellite knots.
Satellite formula connects knot concordance invariants to surgery.
problem Understanding knot concordance invariants.
method Excision theorem for real Floer homotopy types.
result Concordance invariants depend only on zero-framed surgery.
We give sufficient conditions for a satellite knot to admit an L-space surgery, and use this result to give new infinite families of patterns which produce satellite L-space knots.
The study computes invariants of satellite knots using bordered Floer homology.
problem Computing invariants of satellite knots with specific patterns.
method Using bordered Floer homology and the immersed curve interpretation of the bordered pairing theorem.
result Satellites with thin fibered companions or specific patterns have thin knot Floer homology.
Necessary and sufficient conditions are given for a satellite knot to be fibered. Any knot k~ embeds in an unknotted solid torus V~ with arbitrary winding number in such a way that no satellite knot with pattern (V~,k~) is fibered. In particular, there exist nonfibered satellite knots wit…
A simplified proof for satellite knot signatures.
problem Proving Litherland's formula for satellite knots.
method Uses linear algebra and basic knot theory.
result A new, elementary proof of the signature formula.
Unsupervised method removes satellite noise without paired data.
problem Image artifacts from satellite sensor noises affect quality and applications.
method Wavelet subband cycleGAN using adversarial and cycle-consistency losses.
result Effectively removes satellite noise while preserving high frequency features.
We conjecture that satellite operations are either constant or have infinite rank in the concordance group. We reduce this to the difficult case of winding number zero satellites, and use SO(3) gauge theory to provide a general criterion sufficient for the image of a satellite operation to generate an infinite rank s…
Satellite operations with winding number ≠ 1 are not homomorphisms.
problem Characterizing homomorphisms in satellite operations.
method Using d-invariants of branched covers and Torelli group properties. result Satellite operations with winding number ≠ 1 are not homomorphisms.
Blend-ASC improves self-consistency efficiency by dynamically allocating samples, reducing costs.
problem Efficiently applying self-consistency to large datasets is computationally expensive.
method Blend-ASC dynamically allocates samples during inference, improving efficiency.
result Blend-ASC reduces sample usage by 6.8x on average compared to vanilla self-consistency.
Satellite knots have a higher trunk number than their base knots.
problem Understanding the relationship between satellite knots and their base knots.
method Using the Thurston norm and properties of satellite patterns.
result The trunk number of satellite knots is strictly greater than the product of the Thurston norm and the trunk number of their base knots.
Study satellite operations on knot invariant θ, proving additivity and distinguishing knots.
problem Behavior of knot invariant θ under satellite operations.
method Proved additivity, introduced computational tool, verified conjecture for 2977 knots.
result Distinguished knots using invariant θ and verified conjecture for 2977 primes.
Detects parking spaces in parcels using satellite images.
problem Locating parking spaces in urban areas using satellite imagery.
method Used Feature Pyramid based Mask RCNN for localizing parking spaces and vehicles in parking lots.
result Average class accuracy of 97.56% for parking spaces and vehicles.