Search

Our study aims to elucidate both short-term and long-term variations in the light curve of the eclipsing system OGLE-LMC-ECL-14413, with a particular focus on the unusual reversals in eclipse depth. We aim to clarify the role of the accretion disk in these fluctuations, especially in long-cycle changes spanning hundreds of days. Additionally, we seek to determine the evolutionary stage of the system and gain insights into the internal structure of its stellar components. We analyzed photometric time series from the Optical Gravitational Lensing Experiment (OGLE) project in the I and V bands, and from the MAssive Compact Halo Objects project in the BM and RM bands, covering a period of 30.85 years. Using light curve data from 27 epochs, we constructed models of the accretion disk. An optimized simplex algorithm was employed to solve the inverse problem, deriving the best-fit parameters for the stars, orbit, and disk. We also utilized the Modules for Experiments in Stellar Astrophysics software to assess the evolutionary stage of the binary system, investigating the progenitors and potential future developments. We found an orbital period of 38.15917(54) d and a long-term cycle of approximately 780 d. Temperature, mass, radius, and surface gravity values were determined for both stars. The photometric orbital cycle and the long-term cycle are consistent with a disk containing variable physical properties, including two shock regions. The disk encircles the more massive star and the system brightness variations align with the long-term cycle at orbital phase 0.25. Our mass transfer rate calculations correspond to these brightness changes. \texttt{MESA} simulations indicate weak magnetic fields in the donor star's subsurface, which are insufficient to influence mass transfer rates significantly., Comment: 16 pages, 18 figures plus 3 figures in Zenodo. Accepted for publication in Astronomy and Astrophysics main journal

We present a general framework for incorporating non-reciprocal interactions into the Ising model with Glauber dynamics, without requiring multiple species. We then focus on a model with vision-cone type interactions. We solve it in a fully connected network (mean-field) and perform extensive numerical simulations of the model in the square lattice. We find that the breakdown of the spin-flip symmetry introduced by non-reciprocity induces a discontinuous phase transition on top of the usual continuous one, that eventually occurs at higher critical temperatures. Combining a static and dynamic scaling analysis, we measure the critical exponents associated to the continuous symmetry breaking transition, and find them to be identical to the ones of the Ising model in two dimensions (2D), with the exception of the exponent $\beta$ associated to the order parameter. The latter appears to increase as the non-reciprocity of the coupling increases, suggesting that, within our numerical precision, the model does not belong to the 2D Ising model universality class. The coarsening process is anisotropic, but still follows the usual dynamic scaling with an exponent compatible with the standard value with non-conserved order parameter dynamics., Comment: 23 pages, 10 figures

This study presents an innovative dynamic weighting knowledge distillation (KD) framework tailored for efficient Earth observation (EO) image classification (IC) in resource-constrained settings. Utilizing EfficientViT and MobileViT as teacher models, this framework enables lightweight student models, particularly ResNet8 and ResNet16, to surpass 90% in accuracy, precision, and recall, adhering to the stringent confidence thresholds necessary for reliable classification tasks. Unlike conventional KD methods that rely on static weight distribution, our adaptive weighting mechanism responds to each teacher model's confidence, allowing student models to prioritize more credible sources of knowledge dynamically. Remarkably, ResNet8 delivers substantial efficiency gains, achieving a 97.5% reduction in parameters, a 96.7% decrease in FLOPs, an 86.2% cut in power consumption, and a 63.5% increase in inference speed over MobileViT. This significant optimization of complexity and resource demands establishes ResNet8 as an optimal candidate for EO tasks, combining robust performance with feasibility in deployment. The confidence-based, adaptable KD approach underscores the potential of dynamic distillation strategies to yield high-performing, resource-efficient models tailored for satellite-based EO applications. The reproducible code is accessible on our GitHub repository., Comment: Under revisions

Earth observation (EO) systems are essential for mapping, catastrophe monitoring, and resource management, but they have trouble processing and sending large amounts of EO data efficiently, especially for specialized applications like agriculture and real-time disaster response. This paper presents a novel framework for semantic communication in EO satellite networks, aimed at enhancing data transmission efficiency and system performance through cognitive processing techniques. The proposed system leverages Discrete Task-Oriented Joint Source-Channel Coding (DT-JSCC) and Semantic Data Augmentation (SA) integrate cognitive semantic processing with inter-satellite links, enabling efficient analysis and transmission of multispectral imagery for improved object detection, pattern recognition, and real-time decision-making. Cognitive Semantic Augmentation (CSA) is introduced to enhance a system's capability to process and transmit semantic information, improving feature prioritization, consistency, and adaptation to changing communication and application needs. The end-to-end architecture is designed for next-generation satellite networks, such as those supporting 6G, demonstrating significant improvements in fewer communication rounds and better accuracy over federated learning., Comment: 8 Pages, 5 figures, Magazine. arXiv admin note: substantial text overlap with arXiv:2409.15246

Open-ended text generation has become a prominent task in natural language processing due to the rise of powerful (large) language models. However, evaluating the quality of these models and the employed decoding strategies remains challenging because of trade-offs among widely used metrics such as coherence, diversity, and perplexity. Decoding methods often excel in some metrics while underperforming in others, complicating the establishment of a clear ranking. In this paper, we present novel ranking strategies within this multicriteria framework. Specifically, we employ benchmarking approaches based on partial orderings and present a new summary metric designed to balance existing automatic indicators, providing a more holistic evaluation of text generation quality. Furthermore, we discuss the alignment of these approaches with human judgments. Our experiments demonstrate that the proposed methods offer a robust way to compare decoding strategies, exhibit similarities with human preferences, and serve as valuable tools in guiding model selection for open-ended text generation tasks. Finally, we suggest future directions for improving evaluation methodologies in text generation. Our codebase, datasets, and models are publicly available.

In the field of pattern recognition, achieving high accuracy is essential. While training a model to recognize different complex images, it is vital to fine-tune the model to achieve the highest accuracy possible. One strategy for fine-tuning a model involves changing its activation function. Most pre-trained models use ReLU as their default activation function, but switching to a different activation function like Hard-Swish could be beneficial. This study evaluates the performance of models using ReLU, Swish and Hard-Swish activation functions across diverse image datasets. Our results show a 2.06% increase in accuracy for models on the CIFAR-10 dataset and a 0.30% increase in accuracy for models on the ATLAS dataset. Modifying the activation functions in architecture of pre-trained models lead to improved overall accuracy., Comment: 2 pages

Decoding strategies for large language models (LLMs) are a critical but often underexplored aspect of text generation tasks. Since LLMs produce probability distributions over the entire vocabulary, various decoding methods have been developed to transform these probabilities into coherent and fluent text, each with its own set of hyperparameters. In this study, we present a large-scale, comprehensive analysis of how hyperparameter selection affects text quality in open-ended text generation across multiple LLMs, datasets, and evaluation metrics. Through an extensive sensitivity analysis, we provide practical guidelines for hyperparameter tuning and demonstrate the substantial influence of these choices on text quality. Using three established datasets, spanning factual domains (e.g., news) and creative domains (e.g., fiction), we show that hyperparameter tuning significantly impacts generation quality, though its effects vary across models and tasks. We offer in-depth insights into these effects, supported by both human evaluations and a synthesis of widely-used automatic evaluation metrics.

Earth Observation (EO) systems are crucial for cartography, disaster surveillance, and resource administration. Nonetheless, they encounter considerable obstacles in the processing and transmission of extensive data, especially in specialized domains such as precision agriculture and real-time disaster response. Earth observation satellites, outfitted with remote sensing technology, gather data from onboard sensors and IoT-enabled terrestrial objects, delivering important information remotely. Domain-adapted Large Language Models (LLMs) provide a solution by enabling the integration of raw and processed EO data. Through domain adaptation, LLMs improve the assimilation and analysis of many data sources, tackling the intricacies of specialized datasets in agriculture and disaster response. This data synthesis, directed by LLMs, enhances the precision and pertinence of conveyed information. This study provides a thorough examination of using semantic inference and deep learning for sophisticated EO systems. It presents an innovative architecture for semantic communication in EO satellite networks, designed to improve data transmission efficiency using semantic processing methodologies. Recent advancements in onboard processing technologies enable dependable, adaptable, and energy-efficient data management in orbit. These improvements guarantee reliable performance in adverse space circumstances using radiation-hardened and reconfigurable technology. Collectively, these advancements enable next-generation satellite missions with improved processing capabilities, crucial for operational flexibility and real-time decision-making in 6G satellite communication., Comment: 17 pages, 7 figures, Journal

This study focuses on identifying the most effective pre-trained model for land use classification in onboard satellite processing, emphasizing achieving high accuracy, computational efficiency, and robustness against noisy data conditions commonly encountered during satellite-based inference. Through extensive experimentation, we compare the performance of traditional CNN-based, ResNet-based, and various pre-trained vision Transformer models. Our findings demonstrate that pre-trained Vision Transformer (ViT) models, particularly MobileViTV2 and EfficientViT-M2, outperform models trained from scratch in terms of accuracy and efficiency. These models achieve high performance with reduced computational requirements and exhibit greater resilience during inference under noisy conditions. While MobileViTV2 has excelled on clean validation data, EfficientViT-M2 has proved more robust when handling noise, making it the most suitable model for onboard satellite EO tasks. Our experimental results demonstrate that EfficientViT-M2 is the optimal choice for reliable and efficient RS-IC in satellite operations, achieving 98.76 % of accuracy, precision, and recall. Precisely, EfficientViT-M2 delivers the highest performance across all metrics, excels in training efficiency (1,000s) and inference time (10s), and demonstrates greater robustness (overall robustness score of 0.79). Consequently, EfficientViT-M2 consumes 63.93 % less power than MobileViTV2 (79.23 W) and 73.26 % less power than SwinTransformer (108.90 W). This highlights its significant advantage in energy efficiency.

Despite ongoing research, the rational design of nontrivial topological semimetal surface states for the selective photocatalytic CO$_2$ conversion into valuable products remains full of challenges. Herein, we present the synthesis of 1T-OsCoTe$_2$ for the photoreduction upgrading of CO$_2$ to tricarbon alkane C$_3$H$_8$,by the integration of experimental work and theory calculation. Experimental studies suggested a high electron based selectivity of 71.2% for C$_3$H$_8$ and an internal quantum efficiency of 54.6% at 380 nm. In-situ X-ray photoelectron spectroscopy and X-ray absorption fine structure spectroscopy demonstrated that Co and Os atoms coordinated with Te atoms enable an efficient Os-Te-Co electron transfer to activate the generation of *CH$_3$,*CHOCO and *CH$_2$OCOCO. Density functional theory calculations further confirmed Os-Te-Co electron bridging on the improved CO$_2$ conversion kinetics. To our knowledge, this is the first report suggesting the role of Os atoms in accelerating the photocatalytic CO$_2$ conversion activity of the topological semimetal 1T-OsCoTe$_2$., Comment: 31 pages, 6 Figures

Decoding from the output distributions of large language models to produce high-quality text is a complex challenge in language modeling. Various approaches, such as beam search, sampling with temperature, $k-$sampling, nucleus $p-$sampling, typical decoding, contrastive decoding, and contrastive search, have been proposed to address this problem, aiming to improve coherence, diversity, as well as resemblance to human-generated text. In this study, we introduce adaptive contrastive search, a novel decoding strategy extending contrastive search by incorporating an adaptive degeneration penalty, guided by the estimated uncertainty of the model at each generation step. This strategy is designed to enhance both the creativity and diversity of the language modeling process while at the same time producing coherent and high-quality generated text output. Our findings indicate performance enhancement in both aspects, across different model architectures and datasets, underscoring the effectiveness of our method in text generation tasks. Our code base, datasets, and models are publicly available., Comment: Accepted to EMNLP 2024 Findings

We investigate a continuous-time investment-consumption problem with model uncertainty in a general diffusion-based market with random model coefficients. We assume that a power utility investor is ambiguity-averse, with the preference to robustness captured by the homothetic multiplier robust specification, and the investor's investment and consumption strategies are constrained to closed convex sets. To solve this constrained robust control problem, we employ the stochastic Hamilton-Jacobi-Bellman-Isaacs equations, backward stochastic differential equations, and bounded mean oscillation martingale theory. Furthermore, we show the investor incurs (non-negative) utility loss, i.e. the loss in welfare, if model uncertainty is ignored. When the model coefficients are deterministic, we establish formally the relationship between the investor's robustness preference and the robust optimal investment-consumption strategy and the value function, and the impact of investment and consumption constraints on the investor's robust optimal investment-consumption strategy and value function. Extensive numerical experiments highlight the significant impact of ambiguity aversion, consumption and investment constraints, on the investor's robust optimal investment-consumption strategy, utility loss, and value function. Key findings include: 1) short-selling restriction always reduces the investor's utility loss when model uncertainty is ignored; 2) the effect of consumption constraints on utility loss is more delicate and relies on the investor's risk aversion level., Comment: 30 pages, 6 figures (including sub-figures), 4 tables

Sample Return Capsules (SRCs) entering Earth's atmosphere at hypervelocity from interplanetary space are a valuable resource for studying meteor phenomena. The 24 September 2023 arrival of the OSIRIS-REx (Origins, Spectral Interpretation, Resource Identification, and Security-Regolith Explorer) SRC provided an unprecedented chance for geophysical observations of a well-characterized source with known parameters, including timing and trajectory. A collaborative effort involving researchers from 16 institutions executed a carefully planned geophysical observational campaign at strategically chosen locations, deploying over 400 ground-based sensors encompassing infrasound, seismic, distributed acoustic sensing (DAS), and GPS technologies. Additionally, balloons equipped with infrasound sensors were launched to capture signals at higher altitudes. This campaign (the largest of its kind so far) yielded a wealth of invaluable data anticipated to fuel scientific inquiry for years to come. The success of the observational campaign is evidenced by the near-universal detection of signals across instruments, both proximal and distal. This paper presents a comprehensive overview of the collective scientific effort, field deployment, and preliminary findings. The early findings have the potential to inform future space missions and terrestrial campaigns, contributing to our understanding of meteoroid interactions with planetary atmospheres. Furthermore, the dataset collected during this campaign will improve entry and propagation models as well as augment the study of atmospheric dynamics and shock phenomena generated by meteoroids and similar sources., Comment: 87 pages, 14 figures

This work presents a polyelectrolyte (PE) model based on a freely jointed chain (FJC) in which the beads are ionizable and the bonds are rigid. Electrostatic interactions considered are of the short range type up to next-nearest neighbours using a Debye-H\"uckel (DH) potential. Exact expressions for the conformational and protonation properties are obtained as a function of the pH using the transfer matrix method and the integration of the angular variables. For the finite cases with low N values, relevant differences arise on both the protonation curve and the end to end distance due to the end effects. However, when increasing N a rather rapid convergence is observed to the infinite chain limiting case., Comment: 9 pages, 3 figures (1 figure with one image, 2 figures with 2 images)

Advances in NERFs have allowed for 3D scene reconstructions and novel view synthesis. Yet, efficiently editing these representations while retaining photorealism is an emerging challenge. Recent methods face three primary limitations: they're slow for interactive use, lack precision at object boundaries, and struggle to ensure multi-view consistency. We introduce IReNe to address these limitations, enabling swift, near real-time color editing in NeRF. Leveraging a pre-trained NeRF model and a single training image with user-applied color edits, IReNe swiftly adjusts network parameters in seconds. This adjustment allows the model to generate new scene views, accurately representing the color changes from the training image while also controlling object boundaries and view-specific effects. Object boundary control is achieved by integrating a trainable segmentation module into the model. The process gains efficiency by retraining only the weights of the last network layer. We observed that neurons in this layer can be classified into those responsible for view-dependent appearance and those contributing to diffuse appearance. We introduce an automated classification approach to identify these neuron types and exclusively fine-tune the weights of the diffuse neurons. This further accelerates training and ensures consistent color edits across different views. A thorough validation on a new dataset, with edited object colors, shows significant quantitative and qualitative advancements over competitors, accelerating speeds by 5x to 500x.

The Artificial Intelligence Satellite Telecommunications Testbed (AISTT), part of the ESA project SPAICE, is focused on the transformation of the satellite payload by using artificial intelligence (AI) and machine learning (ML) methodologies over available commercial off-the-shelf (COTS) AI-capable chips for onboard processing. The objectives include validating artificial intelligence-driven SATCOM scenarios such as interference detection, spectrum sharing, radio resource management, decoding, and beamforming. The study highlights hardware selection and payload architecture. Preliminary results show that ML models significantly improve signal quality, spectral efficiency, and throughput compared to conventional payload. Moreover, the testbed aims to evaluate the performance and the use of AI-capable COTS chips in onboard SATCOM contexts., Comment: 6 pages, 4 figures

Let $\{C_i\}_{i\in \Gamma_1},$ and $\{D_j\}_{j\in \Gamma_2},$ be two families of Cartan factors such that all of them have dimension at least $2$, and consider the atomic JBW$^*$-triples $A=\bigoplus\limits_{i\in \Gamma_1}^{\ell_{\infty}} C_i$ and $B=\bigoplus\limits_{j\in \Gamma_2}^{\ell_{\infty}} D_j$. Let $\Delta :A \to B$ be a {\rm(}non-necessarily linear nor continuous{\rm)} bijection preserving the truncation of triple products in both directions, that is, $$\begin{aligned} \boxed{a \mbox{ is a truncation of } \{b,c,b\}} \Leftrightarrow \boxed{\Delta(a) \mbox{ is a truncation of } \{\Delta(b),\Delta(c),\Delta(b)\}} \end{aligned}$$ Assume additionally that the restriction of $\Delta$ to each rank-one Cartan factor in $A$, if any, is a continuous mapping. Then we show that $\Delta$ is an isometric real linear triple isomorphism. We also study some general properties of bijections preserving the truncation of triple products in both directions between general JB$^*$-triples.

This report presents a brief review of matrix algebra and its implementation in Julia for power and energy applications. First, we present basic examples of data visualization, followed by conventional operations with matrices and vectors. Then, we study quadratic forms and norms, two main concepts required in the convergence study of the power flow in power and energy applications. After that, we give good practices to create a neat code in Julia. There is an extensive set of examples available on the Internet related to these basic aspects, so we avoid repeating what is well documented. Hence, we show only basic examples to create our first scripts.

Let $X$ be an arbitrary poset and $K$ an arbitrary field. We describe linear unital invertibility preservers of the finitary incidence algebra $FI(X,K)$ in terms of certain maps of the power set algebra $\mathcal{P}(X)$ and linear maps $FI(X,K)\to J(FI(X,K))$.

Developing a green and cost-effective catalytic system for the selective oxidation of biomass-derived alcohols is vital for the sustainable synthesis of fine chemicals. Herein, highly dispersed subnanometric amorphous CoOx clusters in anatase TiO2 nanosheets (Co-TiO2) fabricated by green solvent CO2 assisted approach could directly activate peroxymonosulfate (PMS) for the highly selective oxidation of various biomass-derived alcohols. Advanced characterizations (e.g., EXAFS, EPR, AC HAADF-STEM) reveal that a strong interaction of CoOx clusters and the anatase TiO2 support exist in Co-TiO2 and Co atom in Co-TiO2 is mainly consisted of Co2+ and Co3+. The Co-TiO2 catalyst offers superior catalytic performance in the conversion of six types of alcohols (e.g., benzyl alcohol (BAL), 5-hydroxymethylfurfural (HMF)) with high selectivity to produce corresponding aldehydes. Highly dispersed CoOx clusters and the interaction between CoOx clusters and TiO2 support contribute to the superior performance. Mechanism studies show that SO4 radicals play the dominant role in the selective oxidation of model reactant BAL and 1O2 participates in the non-radical pathway. DFT calculations are well matched with experiment and decipher that the strong interaction between CoOx clusters and TiO2 support promotes the formation of SO4 and SO5., Comment: 29 pages, 9 figures

Rational design and green synthesis of low-cost and robust catalysts efficient for the selective oxidation of various alcohols are full of challenges. Herein, we report a fast and solvent-free arc-melting (AM) method to controllably synthesize semimetal CoSi alloy (abbreviated as AM-CoSi) that is efficient for the base- and solvent-free oxidation of six types of aromatic alcohols. X-ray absorption fine structure (XAFS), electron paramagnetic resonance (EPR), and aberration corrected high angle annular dark field scanning transmission electron microscope (AC HAADF-STEM) confirmed the successful synthesis of AM-CoSi with rich Si vacancy (Siv). The as-prepared CoSi alloy catalysts exhibit an order of magnitude activity enhancement in the oxidation of model reactant benzyl alcohol (BAL) to benzyl benzoate (BBE) compared with its mono counterparts, whereas 70 % yield of BBE which is the highest yield to date. Experimental results and DFT calculations well verify that the CoSi alloy structure improves the BAL conversion and Si vacancy mainly contributes to the generation of BBE. After that, CoSi alloy maintains high stability and a potential pathway is rationally proposed. Besides, CoSi alloy also efficiently works for the selective oxidation of various alcohols with different groups. This work demonstrates for the first time that semimetal CoSi alloy is robust for the green oxidation of various alcohols and provides a vast opportunity for reasonable design and application of other semimetal alloy catalysts., Comment: 22 pages, 6 figures

We introduce TexTile, a novel differentiable metric to quantify the degree upon which a texture image can be concatenated with itself without introducing repeating artifacts (i.e., the tileability). Existing methods for tileable texture synthesis focus on general texture quality, but lack explicit analysis of the intrinsic repeatability properties of a texture. In contrast, our TexTile metric effectively evaluates the tileable properties of a texture, opening the door to more informed synthesis and analysis of tileable textures. Under the hood, TexTile is formulated as a binary classifier carefully built from a large dataset of textures of different styles, semantics, regularities, and human annotations.Key to our method is a set of architectural modifications to baseline pre-train image classifiers to overcome their shortcomings at measuring tileability, along with a custom data augmentation and training regime aimed at increasing robustness and accuracy. We demonstrate that TexTile can be plugged into different state-of-the-art texture synthesis methods, including diffusion-based strategies, and generate tileable textures while keeping or even improving the overall texture quality. Furthermore, we show that TexTile can objectively evaluate any tileable texture synthesis method, whereas the current mix of existing metrics produces uncorrelated scores which heavily hinders progress in the field., Comment: CVPR 2024. Project page: https://mslab.es/projects/TexTile/

Manual analysis and diagnosis of COVID-19 through the examination of Computed Tomography (CT) images of the lungs can be time-consuming and result in errors, especially given high volume of patients and numerous images per patient. So, we address the need for automation of this task by developing a new deep learning model-based pipeline. Our motivation was sparked by the CVPR Workshop on "Domain Adaptation, Explainability and Fairness in AI for Medical Image Analysis", more specifically, the "COVID-19 Diagnosis Competition (DEF-AI-MIA COV19D)" under the same Workshop. This challenge provides an opportunity to assess our proposed pipeline for COVID-19 detection from CT scan images. The same pipeline incorporates the original EfficientNet, but with an added Attention Mechanism: EfficientNet-AM. Also, unlike the traditional/past pipelines, which relied on a pre-processing step, our pipeline takes the raw selected input images without any such step, except for an image-selection step to simply reduce the number of CT images required for training and/or testing. Moreover, our pipeline is computationally efficient, as, for example, it does not incorporate a decoder for segmenting the lungs. It also does not combine different backbones nor combine RNN with a backbone, as other pipelines in the past did. Nevertheless, our pipeline still outperforms all approaches presented by other teams in last year's instance of the same challenge, at least based on the validation subset of the competition dataset.

This paper introduces a joint optimization framework for user-centric beam selection and linear precoding (LP) design in a coordinated multiple-satellite (CoMSat) system, employing a Digital-Fourier-Transform-based (DFT) beamforming (BF) technique. Regarding serving users at their target SINRs and minimizing the total transmit power, the scheme aims to efficiently determine satellites for users to associate with and activate the best cluster of beams together with optimizing LP for every satellite-to-user transmission. These technical objectives are first framed as a complex mixed-integer programming (MIP) challenge. To tackle this, we reformulate it into a joint cluster association and LP design problem. Then, by theoretically analyzing the duality relationship between downlink and uplink transmissions, we develop an efficient iterative method to identify the optimal solution. Additionally, a simpler duality approach for rapid beam selection and LP design is presented for comparison purposes. Simulation results underscore the effectiveness of our proposed schemes across various settings.

This research delves into optimizing mechanism design, with an emphasis on the energy efficiency and the expansive design possibilities of reciprocating mechanisms. It investigates how to efficiently integrate Computer-Aided Design (CAD) simulations with Bayesian Optimization (BO) and a constrained design space, aiming to enhance the design optimization process beyond the confines of traditional kinematic and dynamic analysis. The study sets out to create a novel optimization framework that merges CAD simulations with a BO strategy. Initially, the feasibility of a mechanism design is assessed through CAD-motion simulations, which gauge its practicality. Upon deeming a design feasible, an evaluation via CAD-motion simulations is conducted to ascertain the objective value. This research proposes utilizing non-parametric Gaussian processes for crafting a surrogate model of the objective function, considering the design space's static and dynamic constraints. The findings reveal that the introduced CAD-based Bayesian Optimization framework adeptly identifies optimal design parameters that minimize root mean square (RMS) torque while complying with predetermined constraints. This method markedly diminishes the complexity seen in analytical approaches, rendering it adaptable to intricate mechanisms and practicable for machine builders. The framework evidences the utility of integrating constraints in the optimization process, showing promise for attaining globally optimal designs efficiently. A case study on an emergency ventilator, with three design parameters, demonstrates a 71% RMS torque reduction after 255 CAD-based evaluations, underscoring the approach's effectiveness and its potential for refining mechanism design optimization., Comment: 13 pages, 13 figures

Resource-constrained robotic platforms are particularly useful for tasks that require low-cost hardware alternatives due to the risk of losing the robot, like in search-and-rescue applications, or the need for a large number of devices, like in swarm robotics. For this reason, it is crucial to find mechanisms for adapting reinforcement learning techniques to the constraints imposed by lower computational power and smaller memory capacities of these ultra low-cost robotic platforms. We try to address this need by proposing a method for making imitation learning deployable onto resource-constrained robotic platforms. Here we cast the imitation learning problem as a conditional sequence modeling task and we train a decision transformer using expert demonstrations augmented with a custom reward. Then, we compress the resulting generative model using software optimization schemes, including quantization and pruning. We test our method in simulation using Isaac Gym, a realistic physics simulation environment designed for reinforcement learning. We empirically demonstrate that our method achieves natural looking gaits for Bittle, a resource-constrained quadruped robot. We also run multiple simulations to show the effects of pruning and quantization on the performance of the model. Our results show that quantization (down to 4 bits) and pruning reduce model size by around 30\% while maintaining a competitive reward, making the model deployable in a resource-constrained system., Comment: 10 pages, 4 figures

We prove that every biorthogonality preserving linear surjection between two dual or compact C$^*$-algebras or between two von Neumann algebras is automatically continuous., Comment: arXiv admin note: text overlap with arXiv:2402.00517

We introduce generalised triple homomorphism between Jordan Banach triple systems as a concept which extends the notion of generalised homomorphism between Banach algebras given by Jarosz and Johnson in 1985 and 1987, respectively. We prove that every generalised triple homomorphism between JB$^*$-triples is automatically continuous. When particularised to C$^*$-algebras, we rediscover one of the main theorems established by Johnson. We shall also consider generalised triple derivations from a Jordan Banach triple $E$ into a Jordan Banach triple $E$-module, proving that every generalised triple derivation from a JB$^*$-triple $E$ into $E^*$ is automatically continuous.

Let $T:E\rightarrow F$ be a non-necessarily continuous triple homomorphism from a (complex) JB$^*$-triple (respectively, a (real) J$^*$B-triple) to a normed Jordan triple. The following statements hold: (1) $T$ has closed range whenever $T$ is continuous (2) $T$ has closed range whenever $T$ is continuous This result generalises classical theorems of I. Kaplansky and S.B. Cleveland in the setting of C$^*$-algebras and of A. Bensebah and J.P\'erez, L. Rico and A. Rodr'\iguez Palacios in the setting of JB$^*$-algebras.

We prove that every biorthogonality preserving linear surjection from a weakly compact JB$^*$triple containing no infinite dimensional rank-one summands onto another JB$^*$-triple is automatically continuous. We also show that every biorthogonality preserving linear surjection between atomic JBW$^*$triples containing no infinite dimensional rank-one summands is automatically continuous. Consequently, two atomic JBW$^*$-triples containing no rank-one summands are isomorphic if, and only if, there exists a (non necessarily continuous) biorthogonality preserving linear surjection between them.

We introduce $n$-orthogonality (and completely orthogonality) preserving operators between C$^*$-algebras. Our main theorem states that every completely orthogonality preserving bounded linear mapping between C$^*$-algebras is a weighted TRO homomorphism. We also give several characterisations of TRO homomorphisms among triple homomorphisms.

Quantum key distribution (QKD) is a cryptographic technique that leverages principles of quantum mechanics to offer extremely high levels of data security during transmission. It is well acknowledged for its capacity to accomplish provable security. However, the existence of a gap between theoretical concepts and practical implementation has raised concerns about the trustworthiness of QKD networks. In order to mitigate this disparity, we propose the implementation of risk-aware machine learning techniques that present risk analysis for Trojan-horse attacks over the time-variant quantum channel. The trust condition presented in this study aims to evaluate the offline assessment of safety assurance by comparing the risk levels between the recommended safety borderline. This assessment is based on the risk analysis conducted. Furthermore, the proposed trustworthy QKD scenario demonstrates its numerical findings with the assistance of a state-of-the-art point-to-point QKD device, which operates over optical quantum channels spanning distances of 1m, 1km, and 30km. Based on the results from the experimental evaluation of a 30km optical connection, it can be concluded that the QKD device provided prior information to the proposed learner during the non-existence of Eve's attack. According to the optimal classifier, the defensive gate offered by our learner possesses the capability to identify any latent Eve attacks, hence effectively mitigating the risk of potential vulnerabilities. The Eve detection probability is provably bound for our trustworthy QKD scenario., Comment: 20 Pages, 14 figure, Journal

We present the recent development of a lightweight detector capable of accurate spatial, timing, and amplitude resolution of charged particles. The technology is based on double-sided double-metal p+\,--\,n\,--\,n+ micro-strip silicon sensors, ultra-light long aluminum-polyimide micro-cables for the analogue signal transfer, and a custom-developed SMX read-out ASIC capable of measurement of the time ($\Delta t \lesssim 5 \,\mathrm{ns}$) and amplitude. Dense detector integration enables a material budget $>0.3\,\% X_0$. A sophisticated powering and grounding scheme keeps the noise under control. In addition to its primary application in Silicon Tracking System of the future CBM experiment in Darmstadt, our detector will be utilized in other research applications., Comment: 9 pages, 7 figures, TWEPP 2023 proceedings

In this paper, we focus on the autonomous multiagent taxi routing problem for a large urban environment where the location and number of future ride requests are unknown a-priori, but can be estimated by an empirical distribution. Recent theory has shown that a rollout algorithm with a stable base policy produces a near-optimal stable policy. In the routing setting, a policy is stable if its execution keeps the number of outstanding requests uniformly bounded over time. Although, rollout-based approaches are well-suited for learning cooperative multiagent policies with considerations for future demand, applying such methods to a large urban environment can be computationally expensive due to the large number of taxis required for stability. In this paper, we aim to address the computational bottleneck of multiagent rollout by proposing an approximate multiagent rollout-based two phase algorithm that reduces computational costs, while still achieving a stable near-optimal policy. Our approach partitions the graph into sectors based on the predicted demand and the maximum number of taxis that can run sequentially given the user's computational resources. The algorithm then applies instantaneous assignment (IA) for re-balancing taxis across sectors and a sector-wide multiagent rollout algorithm that is executed in parallel for each sector. We provide two main theoretical results: 1) characterize the number of taxis $m$ that is sufficient for IA to be stable; 2) derive a necessary condition on $m$ to maintain stability for IA as time goes to infinity. Our numerical results show that our approach achieves stability for an $m$ that satisfies the theoretical conditions. We also empirically demonstrate that our proposed two phase algorithm has equivalent performance to the one-at-a-time rollout over the entire map, but with significantly lower runtimes., Comment: 11 pages, 5 figures, 1 lemma, and 2 theorems

The incorporation of subarrays in Direct Radiating Arrays for satellite missions is fundamental in reducing the number of Radio Frequency chains, which correspondingly diminishes cost, power consumption, space, and mass. Despite the advantages, previous beamforming schemes incur significant losses during beam scanning, particularly when hybrid beamforming is not employed. Consequently, this paper introduces an algorithm capable of compensating for these losses by increasing the power, for this, the algorithm will activate radiating elements required to address a specific Effective Isotropic Radiated Power for a beam pattern over Earth, projected from a GeoStationary satellite. In addition to the aforementioned compensation, other beam parameters have been addressed in the algorithm, such as beamwidth and Side Lobe Levels. To achieve these objectives, we propose employing the array thinning concept through the use of genetic algorithms, which enable beam shaping with the desired characteristics and power. The full array design considers an open-ended waveguide, configured to operate in circular polarization within the Ka-band frequency range of 17.7-20.2 GHz.

Satellite communications (SatCom) are crucial for global connectivity, especially in the era of emerging technologies like 6G and narrowing the digital divide. Traditional SatCom systems struggle with efficient resource management due to static multibeam configurations, hindering quality of service (QoS) amidst dynamic traffic demands. This paper introduces an innovative solution - real-time adaptive beamforming on multibeam satellites with software-defined payloads in geostationary orbit (GEO). Utilizing a Direct Radiating Array (DRA) with circular polarization in the 17.7 - 20.2 GHz band, the paper outlines DRA design and a supervised learning-based algorithm for on-board beamforming. This adaptive approach not only meets precise beam projection needs but also dynamically adjusts beamwidth, minimizes sidelobe levels (SLL), and optimizes effective isotropic radiated power (EIRP)., Comment: conference paper

We study bounded bilinear maps on a C$^*$-algebra $A$ having product property at $c\in A$. This leads us to the question of when a C$^*$-algebra is determined by products at $c.$ In the first part of our paper, we investigate this question for compact C$^*$-algebras, and in the second part, we deal with von Neumann algebras having non-trivial atomic part. Our results are applicable to descriptions of homomorphism-like and derivation-like maps at a fixed point on such algebras., Comment: The manuscript has been revised according to the referee's suggestions and comments