Search

Earth Observation (EO) has traditionally involved the transmission of a large volume of raw data to map the Earth surface. This results in congestion to the satellite network and delays in the availability of the results, invalidating the approach for timing-sensitive applications. Instead, the computation resources at the satellites can be used as an edge layer for compressing the data and/or doing inferences. In this paper, we investigate satellite edge computing for vessel detection with a LEO satellite constellation. First, we distribute the computation and inference load among the neighbouring satellites of the one taking the images, based on the VHRShips data set and YOLOv8. This semantic and fragmented information is then routed to a remote ground monitor through the whole constellation. The average and peak Age of Information (AoI) are reformulated to measure the freshness of the aggregated information at the receiver in this image-capture scenario. We then dimension the network (number of orbital planes and satellites per orbital plane) for a given target age and covered area that quantify the level of achievement of the task. The results show that 20 orbital planes with 20 satellites are necessary to keep the peak AoI below 60 seconds with a compression ratio > 23000, i.e., a size reduction of 99.996%, and for a approximately 100% probability of coverage., Comment: This paper was presented at the ComSoc Challenge on 'Future 6G NTN Systems' held at ICCSPA'24, where it was awarded second place

The integration of Semantic Communications (SemCom) and edge computing in space networks enables the optimal allocation of the scarce energy, computing, and communication resources for data-intensive applications. We use Earth Observation (EO) as a canonical functionality of satellites and review its main characteristics and challenges. We identify the potential of the space segment, represented by a low Earth orbit (LEO) satellite constellation, to serve as an edge layer for distributed intelligence. Based on that, propose a system architecture that supports semantic and goal-oriented applications for image reconstruction and object detection and localization. The simulation results show the intricate trade-offs among energy, time, and task-performance using a real dataset and State-of-the-Art (SoA) processing and communication parameters., Comment: Submitted for publication to IEEE Communications Magazine

We obtained new spectra of Kepler-34 and Kepler-35 with Keck-HIRES, nearly a decade after these systems were originally characterized with this spectrograph and other instruments, to search for RV trends from a potential third stellar-mass companion at long periods. For Kepler-34, we rule out coplanar stellar masses as low as $0.12 M_\odot$ at an orbital period of $\lesssim 52$ years. For Kepler-35, we rule out stellar masses of $0.13 M_\odot$ at orbital periods of $\lesssim 55$ years. Highly stable, extreme precision RV instruments, as well as improved methodologies in characterizing double-lined spectroscopic binaries that come with these new instruments, will provide an opportunity to push these mass limits lower in the future., Comment: Submitted to ApJ. Comments are welcome

The probabilities for gamma-ray and particle emission as a function of the excitation energy of a decaying nucleus are valuable observables for constraining the ingredients of the models that describe the de-excitation of nuclei near the particle emission threshold. These models are essential in nuclear astrophysics and applications. In this work, we have for the first time simultaneously measured the gamma-ray and neutron emission probabilities of 208Pb. The measurement was performed in inverse kinematics at the Experimental Storage Ring (ESR) of the GSI/FAIR facility, where a 208Pb beam interacted through the 208Pb(p,p') reaction with a hydrogen gas jet target. Instead of detecting the gamma-rays and neutrons emitted by 208Pb, we detected the heavy beam-like residues produced after gamma and neutron emission. These heavy residues were fully separated by a dipole magnet of the ESR and were detected with outstanding efficiencies. The comparison of the measured probabilities with model calculations has allowed us to test and select different descriptions of the gamma-ray strength function and the nuclear level density available in the literature., Comment: 23 pages, 14 figures

Wireless Sensor Networks (WSNs) play a pivotal role in enabling Internet of Things (IoT) devices with sensing and actuation capabilities. Operating in remote and resource-constrained environments, these IoT devices face challenges related to energy consumption, crucial for network longevity. Clustering protocols have emerged as an effective solution to alleviate energy burdens on IoT devices. This paper introduces Low-Energy Adaptive Clustering Hierarchy with Reinforcement Learning-based Controller (LEACH-RLC), a novel clustering protocol that employs a Mixed Integer Linear Programming (MILP) for strategic selection of cluster heads (CHs) and node-to-cluster assignments. Additionally, it integrates a Reinforcement Learning (RL) agent to minimize control overhead by learning optimal timings for generating new clusters. Addressing key research questions, LEACH-RLC seeks to balance control overhead reduction without compromising overall network performance. Through extensive simulations, this paper investigates the frequency and opportune moments for generating new clustering solutions. Results demonstrate the superior performance of LEACH-RLC over conventional LEACH and LEACH-C, showcasing enhanced network lifetime, reduced average energy consumption, and minimized control overhead. The proposed protocol contributes to advancing the efficiency and adaptability of WSNs, addressing critical challenges in IoT deployments., Comment: 13 pages, 13 figures, 3 tables, journal

The Industrial Internet of Things (IIoT) demands adaptable Networked Embedded Systems (NES) for optimal performance. Combined with recent advances in Artificial Intelligence (AI), tailored solutions can be developed to meet specific application requirements. This study introduces HRL-TSCH, an approach rooted in Hierarchical Reinforcement Learning (HRL), to devise Time Slotted Channel Hopping (TSCH) schedules provisioning IIoT demand. HRL-TSCH employs dual policies: one at a higher level for TSCH schedule link management, and another at a lower level for timeslot and channel assignments. The proposed RL agents address a multi-objective problem, optimizing throughput, power efficiency, and network delay based on predefined application requirements. Simulation experiments demonstrate HRL-TSCH superiority over existing state-of-art approaches, effectively achieving an optimal balance between throughput, power consumption, and delay, thereby enhancing IIoT network performance., Comment: 17 pages, 13 figures, 5 tables, journal

Depending on their mechanism of self-propulsion, active particles can exhibit a time-dependent, often periodic, propulsion velocity. The precise propulsion velocity profile determines their mean square displacement and their effective diffusion coefficient at long times. Here we demonstrate that any periodic propulsion profile results in a larger diffusion coefficient than the corresponding case with constant propulsion velocity. We investigate in detail the case of periodic exponentially decaying velocity pulses, expected in propulsion mechanisms based on sudden absorption of finite amounts of energy. We show both analytically and with numerical simulations that in these cases the effective diffusion coefficient can be arbitrarily enhanced with respect to the case with constant velocity equal to the average speed. Our results may help interpret in a new light observations on the diffusion enhancement of active particles.

In the realm of machine learning, traditional model development and automated approaches like AutoML typically rely on layers of abstraction, such as tree-based or Cartesian genetic programming. Our study introduces "Guided Evolution" (GE), a novel framework that diverges from these methods by utilizing Large Language Models (LLMs) to directly modify code. GE leverages LLMs for a more intelligent, supervised evolutionary process, guiding mutations and crossovers. Our unique "Evolution of Thought" (EoT) technique further enhances GE by enabling LLMs to reflect on and learn from the outcomes of previous mutations. This results in a self-sustaining feedback loop that augments decision-making in model evolution. GE maintains genetic diversity, crucial for evolutionary algorithms, by leveraging LLMs' capability to generate diverse responses from expertly crafted prompts and modulate model temperature. This not only accelerates the evolution process but also injects expert like creativity and insight into the process. Our application of GE in evolving the ExquisiteNetV2 model demonstrates its efficacy: the LLM-driven GE autonomously produced variants with improved accuracy, increasing from 92.52% to 93.34%, without compromising model compactness. This underscores the potential of LLMs to accelerate the traditional model design pipeline, enabling models to autonomously evolve and enhance their own designs.

In this paper we introduce and analyse, from a game theoretical perspective, several multi-agent or multi-item continuous review inventory models in which the buyers are exempted from ordering costs if the price of their orders is greater than or equal to a certain amount. For all models we obtain the optimal ordering policy. We first analyse a simple model with one firm and one item. Then, we study a model with one firm and several items, for which we design a procedure based on cooperative game theory to evaluate the impact of each item on the total cost. Then, we deal with a model with several firms and one item for each firm, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way. Finally, we discuss a model with several firms and several items, for which we characterise a rule to allocate the total cost among the firms in a coalitionally stable way and to evaluate the impact of each item on the cost that would be payable to each firm when using the allocation rule. All the concepts and results of this article are illustrated using data from a case study.

We introduce a new model involving TU-games and exogenous structures. Specifically, we consider that each player in a population can choose an element in a strategy set and that, for every possible strategy profile, a TU-game is associated with the population. This is what we call a TU-game with strategies. We propose and characterize the maxmin procedure to map every game with strategies to a TU-game. We also study whether or not the relevant properties of TU-games are transmitted by applying the maxmin procedure. Finally, we examine two relevant classes of TU-games with strategies: airport and simple games with strategies.

Surrogate modelling techniques have opened up new possibilities to overcome the limitations of computationally intensive numerical models in various areas of engineering and science. However, while fundamental in many engineering applications and decision-making, the incorporation of uncertainty quantification into meta-models remains a challenging open area of research. To address this issue, this paper presents a novel stochastic simulation approach combining sparse polynomial chaos expansion (PCE) and Stochastic Kriging (SK). Specifically, the proposed approach adopts adaptive sparse PCE as the trend model in SK, achieving both global and local prediction capabilities and maximizing the role of the stochastic term to conduct uncertainty quantification. To maximize the generalization and computational efficiency of the meta-model, the Least Angle Regression (LAR) algorithm is adopted to automatically select the optimal polynomial basis in the PCE. The computational effectiveness and accuracy of the proposed approach are appraised through a comprehensive set of case studies and different quality metrics. The presented numerical results and discussion demonstrate the superior performance of the proposed approach compared to the classical ordinary SK model, offering high flexibility for the characterization of both extrinsic and intrinsic uncertainty for a wide variety of problems.

An important problem in project management is determining ways to distribute amongst activities the costs that are incurred when a project is delayed because some activities end later than expected. In this study, we address this problem in stochastic projects, where the durations of activities are unknown but their corresponding probability distributions are known. We propose and characterise an allocation rule based on the Shapley value, illustrate its behaviour by using examples, and analyse features of its calculation for large problems.

In this paper we introduce the $\Gamma$ value, a new value for cooperative games with transferable utility. We also provide an axiomatic characterization of the $\Gamma$ value based on a property concerning the so-called necessary players. A necessary players of a game is one without which the characteristic function is zero. We illustrate the performance of the $\Gamma$ value in a particular cost allocation problem that arises when the owners of the apartments in a building plan to install an elevator and share its installation cost; in the resulting example we compare the proposals of the $\Gamma$ value, the equal division value and the Shapley value in two different scenarios. In addition, we propose an extension of the $\Gamma$ value for cooperative games with transferable utility and with a coalition structure. Finally, we provide axiomatic characterizations of the coalitional $\Gamma$ value and of the Owen and Banzhaf-Owen values using alternative properties concerning necessary players.

In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with level structures. In the case of the equal surplus division value we propose three possible extensions, one of which has already been described in the literature. We provide axiomatic characterizations of the values considered, apply them to a particular cost sharing problem and compare them in the framework of such an application.

In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with a priori unions. In the case of the equal surplus division value we propose three possible extensions. We provide axiomatic characterizations of the new values. Furthermore, we apply the proposed modifications to a particular cost sharing problem and compare the numerical results with those obtained with the original values.

Jewelry recognition is a complex task due to the different styles and designs of accessories. Precise descriptions of the various accessories is something that today can only be achieved by experts in the field of jewelry. In this work, we propose an approach for jewelry recognition using computer vision techniques and image captioning, trying to simulate this expert human behavior of analyzing accessories. The proposed methodology consist on using different image captioning models to detect the jewels from an image and generate a natural language description of the accessory. Then, this description is also utilized to classify the accessories at different levels of detail. The generated caption includes details such as the type of jewel, color, material, and design. To demonstrate the effectiveness of the proposed method in accurately recognizing different types of jewels, a dataset consisting of images of accessories belonging to jewelry stores in C\'ordoba (Spain) has been created. After testing the different image captioning architectures designed, the final model achieves a captioning accuracy of 95\%. The proposed methodology has the potential to be used in various applications such as jewelry e-commerce, inventory management or automatic jewels recognition to analyze people's tastes and social status., Comment: 6 pages, 5 figures, MetroXRAINE 2023 Conference

Neutron-induced reaction cross sections of short-lived nuclei are imperative to understand the origin of heavy elements in stellar nucleosynthesis and for societal applications, but their measurement is extremely complicated due to the radioactivity of the targets involved. One way of overcoming this issue is to combine surrogate reactions with the unique possibilities offered by heavy-ion storage rings. In this work, we describe the first surrogate-reaction experiment in inverse kinematics, which we successfully conducted at the Experimental Storage Ring (ESR) of the GSI/FAIR facility, using the 208Pb(p,p') reaction as a surrogate for neutron capture on 207Pb. Thanks to the outstanding detection efficiencies possible at the ESR, we were able to measure for the first time the neutron-emission probability as a function of the excitation energy of 208Pb. We have used this probability to select different descriptions of the gamma-ray strength function and nuclear level density, and provide reliable results for the neutron-induced radiative capture cross section of 207Pb at energies for which no experimental data exist., Comment: 10 pages and 5 figures

The nuclear two-photon or double-gamma ($2\gamma$) decay is a second-order electromagnetic process whereby a nucleus in an excited state emits two gamma rays simultaneously. To be able to directly measure the $2\gamma$ decay rate in the low-energy regime below the electron-positron pair-creation threshold, we combined the isochronous mode of a storage ring with Schottky resonant cavities. The newly developed technique can be applied to isomers with excitation energies down to $\sim100$\,keV and half-lives as short as $\sim10$\,ms. The half-life for the $2\gamma$ decay of the first-excited $0^+$ state in bare $^{72}\mathrm{Ge}$ ions was determined to be $23.9\left(6\right)$\,ms, which strongly deviates from expectations., Comment: Submitted to Physical Review Letters, 8 pages, 3 figures, 2 tables, 7 equations