Paper introduces a new web robot traffic generator.
problem Lack of realistic web robot traffic generators.
method Statistical and Bayesian models fitted to robot traffic data.
result Generated traffic mimics real robot traffic characteristics.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,181 papers · 148 categories
Trend · papers per month
48 results for “web server”
Paper introduces fast botnet detection from web server logs.
problem Botnets cause various malicious activities; fast detection is needed.
method Inspired by PCA, uses Lanczos method to improve detection speed.
result Lanczos method significantly reduces time complexity for botnet detection.
Simplifies RCA for anomalies with separable likelihoods.
problem Challenges in accurate and friendly root cause analysis.
method Bayesian framework with separable likelihoods under certain restrictions.
result Framework successfully applied to web server error logs.
Topic models such as Latent Dirichlet Allocation (LDA) have been widely used in information retrieval for tasks ranging from smoothing and feedback methods to tools for exploratory search and discovery. However, classical methods for inferring topic models do not scale up to the massive size of today's publicly availab…
New MAB model for online caching costs.
problem Learning costs of cached items online.
method Synchronization bandits, MirrorSync algorithm.
result Adversarial regret of for MirrorSync.
Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithmcs.LG
We study Bayesian optimal control of a general class of smoothly parameterized Markov decision problems. Since computing the optimal control is computationally expensive, we design an algorithm that trades off performance for computational efficiency. The algorithm is a lazy posterior sampling method that maintains a d…
Optimizes web page freshness with limited crawling frequencies.
problem Maximize local cache freshness given crawling frequency constraints.
method Three novel online estimation schemes for page change rates.
result Convergent algorithms for estimating page change rates.
SecVM preserves user privacy in training SVMs for classification tasks.
problem Training supervised classifiers on sensitive user data while maintaining privacy.
method A novel secret vector machine (SecVM) framework for training linear SVMs in a distributed, privacy-preserving manner.
result SecVM outperforms baselines in a large-scale online evaluation, preserving user privacy and classification accuracy.
Developed HIquant to quantify proteoforms accurately without biases.
problem Peptide-specific biases in quantifying proteoforms by MS methods.
method First-principles model (HIquant) for quantifying proteoform stoichiometries.
result High accuracy in quantifying fractional PTM occupancy without external standards.
RNNs improve predictive precompute for faster user interface response times.
problem Improving user interface response times in mobile and web applications.
method Application of recurrent neural networks (RNNs) for predictive precompute.
result RNN models improve prediction accuracy and reduce computational cost.
Lapse improves parameter servers by dynamically allocating parameters, achieving near-linear scaling.
problem Efficiently managing distributed training with reduced communication overhead.
method Integrate dynamic parameter allocation into parameter servers, proposing Lapse.
result Lapse provides near-linear scaling and can be orders of magnitude faster than existing parameter servers.
Formula calculates MOY webs and link polynomials.
problem No specific problem stated; focuses on evaluation.
method Closed formula for exterior webs and link polynomials.
result Closed formula for evaluating MOY webs and link polynomials.
A new scheme for private computation splits client data into shares for server operations.
problem Private computation between client and server without revealing data.
method Stochastic scheme splitting client data into privatized shares.
result Server performs operations on privatized shares without learning raw data.
We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct web-theoretical proof of the Poincaré's theorem: a planar 4-web of maximum rank is lineari…
Classifies hexagonal circular 3-webs with cubic polar curves.
problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.
We construct flat 3-webs via semi-simple geometric Frobenius manifolds of dimension three and give geometric interpretation of the Chern connection of the web. These webs turned out to be biholomorphic to the characteristic webs on the solutions of the corresponding associativity equation. We show that such webs are he…
We give various results and applications using the connection associated with a -web. Precisely, we exhibit fundamental invariants of the web related to the differential equation of first order which presents the web. They cast some new lights on the connection and its construction, both conceptually an…
We investigate the linearizability problem for different classes of 4-webs in the plane. In particular, we apply a recently found in [AGL] the linearizability conditions for 4-webs in the plane to confirm that a 4-web MW (Mayrhofer's web) with equal curvature forms of its 3-subwebs and a nonconstant basic invariant is …
In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that one of web foliations is pointed, there is also associated a unique affine struc…
Projective invariants described for 3-web geometry, resolving Gronwall's conjecture.
problem Projective invariants of linear 3-webs and resolving Gronwall's conjecture.
method Projective torsion-free Cartan connections, web leaves as geodesics, algorithm for resolving Gronwall's conjecture.
result Resolved Gronwall's conjecture for specific 3-webs.
New instanton homology for webs counts Tait colorings.
problem Counting Tait colorings of complex webs.
method Introducing a local system of coefficients to deform instanton homology.
result Rank of deformed instanton homology equals number of Tait colorings.
Study local invariants of divergence-free webs in geometry.
problem Characterize triviality of divergence-free webs.
method Introduce two local invariants: differential and geometric.
result Triviality of either invariant characterizes trivial divergence-free web-germs.
New algorithm for federated learning without a central server.
problem Federated learning in unidirectional trust social networks.
method Central Server Free Federated Learning (OPS) method.
result Users can benefit from communication with trusted users in federated learning.
This paper has been withdrawn by the authors due to the fact that the webs considered in the paper are ``Veronese-like webs'' which are different from Veronese webs.
Investigates webs related to cluster algebras and polylogarithms.
problem Understanding webs associated with cluster algebras and polylogarithms.
method Introducing AMP webs and analyzing their properties, proving results and conjectures.
result Many webs associated with polylogarithms and cluster algebras are AMP webs.
Much information available on the web is copied, reused or rephrased. The phenomenon that multiple web sources pick up certain information is often called trend. A central problem in the context of web data mining is to detect those web sources that are first to publish information which will give rise to a trend. We p…
Paper speeds up DGD by allowing multiple transmissions from non-straggling servers.
problem Limited parallel execution due to straggling servers in DGD.
method Allowing multiple transmissions from each CS at each iteration.
result Significant reduction in average completion time per iteration.
For a four-dimensional (nonisoclinicly geodesic) three-web W (3, 2, 2), a transversal distribution is defined by the torsion tensor of the web. In general, this distribution is not integrable. The authors find necessary and sufficient conditions of its integrability and prove the existence theorem for webs W (3, 2,…
In this paper we study the linearizability problem for 3-webs on a 2-dimensional manifold. With an explicit computation based on the theory developed in the paper "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp. 2643-2654), we examine a 3-web whose linearizability was claimed in the same paper. We …
Veronese webs appear as the natural way of passing to the quotient of curves in the projective space. In thi paper, we give the link between classical multidimensionnal webs and veronse webs by mean of interpolation.
New hexagonal circular 3-webs with reducible curves classified.
problem Classifying hexagonal circular 3-webs with reducible polar curves of degree 3.
method New examples and classifications presented.
result Classification of hexagonal circular 3-webs with reducible polar curves of degree 3.
Linv invariant and web spacemath.GT
In this paper, we reconstruct Kuperberg's web space. We introduce a new web (a trivalent diagram) and new relations between Kuperberg's web diagrams and the new diagram. Using the webs, we define crossing formulas corresponding to R-matrices associated to some irreducible representations and calculate…
A 3-web is linearizable, resolving a controversy.
problem Determining the correct linearizability condition for 3-webs.
method A short proof by J.-P. Dufour.
result The 3-web W is linearizable.
New method infers missing categorical data from Web markup.
problem Missing information in Web markup nodes.
method Supervised approach for inferring categorical properties.
result Significantly outperforms existing baselines with 79% and 83% F1 score.
On Gronwall conjecturemath.DG
Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with the web curvature that vanishes to order three at a point. The differential relati…
We find relative differential invariants of orders eight and nine for a planar nonparallelizable 3-web such that their vanishing is necessary and sufficient for a 3-web to be linearizable. This solves the Blaschke conjecture for 3-webs. As a side result, we show that the number of linearizations in the Gronwall conject…
Develops algorithms to exploit historical and pre-clustered arm information in bandit problems.
problem Optimizing decision-making in multi-armed bandit and contextual bandit problems with historical observations and pre-clustered arms.
method META algorithm that combines historical observations and pre-clustering information, deriving regret bounds for various scenarios.
result META algorithm effectively balances between using historical observations and clustering, outperforming the other in different scenarios.
Geodesic flows with specific integrals are linked to special 4-webs.
problem Characterizing geodesic flows with commuting quadratic integrals.
method Characterization through geodesic 4-webs and geometric hypothesis.
result Metrics of Stäckel type for geodesic flows with specific integrals.
Algorithm stabilizes queues in asymmetric systems with unknown service rates.
problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).
Geometrically interprets integrability of geodesic flow using web theory.
problem Integrability of geodesic flow by quadratic integrals.
method Geometric interpretation through web theory and integrable billiards construction.
result Constructs integrable billiards on surfaces with quadratic geodesic integrals.
The Gronwall conjecture states that a planar 3-web of foliations which admits more than one distinct linearizations is locally equivalent to an algebraic web. We propose an analogue of the Gronwall conjecture for the 3-web of foliations by Legendrian curves in a contact three manifold. The Legendrian Gronwall conjectur…
We study non-flat planar 3-webs with infinitesimal symmetries. Using multi-dimensional Schwarzian derivative we give a criterion for linearization of such webs and present a projective classification thereof. Using this classification we show that the Gronwall conjecture is true for 3-webs admitting infinitesimal symme…
Corella protects client data privacy in multi-server learning with correlated queries.
problem Protecting client data privacy in multi-server machine learning.
method Proposes a private multi-server learning approach using correlated queries and strong noise.
result Mitigates client data leakage with high accuracy and minimal computational effort.
Le rang des tissus de Nakaimath.DG
Proves Nakai webs have rank 0 or 1, provides examples.
problem Classifying the rank of Nakai's webs.
method Analyzes cross-ratios and foliations to prove rank.
result Nakai webs have rank 0 or 1.
Fast, format-agnostic web content detection for security.
problem Detecting malicious web content efficiently and accurately.
method Deep learning on static HTML tokens, avoiding complex parsing.
result 97.5% detection rate at 0.1% false positive rate.
Extracts main content from web pages using neural sequence labeling.
problem Lack of generalization in existing web page content extraction models.
method Neural sequence labeling model using HTML tags and words as input.
result Model outperforms state-of-the-art and adapts to changes in web page structure.
Develops invariants for webs and foams using Seiberg-Witten theory.
problem Computing invariants for complex geometric structures.
method Monopole Floer homology with orbifold singularities.
result New invariants for webs and foams.
Model predicts web page parallelism for improved browser performance and energy.
problem Improving browser performance and energy usage through parallelism.
method Supervised learning model using web page primitives and parallelism features.
result Model predicts parallelism and optimizes performance and energy usage.