Telecomunicaciones, información y comunicación

Equivalence of Countable and Computable
- The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the...
Neural Active Learning Meets the Partial Monitoring Framework
- We focus on the online-based active learning (OAL) setting where an agent operates over a stream of observations and trades-off between the costly acquisition of information (labelled observations)...
Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms
- The sim-to-real gap, which represents the disparity between training and testing environments, poses a significant challenge in reinforcement learning (RL). A promising approach to addressing this...
Federated Topic Model and Model Pruning Based on Variational Autoencoder
- Topic modeling has emerged as a valuable tool for discovering patterns and topics within large collections of documents. However, when cross-analysis involves multiple parties, data privacy becomes a...
Research Team Identification Based on Representation Learning of Academic Heterogeneous Information Network
- Academic networks in the real world can usually be described by heterogeneous information networks composed of multiple types of nodes and relationships. Existing representation-learning research for...
A Cheeger Inequality for Size-Specific Conductance
- The $\mu$-conductance measure proposed by Lovász and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume...
Novel approach for solving multipoint boundary value problem for integro-differential equation
- In the present paper, we study a multipoint boundary value problem for a system of Fredholm integro-differenial equations by the method of parameterization. The case of a degenerate kernel is studied...
Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
- In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a hypergraph $H$, and Maker wins if and only if she possesses all the vertices of some edge of $H$. Deciding the...
Research on Intellectual Property Resource Profile and Evolution Law
- In the era of big data, intellectual property-oriented scientific and technological resources show the trend of large data scale, high information density, and low value density, which brings severe...
Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
- We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments. In this scenario, jobs incur holding costs while awaiting...
Research on Cross-media Science and Technology Information Data Retrieval
- Since the era of big data, the Internet has been flooded with all kinds of information. Browsing information through the Internet has become an integral part of people's daily life. Unlike news...
Decision problem for Hamilton $2$-cycles in $4$-graphs
- A $4$-uniform $2$-cycle in a $4$-uniform hypergraph of length $t$ is a cyclic ordering of $2t$ vertices $v_1v_2\cdots v_{2t}v_1$ such that $v_{2i+1}v_{2i+2}v_{2i+3}v_{2i+4}$ are edges for $0\le i\le...
Input-Aware Dynamic Backdoor Attack Against Quantum Neural Networks
- Quantum Neural Networks (QNNs) are a promising framework for quantum machine learning on near-term quantum devices, but their security risks remain insufficiently understood. Studies have shown that...
Stabilize-then-optimize: Feedback transformations as preconditioners in optimal control
- Many numerical algorithms for optimal control leverage an elimination of the state via the control-to-state map such as condensed approaches or preconditioned conjugate gradient methods for the...
Sparse Robust Optimal Control in Continuous-Time: A Computationally Viable Approach
- This article presents a novel, numerically viable algorithm for solving sparse robust optimal control problems in continuous time. We consider a constrained linear noisy system governed by an...
Improving Upper Bounds for the Maximum Clique Problem using Reduction Rules
- We study the interaction between reduction rules and upper-bound functions for the Maximum Clique Problem (MCP). We show how MCP upper-bound functions can strengthen classical core and truss...
$mathtt{Q^2SAR}$: overcoming classical bottlenecks in drug discovery via quantum multiple kernel learning
- Quantitative Structure-Activity Relationship ($\mathtt{QSAR}$) modeling is a foundational computational methodology in early-stage drug discovery, heavily relied upon for predicting compound...
Quantum Arithmetic Circuits in Public-Key Cryptography
- Quantum computing has advanced rapidly in recent decades, driven by developments across the technology stack, including quantum error-correcting codes and efficient quantum algorithms. Among these,...
Imputation-free transformer learning enables robust Alzheimer's disease prediction and calibrated uncertainty quantification across heterogeneous clinical cohorts
- Accurate diagnostic classification and disease-severity prediction for Alzheimer's disease are hampered by the incompleteness and heterogeneity of real-world clinical data. Left unaddressed,...
Diversified Multinomial Logit Contextual Bandits
- Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode...
Copositive Characterizations of Convex Hull Pricing
- Due to the nonconvex binary constraints of unit commitment (UC), no uniform linear pricing scheme supports the optimal dispatch. Convex hull pricing (CHP) and copositive duality pricing (CDP) both...