Tootfinder

Launch pad.
(Not really, but that part of the Saalfelder Weg very much makes me feel like wanting to take off... Höhengefühle!)
#SilentSunday #LandscapePhotography #Photography

Yes, yes, yes, yes, @…! 👏
“For now, I’m planning on continuing to roll up my sleeves. I want to make things because I’m human and alive. I want to go on journeys and grow. I’m not always looking for an easy path, I want the friction. Because if I give up the journey, what am I really making? What do I actually learn?”

To be effective a boobytrap needs to be laid in a location frequented by the enemy.
These raccoons are super predictable, you can see a path they've worn into the grass

from my link log —
Why does Windows use backslash as its path separator?
https://www.os2museum.com/wp/why-does-windows-really-use-backslash-as-path-separator/
saved 2024-04-25

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
Stephan Sturm
https://arxiv.org/abs/2506.01815

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams. The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual character without plunging into the technical details of rigorous proofs. These notes are based on an introductory presentation given to students of the Research Experience for Undergraduates in Industrial Mathematics and Statistics at Worcester Polytechnic …

Computing Path Signature Varieties in Macaulay2
Carlos Am\'endola, Angelo El Saliby, Felix Lotter, Oriol Reig Fit\'e
https://arxiv.org/abs/2506.01429

Computing Path Signature Varieties in Macaulay2
The signature of a path is a non-commutative power series whose coefficients are given by certain iterated integrals over the path coordinates. This series almost uniquely characterizes the path up to translation and reparameterization. Taking only fixed degree parts of these series yields signature tensors. We introduce the Macaulay2 package $\texttt{PathSignatures}$ to simplify the study of these interesting objects for piecewise polynomial paths. It allows for the creation and manipulation o…

Is Extending Modality The Right Path Towards Omni-Modality?
Tinghui Zhu, Kai Zhang, Muhao Chen, Yu Su
https://arxiv.org/abs/2506.01872 https://

Is Extending Modality The Right Path Towards Omni-Modality?
Omni-modal language models (OLMs) aim to integrate and reason over diverse input modalities--such as text, images, video, and audio--while maintaining strong language capabilities. Despite recent advancements, existing models, especially open-source ones, remain far from true omni-modality, struggling to generalize beyond the specific modality pairs they are trained on or to achieve strong performance when processing multi-modal inputs. We study the effect of extending modality, the dominant te…

This https://arxiv.org/abs/2405.04860 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

Quantum Concolic Testing
This paper presents the first concolic testing framework explicitly designed for quantum programs. The framework introduces quantum constraint generation methods for quantum control statements that quantify quantum states and offers a symbolization method for quantum variables. Based on this framework, we generate path constraints for each concrete execution path of a quantum program. These constraints guide the exploration of new paths, with a quantum constraint solver determining outcomes to …

This https://arxiv.org/abs/2505.20455 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

HAND Me the Data: Fast Robot Adaptation via Hand Path Retrieval
We hand the community HAND, a simple and time-efficient method for teaching robots new manipulation tasks through human hand demonstrations. Instead of relying on task-specific robot demonstrations collected via teleoperation, HAND uses easy-to-provide hand demonstrations to retrieve relevant behaviors from task-agnostic robot play data. Using a visual tracking pipeline, HAND extracts the motion of the human hand from the hand demonstration and retrieves robot sub-trajectories in two stages: fi…

2025 Cowboys game-by-game predictions: Is there a path to playoffs for Dallas? https://www.foxsports.com/stories/nfl/predicting-cowboys-2025-season-game-by-game

This https://arxiv.org/abs/2412.09433 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

This https://arxiv.org/abs/2302.11997 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Beamforming Design with Partial Channel Estimation and Feedback for FDD RIS-Assisted Systems
Beamforming design with partial channel estimation and feedback for frequency-division duplexing (FDD) reconfigurable intelligent surface (RIS) assisted systems is considered in this paper. We leverage the observation that path angle information (PAI) varies more slowly than path gain information (PGI). Then, several dominant paths are selected among all the cascaded paths according to the known PAI for maximizing the spectral efficiency of downlink data transmission. To acquire the dominating …

This https://arxiv.org/abs/2505.24100 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Halfway to induced saturation for even cycles
For graphs $G$ and $H$, we say that $G$ is $H$-free if no induced subgraph of $G$ is isomorphic to $H$, and that $G$ is $H$-induced saturated if $G$ is $H$-free but removing or adding any edge in $G$ creates an induced copy of $H$. A full characterization of graphs $H$ for which $H$-induced saturated graphs exist remains elusive. Even the case where $H$ is a path -- now settled by the collective results of Martin and Smith, Bonamy et al., and Dvoŕǎk -- was already quite challenging. What if…

This https://arxiv.org/abs/2505.20597 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

LSZ ghostbusters in the quadratic gravity stage
The present letter considers the quantization method developed in [1]-[9], which postulates that, in several situations, negative norm or ghost states can be avoided in order to give positive probabilities. These authors also postulate a candidate for a path integral for those theories, following pioneer works initiated by Dirac [10]} and Pauli \[11]. However, taking into account the non standard oscillator algebra inherent to this method, in order to be sure that unitarity is not violated, one…

This https://arxiv.org/abs/2412.11283 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Cyclic polytopes through the lens of iterated integrals
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial automorphisms of the polytope. Motivated by this observation, we look for other linear combinations of iterated integrals that are invariant under the subgroup action. This yields interesting polynomial attributes of the cyclic polytope. We prove that there a…

Neural Networks for Parameter Estimation of the Discretely Observed Hawkes Process
Jason J. Lambe, Feng Chen, Tom Stindl, Tsz-Kit Jeffrey Kwan
https://arxiv.org/abs/2506.01258

Neural Networks for Parameter Estimation of the Discretely Observed Hawkes Process
When the sample path of a Hawkes process is observed discretely, such that only the total event counts in disjoint time intervals are known, the likelihood function becomes intractable. To overcome the challenge of likelihood-based inference in this setting, we propose to use a likelihood-free approach to parameter estimation, where a fully connected neural network (NN) is trained using simulated data to estimate the parameters of the Hawkes process from a summary statistic of the count data. A…

Trivial Monodromy without Separation: A Non-Hausdorff Counterexample in Covering Theory
Abhiram Sripat
https://arxiv.org/abs/2506.00031 https://

Trivial Monodromy without Separation: A Non-Hausdorff Counterexample in Covering Theory
We present a concrete topological construction, a non-Hausdorff, locally Euclidean space with multiple origins, that behaves unexpectedly well under path-lifting. Despite lacking the Hausdorff property, the space remains second-countable, T1, and path-connected, yet its fundamental group sees only trivial monodromy. This violates intuitive expectations from classical covering theory and invites a systematic rethinking of how separation axioms interact with lifting properties. We offer this spac…

This https://arxiv.org/abs/2504.19605 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

A Comparative Study on Positional Encoding for Time-frequency Domain Dual-path Transformer-based Source Separation Models
In this study, we investigate the impact of positional encoding (PE) on source separation performance and the generalization ability to long sequences (length extrapolation) in Transformer-based time-frequency (TF) domain dual-path models. The length extrapolation capability in TF-domain dual-path models is a crucial factor, as it affects not only their performance on long-duration inputs but also their generalizability to signals with unseen sampling rates. While PE is known to significantly i…

Natura Urbana VIII 🏡
城市自然 VIII 🏡
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Harnessing curvature for helical wave generation in spiral-based metamaterial structures
Mohamed Roshdy, Osama R. Bilal
https://arxiv.org/abs/2506.04903 ht…

Harnessing curvature for helical wave generation in spiral-based metamaterial structures
Linearly polarized elastic waves propagating in a linear path have been extensively explored in numerous applications from biomedical imaging to structural health monitoring. However, elastic waves propagating in a circularly polarized helical path are less explored because of the challenges in their generation and control. In this paper, we harness conventional actuation methods combined with sheets decorated by Archimedean spirals to generate elastic helical waves. We show that our metamateri…

This https://arxiv.org/abs/2402.10330 has been replaced.
initial toot: https://mastoxiv.page/@a…

Quantum dynamics of semiconductor quantum dot Josephson junctions
Josephson junctions constructed from superconductor-semiconductor-superconductor heterostructures have been used to realize a variety of voltage-tunable superconducting quantum devices, including qubits and parametric amplifiers. To date theoretical descriptions of these systems have been restricted to small quantum fluctuations of the junction phase, making them inapplicable to many experiments. In this work we relax this, employing a path-integral formulation where the phase quantum dynamics …

Neural Path Guiding with Distribution Factorization
Pedro Figueiredo, Qihao He, Nima Khademi Kalantari
https://arxiv.org/abs/2506.00839 https://

Neural Path Guiding with Distribution Factorization
In this paper, we present a neural path guiding method to aid with Monte Carlo (MC) integration in rendering. Existing neural methods utilize distribution representations that are either fast or expressive, but not both. We propose a simple, but effective, representation that is sufficiently expressive and reasonably fast. Specifically, we break down the 2D distribution over the directional domain into two 1D probability distribution functions (PDF). We propose to model each 1D PDF using a neur…

This https://arxiv.org/abs/2411.01707 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction
We study Multi-Robot Coverage Path Planning (MCPP) on a 4-neighbor 2D grid G, which aims to compute paths for multiple robots to cover all cells of G. Traditional approaches are limited as they first compute coverage trees on a quadrant coarsened grid H and then employ the Spanning Tree Coverage (STC) paradigm to generate paths on G, making them inapplicable to grids with partially obstructed 2x2 blocks. To address this limitation, we reformulate the problem directly on G, revolutionizing grid-…

This https://arxiv.org/abs/2504.11711 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

The Hitchhiker's Guide to Program Analysis, Part II: Deep Thoughts by LLMs
Static analysis plays a crucial role in software vulnerability detection, yet faces a persistent precision-scalability tradeoff. In large codebases like the Linux kernel, traditional static analysis tools often generate excessive false positives due to simplified vulnerability modeling and overapproximation of path and data constraints. While large language models (LLMs) demonstrate promising code understanding capabilities, their direct application to program analysis remains unreliable due to…

Trevon Diggs progressing well in recovery from 2024 injury: 'All signs are positive' https://www.dallascowboys.com/news/trevon-diggs-progressing-well-in-recovery-from-2024-injury-all-signs-are-positive…

Nice climb up the grade over Breckenheim past Wildsachsen to Bremthal, then back—woosh!—down to Auringen, through Medenbach, and across the multi-use recreation paths to Nordenstadt (home). Taunus foothills, greater Wiesbaden, Hesse, Germany.
#seniorfitness #nogym

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks
Atsuyuki Miyai, Zaiying Zhao, Kazuki Egashira, Atsuki Sato, Tatsumi Sunada, Shota Onohara, Hiromasa Yamanishi, Mashiro Toyooka, Kunato Nishina, Ryoma Maeda, Kiyoharu Aizawa, Toshihiko Yamasaki
https://arxiv.org/abs/2506.01952

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks
Powered by a large language model (LLM), a web browsing agent operates web browsers in a human-like manner and offers a highly transparent path toward automating a wide range of everyday tasks. As web agents become increasingly capable and demonstrate proficiency in general browsing tasks, a critical question emerges: Can they go beyond general browsing to robustly handle tasks that are tedious and complex, or chores that humans often avoid doing themselves? In this paper, we introduce WebChore…

Equation of State and First Principles Prediction of the Vibrational Matrix Shift of Solid Parahydrogen
Alexander Ibrahim, Lecheng Wang, Tom Halverson, Robert J Le Roy, Pierre-Nicholas Roy
https://arxiv.org/abs/2506.01294

Equation of State and First Principles Prediction of the Vibrational Matrix Shift of Solid Parahydrogen
We generate the equation of state (EOS) of solid parahydrogen using a path-integral Monte Carlo (PIMC) simulation based on a highly accurate first-principles adiabatic hindered rotor (AHR) potential energy curve for the \para dimer. The EOS curves for the fcc and hcp structures of solid parahydrogen near the equilibrium density show that the hcp structure is the more stable of the two, in agreement with experiment. To accurately reproduce the structural and energy properties of solid parahydrog…

Front propagation on a general metric graph
Hiroshi Matano, Shuichi Jimbo
https://arxiv.org/abs/2505.24418 https://arxiv.org/pdf/2505…

Front propagation on a general metric graph
We consider a bistable reaction-diffusion equation on a metric graph that is a generalization of the so-called star graphs. More precisely, our graph $Ω$ consists of a bounded finite metric graph $D$ of arbitrary configuration and a finite number of branches $Ω_1,\ldots,Ω_N\,(N\geq 2)$ of infinite length emanating from some of the vertices of $D$. Each $Ω_i\,(i=1,\ldots,N)$ is called an ``outer path''. Our goal is to investigate the behavior of the front coming from infinity along a given o…

Coalgebraic proof translations for non-wellfounded proofs
Borja Sierra Miranda, Thomas Studer, Lukas Zenger
https://arxiv.org/abs/2506.01711 https://

Coalgebraic proof translations for non-wellfounded proofs
Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof. Among these conditions, one of the simplest is enforcing that any infinite path goes through the premise of a rule infinitely often. Systems of this kind appear for modal logics with conversely well-founded frame conditions like GL or Grz. In this paper, we pr…

Path-dependent option pricing with two-dimensional PDE using MPDATA
Pawe{\l} Magnuszewski, Sylwester Arabas
https://arxiv.org/abs/2505.24435 https://

Path-dependent option pricing with two-dimensional PDE using MPDATA
In this paper, we discuss a simple yet robust PDE method for evaluating path-dependent Asian-style options using the non-oscillatory forward-in-time second-order MPDATA finite-difference scheme. The valuation methodology involves casting the Black-Merton-Scholes equation as a transport problem by first transforming it into a homogeneous advection-diffusion PDE via variable substitution, and then expressing the diffusion term as an advective flux using the pseudo-velocity technique. As a result,…

Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
J. Lea\~nos, M. Lomel\'i-Haro, Christophe Ndjatchi, L. M. R\'ios-Castro
https://arxiv.org/abs/2506.00689

Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
Let $G=(V(G),E(G))$ be a simple graph, and let $U\subseteq V(G)$. Two distinct vertices $x,y\in U$ are $U$-mutually visible if $G$ contains a shortest $x$-$y$ path that is internally disjoint from $U$. $U$ is called a mutual-visibility set of $G$ if any two vertices of $U$ are $U$-mutually visible. The mutual-visibility number $μ(G)$ of $G$ is the size of a largest mutual-visibility set of $G$. Let $P$ be a set of $n\geq 3$ points in ${\mathbb R}^2$ in general position. The disjointness graph …

Trevon Diggs progressing well in recovery from 2024 injury: 'All signs are positive' https://www.dallascowboys.com/news/trevon-diggs-progressing-well-in-recovery-from-2024-injury-all-signs-are-positive…

This https://arxiv.org/abs/2505.14446 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Light deflection in unified gravity and measurable deviation from general relativity
Light, though massless, does not travel in a perfectly straight line when it passes near a massive object. Instead, it follows the curvature of spacetime - a phenomenon predicted by Einstein's general theory of relativity. This effect, known as gravitational lensing, occurs because massive bodies like stars, galaxies, or black holes distort the fabric of spacetime around them, bending the path of light much like a lens bends rays in optics. In this work, we study gravitational lensing using the…

Apologies for the self-promotion, but this video just crossed my path today. I didn't know it was available. It's a (long) lecture I gave at UNSW a couple of years ago to a software engineering class on the subject of what software engineering actually _is_. It captures how I think about software pretty well.
https://www.youtube.com/watch?v=SlasmhEcXDo

Design and Analysis of Power Consumption Models for Open-RAN Architectures
Urooj Tariq, Rishu Raj, Dan Kilper
https://arxiv.org/abs/2505.24552 https://

Design and Analysis of Power Consumption Models for Open-RAN Architectures
The open radio access network (O-RAN) Alliance developed an architecture and specifications for open and disaggregated cellular networks including many elements that are being widely adopted and implemented in both commercial and research networks. In this paper, we develop transaction-based power consumption models of a centralized O-RAN architecture based on commercial hardware and considering the full end-to-end data path from the radio unit to the data center. We focus on recent fanout limi…

This https://arxiv.org/abs/2402.01820 has been replaced.
link: https://scholar.google.com/scholar?q=a

Signature volatility models: pricing and hedging with Fourier
We consider a stochastic volatility model where the dynamics of the volatility are given by a possibly infinite linear combination of the elements of the time extended signature of a Brownian motion. First, we show that the model is remarkably universal, as it includes, but is not limited to, the celebrated Stein-Stein, Bergomi, and Heston models, together with some path-dependent variants. Second, we derive the joint characteristic functional of the log-price and integrated variance provided t…

Drawdowns, Drawups, and Occupation Times under General Markov Models
Pingping Zeng, Gongqiu Zhang, Weinan Zhang
https://arxiv.org/abs/2506.00552 https://…

Drawdowns, Drawups, and Occupation Times under General Markov Models
Drawdown risk, an important metric in financial risk management, poses significant computational challenges due to its highly path-dependent nature. This paper proposes a unified framework for computing five important drawdown quantities introduced in Landriault et al. (2015) and Zhang (2015) under general Markov models. We first establish linear systems and develop efficient algorithms for such problems under continuous-time Markov chains (CTMCs), and then establish their theoretical convergen…

Nice climb up the grade over Breckenheim past Wildsachsen to Bremthal, then back—woosh!—down to Auringen, through Medenbach, and across the multi-use recreation paths to Nordenstadt (home). Taunus foothills, greater Wiesbaden, Hesse, Germany.
#seniorfitness #nogym

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
Massimiliano Gubinelli, Guopeng Li, Jiawei Li, Tadahiro Oh
https://arxiv.org/abs/2505.24270

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
We study the modulated Korteweg-de~Vries equation (KdV) on the circle with a time non-homogeneous modulation acting on the linear dispersion term. By adapting the normal form approach to the modulated setting, we prove sharp unconditional uniqueness of solutions to the modulated KdV in $L^2(\mathbb T)$ if a modulation is sufficiently irregular. For example, this result implies that if the modulation is given by a sample path of a fractional Brownian motion with Hurst index $0 < H < \frac 25$, t…

#WaterfallWednesday, pretty much a year ago...
(Coincidentally there on the same day as @…... but didn't know)
#LandscapePhotography

Done some more work with the VR animation engine today.
Seems to now be working that I can lay in the path that the character will walk, and then puppet their limbs as they walk it.
Done more work to standardize how all the slapdash episode structure is so now there's also a #wip #starshipsd #gamedev

This https://arxiv.org/abs/2505.24299 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Iion-motion simulations of a plasma-wakefield experiment at FLASHForward
In plasma-based acceleration, an ultra-relativistic particle bunch$\unicode{x2014}$or an intense laser beam$\unicode{x2014}$is used to expel electrons from its propagation path, forming a wake that is devoid of electrons. The ions, being significantly more massive, are often assumed to be stationary. However, both theory and simulations suggest that any sufficiently dense electron bunch can trigger ion motion, and its effect must be taken into account. We simulate beam-driven plasma wakefields …

Neutrino emission from neutron star matter
Omar Benhar, Lucas Tonetto
https://arxiv.org/abs/2505.24485 https://arxiv.org/pdf/2505.244…

Neutrino emission from neutron star matter
The temperature of a newly formed neutron star is believed to be as high as $10^{11}$~K, corresponding to a thermal energy of about $10$ MeV. After a time $t \sim 50 \ {\rm s}$, the neutrino mean free path in nuclear matter exceeds the typical star radius, R~$\sim$~10 Km, and neutrino emission becomes the dominant mechanism of energy loss, eventually bringing the temperature down to $\sim10^{8}$~K. Neutrinos also play a critical role in determining the composition of matter in the star interior…

Halfway to induced saturation for even cycles
Xinyue Fan, Sahab Hajebi, Sepehr Hajebi, Sophie Spiral
https://arxiv.org/abs/2505.24100 https://

Halfway to induced saturation for even cycles
For graphs $G$ and $H$, we say that $G$ is $H$-free if no induced subgraph of $G$ is isomorphic to $H$, and that $G$ is $H$-induced saturated if $G$ is $H$-free but removing or adding any edge in $G$ creates an induced copy of $H$. A full characterization of graphs $H$ for which $H$-induced saturated graphs exist remains elusive. Even the case where $H$ is a path -- now settled by the collective results of Martin and Smith, Bonamy et al., and Dvoŕǎk -- was already quite challenging. What if…

This https://arxiv.org/abs/2505.22623 has been replaced.
initial toot: https://mastoxiv.page/@ar…

A theory for diffusion-controlled reactions within nonequilibrium steady-states
We study diffusion-controlled processes in nonequilibrium steady-states, where standard rate theory assumptions break down. Using transition path theory, we generalize the relations between reactive probability fluxes and measures of the rate of the reaction. Stochastic thermodynamics analysis reveals how work constrains the enhancement of rates relative to their equilibrium values. An analytically solvable ion-pairing model under a strong electric field illustrates and validates our approach a…

The shortest path to Sat' @…
First posted in 2013
I'm wondering: How much are the paths different today?

Alley Stories V 🔣
巷弄故事 V 🔣
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Alley Stories V 🔣
巷弄故事 V 🔣
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.