YOLOv3 detects ships in real-time with high accuracy.
problem Real-time target detection in maritime scenarios.
method YOLOv3 model trained on a large dataset of marine vessels.
result Average Precision up to 96% for IoU of 0.5.
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “web scraping”
Tool to estimate research impact for low-resource institutions.
problem Costly databases limit access for third-world institutions.
method Machine Learning for data analysis and panel regression.
result Approximation of SCOPUS Impact Factor for free.
Reduces false positives in classifying rare online platforms.
problem Challenges in accurately identifying rare online platforms with ML.
method Calibrated probabilities and ensembles to reduce bias.
result Significantly reduces false positives in rare event detection.
Position: Considerations for Differentially Private Learning with Large-Scale Public Pretrainingcs.LG
Publicly pretraining models on Web data may undermine differential privacy.
problem The use of large Web-scraped datasets in differential privacy models.
method Critical review of leveraging pretrained models on public datasets for differential privacy.
result Publicizing pretrained models as 'private' could harm trust and generalize poorly.
Botnet, a group of coordinated bots, is becoming the main platform of malicious Internet activities like DDOS, click fraud, web scraping, spam/rumor distribution, etc. This paper focuses on design and experiment of a new approach for botnet detection from streaming web server logs, motivated by its wide applicability, …
In recent years, the interest in Big Data sources has been steadily growing within the Official Statistic community. The Italian National Institute of Statistics (Istat) is currently carrying out several Big Data pilot studies. One of these studies, the ICT Big Data pilot, aims at exploiting massive amounts of textual …
Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose a new adversarial regularization scheme based on the Wasserstei…
Deep learning model forecasts stock prices for portfolio optimization.
problem Precise stock price prediction and portfolio optimization.
method LSTM network for web-scraped historical data, automated stock price forecasting.
result Model demonstrates profitability of sectors for investors.
Deep learning outperforms Black-Scholes in Brazilian Petrobras option pricing.
problem Improving option pricing accuracy for Petrobras stocks.
method Trained deep residual networks using a custom loss function with historical data.
result Deep learning achieved a 64.3% reduction in mean absolute error compared to Black-Scholes.
Data poisoning is an attack on machine learning models wherein the attacker adds examples to the training set to manipulate the behavior of the model at test time. This paper explores poisoning attacks on neural nets. The proposed attacks use "clean-labels"; they don't require the attacker to have any control over the …
In the last three decades, we have seen a significant increase in trading goods and services through online auctions. However, this business created an attractive environment for malicious moneymakers who can commit different types of fraud activities, such as Shill Bidding (SB). The latter is predominant across many a…
Feedback loops amplify dataset biases, affecting future model performance.
problem Feedback loops amplify biases in datasets, risking future model reliability.
method Formalized system where model interactions are recorded and reused, analyzed for bias amplification.
result Models that behave like samples from the training distribution are more stable and calibrated.
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.
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…
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.
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.
We present a projectively invariant description of planar linear 3-webs. For a non-hexagonal 3-web, we introduce family of projective torsion-free Cartan connections, the web leaves being geodesics for each member of the family, and give a web linearization criterion. Finally, we propose an algorithm for resolving the …
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…
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…
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…
A deformation of the authors' instanton homology for webs is constructed by introducing a local system of coefficients. In the case that the web is planar, the rank of the deformed instanton homology is equal to the number of Tait colorings of the web.
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.
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…
The Myers-Briggs Type Indicator (MBTI) is a popular personality metric that uses four dichotomies as indicators of personality traits. This paper examines the use of pre-trained language models to predict MBTI personality types based on scraped labeled texts. The proposed model reaches an accuracy of for correct…
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…
Critical to evaluating the capacity, scalability, and availability of web systems are realistic web traffic generators. Web traffic generation is a classic research problem, no generator accounts for the characteristics of web robots or crawlers that are now the dominant source of traffic to a web server. Administrator…
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.
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.
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.
Samuelson's Websmath.DG
In the present paper we define Samuelson's webs and their rank. The main result of the paper is the proof that the rank of the Samuelson webs does not exceed 6, as well as finding the conditions under which this rank is maximal for the general Samuelson webs as well as for their singular cases.
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.
Functors from web categories differ despite similar definitions.
problem Distinguishing between combinatorial and gauge-theoretic evaluations of webs.
method Exhibited a counterexample showing restricted to planar webs is not .
result Restriction of to planar webs is distinct from .
Intersections of Dual -Websmath.GT
Interprets SL3-web intersections on surfaces.
problem Interpreting SL3-web intersections on surfaces.
method Intersection pairing between reduced SL3-webs and tropical sets.
result Provides a new proof of flip equivariance.
On webs in quantum type math.QA
Study of webs in quantum type C, proving equivalence to quantum representations.
problem Equivalence of webs and quantum representations in type C.
method Defined a linear pivotal category diagrammatically, conjectured equivalence, and proved functorial results.
result Full, essentially surjective functor between web and quantum representation categories.
The study generalizes Blaschke curvature for higher-dimensional webs and identifies infinite classes of isomorphism.
problem Understanding the structure and classification of -webs by curves in -dimensional manifolds.
method Definition and analysis of generalized Blaschke curvature, construction of isomorphism classes, and identification of invariants.
result There are infinitely many classes of isomorphism for 4-webs by curves of rank one in 3-dimensional space.
The curvature of web curves is studied in 3D manifolds.
problem Understanding the maximal rank of web structures in 3D.
method Defined a tautological connection on a bundle whose curvature vanishes for maximal rank.
result Exceptional 6-web and its subwebs in 3D have maximal rank.