Iyad Kanj

Iyad Kanj

Auto-generated profile, based on publicly available information

Iyad Kanj


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
DADimuthu D. K. Arachchige
Dimuthu D. K. Arachchige
DPDulanjana M. Perera
Dulanjana M. Perera
SMSanjaya Mallikarachchi
Sanjaya Mallikarachchi
IKIyad Kanj
Iyad Kanj
YCYue Chen
Yue Chen
Isuru S. GodageIsuru S. Godage
Isuru S. Godage
Soft robotic snakes made of compliant materials can continuously deform their bodies and, therefore, mimic the biological snakes' flexible and agile locomotion gaits better than their rigid-bodied counterparts. Without wheel support, to date, soft robotic snakes are limited to emulating planar locomotion gaits, which are derived via kinematic modeling and tested on robotic prototypes. Given that the snake locomotion results from the reaction forces due to the distributed contact between their skin and the ground, it is essential to investigate the locomotion gaits through efficient dynamic models capable of accommodating distributed contact forces. We present a complete spatial dynamic model that utilizes a floating-base kinematic model with distributed contact dynamics for a pneumatically powered soft robotic snake. We numerically evaluate the feasibility of the planar and spatial rolling gaits utilizing the proposed model and experimentally validate the corresponding locomotion gait trajectories on a soft robotic snake prototype. We qualitatively and quantitatively compare the numerical and experimental results which confirm the validity of the proposed dynamic model.

16 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
JCJianer Chen
Jianer Chen
QHQin Huang
Qin Huang
IKIyad Kanj
Iyad Kanj
QLQian Li
Qian Li
GXGe Xia
Ge Xia
We present streaming algorithms for the graph $k$-matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds, have optimal or near-optimal update time, significantly improving on previous results. More specifically, for the insert-only streaming model, we present a one-pass algorithm with optimal space complexity $O(k^2)$ and optimal update time $O(1)$, that with high probability computes a maximum weighted $k$-matching of a given weighted graph. The update time of our algorithm significantly improves the previous upper bound of $O(\log k)$, which was derived only for $k$-matching on unweighted graphs. For the dynamic streaming model, we present a one-pass algorithm that with high probability computes a maximum weighted $k$-matching in $O(Wk^2 \cdot \mbox{polylog}(n)$ space and with $O(\mbox{polylog}(n))$ update time, where $W$ is the number of distinct edge weights. Again the update time of our algorithm improves the previous upper bound of $O(k^2 \cdot \mbox{polylog}(n))$. This algorithm, when applied to unweighted graphs, gives a streaming algorithm on the dynamic model whose space and update time complexities are both near-optimal. Our results also imply a streaming approximation algorithm for maximum weighted $k$-matching whose space complexity matches the best known upper bound with a significantly improved update time.

12 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
EEEduard Eiben
Eduard Eiben
RGRobert Ganian
Robert Ganian
IKIyad Kanj
Iyad Kanj
SOSebastian Ordyniak
Sebastian Ordyniak
SSStefan Szeider
Stefan Szeider
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere classification is much more difficult when dealing with binary data than real-valued data. In this paper, we perform the first complexity-theoretic study of the hypersphere classification problem for binary data. We use the fine-grained parameterized complexity paradigm to analyze the impact of structural properties that may be present in the input data as well as potential conciseness constraints. Our results include stronger lower bounds and new fixed-parameter algorithms for hypersphere classification of binary data, which can find an exact and concise explanation when one exists.