arXiv subjects

Bin Han

Publications and source records attributed to Bin Han.

At least 91 records · Page 5Linked to original sources

arXiv2024

Quasi-stationary Subdivision Schemes in Arbitrary Dimensions

Stationary subdivision schemes have been extensively studied and have numerous applications in CAGD and wavelet analysis. To have high-order smoothness of the scheme, it is usually inevitable to enlarge the support of the mask that is used, which is a major difficulty with stationary subdivision schemes due to complicated implementation and dramatically increased special subdivision rules at extraordinary vertices. In this paper, we introduce the notion of a multivariate quasi-stationary subdivision scheme and fully characterize its convergence and smoothness. We will also discuss the general procedure of designing interpolatory masks with short support that yields smooth quasi-stationary subdivision schemes. Specifically, using the dyadic dilation of both triangular and quadrilateral meshes, for each smoothness exponent $m=1,2$, we obtain examples of $C^m$-convergent quasi-stationary $2I_2$-subdivision schemes with bivariate symmetric masks having at most $m$-ring stencils. Our examples demonstrate the advantage of quasi-stationary subdivision schemes, which can circumvent the difficulty above with stationary subdivision schemes.

math.NA↗

arXiv2024

A Semantic Model for Physical Layer Deception

Physical layer deception (PLD) is a novel security mechanism that combines physical layer security (PLS) with deception technologies to actively defend against eavesdroppers. In this paper, we establish a novel semantic model for PLD that evaluates its performance in terms of semantic distortion. By analyzing semantic distortion at varying levels of knowledge on the receiver's part regarding the key, we derive the receiver's optimal decryption strategy, and consequently, the transmitter's optimal deception strategy. The proposed semantic model provides a more generic understanding of the PLD approach independent from coding or multiplexing schemes, and allows for efficient real-time adaptation to fading channels.

cs.IT↗

arXiv2024

Architectural Challenges of Nomadic Networks in 6G

This paper examines architectural challenges and opportunities arising from Nomadic Networks in the context of emerging 6G research. Nomadic networks are proposed as a solution to the limitations of stationary communication networks, providing enhanced connectivity for dynamic and mobile environments, such as large outdoor events, emergency situations and mobile industrial applications. The key requirements for nomadic networks are outlined, including functional split within the Radio Access Network and robust backhauling solutions. It also addresses the complexity of managing network components, ensuring interoperability with existing systems and maintaining stakeholder trust. A comprehensive architectural framework for Nomadic Networks in 6G is proposed. Different deployment scenarios for Nomadic Networks are investigated, including spawned, steered, and wandering Radio Access Networks as well as integrated, migrated and donated Core Networks. By introducing Nomadic-Network-as-a-Service and a related orchestration framework, the potential for flexible and scalable network management is emphasized. By addressing the architectural challenges, the paper provides a path for the successful implementation of Nomadic Networks towards more adaptable and flexible 6G networks that can meet the evolving needs of multiple sectors.

cs.NI↗

arXiv2024

Towards an AI/ML-driven SMO Framework in O-RAN: Scenarios, Solutions, and Challenges

The emergence of the open radio access network (O-RAN) architecture offers a paradigm shift in cellular network management and service orchestration, leveraging data-driven, intent-based, autonomous, and intelligent solutions. Within O-RAN, the service management and orchestration (SMO) framework plays a pivotal role in managing network functions (NFs), resource allocation, service provisioning, and others. However, the increasing complexity and scale of O-RANs demand autonomous and intelligent models for optimizing SMO operations. To achieve this goal, it is essential to integrate intelligence and automation into the operations of SMO. In this manuscript, we propose three scenarios for integrating machine learning (ML) algorithms into SMO. We then focus on exploring one of the scenarios in which the non-real-time RAN intelligence controller (Non-RT RIC) plays a major role in data collection, as well as model training, deployment, and refinement, by proposing a centralized ML architecture. Finally, we identify potential challenges associated with implementing a centralized ML solution within SMO.

cs.NI↗

arXiv2024

Interpolating Refinable Functions and $n_s$-step Interpolatory Subdivision Schemes

Standard interpolatory subdivision schemes and their underlying interpolating refinable functions are of interest in CAGD, numerical PDEs, and approximation theory. Generalizing these notions, we introduce and study $n_s$-step interpolatory $M$-subdivision schemes and their interpolating $M$-refinable functions with $n_s\in \mathbb{N} \cup\{\infty\}$ and a dilation factor $M\in \mathbb{N}\backslash\{1\}$. We completely characterize $\mathscr{C}^m$-convergence and smoothness of $n_s$-step interpolatory subdivision schemes and their interpolating $M$-refinable functions in terms of their masks. Inspired by $n_s$-step interpolatory stationary subdivision schemes, we further introduce the notion of $r$-mask quasi-stationary subdivision schemes, and then we characterize their $\mathscr{C}^m$-convergence and smoothness properties using only their masks. Moreover, combining $n_s$-step interpolatory subdivision schemes with $r$-mask quasi-stationary subdivision schemes, we can obtain $r n_s$-step interpolatory subdivision schemes. Examples and construction procedures of convergent $n_s$-step interpolatory $M$-subdivision schemes are provided to illustrate our results with dilation factors $M=2,3,4$. In addition, for the dyadic dilation $M=2$ and $r=2,3$, using $r$ masks with only two-ring stencils, we provide examples of $\mathscr{C}^r$-convergent $r$-step interpolatory $r$-mask quasi-stationary dyadic subdivision schemes.

math.NA↗

arXiv2024

Knowledge-based Emotion Recognition using Large Language Models

Emotion recognition in social situations is a complex task that requires integrating information from both facial expressions and the situational context. While traditional approaches to automatic emotion recognition have focused on decontextualized signals, recent research emphasizes the importance of context in shaping emotion perceptions. This paper contributes to the emerging field of context-based emotion recognition by leveraging psychological theories of human emotion perception to inform the design of automated methods. We propose an approach that combines emotion recognition methods with Bayesian Cue Integration (BCI) to integrate emotion inferences from decontextualized facial expressions and contextual knowledge inferred via Large-language Models. We test this approach in the context of interpreting facial expressions during a social task, the prisoner's dilemma. Our results provide clear support for BCI across a range of automatic emotion recognition methods. The best automated method achieved results comparable to human observers, suggesting the potential for this approach to advance the field of affective computing.

cs.HC↗

arXiv2024

Nomadic Non-Public Networks for 6G: Use Cases and Key Performance Indicators

The landscape of wireless communication systems is evolving rapidly, with a pivotal role envisioned for dynamic network structures and self-organizing networks in upcoming technologies like the 6G mobile communications standard. This evolution is fueled by the growing demand from diverse sectors, including industry, manufacturing, agriculture, and the public sector, each with increasingly specific requirements. The establishment of non-public networks in the current 5G standard has laid a foundation, enabling independent operation within certain frequencies and local limitations, notably for Internet of Things applications. This paper explores the progression from non-public networks to nomadic non-public networks and their significance in the context of the forthcoming 6G era. Building on existing work in dynamic network structures, non-public networks regulations, and alternative technological solutions, this paper introduces specific use cases enhanced by nomadic networks. In addition, relevant Key Performance Indicators are discussed on the basis of the presented use cases. These serve as a starting point for the definition of requirement clusters and thus for a evaluation metric of nomadic non-public networks. This work lays the groundwork for understanding the potential of nomadic non-public networks in the dynamic landscape of 6G wireless communication systems.

cs.NI↗

arXiv2024

SARN: Structurally-Aware Recurrent Network for Spatio-Temporal Disaggregation

Open data is frequently released spatially aggregated, usually to comply with privacy policies. But coarse, heterogeneous aggregations complicate learning and integration for downstream AI/ML systems. In this work, we consider models to disaggregate spatio-temporal data from a low-resolution, irregular partition (e.g., census tract) to a high-resolution, irregular partition (e.g., city block). We propose an overarching model named the Structurally-Aware Recurrent Network (SARN), which integrates structurally-aware spatial attention (SASA) layers into the Gated Recurrent Unit (GRU) model. The spatial attention layers capture spatial interactions among regions, while the gated recurrent module captures the temporal dependencies. Each SASA layer calculates both global and structural attention -- global attention facilitates comprehensive interactions between different geographic levels, while structural attention leverages the containment relationship between different geographic levels (e.g., a city block being wholly contained within a census tract) to ensure coherent and consistent results. For scenarios with limited historical training data, we explore transfer learning and show that a model pre-trained on one city variable can be fine-tuned for another city variable using only a few hundred samples. Evaluating these techniques on two mobility datasets, we find that on both datasets, SARN significantly outperforms other neural models (5% and 1%) and typical heuristic methods (40% and 14%), enabling us to generate realistic, high-quality fine-grained data for downstream applications.

cs.LG↗

arXiv2024

Towards Zero-Shot Annotation of the Built Environment with Vision-Language Models (Vision Paper)

Equitable urban transportation applications require high-fidelity digital representations of the built environment: not just streets and sidewalks, but bike lanes, marked and unmarked crossings, curb ramps and cuts, obstructions, traffic signals, signage, street markings, potholes, and more. Direct inspections and manual annotations are prohibitively expensive at scale. Conventional machine learning methods require substantial annotated training data for adequate performance. In this paper, we consider vision language models as a mechanism for annotating diverse urban features from satellite images, reducing the dependence on human annotation to produce large training sets. While these models have achieved impressive results in describing common objects in images captured from a human perspective, their training sets are less likely to include strong signals for esoteric features in the built environment, and their performance in these settings is therefore unclear. We demonstrate proof-of-concept combining a state-of-the-art vision language model and variants of a prompting strategy that asks the model to consider segmented elements independently of the original image. Experiments on two urban features -- stop lines and raised tables -- show that while direct zero-shot prompting correctly annotates nearly zero images, the pre-segmentation strategies can annotate images with near 40% intersection-over-union accuracy. We describe how these results inform a new research agenda in automatic annotation of the built environment to improve equity, accessibility, and safety at broad scale and in diverse environments.

cs.CV↗

arXiv2024

Robust Federated Learning for Wireless Networks: A Demonstration with Channel Estimation

Federated learning (FL) offers a privacy-preserving collaborative approach for training models in wireless networks, with channel estimation emerging as a promising application. Despite extensive studies on FL-empowered channel estimation, the security concerns associated with FL require meticulous attention. In a scenario where small base stations (SBSs) serve as local models trained on cached data, and a macro base station (MBS) functions as the global model setting, an attacker can exploit the vulnerability of FL, launching attacks with various adversarial attacks or deployment tactics. In this paper, we analyze such vulnerabilities, corresponding solutions were brought forth, and validated through simulation.

cs.LG↗

arXiv2024

In-Depth Analysis of Emotion Recognition through Knowledge-Based Large Language Models

cs.HC↗

arXiv2024

Refining Potential Energy Surface through Dynamical Properties via Differentiable Molecular Simulation

Recently, machine learning potentials (MLP) largely enhances the reliability of molecular dynamics, but its accuracy is limited by the underlying $\textit{ab initio}$ methods. A viable approach to overcome this limitation is to refine the potential by learning from experimental data, which now can be done efficiently using modern automatic differentiation technique. However, potential refinement is mostly performed using thermodynamic properties, leaving the most accessible and informative dynamical data (like spectroscopy) unexploited. In this work, through a comprehensive application of adjoint and gradient truncation methods, we show that both memory and gradient explosion issues can be circumvented in many situations, so the dynamical property differentiation is well-behaved. Consequently, both transport coefficients and spectroscopic data can be used to improve the density functional theory based MLP towards higher accuracy. Essentially, this work contributes to the solution of the inverse problem of spectroscopy by extracting microscopic interactions from vibrational spectroscopic data.

physics.chem-ph↗

arXiv2024

Breaking of brightness consistency in optical flow with a lightweight CNN network

Sparse optical flow is widely used in various computer vision tasks, however assuming brightness consistency limits its performance in High Dynamic Range (HDR) environments. In this work, a lightweight network is used to extract illumination robust convolutional features and corners with strong invariance. Modifying the typical brightness consistency of the optical flow method to the convolutional feature consistency yields the light-robust hybrid optical flow method. The proposed network runs at 190 FPS on a commercial CPU because it uses only four convolutional layers to extract feature maps and score maps simultaneously. Since the shallow network is difficult to train directly, a deep network is designed to compute the reliability map that helps it. An end-to-end unsupervised training mode is used for both networks. To validate the proposed method, we compare corner repeatability and matching performance with origin optical flow under dynamic illumination. In addition, a more accurate visual inertial system is constructed by replacing the optical flow method in VINS-Mono. In a public HDR dataset, it reduces translation errors by 93\%. The code is publicly available at https://github.com/linyicheng1/LET-NET.

cs.CV↗

arXiv2024

Laboratory-Scale AI: Open-Weight Models are Competitive with ChatGPT Even in Low-Resource Settings

The rapid proliferation of generative AI has raised questions about the competitiveness of lower-parameter, locally tunable, open-weight models relative to high-parameter, API-guarded, closed-weight models in terms of performance, domain adaptation, cost, and generalization. Centering under-resourced yet risk-intolerant settings in government, research, and healthcare, we see for-profit closed-weight models as incompatible with requirements for transparency, privacy, adaptability, and standards of evidence. Yet the performance penalty in using open-weight models, especially in low-data and low-resource settings, is unclear. We assess the feasibility of using smaller, open-weight models to replace GPT-4-Turbo in zero-shot, few-shot, and fine-tuned regimes, assuming access to only a single, low-cost GPU. We assess value-sensitive issues around bias, privacy, and abstention on three additional tasks relevant to those topics. We find that with relatively low effort, very low absolute monetary cost, and relatively little data for fine-tuning, small open-weight models can achieve competitive performance in domain-adapted tasks without sacrificing generality. We then run experiments considering practical issues in bias, privacy, and hallucination risk, finding that open models offer several benefits over closed models. We intend this work as a case study in understanding the opportunity cost of reproducibility and transparency over for-profit state-of-the-art zero shot performance, finding this cost to be marginal under realistic settings.

cs.LG↗

arXiv2024

A Robust UAV-Based Approach for Power-Modulated Jammer Localization Using DoA

Unmanned aerial vehicles (UAVs) are well-suited to localize jammers, particularly when jammers are at non-terrestrial locations, where conventional detection methods face challenges. In this work we propose a novel localization method, sample pruning gradient descend (SPGD), which offers robust performance against multiple power-modulated jammers with low computational complexity.

eess.SP↗

arXiv2024

Resource Allocation in Mobile Networks: A Decision Model Of Jockeying in Queues

Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate different slice profiles to queues in a multi-server setting, such that tenants continuously assess their preferences and make rational decisions to minimize the queuing delay. Deviated from classical approaches that statistically model the jockeying phenomena in queuing systems, our work pioneers to setup a behavioral model of jockeying impatient tenants. This will serve as a basis for decentralized management of multi-queue systems, where the decision to jockey is individually made by each tenant upon its up-to-date assessment of expected waiting time. Additionally, we carry out numerical simulations to empirically unravel the parametric dependencies of the tenants' jockeying behavior.

cs.NI↗

arXiv2024

Terahertz Communications and Sensing for 6G and Beyond: A Comprehensive Review

Next-generation cellular technologies, commonly referred to as the 6G, are envisioned to support a higher system capacity, better performance, and network sensing capabilities. The THz band is one potential enabler to this end due to the large unused frequency bands and the high spatial resolution enabled by the short signal wavelength and large bandwidth. Different from earlier surveys, this paper presents a comprehensive treatment and technology survey on THz communications and sensing in terms of advantages, applications, propagation characterization, channel modeling, measurement campaigns, antennas, transceiver devices, beamforming, networking, the integration of communications and sensing, and experimental testbeds. Starting from the motivation and use cases, we survey the development and historical perspective of THz communications and sensing with the anticipated 6G requirements. We explore the radio propagation, channel modeling, and measurement for the THz band. The transceiver requirements, architectures, technological challenges, and state-of-the-art approaches to compensate for the high propagation losses, including appropriate antenna design and beamforming solutions. We overview several related technologies that either are required by or are beneficial for THz systems and networks. The synergistic design of sensing and communications is explored in depth. Practical trials, demonstrations, and experiments are also summarized. The paper gives a holistic view of the current state of the art and highlights the open research challenges towards 6G and beyond.

eess.SP↗

arXiv2024

Engaged and Affective Virtual Agents: Their Impact on Social Presence, Trustworthiness, and Decision-Making in the Group Discussion

This study investigates how different virtual agent (VA) behaviors influence subjects' perceptions and group decision-making. Participants carried out experimental group discussions with a VA exhibiting varying levels of engagement and affective behavior. Engagement refers to the VA's focus on the group task, whereas affective behavior reflects the VA's emotional state. The findings revealed that VA's engagements effectively captured participants' attention even in the group setting and enhanced group synergy, thereby facilitating more in-depth discussion and producing better consensus. On the other hand, VA's affective behavior negatively affected the perceived social presence and trustworthiness. Consequently, in the context of group discussion, participants preferred the engaged and non-affective VA to the non-engaged and affective VA. The study provides valuable insights for improving the VA's behavioral design as a team member for collaborative tasks.

cs.HC↗