BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Haibo Chen

Haibo Chen appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
Computer VisionDistributed, Parallel, and Cluster ComputingMachine Learningmath.RTOperating Systemsmath.QAPerformanceArtificial IntelligenceCryptography and Securitymath-phmath.MPSoftware EngineeringApplicationsComputational Engineering, Finance, and Sciencecond-mat.supr-conDatabasesHardware ArchitectureLogic in Computer Sciencemath.NANetworking and Internet ArchitectureNumerical Analysis

Catalog footprint

What is connected

27works
21topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

27 published item(s)

preprint2026arXiv

A Case for Agentic Tuning: From Documentation to Action in PostgreSQL

Documentation has long guided computer system tuning by distilling expert knowledge into per-parameter recommendations. Yet such guides capture only what experts conclude, discarding how they reason. This fundamental gap manifests in three concrete deficiencies: documentation grows stale as software evolves, fails under heterogeneous workloads, and ignores inter-parameter dependencies. We propose shifting from static documentation to dynamic action for system tuning. We introduce PerfEvolve, which translates expert tuning methodologies into executable skills that equip LLM-based agents to perform version-consistency verification, workload-specific profiling, and multi-parameter joint optimization. Evaluated on PostgreSQL under TPC-C and TPC-H benchmarks, PerfEvolve outperforms state-of-the-art documentation-driven tuning baselines by up to 35.2%. The tool is available at https://github.com/ISCAS-OSLab/PerfEvolve.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

A Unified Graph Language Model for Multi-Domain Multi-Task Graph Alignment Instruction Tuning

Leveraging Graph Neural Networks (GNNs) as graph encoders and aligning the resulting representations with Large Language Models (LLMs) through alignment instruction tuning has become a mainstream paradigm for constructing Graph Language Models (GLMs), combining the generalization ability of LLMs with the structural modeling capacity of GNNs. However, existing GLMs that adopt GNNs as graph encoders largely overlook the problem of aligning GNN-encoded representations across domains and tasks with the LLM token space to obtain unified graph tokens, thereby limiting their ability to generalize across diverse graph data. To bridge this gap, we aim to incorporate a multi-domain, multi-task GNN encoder into GLMs and align its representations with LLMs to enable multi-domain, multi-task graph alignment instruction tuning. This alignment problem remains underexplored and poses two key challenges: 1) learning GNN-encoded representations that are simultaneously generalizable across domains and tasks and well aligned with textual semantics is difficult, due to substantial variations in graph structures, feature distributions, and supervision signals, together with the lack of textual-semantic alignment guidance in task-specific GNN training; 2) diverse graph data and task-specific instructions can exhibit different degrees of compatibility with the LLM token space during instruction tuning, leading to varying alignment difficulty and rendering a fixed alignment strategy suboptimal. To tackle these challenges, we propose UniGraphLM, a Unified Graph Language Model that incorporates a multi-domain, multi-task GNN encoder to learn generalizable graph representations aligned with textual semantics, and then adaptively aligns these representations with the LLM.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Agentic AIs Are the Missing Paradigm for Out-of-Distribution Generalization in Foundation Models

Foundation models (FMs) are increasingly deployed in open-world settings where distribution shift is the rule rather than the exception. The out-of-distribution (OOD) phenomena they face -- knowledge boundaries, capability ceilings, compositional shifts, and open-ended task variation -- differ in kind from the settings that have shaped prior OOD research, and are further complicated because the pretraining and post-training distributions of modern FMs are often only partially observed. Our position is that OOD for foundation models is a structurally distinct problem that cannot be solved within the prevailing model-centric paradigm, and that agentic systems constitute the missing paradigm required to address it. We defend this claim through four steps. First, we give a stage-aware formalization of OOD that accommodates partially observed multi-stage training distributions. Second, we prove a parameter coverage ceiling: there exist practically relevant inputs that no model-centric method (training-time or test-time) can handle within tolerance $\varepsilon$, for reasons intrinsic to parameter-based representation. Third, we characterize agentic OOD systems by four structural properties -- perception, strategy selection, external action, and closed-loop verification -- and show that they strictly extend the reachable set beyond the ceiling. Fourth, we respond to seven counterarguments, conceding two, and outline a research agenda. We do not claim that agentic methods subsume model-centric ones; we argue that the two are complementary, and that progress on FM-OOD requires explicit recognition of the agentic paradigm as a first-class research direction.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

FalconFS: Distributed File System for Large-Scale Deep Learning Pipeline

Client-side metadata caching has long been considered an effective method for accelerating metadata operations in distributed file systems (DFSs). However, we have found that client-side state (e.g., caching) is not only ineffective but also consumes valuable memory resources in the deep learning pipelines. We thus propose FalconFS, a DFS optimized for deep learning pipelines with the stateless-client architecture. Specifically, instead of performing client-side path resolution and caching, FalconFS efficiently resolves paths on the server side using hybrid metadata indexing and lazy namespace replication. FalconFS also boosts server concurrency with concurrent request merging and provides easy deployment with VFS shortcut. Evaluations against CephFS and Lustre show that FalconFS achieves up to 5.72$\times$ throughput for small file read/write and up to 12.81$\times$ throughput for deep learning model training. FalconFS has been running in Huawei autonomous driving system's production environment with 10,000 NPUs for one year and has been open-sourced.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Self-Creative Text-to-Object Generation using Semantic-Aware Spatial Weighting

Instilling creativity in text-to-image (T2I) generation presents a significant challenge, as it requires synthesized images to exhibit not only visual novelty and surprise, but also artistic value. Current T2I models, however, are largely optimized for literal text-image alignment with their data distribution, and their noise prediction networks constrain the generation to high-probability regions, consequently generating outputs that lack authentic creativity. To address this, we propose a Self-Creative Diffusion (SCDiff) model for meaningful T2I generations featuring two core modules: a learnable spatial weighting (LSW) module and a visual-semantic mixing loss (VSML). The LSW module designs a parametric Kaiser-Bessel window to reinforce central image features, fostering novel and surprising generation. The VSML module introduces a dual loss function: a similarity loss constrains that the new images align with its textual description, while a diversity loss maximizes its distinction from the original image, enhancing both semantic value and visual novelty. Extensive experiments demonstrate that our model substantially improves creativity, semantic alignment, and visual coherence, offering a simple yet powerful framework for generating creative objects.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Towards Fully-fledged GPU Multitasking via Proactive Memory Scheduling

The limited HBM capacity has become the primary bottleneck for hosting an increasing number of larger-scale GPU tasks. While demand paging extends capacity via host DRAM, it incurs up to 78x slowdown due to the massive working sets and poor locality of GPU workloads. We observe, however, that GPU memory access patterns are inherently predictable via kernel launch arguments and their asynchronous execution nature. Leveraging this, we propose MSched, an OS-level scheduler that extends GPU context switching to include proactive working set preparation, thereby coalescing fragmented, eventual, and expensive page faults into a single efficient migration. MSched employs a template-based approach to predict working sets with near-perfect accuracy and proposes a co-design between task scheduler and memory manager to enforce a globally optimal page placement policy. Evaluation demonstrates that MSched outperforms demand paging by up to 11.05x for scientific and deep learning workloads, and 57.88x for LLM under memory oversubscription.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

VUDA: Breaking CUDA-Vulkan Isolation for Spatial Sharing of Compute and Graphics on the Same GPU

GPU-based simulation environments for embodied AI interleave physics simulation (CUDA) and photorealistic rendering (Vulkan) on a single device. We observe that two foundational scenarios -- simulation data generation and RL training -- can be naturally adapted to execute their simulation and rendering phases concurrently, presenting a significant opportunity to improve GPU utilization through spatial multiplexing. However, a fundamental obstacle we term execution isolation prevents this: CUDA and Vulkan create separate GPU contexts whose channels are bound to different scheduling groups, confining compute and graphics to mutually exclusive time slices. Existing spatial-sharing techniques are limited to the CUDA ecosystem, while temporal-sharing approaches underutilize available resources. This paper presents VUDA, a system that breaks execution isolation to enable spatial parallelism between CUDA compute and Vulkan graphics workloads. VUDA is built on two key observations: although CUDA and Vulkan expose different programming abstractions, their execution paths converge to a common channel primitive at the driver and hardware level; meanwhile, their virtual-address spaces are inherently disjoint, making safe page-table merging feasible without remapping. VUDA exposes a thin API for developers to annotate co-schedulable CUDA streams, and realizes spatial sharing through channel redirection into Vulkan's scheduling domain and page-table grafting to unify address spaces, eliminating all data copying on the critical path. Experiments on representative embodied-AI workloads show that VUDA delivers up to 85% higher throughput than temporal-sharing baselines, while improving GPU utilization and reducing end-to-end latency.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination

Distributed filesystem metadata updates are typically synchronous. This creates inherent challenges for access efficiency, load balancing, and directory contention, especially under dynamic and skewed workloads. This paper argues that synchronous updates are overly conservative. We propose SwitchFS with asynchronous metadata updates that allow operations to return early and defer directory updates until reads, both hiding latency and amortizing overhead. The key challenge lies in efficiently maintaining the synchronous POSIX semantics of metadata updates. To address this, SwitchFS is co-designed with a programmable switch, leveraging the limited on-switch resources to track directory states with negligible overhead. This allows SwitchFS to aggregate and apply delayed updates efficiently, using batching and consolidation before directory reads. Evaluation shows that SwitchFS achieves up to 13.34$\times$ and 3.85$\times$ higher throughput, and 61.6% and 57.3% lower latency than two state-of-the-art distributed filesystems, Emulated-InfiniFS and Emulated-CFS, respectively, under skewed workloads. For real-world workloads, SwitchFS improves end-to-end throughput by 21.1$\times$, 1.1$\times$, and 0.3$\times$ over CephFS, Emulated-InfiniFS, and Emulated-CFS, respectively.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

DivSwapper: Towards Diversified Patch-based Arbitrary Style Transfer

Gram-based and patch-based approaches are two important research lines of style transfer. Recent diversified Gram-based methods have been able to produce multiple and diverse stylized outputs for the same content and style images. However, as another widespread research interest, the diversity of patch-based methods remains challenging due to the stereotyped style swapping process based on nearest patch matching. To resolve this dilemma, in this paper, we dive into the crux of existing patch-based methods and propose a universal and efficient module, termed DivSwapper, for diversified patch-based arbitrary style transfer. The key insight is to use an essential intuition that neural patches with higher activation values could contribute more to diversity. Our DivSwapper is plug-and-play and can be easily integrated into existing patch-based and Gram-based methods to generate diverse results for arbitrary styles. We conduct theoretical analyses and extensive experiments to demonstrate the effectiveness of our method, and compared with state-of-the-art algorithms, it shows superiority in diversity, quality, and efficiency.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

DuVisor: a User-level Hypervisor Through Delegated Virtualization

Today's mainstream virtualization systems comprise of two cooperative components: a kernel-resident driver that accesses virtualization hardware and a user-level helper process that provides VM management and I/O virtualization. However, this virtualization architecture has intrinsic issues in both security (a large attack surface) and performance. While there is a long thread of work trying to minimize the kernel-resident driver by offloading functions to user mode, they face a fundamental tradeoff between security and performance: more offloading may reduce the kernel attack surface, yet increase the runtime ring crossings between the helper process and the driver, and thus more performance cost. This paper explores a new design called delegated virtualization, which completely separates the control plane (the kernel driver) from the data plane (the helper process) and thus eliminates the kernel driver from runtime intervention. The resulting user-level hypervisor, called DuVisor, can handle all VM operations without trapping into the kernel once the kernel driver has done the initialization. DuVisor retrofits existing hardware virtualization support with a new delegated virtualization extension to directly handle VM exits, configure virtualization registers, manage the stage-2 page table and virtual devices in user mode. We have implemented the hardware extension on an open-source RISC-V CPU and built a Rust-based hypervisor atop the hardware. Evaluation on FireSim shows that DuVisor outperforms KVM by up to 47.96\% in a variety of real-world applications and significantly reduces the attack surface.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Fast multipole boundary element method for the acoustic analysis of finite periodic structures

In this work, two fast multipole boundary element formulations for the linear time-harmonic acoustic analysis of finite periodic structures are presented. Finite periodic structures consist of a bounded number of unit cell replications in one or more directions of periodicity. Such structures can be designed to efficiently control and manipulate sound waves and are referred to as acoustic metamaterials or sonic crystals. Our methods subdivide the geometry into boxes which correspond to the unit cell. A boundary element discretization is applied and interactions between well separated boxes are approximated by a fast multipole expansion. Due to the periodicity of the underlying geometry, certain operators of the expansion become block Toeplitz matrices. This allows to express matrix-vector products as circular convolutions which significantly reduces the computational effort and the overall memory requirements. The efficiency of the presented techniques is shown based on an acoustic scattering problem. In addition, a study on the design of sound barriers is presented where the performance of a wall-like sound barrier is compared to the performance of two sonic crystal sound barriers.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

KRCORE: a microsecond-scale RDMA control plane for elastic computing

We present KRCORE, an RDMA library with a microsecond-scale control plane on commodity RDMA hardware for elastic computing. KRCORE can establish a full-fledged RDMA connection within 10μs (hundreds or thousands of times faster than verbs), while only maintaining a (small) fixed-sized connection metadata at each node, regardless of the cluster scale. The key ideas include virtualizing pre-initialized kernel-space RDMA connections instead of creating one from scratch, and retrofitting advanced RDMA dynamic connected transport with static transport for both low connection overhead and high networking speed. Under load spikes, KRCORE can shorten the worker bootstrap time of an existing disaggregated key-value store (namely RACE Hashing) by 83%. In serverless computing (namely Fn), KRCORE can also reduce the latency for transferring data through RDMA by 99%.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

New irreducible non-weight Virasoro modules from tensor products

In this paper, we present a class of non-weight Virasoro modules $\mathcal{M}\big(V,Ω(λ_0,α_0)\big)\otimes\bigotimes_{i=1}^mΩ(λ_i,α_i)$ where $Ω(λ_i,α_i)$ and $\mathcal{M}\big(V,Ω(λ_0,α_0)\big)$ are irreducible Virasoro modules defined in \cite{LZ2} and \cite{LZ} respectively. The necessary and sufficient conditions for $\mathcal{M}\big(V,Ω(λ_0,α_0)\big)\otimes\bigotimes_{i=1}^mΩ(λ_i,α_i)$ to be irreducible are obtained. Then we determine the necessary and sufficient conditions for two such irreducible Virasoro modules to be isomorphic. At last, we show that the irreducible modules in this class are new.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

A family of simple non-weight modules over the twisted $N=2$ superconformal algebra

We construct a class of non-weight modules over the twisted $N=2$ superconformal algebra $\T$. Let $\mathfrak{h}=\C L_0\oplus\C G_0$ be the Cartan subalgebra of $\T$, and let $\mathfrak{t}=\C L_0$ be the Cartan subalgebra of even part $\T_{\bar 0}$. These modules over $\T$ when restricted to the $\mathfrak{h}$ are free of rank $1$ or when restricted to the $\mathfrak{t}$ are free of rank $2$. We provide the sufficient and necessary conditions for those modules being simple, as well as giving the sufficient and necessary conditions for two $\T$-modules being isomorphic. We also compute the action of an automorphism on them. Moreover, based on the weighting functor introduced in \cite{N2}, a class of intermediate series modules $A_σ$ are obtained. As a byproduct, we give a sufficient condition for two $\T$-modules are not isomorphic.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

VSync: Push-Button Verification and Optimization for Synchronization Primitives on Weak Memory Models (Technical Report)

This technical report contains material accompanying our work with same title published at ASPLOS'21. We start in Sec. 1 with a detailed presentation of the core innovation of this work, Await Model Checking (AMC). The correctness proofs of AMC can be found in Sec. 2. Next, we discuss three study cases in Sec. 3, presenting bugs found and challenges encountered when applying VSync to existing code bases. Finally, in Sec. 4 we describe the setup details of our evaluation and report further experimental results.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Survey on Adaptive Random Testing

Random testing (RT) is a well-studied testing method that has been widely applied to the testing of many applications, including embedded software systems, SQL database systems, and Android applications. Adaptive random testing (ART) aims to enhance RT's failure-detection ability by more evenly spreading the test cases over the input domain. Since its introduction in 2001, there have been many contributions to the development of ART, including various approaches, implementations, assessment and evaluation methods, and applications. This paper provides a comprehensive survey on ART, classifying techniques, summarizing application areas, and analyzing experimental evaluations. This paper also addresses some misconceptions about ART, and identifies open research challenges to be further investigated in the future work.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Diversified Arbitrary Style Transfer via Deep Feature Perturbation

Image style transfer is an underdetermined problem, where a large number of solutions can satisfy the same constraint (the content and style). Although there have been some efforts to improve the diversity of style transfer by introducing an alternative diversity loss, they have restricted generalization, limited diversity and poor scalability. In this paper, we tackle these limitations and propose a simple yet effective method for diversified arbitrary style transfer. The key idea of our method is an operation called deep feature perturbation (DFP), which uses an orthogonal random noise matrix to perturb the deep image feature maps while keeping the original style information unchanged. Our DFP operation can be easily integrated into many existing WCT (whitening and coloring transform)-based methods, and empower them to generate diverse results for arbitrary styles. Experimental results demonstrate that this learning-free and universal method can greatly increase the diversity while maintaining the quality of stylization.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Finite irreducible conformal modules over the extended Block type Lie conformal algebra $\mathfrak{B}(α,β,p)$

In this paper, we introduce a class of infinite Lie conformal algebras $\mathfrak{B}(α,β,p)$, which are the semi-direct sums of Block type Lie conformal algebra $\mathfrak{B}(p)$ and its non-trivial conformal modules of $\Z$-graded free intermediate series. The annihilation algebras are a class of infinite-dimensional Lie algebras, which include a lot of interesting subalgebras: Virasoro algebra, Block type Lie algebra, twisted Heisenberg-Virasoro algebra and so on. We give a complete classification of all finite non-trivial irreducible conformal modules of $\mathfrak{B}(α,β,p)$ for $α,β\in\C, p\in\C^*$. As an application, the classifications of finite irreducible conformal modules over a series of finite Lie conformal algebras $\mathfrak{b}(n)$ for $n\geq1$ are given.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Action Recognition in Untrimmed Videos with Composite Self-Attention Two-Stream Framework

With the rapid development of deep learning algorithms, action recognition in video has achieved many important research results. One issue in action recognition, Zero-Shot Action Recognition (ZSAR), has recently attracted considerable attention, which classify new categories without any positive examples. Another difficulty in action recognition is that untrimmed data may seriously affect model performance. We propose a composite two-stream framework with a pre-trained model. Our proposed framework includes a classifier branch and a composite feature branch. The graph network model is adopted in each of the two branches, which effectively improves the feature extraction and reasoning ability of the framework. In the composite feature branch, a 3-channel self-attention models are constructed to weight each frame in the video and give more attention to the key frames. Each self-attention models channel outputs a set of attention weights to focus on a particular aspect of the video, and a set of attention weights corresponds to a one-dimensional vector. The 3-channel self-attention models can evaluate key frames from multiple aspects, and the output sets of attention weight vectors form an attention matrix, which effectively enhances the attention of key frames with strong correlation of action. This model can implement action recognition under zero-shot conditions, and has good recognition performance for untrimmed video data. Experimental results on relevant data sets confirm the validity of our model.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

A family of new simple modules over the Schrödinger-Virasoro algebra

In this article, a large class of simple modules over the Schrödinger-Virasoro algebra $\mathcal{G}$ are constructed, which include highest weight modules and Whittaker modules. These modules are determined by the simple modules over the finite-dimensional quotient algebras of some subalgebras. Moreover, we show that all simple modules of $\mathcal{G}$ with locally finite actions of elements in a certain positive part belong to this class of simple modules. Similarly, a large class of simple modules over the $W$-algebra $W(2,2)$ are constructed.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Deep Learning At Scale and At Ease

Recently, deep learning techniques have enjoyed success in various multimedia applications, such as image classification and multi-modal data analysis. Large deep learning models are developed for learning rich representations of complex data. There are two challenges to overcome before deep learning can be widely adopted in multimedia and other applications. One is usability, namely the implementation of different models and training algorithms must be done by non-experts without much effort especially when the model is large and complex. The other is scalability, that is the deep learning system must be able to provision for a huge demand of computing resources for training large models with massive datasets. To address these two challenges, in this paper, we design a distributed deep learning platform called SINGA which has an intuitive programming model based on the common layer abstraction of deep learning models. Good scalability is achieved through flexible distributed training architecture and specific optimization techniques. SINGA runs on GPUs as well as on CPUs, and we show that it outperforms many other state-of-the-art deep learning systems. Our experience with developing and training deep learning models for real-life multimedia applications in SINGA shows that the platform is both usable and scalable.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

The Scale-free Network of Passwords : Visualization and Estimation of Empirical Passwords

In this paper, we present a novel vision of large scale of empirical password sets available and improve the understanding of passwords by revealing their interconnections and considering the security on a level of the whole password set instead of one single password level. Through the visualization of Yahoo, Phpbb, 12306, etc. we, for the first time, show what the spatial structure of empirical password sets are like and take the community and clustering patterns of the passwords into account to shed lights on the definition of popularity of a password based on their frequency and degree separately. Furthermore, we propose a model of statistical guessing attack from the perspective of the data's topological space, which provide an explanation of the "cracking curve". We also give a lower bound of the minimum size of the dictionary needed to compromise arbitrary ratio of any given password set by proving that it is equivalent to the minimum dominating set problem, which is a NP-complete problem. Hence the minimal dictionary problem is also NP-complete.

0 citations0 reviewsNo code linkedOpen access
preprint2010arXiv

Multiple change-point Poisson model for threshold exceedances of air pollution concentrations

A Bayesian multiple change-point model is proposed to analyse violations of air quality standards by pollutants such as nitrogen oxides (NO2 and NO) and carbon monoxide (CO). The model is built on the assumption that the occurrence of threshold exceedances may be described by a non-homogeneous Poisson process with a step rate function. Unlike earlier approaches, our model is not restricted by a predetermined number of change-points, nor does it involve any covariates. Possible short-range correlations in the exceedance data (e.g., due to chemical and meteorological factors) are removed via declusterisation. The unknown rate function is estimated using a reversible jump MCMC sampling algorithm adapted from Green (1995), which allows for transitions between parameter subspaces of varying dimension. This technique is applied to the 17-year (1993-2009) daily NO2, NO and CO concentration data in the City of Leeds, UK. The results are validated by running the MCMC estimator on simulated data replicated via a posterior estimate of the rate function. The findings are interpreted and discussed in relation to some known traffic control actions. The proposed methodology may be useful in the air quality management context by providing quantitative objective means to measure the efficacy of pollution control programmes.

0 citations0 reviewsNo code linkedOpen access
preprint2010arXiv

Repulsion and attraction in high Tc superconductors

The influence of repulsion and attraction in high-Tc superconductors to the gap functions is studied. A systematic method is proposed to compute the gap functions using the irreducible representations of the point group. It is found that a pure s-wave superconductivity exists only at very low temperatures, and attractive potentials on the near shells significantly expand the gap functions and increase significantly the critical temperature of superconductivity. A strong on-site repulsion drives the $A_{1g}$ gap into a $B_{1g}$ gap. It is expected that superconductivity with the $A_{1g}$ symmetry reaches a high critical temperature due to the cooperation of the on-site and the next-nearest neighbor attractions.

0 citations0 reviewsNo code linkedOpen access