TG-PSM morphs encrypted traffic to reduce traffic analysis accuracy.
problem Traffic analysis on encrypted traffic reveals sensitive information.
method Clusters websites, finds target sites, morphs traffic using greedy algorithm.
result TG-PSM reduces attacker's accuracy significantly with low overhead.
A morph between two Riemannian n-manifolds is an isotopy between them together with the set of all intermediate manifolds equipped with Riemannian metrics. We propose measures of the distortion produced by some classes of morphs and diffeomorphisms between two isotopic Riemannian n-manifolds and, with respect to th…
Simpler algorithms for morphing planar and toroidal graphs.
problem Constructing smooth transitions between isomorphic drawings of planar and toroidal graphs.
method Barycentric interpolation and scaling strategy.
result Simplified and more natural morphs with improved computational efficiency.
Federated Learning improves mobile data privacy by training classifiers without sharing raw data.
problem Privacy concerns in packet classification due to sensitive data sharing.
method Apply Federated Learning to mobile packet classification tasks, training models without raw data sharing.
result Demonstrated effectiveness of the approach in terms of performance, cost, and privacy.
Algorithm morphs graphs on hyperbolic surfaces.
problem Morphing graphs on hyperbolic surfaces.
method Generalization of Tutte's spring embedding theorem.
result First algorithm for morphing graphs on hyperbolic surfaces.
We consider the problem of distortion minimal morphing of n-dimensional compact connected oriented smooth manifolds without boundary embedded in Rn+1. Distortion involves bending and stretching. In this paper, minimal distortion (with respect to stretching) is defined as the infinitesimal relative change in vol…
Let M and N be compact smooth oriented Riemannian n-manifolds without boundary embedded in Rn+1. Several problems about minimal distortion bending and morphing of M to N are posed. Cost functionals that measure distortion due to stretching or bending produced by a diffeomorphism h:M→N are …
Decentralized learning ensures stability in online queuing systems with packet rates above 1.
problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.
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.
Differentiable voxelization for 3D meshes with GPU acceleration.
problem Efficient and accurate voxelization of 3D meshes.
method Differentiable voxelization using winding number and solid angles, with GPU acceleration and neural network deformation.
result State-of-the-art performance in accuracy and efficiency on the ShapeNet dataset.
A deep learning framework learns wavelet packet transforms for efficient feature extraction.
problem Efficiently extracting meaningful time-frequency features from high-frequency signals.
method Learnable wavelet packet transforms using deep learning.
result Improved spectral leakage and enhanced anomaly detection performance.
Optimizes hydrokinetic turbine design using morphing and Bayesian optimization.
problem Designing optimal hydrokinetic turbine shapes due to high cost and geometric constraints.
method Design-by-Morphing (DbM) and Mixed variable, Multi-Objective Bayesian Optimization (MixMOBO).
result Optimized shapes lead to maximum power output with minimal evaluations.
Unified theory solves strain compatibility and elasticity of origami metamaterials.
problem Understanding and controlling the morphing paths of origami metamaterials.
method Unified theory for a wide array of origami tessellations, solving strain compatibility and elasticity.
result Origami metamaterials exhibit equal but opposite in-plane and out-of-plane Poisson's ratios and bending energy depends on strain gradient.
The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the architecture community, the lion share of effort has targeted CNN inference for image recognition. The closely related problem of video recognition…
Exact and scalable algorithm for Gaussian process regression with Matérn correlations.
problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.
Transfer learning improves chatter detection accuracy with EEMD over WPT.
problem Improving chatter detection accuracy in metal cutting using transfer learning.
method Wavelet Packet Transform (WPT) and Ensemble Empirical Mode Decomposition (EEMD) for feature extraction; Support Vector Machine (SVM), Logistic Regression, Random Forest Classification, and Gradient Boosting with RFE for classification; Transfer learning applied to different turning configurations.
result EEMD outperforms WPT in transfer learning applications, achieving up to 95% accuracy.
A transformation based on mean curvature is introduced which morphs triangulated surfaces into round spheres.
Improved earnings predictions through text-morphed earnings calls.
problem Improving earnings prediction models using narrative information.
method Introducing a text-morphing methodology to generate counterfactual transcripts.
result Analysts over-react to sentiment and under-react to risk and uncertainty.
A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.
problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.
Design-by-Morphing creates radical airfoil designs without geometric constraints.
problem Design constraints limit airfoil design novelty and small changes.
method Design-by-Morphing (DbM) creates a search space without geometric constraints.
result DbM generates radical airfoils with remarkable lift-over-drag ratio and stall angle tolerance.
Quantum physics model uses knot theory for fragile topology.
problem Modeling quantum physics' fragile topology.
method Knot theoretic algorithm.
result Quantum physics' fragile topology modeled.
New origami structures adapt to over 100 shapes with minimal actuation.
problem Limited shape-morphing capabilities in metamaterials and robotics.
method Hierarchical origami based on polyhedrons, using simple actuation.
result Single structure adapts to over 103 configurations with few actuations.
Proposes a new approach to enforce uniform distribution on torus.
problem Enforcing uniform distribution on torus for generative models.
method Introduces circular spring loss to enforce equally spaced points on torus.
result Enables morphing between points on torus with different paths.
New method allows sheets to morph into multiple shapes via spatially varying stimuli.
problem Limitation of current shape-programmed sheets to achieve only one target geometry.
method Patterning the stimulus itself for spatiotemporal control over local deformation magnitudes.
result A single physical sample can be induced to traverse a continuous family of target geometries.
We propose approaches based on deep learning to localize objects in images when only a small training dataset is available and the images have low quality. That applies to many problems in medical image processing, and in particular to the analysis of fluoroscopic (low-dose) X-ray images, where the images have low cont…
This study compares DR methods with kernel variations for face image analysis.
problem High dimensionality, noise, and correlation in data.
method Reviews and comparative study of PCA, LDA, KPCA, KLDA, SKPCA.
result SKPCA outperforms other methods in gender classification on face databases.
The paper develops algorithms to minimize queue length regret in a communication system.
problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal O(1) queue length regret can be achieved with queue-length based policies. Paper uses RL to optimize SFC deployment and VNF management in NFV networks.
problem Optimizing SFC deployment and VNF management in NFV networks to reduce packet loss.
method Reinforcement Learning (PPO) to optimize SFC deployment and VNF management.
result PPO agent reduces packet loss in SFC deployment and VNF management.
Optimizes pipelined computation and communication for edge learning within latency constraints.
problem Balancing data transmission and model training to meet latency requirements.
method Analyzes the optimal packet payload size tradeoff between bias and variance.
result Derives analytical bounds on the expected optimality gap for effective optimization.
A decentralized routing framework for lunar exploration robots.
problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.
AdjointDEIS simplifies diffusion model optimization.
problem Optimizing diffusion models with respect to a differentiable metric.
method Novel bespoke ODE solvers for continuous adjoint equations.
result Continuous adjoint equations simplify to a simple ODE, improving efficiency.
This paper addresses the morphing of manifold-valued images based on the time discrete geodesic paths model of Berkels, Effland and Rumpf 2015. Although for our manifold-valued setting such an interpretation of the energy functional is not available so far, the model is interesting on its own. We prove the existence of…
Wireless systems perform rate adaptation to transmit at highest possible instantaneous rates. Rate adaptation has been increasingly granular over generations of wireless systems. The base-station uses SINR and packet decode feedback called acknowledgement/no acknowledgement (ACK/NACK) to perform rate adaptation. SINR i…
Bistable structures associated with non-linear deformation behavior, exemplified by the Venus flytrap and slap bracelet, can switch between different functional shapes upon actuation. Despite numerous efforts in modeling such large deformation behavior of shells, the roles of mechanical and nonlinear geometric effects …
RNNs are vulnerable to adversarial attacks, especially in network traffic.
problem Adversarial attacks on RNNs for IDSs in network traffic.
method Developed new explainability techniques and ARS for comparing IDSs.
result RNNs are vulnerable to adversarial attacks, even in sequential data.
Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.
problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn). Develops support theorem for analytic transforms in tomography.
problem Analytic wave front set resolution for integral transforms.
method Microlocal analysis, double fibration framework, wave packet transforms.
result Uniqueness and support theorems for analytic transforms.
AutoIDS uses auto-encoders to detect network intrusions efficiently.
problem Detecting network intrusions with high accuracy and efficiency.
method Semi-supervised machine learning with cascading encoder-decoder neural networks.
result AutoIDS achieves 90.17% accuracy on NSL-KDD dataset, superior to other methods.
Shelstad's character identity is an equality between sums of characters of tempered representations in corresponding L-packets of two real, semisimple, linear, algebraic groups that are inner forms to each other. We reconstruct this character identity in the case of the discrete series, using index theory of elliptic…
Study the structure of linear bundle morphisms between vector bundles.
problem Understanding the structure of linear bundle morphisms between vector bundles.
method Analyzing the set of smooth linear bundle morphisms between fibre bundles.
result Detailed structure of linear bundle morphisms between vector bundles.
New method uses reinforcement learning to accurately estimate available network bandwidth.
problem Accurate and fast estimation of available bandwidth in networks with varying cross-traffic.
method Employed reinforcement learning, specifically the ε-greedy algorithm in a multi-armed bandit approach. result Proposed method identifies available bandwidth with high precision and converges under various challenging conditions.
Learning a distribution conditional on a set of discrete-valued features is a commonly encountered task. This becomes more challenging with a high-dimensional feature set when there is the possibility of interaction between the features. In addition, many frequently applied techniques consider only prediction of the me…
FNFs model parameter-dependent densities by combining a fixed flow with a polynomial parameter-dependent transformation.
problem Learning a separate flow for every parameter configuration is intractable.
method Factorizable Normalizing Flows (FNFs) represent the parameter-dependent density as a fixed flow for a reference configuration and a learnable polynomial transformation factorized over parameters.
result FNFs enable the recovery of the combined effect of multiple parameters without sampling their joint space, providing a scalable and interpretable solution.
We consider the motion of small bodies in general relativity. The key result captures a sense in which such bodies follow timelike geodesics (or, in the case of charged bodies, Lorentz-force curves). This result clarifies the relationship between approaches that model such bodies as distributions supported on a curve, …
We present five methods to the problem of network anomaly detection. These methods cover most of the common techniques in the anomaly detection field, including Statistical Hypothesis Tests (SHT), Support Vector Machines (SVM) and clustering analysis. We evaluate all methods in a simulated network that consists of nomi…
The correspondence between Riemann-Finsler geometries and effective field theories with spin-independent Lorentz violation is explored. We obtain the general quadratic action for effective scalar field theories in any spacetime dimension with Lorentz-violating operators of arbitrary mass dimension. Classical relativist…
In the current paper the Lagrangian of a classical, relativistic point particle is obtained whose conjugate momentum satisfies the dispersion relation of a quantum wave packet that is subject to Lorentz violation based on a particular coefficient of the nonminimal Standard-Model Extension (SME). The properties of this …
We address the following problem: given two smooth densities on a manifold, find an optimal diffeomorphism that transforms one density into the other. Our framework builds on connections between the Fisher-Rao information metric on the space of probability densities and right-invariant metrics on the infinite-dimension…