Search

We give a short proof that for every apex-forest $X$ on at least two vertices, graphs excluding $X$ as a minor have layered pathwidth at most $2|V(X)|-3$. This improves upon a result by Dujmovi\'c, Eppstein, Joret, Morin, and Wood (SIDMA, 2020). Our main tool is a structural result about graphs excluding a forest as a rooted minor, which is of independent interest. We develop similar tools for treedepth and treewidth. We discuss implications for Erd\H{o}s-P\'osa properties of rooted models of minors in graphs.

Background: Software Vulnerability (SV) prediction in emerging languages is increasingly important to ensure software security in modern systems. However, these languages usually have limited SV data for developing high-performing prediction models. Aims: We conduct an empirical study to evaluate the impact of SV data scarcity in emerging languages on the state-of-the-art SV prediction model and investigate potential solutions to enhance the performance. Method: We train and test the state-of-the-art model based on CodeBERT with and without data sampling techniques for function-level and line-level SV prediction in three low-resource languages - Kotlin, Swift, and Rust. We also assess the effectiveness of ChatGPT for low-resource SV prediction given its recent success in other domains. Results: Compared to the original work in C/C++ with large data, CodeBERT's performance of function-level and line-level SV prediction significantly declines in low-resource languages, signifying the negative impact of data scarcity. Regarding remediation, data sampling techniques fail to improve CodeBERT; whereas, ChatGPT showcases promising results, substantially enhancing predictive performance by up to 34.4% for the function level and up to 53.5% for the line level. Conclusion: We have highlighted the challenge and made the first promising step for low-resource SV prediction, paving the way for future research in this direction., Comment: Accepted in the 4th International Workshop on Software Security co-located with the 28th International Conference on Evaluation and Assessment in Software Engineering (EASE) 2024

A crucial challenge arising in the design of large-scale logistical networks is to optimize parcel sortation for routing. We study this problem under the recent graph-theoretic formalization of Van Dyk, Klause, Koenemann and Megow (IPCO 2024). The problem asks - given an input digraph D (the fulfillment network) together with a set of commodities represented as source-sink tuples - for a minimum-outdegree subgraph H of the transitive closure of D that contains a source-sink route for each of the commodities. Given the underlying motivation, we study two variants of the problem which differ in whether the routes for the commodities are assumed to be given, or can be chosen arbitrarily. We perform a thorough parameterized analysis of the complexity of both problems. Our results concentrate on three fundamental parameterizations of the problem: (1) When attempting to parameterize by the target outdegree of H, we show that the problems are paraNP-hard even in highly restricted cases; (2) When parameterizing by the number of commodities, we utilize Ramsey-type arguments and color-coding techniques to obtain parameterized algorithms for both problems; (3) When parameterizing by the structure of D, we establish fixed-parameter tractability for both problems w.r.t. treewidth, maximum degree and the maximum routing length. We combine this with lower bounds which show that omitting any of the three parameters results in paraNP-hardness.

Splitting methods are a widely used numerical scheme for solving convection-diffusion problems. However, they may lose stability in some situations, particularly when applied to convection-diffusion problems in the presence of an unbounded convective term. In this paper, we propose a new splitting method, called the "Adapted Lie splitting method", which successfully overcomes the observed instability in certain cases. Assuming that the unbounded coefficient belongs to a suitable Lorentz space, we show that the adapted Lie splitting converges to first-order under the analytic semigroup framework. Furthermore, we provide numerical experiments to illustrate our newly proposed splitting approach., Comment: 14 pages, 6 figures

This paper focuses on self-supervised monocular depth estimation in dynamic scenes trained on monocular videos. Existing methods jointly estimate pixel-wise depth and motion, relying mainly on an image reconstruction loss. Dynamic regions1 remain a critical challenge for these methods due to the inherent ambiguity in depth and motion estimation, resulting in inaccurate depth estimation. This paper proposes a self-supervised training framework exploiting pseudo depth labels for dynamic regions from training data. The key contribution of our framework is to decouple depth estimation for static and dynamic regions of images in the training data. We start with an unsupervised depth estimation approach, which provides reliable depth estimates for static regions and motion cues for dynamic regions and allows us to extract moving object information at the instance level. In the next stage, we use an object network to estimate the depth of those moving objects assuming rigid motions. Then, we propose a new scale alignment module to address the scale ambiguity between estimated depths for static and dynamic regions. We can then use the depth labels generated to train an end-to-end depth estimation network and improve its performance. Extensive experiments on the Cityscapes and KITTI datasets show that our self-training strategy consistently outperforms existing self/unsupervised depth estimation methods., Comment: Accepted to CVPR2024

We derive the complete expression for the Brans Class I exterior spacetime explicitly in terms of the energy and pressures profiles of a stationary spherisymmetric gravity source. This novel and generic expression is achieved in a parsimonious manner, requiring only a subset of the Brans-Dicke field equation and the scalar equation. For distant orbiting test particles, this expression promptly provides a simple, closed and exact formula of the [textgreek]\textgreek{g} Eddington parameter, which reads {\gamma}_{exact}=(({\omega}+1+({\omega}+2){\Theta})/({\omega}+2+({\omega}+1){\Theta})), where {\Theta} is the ratio of the star's "total pressure" integral over its energy integral. This non-perturbative result reproduces the usual Post-Newtonian (({\omega}+1)/({\omega}+2)) expression in the case of a "Newtonian star", in which the pressure is negligible with respect to the energy density. Furthermore, it converges to the General Relativity value ({\gamma}_{GR}=1) as the star's equation of state approaches that of ultra-relativistic matter (in which case {\Theta} approaches 1), a behavior consistent with broader studies on scalar-tensor gravity. Our derivation underscores the essence of these results involving (1) the key relevant portion of the Brans-Dicke field equations, (2) the uniqueness of the Brans Class I vacuum solution for the non-phantom action, viz. {\omega}>-3/2, and (3) the involvement of only two free parameters in this solution, hence requiring two quantities (energy and pressure integrals) of the mass source to fully characterize the solution. From a practical standpoint, it elucidates how a given stellar interior structure model determines the star's exterior gravitational field and impacts the motions of light objects (such as planets and accretion disks) orbiting it., Comment: 1 figure. Correcting a typo in Eq (19) (an unjustified 4*pi factor has been removed)

An $(m,n,R)$-de Bruijn covering array (dBCA) is a doubly periodic $M \times N$ array over an alphabet of size $q$ such that the set of all its $m \times n$ windows form a covering code with radius $R$. An upper bound of the smallest array area of an $(m,n,R)$-dBCA is provided using a probabilistic technique which is similar to the one that was used for an upper bound on the length of a de Bruijn covering sequence. A folding technique to construct a dBCA from a de Bruijn covering sequence or de Bruijn covering sequences code is presented. Several new constructions that yield shorter de Bruijn covering sequences and $(m,n,R)$-dBCAs with smaller areas are also provided. These constructions are mainly based on sequences derived from cyclic codes, self-dual sequences, primitive polynomials, an interleaving technique, folding, and mutual shifts of sequences with the same covering radius. Finally, constructions of de Bruijn covering sequences codes are also discussed.

Naively assuming English as a source language may hinder cross-lingual transfer for many languages by failing to consider the importance of language contact. Some languages are more well-connected than others, and target languages can benefit from transferring from closely related languages; for many languages, the set of closely related languages does not include English. In this work, we study the impact of source language for cross-lingual transfer, demonstrating the importance of selecting source languages that have high contact with the target language. We also construct a novel benchmark dataset for close contact Chinese-Japanese-Korean-Vietnamese (CJKV) languages to further encourage in-depth studies of language contact. To comprehensively capture contact between these languages, we propose to integrate Romanized transcription beyond textual scripts via Contrastive Learning objectives, leading to enhanced cross-lingual representations and effective zero-shot cross-lingual transfer., Comment: Accepted at LREC-COLING 2024

Stellar-mass black hole binaries (BHBs) in galactic nuclei are gravitationally perturbed by the central supermassive black hole (SMBH) of the host galaxy, potentially inducing strong eccentricity oscillations through the eccentric Kozai-Lidov (EKL) mechanism. These highly eccentric binaries emit a train of gravitational-wave (GW) bursts detectable by the Laser Interferometer Space Antenna (LISA) -- a planned space-based GW detector -- with signal-to-noise ratios (SNRs) up to ${\sim}100$ per burst. In this work, we study the GW signature of BHBs orbiting our galaxy's SMBH, Sgr A$^*$, which are consequently driven to very high eccentricities. We demonstrate that an unmodeled approach using a wavelet decomposition of the data effectively yields the time-frequency properties of each burst, provided that the GW frequency peaks between $10^{-3}\,\,\mathrm{Hz}$--$10^{-1}\,\,\mathrm{Hz}$. The wavelet parameters may be used to infer the eccentricity of the binary, measuring $\log_{10}(1-e)$ within an error of $20\%$. Our proposed search method can thus constrain the parameter space to be sampled by complementary Bayesian inference methods, which use waveform templates or orthogonal wavelets to reconstruct and subtract the signal from LISA data., Comment: 11 pages, 5+1 figures. Accepted to ApJL

The intricate interplay between spin and lattice degrees of freedom in two-dimensional magnetic materials plays a pivotal role in modifying their magnetic characteristics, engendering hybrid quasiparticles, and implementing functional devices. Herein, we present our comprehensive and in-depth investigations on magnetic and lattice excitations of MnPSe3-xSx (x = 0, 0.5, and 1.5) alloys, utilizing temperature- and polarization-dependent Raman scattering. Our experimental results reveal the occurrence of multiple phase transitions, evidenced by notable changes in phonon self-energy and the appearance or splitting of phonon modes. These emergent phases are tied to the development of long and short-range spin-spin correlations, as well as to spin reorientations or magnetic instabilities. Our analysis of two-magnon excitations as a function of temperature and composition showcases their hybridization with phonons whose degree weakens with increasing x. Moreover, the suppression of spin-dependent phonon intensity in chemically most-disordered MnPSe3-xSx (x = 1.5) suggests that chalcogen substitution offers a control knob of tuning spin and phonon dynamics by modulating concurrently superexchange pathways and a degree of trigonal distortions.

In the context of Monte Carlo (MC) generators with parton showers that have next-to-leading-logarithmic (NLL) precision, the cutoff $Q_0$ terminating the shower evolution should be viewed as an infrared factorization scale so that parameters or non-perturbative effects of the MC generator may have a field theoretic interpretation with a controllable scheme dependence. This implies that the generator's parton level should be carefully defined within QCD perturbation theory with subleading order precision. Furthermore, it entails that the shower cut $Q_0$ is not treated as one of the generator's tuning parameters, but that the tuning can be carried out reliably for a range of $Q_0$ values and that the hadron level description is $Q_0$-invariant. This in turn imposes non-trival constraints on the behavior of the generator's hadronization model, so that its parameters can adapt accordingly when the $Q_0$ value is changed. We investigate these features using the angular ordered parton shower and the cluster hadronization model implemented in the Herwig~7.2 MC generator focusing in particular on the $e^+e^-$ 2-jettiness distribution, where the shower is known to be NLL precise and where QCD factorization imposes stringent constraints on the hadronization corrections. We show that the Herwig default cluster hadronization model does not exhibit these features or consistency with QCD factorization with a satisfying precision. We design a modification of the cluster hadronization model, where some dynamical parton shower aspects are added that are missing in the default model. For this novel dynamical cluster hadronization model these features and consistency with QCD factorization are realized much more accurately., Comment: 54 pages, 17 figures

Sports videos pose complex challenges, including cluttered backgrounds, camera angle changes, small action-representing objects, and imbalanced action class distribution. Existing methods for detecting actions in sports videos heavily rely on global features, utilizing a backbone network as a black box that encompasses the entire spatial frame. However, these approaches tend to overlook the nuances of the scene and struggle with detecting actions that occupy a small portion of the frame. In particular, they face difficulties when dealing with action classes involving small objects, such as balls or yellow/red cards in soccer, which only occupy a fraction of the screen space. To address these challenges, we introduce a novel approach that analyzes and models scene entities using an adaptive attention mechanism. Particularly, our model disentangles the scene content into the global environment feature and local relevant scene entities feature. To efficiently extract environmental features while considering temporal information with less computational cost, we propose the use of a 2D backbone network with a time-shift mechanism. To accurately capture relevant scene entities, we employ a Vision-Language model in conjunction with the adaptive attention mechanism. Our model has demonstrated outstanding performance, securing the 1st place in the SoccerNet-v2 Action Spotting, FineDiving, and FineGym challenge with a substantial performance improvement of 1.6, 2.0, and 1.3 points in avg-mAP compared to the runner-up methods. Furthermore, our approach offers interpretability capabilities in contrast to other deep learning models, which are often designed as black boxes. Our code and models are released at: https://github.com/Fsoft-AIC/unifying-global-local-feature., Comment: Accepted to IJCNN 2024

Controlling gas turbines (GTs) efficiently is vital as GTs are used to balance power in onshore/offshore hybrid power systems with variable renewable energy and energy storage. However, predictive control of GTs is non-trivial when formulated as a dynamic optimisation problem due to the semi-continuous operating regions of GTs, which must be included to ensure complete combustion and high fuel efficiency. This paper studies two approaches for handling the semi-continuous operating regions of GTs in hybrid power systems through predictive control, dynamic optimisation, and complementarity constraints. The proposed solutions are qualitatively investigated and compared with baseline controllers in a case study involving GTs, offshore wind, and batteries. While one of the baseline controllers considers fuel efficiency, it employs a continuous formulation, which results in lower efficiency than the two proposed approaches as it does not account for the semi-continuous operating regions of each GT., Comment: Accepted for presentation at IFAC ADCHEM 2024

The End-to-end (E2E) learning-based approach has great potential to reshape the existing communication systems by replacing the transceivers with deep neural networks. To this end, the E2E learning approach needs to assume the availability of prior channel information to mathematically formulate a differentiable channel layer for the backpropagation (BP) of the error gradients, thereby jointly optimizing the transmitter and the receiver. However, accurate and instantaneous channel state information is hardly obtained in practical wireless communication scenarios. Moreover, the existing E2E learning-based solutions exhibit limited performance in data transmissions with large block lengths. In this article, these practical issues are addressed by our proposed deep deterministic policy gradient-based E2E communication system. In particular, the proposed solution utilizes a reward feedback mechanism to train both the transmitter and the receiver, which alleviates the information loss of error gradients during BP. In addition, a convolutional neural network (CNN)-based architecture is developed to mitigate the curse of dimensionality problem when transmitting messages with large block lengths. Extensive simulations then demonstrate that our proposed solution can not only jointly train the transmitter and the receiver simultaneously without requiring the prior channel knowledge but also can obtain significant performance improvement on block error rate compared to state-of-the-art solutions.

We consider the numerical approximation for a class of radial Dunkl processes corresponding to arbitrary (reduced) root systems in $\mathbb{R}^{d}$. This class contains some well-known processes such as Bessel processes, Dyson's Brownian motions, and Wishart processes. We propose some semi--implicit and truncated Euler--Maruyama schemes for radial Dunkl processes, and study their rate of convergence with respect to the $L^{p}$-sup norm., Comment: 24 pages

Cavity quantum electrodynamics (cQED), the interaction of a two-level system with a high quality factor (Q) cavity, is a foundational building block in different architectures for quantum computation, communication, and metrology. The strong interaction between the atom and the cavity enables single photon operation which is required for quantum gates and sources. Cold atoms, quantum dots, and color centers in crystals are amongst the systems that have shown single photon operations, but they require significant physical infrastructure. Atomic vapors, on the other hand, require limited experimental infrastructure and are hence much easier to deploy outside a laboratory, but they produce an ensemble of moving atoms that results in short interaction times involving multiple atoms, which can hamper quantum operations. A solution to this issue can be found in nanophotonic cavities, where light-matter interaction is enhanced and the volume of operation is small, so that fast single-atom, single-photon operations are enabled. In this work, we study the interaction of an atomically-clad microring resonator (ACMRR) with different-sized ensembles of Rb atoms. We demonstrate strong coupling between an ensemble of ~50 atoms interacting with a high-quality factor (Q > 4 x 10^5) ACMRR, yielding a many-atom cooperativity C ~ 5.5. We continue to observe signatures of atom-photon interaction for a few (< 3) atoms, for which we observe saturation at the level of one intracavity photon. Further development of our platform, which includes integrated thermo-optic heaters to enable cavity tuning and stabilization, should enable the observation of interactions between single photons and single atoms.

We report the observation of a coalescing compact binary with component masses $2.5\text{-}4.5~M_\odot$ and $1.2\text{-}2.0~M_\odot$ (all measurements quoted at the 90% credible level). The gravitational-wave signal GW230529_181500 was observed during the fourth observing run of the LIGO-Virgo-KAGRA detector network on 2023 May 29 by the LIGO Livingston Observatory. The primary component of the source has a mass less than $5~M_\odot$ at 99% credibility. We cannot definitively determine from gravitational-wave data alone whether either component of the source is a neutron star or a black hole. However, given existing estimates of the maximum neutron star mass, we find the most probable interpretation of the source to be the coalescence of a neutron star with a black hole that has a mass between the most massive neutron stars and the least massive black holes observed in the Galaxy. We provisionally estimate a merger rate density of $55^{+127}_{-47}~\text{Gpc}^{-3}\,\text{yr}^{-1}$ for compact binary coalescences with properties similar to the source of GW230529_181500; assuming that the source is a neutron star-black hole merger, GW230529_181500-like sources constitute about 60% of the total merger rate inferred for neutron star-black hole coalescences. The discovery of this system implies an increase in the expected rate of neutron star-black hole mergers with electromagnetic counterparts and provides further evidence for compact objects existing within the purported lower mass gap., Comment: 45 pages (10 pages author list, 13 pages main text, 1 page acknowledgements, 13 pages appendices, 8 pages bibliography), 17 figures, 16 tables. Update to match version published in The Astrophysical Journal Letters. Data products available from https://zenodo.org/records/10845779

Large Language Models (LLMs) can perform various natural language processing tasks with suitable instruction prompts. However, designing effective prompts manually is challenging and time-consuming. Existing methods for automatic prompt optimization either lack flexibility or efficiency. In this paper, we propose an effective approach to automatically select the optimal prompt for a given input from a finite set of synthetic candidate prompts. Our approach consists of three steps: (1) clustering the training data and generating candidate prompts for each cluster using an LLM-based prompt generator; (2) synthesizing a dataset of input-prompt-output tuples for training a prompt evaluator to rank the prompts based on their relevance to the input; (3) using the prompt evaluator to select the best prompt for a new input at test time. Our approach balances prompt generality-specificity and eliminates the need for resource-intensive training and inference. It demonstrates competitive performance on zero-shot question-answering datasets: GSM8K, MultiArith, and AQuA., Comment: preprint

In modern decentralized applications, ensuring communication efficiency and privacy for the users are the key challenges. In order to train machine-learning models, the algorithm has to communicate to the data center and sample data for its gradient computation, thus exposing the data and increasing the communication cost. This gives rise to the need for a decentralized optimization algorithm that is communication-efficient and minimizes the number of gradient computations. To this end, we propose the primal-dual sliding with conditional gradient sliding framework, which is communication-efficient and achieves an $\varepsilon$-approximate solution with the optimal gradient complexity of $O(1/\sqrt{\varepsilon}+\sigma^2/{\varepsilon^2})$ and $O(\log(1/\varepsilon)+\sigma^2/\varepsilon)$ for the convex and strongly convex setting respectively and an LO (Linear Optimization) complexity of $O(1/\varepsilon^2)$ for both settings given a stochastic gradient oracle with variance $\sigma^2$. Compared with the prior work \cite{wai-fw-2017}, our framework relaxes the assumption of the optimal solution being a strict interior point of the feasible set and enjoys wider applicability for large-scale training using a stochastic gradient oracle. We also demonstrate the efficiency of our algorithms with various numerical experiments.

Collaborative machine learning involves training models on data from multiple parties but must incentivize their participation. Existing data valuation methods fairly value and reward each party based on shared data or model parameters but neglect the privacy risks involved. To address this, we introduce differential privacy (DP) as an incentive. Each party can select its required DP guarantee and perturb its sufficient statistic (SS) accordingly. The mediator values the perturbed SS by the Bayesian surprise it elicits about the model parameters. As our valuation function enforces a privacy-valuation trade-off, parties are deterred from selecting excessive DP guarantees that reduce the utility of the grand coalition's model. Finally, the mediator rewards each party with different posterior samples of the model parameters. Such rewards still satisfy existing incentives like fairness but additionally preserve DP and a high similarity to the grand coalition's posterior. We empirically demonstrate the effectiveness and practicality of our approach on synthetic and real-world datasets., Comment: Accepted to NeurIPS 2023

This paper presents a simple yet efficient ensemble learning framework for Vietnamese scene text spotting. Leveraging the power of ensemble learning, which combines multiple models to yield more accurate predictions, our approach aims to significantly enhance the performance of scene text spotting in challenging urban settings. Through experimental evaluations on the VinText dataset, our proposed method achieves a significant improvement in accuracy compared to existing methods with an impressive accuracy of 5%. These results unequivocally demonstrate the efficacy of ensemble learning in the context of Vietnamese scene text spotting in urban environments, highlighting its potential for real world applications, such as text detection and recognition in urban signage, advertisements, and various text-rich urban scenes., Comment: RIVF 2023

This paper considers a class of noncoercive nonlinear elliptic problems with coefficients defined in Marcinkiewicz and Lorentz spaces. We prove the existence of a solution for the corresponding Dirichlet problem and investigate the higher integrability properties of the solution., Comment: 13 pages

We provide a concrete example exhibiting marked deviation from the PPN approximation in a modified theory of gravity. Specifically, we derive the exact formula for the Robertson parameter $\gamma$ in Brans-Dicke gravity for compact mass sources, explicitly incorporating the pressure content of these sources. We achieve this by exploiting the $\textit integrability$ of the 00-component of the Brans-Dicke field equation. In place of the conventional PPN result $\gamma_{PPN}=\frac{\omega+1}{\omega+2}$, we obtain the analytical expression $\gamma_{\,exact}=\frac{\omega+1+(\omega+2)\varTheta}{\omega+2+(\omega+1)\varTheta}$ where $\varTheta$ is the ratio of the total pressure $P_\parallel^*+2P_\perp^*$ and total energy $E^*$ contained within the mass source. Our $\textit non\text{-}perturbative$ formula is valid for all field strengths and types of matter comprising the mass source. We draw four key conclusions: (1) The usual $\gamma_{PPN}$ formula is violated in the presence of pressure, viz. when $\varTheta\neq0$, revealing a limitation of the PPN approximation in Brans-Dicke gravity. (2) The PPN result mainly stems from the assumption of pressureless matter. Even in the weak-field star case, non-zero pressure leads to a violation of the PPN $\gamma$ formula. Conversely, the PPN result is a good approximation for low-pressure matter, i.e. when $\varTheta\approx0$, for all field strengths. (3) Observational constraints on $\gamma$ set $\textit joint$ bounds on $\omega$ and $\varTheta$, with the latter representing a global characteristic of a mass source. If the equation of state of matter in the mass source approaches the ultra-relativistic form, entailing $\varTheta\simeq1$, $\gamma_{\,exact}$ converges to 1 $\textit irrespective$ of $\omega$. (4) In a broader context, our findings indicate the latent significance of considering the interior structure of stars in observational astronomy., Comment: To appear in EPJC. Figure 2 improved with new details; Section 9 added; Section 10 significantly expanded and enhanced

Using starlight polarization, we present the properties of foreground dust towards cluster NGC 7380 embedded in H{\sc ii} region Sh 2-142. Observations of starlight polarization are carried out in four filters using an imaging polarimeter equipped with a 104-cm ARIES telescope. Polarization vectors of stars are aligned along the Galactic magnetic field. Towards the east and southeast regions, the dust structure appears much denser than in other regions (inferred from extinction contours and colour composite image) and is also reflected in polarization distribution. We find that the polarization degree and extinction tend to increase with distance and indication for the presence of a dust layer at a distance of around 1.2 $kpc$. We have identified eight potential candidates exhibiting intrinsic polarization by employing three distinct criteria to distinguish between stars of intrinsic polarization and interstellar polarized stars. For interstellar polarized stars, we find that the maximum polarization degree increases with the color excess and has a strong scatter, with the mean value of 1.71$\pm$0.57$\%$. The peak wavelength spans $0.40-0.88\mu$m with the mean value of 0.56$\pm$0.07 $\mu m$, suggesting similar grain sizes in the region as the average diffuse interstellar medium. The polarization efficiency is also found to decrease with visual extinction as $P_{max}/A_{V}\propto A_{V}^{-0.61}$. Our observational results are found to be consistent with the predictions by the radiative torque alignment theory., Comment: 20 pages, 7 figures, 3 tables. Accepted for publication in AJ

In this work, we provide data stream algorithms that compute optimal splits in decision tree learning. In particular, given a data stream of observations $x_i$ and their labels $y_i$, the goal is to find the optimal split $j$ that divides the data into two sets such that the mean squared error (for regression) or misclassification rate and Gini impurity (for classification) is minimized. We provide several fast streaming algorithms that use sublinear space and a small number of passes for these problems. These algorithms can also be extended to the massively parallel computation model. Our work, while not directly comparable, complements the seminal work of Domingos-Hulten (KDD 2000) and Hulten-Spencer-Domingos (KDD 2001).

In the context of the model-driven development of data-centric applications, OCL constraints play a major role in adding precision to the source models (e.g., data models and security models). Several code-generators have been proposed to bridge the gap between source models with OCL constraints and their corresponding database implementations. However, the database queries produced by these code-generators are significantly less efficient -- from the point of view of execution-time performance -- than the implementations manually written by database experts. In this paper, we propose a different approach to bridge the gap between models with OCL constraints and their corresponding database implementations. In particular, we introduce a model-based methodology for proving the correctness of manually written SQL implementations of OCL constraints. This methodology is based on a novel mapping from a significant subset of the SQL language into many-sorted first-order logic. Moreover, by leveraging on an already existing mapping from the OCL language into many-sorted first-order logic, we can use SMT solvers to automatically prove the correctness of SQL implementations of OCL constraints. To illustrate and show the applicability of our approach, we include in the paper a number of non-trivial examples. Finally, we report on the status of a suite of tools supporting our approach., Comment: 11 pages

The rise of new video modalities like virtual reality or autonomous driving has increased the demand for efficient multi-view video compression methods, both in terms of rate-distortion (R-D) performance and in terms of delay and runtime. While most recent stereo video compression approaches have shown promising performance, they compress left and right views sequentially, leading to poor parallelization and runtime performance. This work presents Low-Latency neural codec for Stereo video Streaming (LLSS), a novel parallel stereo video coding method designed for fast and efficient low-latency stereo video streaming. Instead of using a sequential cross-view motion compensation like existing methods, LLSS introduces a bidirectional feature shifting module to directly exploit mutual information among views and encode them effectively with a joint cross-view prior model for entropy coding. Thanks to this design, LLSS processes left and right views in parallel, minimizing latency; all while substantially improving R-D performance compared to both existing neural and conventional codecs., Comment: Accepted by CVPR2024

Secure aggregation (SecAgg) is a commonly-used privacy-enhancing mechanism in federated learning, affording the server access only to the aggregate of model updates while safeguarding the confidentiality of individual updates. Despite widespread claims regarding SecAgg's privacy-preserving capabilities, a formal analysis of its privacy is lacking, making such presumptions unjustified. In this paper, we delve into the privacy implications of SecAgg by treating it as a local differential privacy (LDP) mechanism for each local update. We design a simple attack wherein an adversarial server seeks to discern which update vector a client submitted, out of two possible ones, in a single training round of federated learning under SecAgg. By conducting privacy auditing, we assess the success probability of this attack and quantify the LDP guarantees provided by SecAgg. Our numerical results unveil that, contrary to prevailing claims, SecAgg offers weak privacy against membership inference attacks even in a single training round. Indeed, it is difficult to hide a local update by adding other independent local updates when the updates are of high dimension. Our findings underscore the imperative for additional privacy-enhancing mechanisms, such as noise injection, in federated learning., Comment: accepted to the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2024

Dust grains are important in various astrophysical processes and serve as indicators of interstellar medium structures, density, and mass. Understanding their physical properties and chemical composition is crucial in astrophysics. Dust polarisation is a valuable tool for studying these properties. The Radiative Torque (RAT) paradigm, which includes Radiative Torque Alignment (RAT-A) and Radiative Torque Disruption (RAT-D), is essential to interpret the dust polarisation data and constrain the fundamental properties of dust grains. However, it has been used primarily to interpret observations at a single wavelength. In this study, we analyse the thermal dust polarisation spectrum obtained from observations with SOFIA/HAWC+ and JCMT/POL-2 in the OMC-1 region and compare the observational data with our numerical results using the RAT paradigm. In general, we show that the dense gas exhibits a positive spectral slope, whereas the warm regions show a negative one. We demonstrate that a one-layer dust (one-phase) model can only reproduce the observed spectra at certain locations and cannot match those with prominent V-shaped spectra (for which the degree of polarisation initially decreases with wavelength from 54 to $\sim$ 300$\,\mu$m and then increases at longer wavelengths). To address this, we improve our model by incorporating two dust components (warm and cold) along the line of sight, resulting in a two-phase model. This improved model successfully reproduces the V-shaped spectra. The best model corresponds to a mixture composition of silicate and carbonaceous grains in the cold medium. Finally, by assuming the plausible model of grain alignment, we infer the inclination angle of the magnetic fields in OMC-1. This approach represents an important step towards better understanding the physics of grain alignment and constraining 3D magnetic fields using dust polarisation spectra., Comment: 12 pages, 9 figures, 3 tables, accepted to A&A

Polarization of starlight and thermal dust emission caused by aligned dust grains is a valuable tool to characterize magnetic fields (B-fields) and constrain dust properties. However, the physics of grain alignment is not fully understood. To test the popular paradigm of radiative torque (RAT) theory, including RAT alignment (RAT-A) and disruption (RAT-D), we use dust polarization data observed by {\it Planck} and SOFIA/HAWC+ toward two filaments with contrasting physical conditions: Musca, a quiet filament, and OMC-1, a highly dynamic filament due to feedback. We analyze various relations of the observed polarization fraction, $P$, with gas column density, $\NHt$, dust temperature, $\Td$, and polarization angle dispersion function, $\S$. We found that $P$ decreases with increasing $\S$ and increasing $\NHt$, as expected from RAT-A. On the other hand, the $P-\Td$ relation is more complicated; it is a linear correlation at low $\Td$ but turns into an anti-correlation when $\Td$ reaches a certain high value. Next, we compute the polarization fraction on a pixel-by-pixel with B-fields in the plane of the sky using the DustPOL code based on RAT, incorporate the depolarization effect by B-field tangling using $\S$, and compare the realistic polarization model with observations of Musca and OMC-1. For Musca with well-ordered B-fields, our numerical model reproduces the decline of $P$ toward the filament spine (aka. polarization hole), having high $\NHt$ and low $\Td$, indicating the loss of grain alignment efficiency due to RAT-A. For OMC-1, with stronger B-field variations and higher $\Td$, our model can reproduce the observed $P-\Td$ and $P-N(\rm H_{2})$ relations only if the depolarization effect resulting from B-field tangling and RAT-D effect are taken into account. Our results provide more robust observational evidence for the RAT paradigm, particularly the recently discovered RAT-D., Comment: 13 figures, 24 pages

The proliferation of online toxic speech is a pertinent problem posing threats to demographic groups. While explicit toxic speech contains offensive lexical signals, implicit one consists of coded or indirect language. Therefore, it is crucial for models not only to detect implicit toxic speech but also to explain its toxicity. This draws a unique need for unified frameworks that can effectively detect and explain implicit toxic speech. Prior works mainly formulated the task of toxic speech detection and explanation as a text generation problem. Nonetheless, models trained using this strategy can be prone to suffer from the consequent error propagation problem. Moreover, our experiments reveal that the detection results of such models are much lower than those that focus only on the detection task. To bridge these gaps, we introduce ToXCL, a unified framework for the detection and explanation of implicit toxic speech. Our model consists of three modules: a (i) Target Group Generator to generate the targeted demographic group(s) of a given post; an (ii) Encoder-Decoder Model in which the encoder focuses on detecting implicit toxic speech and is boosted by a (iii) Teacher Classifier via knowledge distillation, and the decoder generates the necessary explanation. ToXCL achieves new state-of-the-art effectiveness, and outperforms baselines significantly., Comment: Accepted at NAACL 2024 (Main Conference)

Personas are commonly used in software projects to gain a better understanding of end-users' needs. However, there is a limited understanding of their usage and effectiveness in practice. This paper presents the results of a two-step investigation, comprising interviews with 26 software developers, UI/UX designers, business analysts and product managers and a survey of 203 practitioners, aimed at shedding light on the current practices, methods and challenges of using personas in software development. Our findings reveal variations in the frequency and effectiveness of personas across different software projects and IT companies, the challenges practitioners face when using personas and the reasons for not using them at all. Furthermore, we investigate the coverage of human aspects in personas, often assumed to be a key feature of persona descriptions. Contrary to the general perception, our study shows that human aspects are often ignored for various reasons in personas or requirements engineering in general. Our study provides actionable insights for practitioners to overcome challenges in using personas during requirements engineering stages, and we identify areas for future research.

The success of Natural Language Understanding (NLU) benchmarks in various languages, such as GLUE for English, CLUE for Chinese, KLUE for Korean, and IndoNLU for Indonesian, has facilitated the evaluation of new NLU models across a wide range of tasks. To establish a standardized set of benchmarks for Vietnamese NLU, we introduce the first Vietnamese Language Understanding Evaluation (VLUE) benchmark. The VLUE benchmark encompasses five datasets covering different NLU tasks, including text classification, span extraction, and natural language understanding. To provide an insightful overview of the current state of Vietnamese NLU, we then evaluate seven state-of-the-art pre-trained models, including both multilingual and Vietnamese monolingual models, on our proposed VLUE benchmark. Furthermore, we present CafeBERT, a new state-of-the-art pre-trained model that achieves superior results across all tasks in the VLUE benchmark. Our model combines the proficiency of a multilingual pre-trained model with Vietnamese linguistic knowledge. CafeBERT is developed based on the XLM-RoBERTa model, with an additional pretraining step utilizing a significant amount of Vietnamese textual data to enhance its adaptation to the Vietnamese language. For the purpose of future research, CafeBERT is made publicly available for research purposes., Comment: Accepted at NAACL 2024 (Findings)

In cellular networks, authorities may need to physically locate user devices to track criminals or illegal equipment. This process involves authorized agents tracing devices by monitoring uplink signals with cellular operator assistance. However, tracking uncooperative uplink signal sources remains challenging, even for operators and authorities. Three key challenges persist for fine-grained localization: i) devices must generate sufficient, consistent uplink traffic over time, ii) target devices may transmit uplink signals at very low power, and iii) signals from cellular repeaters may hinder localization of the target device. While these challenges pose significant practical obstacles to localization, they have been largely overlooked in existing research. This work examines the impact of these real-world challenges on cellular localization and introduces the Uncooperative Multiangulation Attack (UMA) to address them. UMA can 1) force a target device to transmit traffic continuously, 2) boost the target's signal strength to maximum levels, and 3) uniquely differentiate between signals from the target and repeaters. Importantly, UMA operates without requiring privileged access to cellular operators or user devices, making it applicable to any LTE network. Our evaluations demonstrate that UMA effectively overcomes practical challenges in physical localization when devices are uncooperative.

While intrusion detection systems (IDSs) benefit from the diversity and generalization of IoT data features, the data diversity (e.g., the heterogeneity and high dimensions of data) also makes it difficult to train effective machine learning models in IoT IDSs. This also leads to potentially redundant/noisy features that may decrease the accuracy of the detection engine in IDSs. This paper first introduces a novel neural network architecture called Multiple-Input Auto-Encoder (MIAE). MIAE consists of multiple sub-encoders that can process inputs from different sources with different characteristics. The MIAE model is trained in an unsupervised learning mode to transform the heterogeneous inputs into lower-dimensional representation, which helps classifiers distinguish between normal behaviour and different types of attacks. To distil and retain more relevant features but remove less important/redundant ones during the training process, we further design and embed a feature selection layer right after the representation layer of MIAE resulting in a new model called MIAEFS. This layer learns the importance of features in the representation vector, facilitating the selection of informative features from the representation vector. The results on three IDS datasets, i.e., NSLKDD, UNSW-NB15, and IDS2017, show the superior performance of MIAE and MIAEFS compared to other methods, e.g., conventional classifiers, dimensionality reduction models, unsupervised representation learning methods with different input dimensions, and unsupervised feature selection models. Moreover, MIAE and MIAEFS combined with the Random Forest (RF) classifier achieve accuracy of 96.5% in detecting sophisticated attacks, e.g., Slowloris. The average running time for detecting an attack sample using RF with the representation of MIAE and MIAEFS is approximate 1.7E-6 seconds, whilst the model size is lower than 1 MB.

Representation Learning (RL) plays a pivotal role in the success of many problems including cyberattack detection. Most of the RL methods for cyberattack detection are based on the latent vector of Auto-Encoder (AE) models. An AE transforms raw data into a new latent representation that better exposes the underlying characteristics of the input data. Thus, it is very useful for identifying cyberattacks. However, due to the heterogeneity and sophistication of cyberattacks, the representation of AEs is often entangled/mixed resulting in the difficulty for downstream attack detection models. To tackle this problem, we propose a novel mod called Twin Auto-Encoder (TAE). TAE deterministically transforms the latent representation into a more distinguishable representation namely the \textit{separable representation} and the reconstructsuct the separable representation at the output. The output of TAE called the \textit{reconstruction representation} is input to downstream models to detect cyberattacks. We extensively evaluate the effectiveness of TAE using a wide range of bench-marking datasets. Experiment results show the superior accuracy of TAE over state-of-the-art RL models and well-known machine learning algorithms. Moreover, TAE also outperforms state-of-the-art models on some sophisticated and challenging attacks. We then investigate various characteristics of TAE to further demonstrate its superiority.

We propose a distributional formulation of the spanning problem of a multi-asset payoff by vanilla basket options. This problem is shown to have a unique solution if and only if the payoff function is even and absolutely homogeneous, and we establish a Fourier-based formula to calculate the solution. Financial payoffs are typically piecewise linear, resulting in a solution that may be derived explicitly, yet may also be hard to numerically exploit. One-hidden-layer feedforward neural networks instead provide a natural and efficient numerical alternative for discrete spanning. We test this approach for a selection of archetypal payoffs and obtain better hedging results with vanilla basket options compared to industry-favored approaches based on single-asset vanilla hedges.

In the realm of Federated Learning (FL) applied to remote sensing image classification, this study introduces and assesses several innovative communication strategies. Our exploration includes feature-centric communication, pseudo-weight amalgamation, and a combined method utilizing both weights and features. Experiments conducted on two public scene classification datasets unveil the effectiveness of these strategies, showcasing accelerated convergence, heightened privacy, and reduced network information exchange. This research provides valuable insights into the implications of feature-centric communication in FL, offering potential applications tailored for remote sensing scenarios., Comment: 5 pages, to appear in IGARSS 2024

This paper focuses on estimating the invariant density function $f_X$ of the strongly mixing stationary process $X_t$ in the multiplicative measurement errors model $Y_t = X_t U_t$, where $U_t$ is also a strongly mixing stationary process. We propose a novel approach to handle non-independent data, typical in real-world scenarios. For instance, data collected from various groups may exhibit interdependencies within each group, resembling data generated from $m$-dependent stationary processes, a subset of stationary processes. This study extends the applicability of the model $Y_t = X_t U_t$ to diverse scientific domains dealing with complex dependent data. The paper outlines our estimation techniques, discusses convergence rates, establishes a lower bound on the minimax risk, and demonstrates the asymptotic normality of the estimator for $f_X$ under smooth error distributions. Through examples and simulations, we showcase the efficacy of our estimator. The paper concludes by providing proofs for the presented theoretical results.v

Uncertainty in medical image segmentation tasks, especially inter-rater variability, arising from differences in interpretations and annotations by various experts, presents a significant challenge in achieving consistent and reliable image segmentation. This variability not only reflects the inherent complexity and subjective nature of medical image interpretation but also directly impacts the development and evaluation of automated segmentation algorithms. Accurately modeling and quantifying this variability is essential for enhancing the robustness and clinical applicability of these algorithms. We report the set-up and summarize the benchmark results of the Quantification of Uncertainties in Biomedical Image Quantification Challenge (QUBIQ), which was organized in conjunction with International Conferences on Medical Image Computing and Computer-Assisted Intervention (MICCAI) 2020 and 2021. The challenge focuses on the uncertainty quantification of medical image segmentation which considers the omnipresence of inter-rater variability in imaging datasets. The large collection of images with multi-rater annotations features various modalities such as MRI and CT; various organs such as the brain, prostate, kidney, and pancreas; and different image dimensions 2D-vs-3D. A total of 24 teams submitted different solutions to the problem, combining various baseline models, Bayesian neural networks, and ensemble model techniques. The obtained results indicate the importance of the ensemble models, as well as the need for further research to develop efficient 3D methods for uncertainty quantification methods in 3D segmentation tasks., Comment: initial technical report

Facial Expression Recognition (FER) is a critical task within computer vision with diverse applications across various domains. Addressing the challenge of limited FER datasets, which hampers the generalization capability of expression recognition models, is imperative for enhancing performance. Our paper presents an innovative approach integrating the MAE-Face self-supervised learning (SSL) method and multi-view Fusion Attention mechanism for expression classification, particularly showcased in the 6th Affective Behavior Analysis in-the-wild (ABAW) competition. By utilizing low-level feature information from the ipsilateral view (auxiliary view) before learning the high-level feature that emphasizes the shift in the human facial expression, our work seeks to provide a straightforward yet innovative way to improve the examined view (main view). We also suggest easy-to-implement and no-training frameworks aimed at highlighting key facial features to determine if such features can serve as guides for the model, focusing on pivotal local elements. The efficacy of this method is validated by improvements in model performance on the Aff-wild2 dataset, as observed in both training and validation contexts., Comment: 6 pages; added references for section 1; corrected typo for email author

Perception plays a crucial role in various robot applications. However, existing well-annotated datasets are biased towards autonomous driving scenarios, while unlabelled SLAM datasets are quickly over-fitted, and often lack environment and domain variations. To expand the frontier of these fields, we introduce a comprehensive dataset named MCD (Multi-Campus Dataset), featuring a wide range of sensing modalities, high-accuracy ground truth, and diverse challenging environments across three Eurasian university campuses. MCD comprises both CCS (Classical Cylindrical Spinning) and NRE (Non-Repetitive Epicyclic) lidars, high-quality IMUs (Inertial Measurement Units), cameras, and UWB (Ultra-WideBand) sensors. Furthermore, in a pioneering effort, we introduce semantic annotations of 29 classes over 59k sparse NRE lidar scans across three domains, thus providing a novel challenge to existing semantic segmentation research upon this largely unexplored lidar modality. Finally, we propose, for the first time to the best of our knowledge, continuous-time ground truth based on optimization-based registration of lidar-inertial data on large survey-grade prior maps, which are also publicly released, each several times the size of existing ones. We conduct a rigorous evaluation of numerous state-of-the-art algorithms on MCD, report their performance, and highlight the challenges awaiting solutions from the research community., Comment: Accepted by The IEEE/CVF Conference on Computer Vision and Pattern Recognition 2024

This research paper presents an approach to enhancing the predictive capability of architects in the design and assurance of systems, focusing on systems operating in dynamic and unpredictable environments. By adopting a systems approach, we aim to improve architects' predictive capabilities in designing dependable systems (for example, ML-based systems). An aerospace case study is used to illustrate the approach. Multiple factors (challenges) influencing aircraft detection are identified, demonstrating the effectiveness of our approach in a complex operational setting. Our approach primarily aimed to enhance the architect's predictive capability., Comment: S. Bernardi, T. Zoppi (Editors), "Fast Abstracts and Student Forum Proceedings - EDCC 2024 - 19th European Dependable Computing Conference, Leuven, Belgium, 8-11 April 2024"

Classical structural-based visual localization methods offer high accuracy but face trade-offs in terms of storage, speed, and privacy. A recent innovation, keypoint scene coordinate regression (KSCR) named D2S addresses these issues by leveraging graph attention networks to enhance keypoint relationships and predict their 3D coordinates using a simple multilayer perceptron (MLP). Camera pose is then determined via PnP+RANSAC, using established 2D-3D correspondences. While KSCR achieves competitive results, rivaling state-of-the-art image-retrieval methods like HLoc across multiple benchmarks, its performance is hindered when data samples are limited due to the deep learning model's reliance on extensive data. This paper proposes a solution to this challenge by introducing a pipeline for keypoint descriptor synthesis using Neural Radiance Field (NeRF). By generating novel poses and feeding them into a trained NeRF model to create new views, our approach enhances the KSCR's generalization capabilities in data-scarce environments. The proposed system could significantly improve localization accuracy by up to 50% and cost only a fraction of time for data synthesis. Furthermore, its modular design allows for the integration of multiple NeRFs, offering a versatile and efficient solution for visual localization. The implementation is publicly available at: https://github.com/ais-lab/DescriptorSynthesis4Feat2Map.

Drawing is an art that enables people to express their imagination and emotions. However, individuals usually face challenges in drawing, especially when translating conceptual ideas into visually coherent representations and bridging the gap between mental visualization and practical execution. In response, we propose ARtVista - a novel system integrating AR and generative AI technologies. ARtVista not only recommends reference images aligned with users' abstract ideas and generates sketches for users to draw but also goes beyond, crafting vibrant paintings in various painting styles. ARtVista also offers users an alternative approach to create striking paintings by simulating the paint-by-number concept on reference images, empowering users to create visually stunning artwork devoid of the necessity for advanced drawing skills. We perform a pilot study and reveal positive feedback on its usability, emphasizing its effectiveness in visualizing user ideas and aiding the painting process to achieve stunning pictures without requiring advanced drawing skills. The source code will be available at https://github.com/htrvu/ARtVista., Comment: CHI 2024

Resonant Inelastic X-ray Scattering (RIXS) is an ideal X-ray spectroscopy method to push the combination of energy and time resolutions to the Fourier transform ultimate limit, because it is unaffected by the core-hole lifetime energy broadening. And in pump-probe experiments the interaction time is made very short by the same core-hole lifetime. RIXS is very photon hungry so it takes great advantage from high repetition rate pulsed X-ray sources like the European XFEL. The hRIXS instrument is designed for RIXS experiments in the soft X-ray range with energy resolution approaching the Fourier and the Heisenberg limits. It is based on a spherical grating with variable line spacing (VLS) and a position-sensitive 2D detector. Initially, two gratings are installed to adequately cover the whole photon energy range. With optimized spot size on the sample and small pixel detector the energy resolution can be better than 40 meV at any photon energy below 1000 eV. At the SCS instrument of the European XFEL the spectrometer can be easily positioned thanks to air-pads on a high-quality floor, allowing the scattering angle to be continuously adjusted over the 65-145 deg range. It can be coupled to two different sample interaction chamber, one for liquid jets and one for solids, each equipped at the state-of-the-art and compatible for optical laser pumping in collinear geometry. The measured performances, in terms of energy resolution and count rate on the detector, closely match design expectations. hRIXS is open to public users since the summer of 2022., Comment: 43 pages, 12 figures, Supplemental Material

Graph Neural Networks (GNNs), known as spectral graph filters, find a wide range of applications in web networks. To bypass eigendecomposition, polynomial graph filters are proposed to approximate graph filters by leveraging various polynomial bases for filter training. However, no existing studies have explored the diverse polynomial graph filters from a unified perspective for optimization. In this paper, we first unify polynomial graph filters, as well as the optimal filters of identical degrees into the Krylov subspace of the same order, thus providing equivalent expressive power theoretically. Next, we investigate the asymptotic convergence property of polynomials from the unified Krylov subspace perspective, revealing their limited adaptability in graphs with varying heterophily degrees. Inspired by those facts, we design a novel adaptive Krylov subspace approach to optimize polynomial bases with provable controllability over the graph spectrum so as to adapt various heterophily graphs. Subsequently, we propose AdaptKry, an optimized polynomial graph filter utilizing bases from the adaptive Krylov subspaces. Meanwhile, in light of the diverse spectral properties of complex graphs, we extend AdaptKry by leveraging multiple adaptive Krylov bases without incurring extra training costs. As a consequence, extended AdaptKry is able to capture the intricate characteristics of graphs and provide insights into their inherent complexity. We conduct extensive experiments across a series of real-world datasets. The experimental results demonstrate the superior filtering capability of AdaptKry, as well as the optimized efficacy of the adaptive Krylov basis.

Terrestrial networks form the fundamental infrastructure of modern communication systems, serving more than 4 billion users globally. However, terrestrial networks are facing a wide range of challenges, from coverage and reliability to interference and congestion. As the demands of the 6G era are expected to be much higher, it is crucial to address these challenges to ensure a robust and efficient communication infrastructure for the future. To address these problems, Non-terrestrial Network (NTN) has emerged to be a promising solution. NTNs are communication networks that leverage airborne (e.g., unmanned aerial vehicles) and spaceborne vehicles (e.g., satellites) to facilitate ultra-reliable communications and connectivity with high data rates and low latency over expansive regions. This article aims to provide a comprehensive survey on the utilization of network slicing, Artificial Intelligence/Machine Learning (AI/ML), and Open Radio Access Network (ORAN) to address diverse challenges of NTNs from the perspectives of both academia and industry. Particularly, we first provide an in-depth tutorial on NTN and the key enabling technologies including network slicing, AI/ML, and ORAN. Then, we provide a comprehensive survey on how network slicing and AI/ML have been leveraged to overcome the challenges that NTNs are facing. Moreover, we present how ORAN can be utilized for NTNs. Finally, we highlight important challenges, open issues, and future research directions of NTN in the 6G era., Comment: 35 pages

We present a fully autonomous self-recharging drone system capable of long-duration sustained operations near powerlines. The drone is equipped with a robust onboard perception and navigation system that enables it to locate powerlines and approach them for landing. A passively actuated gripping mechanism grasps the powerline cable during landing after which a control circuit regulates the magnetic field inside a split-core current transformer to provide sufficient holding force as well as battery recharging. The system is evaluated in an active outdoor three-phase powerline environment. We demonstrate multiple contiguous hours of fully autonomous uninterrupted drone operations composed of several cycles of flying, landing, recharging, and takeoff, validating the capability of extended, essentially unlimited, operational endurance., Comment: Accepted for publication at the 2024 IEEE International Conference on Robotics and Automation (ICRA). Video at https://www.youtube.com/watch?v=C-uekD6VTIQ

Code Large Language Models (CodeLLMs) have demonstrated impressive proficiency in code completion tasks. However, they often fall short of fully understanding the extensive context of a project repository, such as the intricacies of relevant files and class hierarchies, which can result in less precise completions. To overcome these limitations, we present \tool, a multifaceted framework designed to address the complex challenges associated with repository-level code completion. Central to RepoHYPER is the {\em Repo-level Semantic Graph} (RSG), a novel semantic graph structure that encapsulates the vast context of code repositories. Furthermore, RepoHyper leverages Expand and Refine retrieval method, including a graph expansion and a link prediction algorithm applied to the RSG, enabling the effective retrieval and prioritization of relevant code snippets. Our evaluations show that \tool markedly outperforms existing techniques in repository-level code completion, showcasing enhanced accuracy across various datasets when compared to several strong baselines. Our implementation of RepoHYPER can be found at https://github.com/FSoft-AI4Code/RepoHyper.