arXiv subjects

Dominique Quadri

Publications and source records attributed to Dominique Quadri.

3 recordsLinked to original sources

arXiv2026

Towards Realistic Waveform-Level IoT Network Simulation via IQ Mixing

Most Internet of Things (IoT) network simulators are packet-level discrete-event systems in which physical-layer (PHY) behavior is approximated through analytical interference rules and precomputed error models. While this enables scalable experiments, it can miss key waveform-level effects such as adjacent-channel leakage, cross-modulation interference between coexisting signals, and receiver imperfections, which are critical in heterogeneous sub-GHz ISM-band coexistence scenarios. This paper discusses these limitations and introduces IQSim, a simulation paradigm based on in-phase/quadrature (IQ) stream mixing. Instead of predicting packet outcomes from abstract collision models, IQSim maintains a shared complex baseband IQStream into which simulated transmissions are inserted as IQ waveforms after propagation processing, and then demodulated by software-based receivers or hardware gateways. We outline the end-to-end workflow, including online or offline waveform generation, IQ-domain propagation, waveform superposition, and delivery to gateways. We also report preliminary prototype results supporting the feasibility of real-time execution.

cs.NI↗

arXiv2021

An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem

In this article, we address a class of non convex, integer, non linear mathematical programs using dynamic programming. The mathematical program considered, whose properties are studied in this article, may be used to model the optimal liquidation problem of a single asset portfolio, held in a very large quantity, in a low volatility and perfect memory market, with few market participants. In this context, the Portfolio Manager's selling actions convey information to market participants, which in turn lower bid prices and further penalize the liquidation proceeds we attempt to maximize. We show the problem can be solved exactly using Dynamic Programming (DP) in polynomial time. However, exact resolution is only efficient for small instances. For medium size and large instances, we introduce dedicated heuristics which provide thin admissible solutions, hence tight lower bounds for the initial problem. We also benchmark them against a commercial solver, such as LocalSolver [7]. We are also interested in the continuously relaxed problem, which is non convex. Firstly, we use continuous solutions, obtained by free solver NLopt [26] and transform them into thin admissible solutions of the discrete problem. Secondly, we provide, under some convexity assumptions, an upper bound for the continuous relaxation, and hence for the initial (integer) problem. Numerical experiments confirm the quality of proposed heuristics (lower bounds), which often reach the optimal, or prove very tight, for small and medium size instances, with a very fast CPU time. Our upper bound, however, is not tight.

cs.DM↗

arXiv2019

Recommendation System-based Upper Confidence Bound for Online Advertising

In this paper, the method UCB-RS, which resorts to recommendation system (RS) for enhancing the upper-confidence bound algorithm UCB, is presented. The proposed method is used for dealing with non-stationary and large-state spaces multi-armed bandit problems. The proposed method has been targeted to the problem of the product recommendation in the online advertising. Through extensive testing with RecoGym, an OpenAI Gym-based reinforcement learning environment for the product recommendation in online advertising, the proposed method outperforms the widespread reinforcement learning schemes such as $ε$-Greedy, Upper Confidence (UCB1) and Exponential Weights for Exploration and Exploitation (EXP3).

cs.IR↗