Catalog footprint

What is connected

93works
39topics
4close collaborators

Actions

Connect this record

Log in to claim

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

93 published item(s)

preprint2026arXiv

Cross-Modal Attention Network with Dual Graph Learning in Multimodal Recommendation

Multimedia recommendation systems leverage user-item interactions and multimodal information to capture user preferences, enabling more accurate and personalized recommendations. Despite notable advancements, existing approaches still face two critical limitations: first, shallow modality fusion often relies on simple concatenation, failing to exploit rich synergic intra- and inter-modal relationships; second, asymmetric feature treatment-where users are only characterized by interaction IDs while items benefit from rich multimodal content-hinders the learning of a shared semantic space. To address these issues, we propose a Cross-modal Recursive Attention Network with dual graph Embedding (CRANE). To tackle shallow fusion, we design a core Recursive Cross-Modal Attention (RCA) mechanism that iteratively refines modality features based on cross-correlations in a joint latent space, effectively capturing high-order intra- and inter-modal dependencies. For symmetric multimodal learning, we explicitly construct users' multimodal profiles by aggregating features of their interacted items. Furthermore, CRANE integrates a symmetric dual-graph framework-comprising a heterogeneous user-item interaction graph and a homogeneous item-item semantic graph-unified by a self-supervised contrastive learning objective to fuse behavioral and semantic signals. Despite these complex modeling capabilities, CRANE maintains high computational efficiency. Theoretical and empirical analyses confirm its scalability and high practical efficiency, achieving faster convergence on small datasets and superior performance ceilings on large-scale ones. Comprehensive experiments on four public real-world datasets validate an average 5% improvement in key metrics over state-of-the-art baselines.

preprint2026arXiv

Edge Truncation Effect Suppression of Ultrawideband Phased Arrays for Radar Application

This letter presents a novel, effective method to suppress the edge truncation effect of ultrawideband tightly coupled dipole linear arrays. To restrain the edge truncation effect within an ultrawideband operating band, a new type of T-shaped metal strip with a resistor is further loaded on the array edges apart from extending the length of the overlapping patches. Besides, the excitation phase of the elements at the array edges is optimized. Full-wave simulation results show that the active standing wave standing ratio of the 2 x 16 tightly coupled dipole linear arrays using the proposed method is significantly optimized to less than 3.5 within a 5:1 [(1.2 to 6) GHz] bandwidth, while scanning up to +/-60° in the E-plane. The effectiveness of the proposed method is experimentally verified by a 2 x 16 linear array prototype.

preprint2026arXiv

Robust Multimodal Recommendation via Graph Retrieval-Enhanced Modality Completion

Multimodal data plays a critical role in web-based recommendation systems, where information from diverse modalities such as vision and text enhances representation learning. However, real-world multimodal datasets often suffer from modality incompleteness due to sensor failures, annotation scarcity, or privacy constraints, which substantially degrade model performance and reliability. One effective solution to address this issue is modality completion, which reconstructs missing features to provide modality-complete graphs for downstream tasks. Given a query node with missing multimodal features, existing modality completion methods typically infer information from the node itself or its neighbors to reconstruct the missing modality. However, these methods may overlook semantically relevant context in the graph, which contains valuable cues that are non-trivial to capture through simple methods like neighborhood aggregation. In this work, we propose GRE-MC, a Graph Retrieval-Enhanced Modality Completion framework, to overcome these limitations. By introducing a modality-aware subgraph retrieval mechanism, GRE-MC selects semantically relevant subgraphs from the entire graph, providing richer contextual information for completing missing modalities. Subsequently, a graph transformer jointly encodes the query node and the retrieved subgraph via global attention to complete the missing features, while a learnable sparse-routing codebook regularizes latent embeddings into compact bases for improved robustness. Extensive experiments on multimodal recommendation benchmarks demonstrate that GRE-MC consistently outperforms state-of-the-art methods, validating the effectiveness of subgraph retrieval and joint-encoding graph transformer for robust modality completion.

preprint2026arXiv

Study of Class-Incremental Radio Frequency Fingerprint Recognition Without Storing Exemplars

The rapid proliferation of wireless devices makes robust identity authentication essential. Radio Frequency Fingerprinting (RFF) exploits device-specific, hard-to-forge physical-layer impairments for identification, and is promising for IoT and unmanned systems. In practice, however, new devices continuously join deployed systems while per-class training data are limited. Conventional static training and naive replay of stored exemplars are impractical due to growing class cardinality, storage cost, and privacy concerns. We propose an exemplar-free class-incremental learning framework tailored to RFF recognition. Starting from a pretrained feature extractor, we freeze the backbone during incremental stages and train only a classifier together with lightweight Adapter modules that perform small task-specific feature adjustments. For each class we fit a diagonal Gaussian Mixture Model (GMM) to the backbone features and sample pseudo-features from these fitted distributions to rehearse past classes without storing raw signals. To improve robustness under few-shot conditions we introduce a time-domain random-masking augmentation and adopt a multi-teacher distillation scheme to compress stage-wise Adapters into a single inference Adapter, trading off accuracy and runtime efficiency. We evaluate the method on large, self-collected ADS-B datasets: the backbone is pretrained on 2,175 classes and incremental experiments are run on a disjoint set of 669 classes with multiple rounds and step sizes. Against several representative baselines, our approach consistently yields higher average accuracy and lower forgetting, while using substantially less storage and avoiding raw-data retention. The proposed pipeline is reproducible and provides a practical, low-storage solution for RFF deployment in resource- and privacy-constrained environments.

preprint2026arXiv

UniBiDex: A Unified Teleoperation Framework for Robotic Bimanual Dexterous Manipulation

We present UniBiDex a unified teleoperation framework for robotic bimanual dexterous manipulation that supports both VRbased and leaderfollower input modalities UniBiDex enables realtime contactrich dualarm teleoperation by integrating heterogeneous input devices into a shared control stack with consistent kinematic treatment and safety guarantees The framework employs nullspace control to optimize bimanual configurations ensuring smooth collisionfree and singularityaware motion across tasks We validate UniBiDex on a longhorizon kitchentidying task involving five sequential manipulation subtasks demonstrating higher task success rates smoother trajectories and improved robustness compared to strong baselines By releasing all hardware and software components as opensource we aim to lower the barrier to collecting largescale highquality human demonstration datasets and accelerate progress in robot learning.

preprint2024arXiv

MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering

Graph Neural Networks (GNNs) have recently been utilized to build Collaborative Filtering (CF) models to predict user preferences based on historical user-item interactions. However, there is relatively little understanding of how GNN-based CF models relate to some traditional Network Representation Learning (NRL) approaches. In this paper, we show the equivalence between some state-of-the-art GNN-based CF models and a traditional 1-layer NRL model based on context encoding. Based on a Markov process that trades off two types of distances, we present Markov Graph Diffusion Collaborative Filtering (MGDCF) to generalize some state-of-the-art GNN-based CF models. Instead of considering the GNN as a trainable black box that propagates learnable user/item vertex embeddings, we treat GNNs as an untrainable Markov process that can construct constant context features of vertices for a traditional NRL model that encodes context features with a fully-connected layer. Such simplification can help us to better understand how GNNs benefit CF models. Especially, it helps us realize that ranking losses play crucial roles in GNN-based CF tasks. With our proposed simple yet powerful ranking loss InfoBPR, the NRL model can still perform well without the context features constructed by GNNs. We conduct experiments to perform detailed analysis on MGDCF.

preprint2024arXiv

On the maximal and minimal degree components of the cocenter of the cyclotomic KLR algebras

Let $\mathscr{R}_α^Λ$ be the cyclotomic KLR algebra associated to a symmetrizable Kac-Moody Lie algebra $\mathfrak{g}$ and polynomials $\{Q_{ij}(u,v)\}_{i,j\in I}$. Shan, Varagnolo and Vasserot show that, when the ground field $K$ has characteristic $0$, the degree $d$ component of the cocenter $Tr(\mathscr{R}_α^Λ)$ is nonzero only if $0\leq d\leq d_{Λ,α}$. In this paper we show that this holds true for arbitrary ground field $K$, arbitrary $\mathfrak{g}$ and arbitrary polynomials $\{Q_{ij}(u,v)\}_{i,j\in I}$. We generalize our earlier results on the $K$-linear generators of $Tr(\mathscr{R}_α^Λ), Tr(\mathscr{R}_α^Λ)_0, Tr(\mathscr{R}_α^Λ)_{d_{Λ,α}}$ to arbitrary ground field $K$. Moreover, we show that the dimension of the degree $0$ component $Tr(\mathscr{R}_α^Λ)_0$ is always equal to $\dim V(Λ)_{Λ-α}$, where $V(Λ)$ is the integrable highest weight $U(\mathfrak{g})$-module with highest weight $Λ$, and we obtain a basis for $Tr(\mathscr{R}_α^Λ)_0$.

preprint2022arXiv

A Broad and General Sequential Sampling Scheme

In this paper, we propose a broad and general sequential sampling scheme, which incorporates four different types of sampling procedures: i) the classic Anscombe-Chow-Robbins purely sequential sampling procedure; ii) the ordinary accelerated sequential sampling procedure; iii) the relatively new k-at-a-time purely sequential sampling procedure; iv) the new k-at-a-time improved accelerated sequential sampling procedure. The first-order and second-order properties of this general sequential sampling scheme are fully investigated with two illustrations on minimum risk point estimation for the mean of a normal distribution and on bounded variance point estimation for the location parameter of a negative exponential distribution, respectively. We also provide extensive computational simulation studies and real data analyses for each illustration.

preprint2022arXiv

Afterpulse measurement of JUNO 20-inch PMTs

In this article we present the large photo-multiplier tube (PMT) afterpulse measurement results of Jiangmen Underground Neutrino Observatory (JUNO) experiment. Totally 11 dynode-PMTs (R12860) from Hamamatsu company and 150 micro-channel plate PMTs (MCP-PMTs, GDB-6201) from NNVT company were tested, an afterpulse model is built according to the afterpulse time distribution and probability of occurrence for these two types of PMTs. The average ratio between the total afterpulse charge with the delay between 0.5 $μ$ s and 20 $μ$ s to the primary pulse charge is 5.6%(13.2%) for the tested MCP-PMTs (dynode-PMTs). JUNO experiment will deploy 20,012 20-inch PMTs, and this study will benefit the detector simulation, event reconstruction and data analysis of JUNO experiment.

preprint2022arXiv

An efficient semismooth Newton-AMG-based inexact primal-dual algorithm for generalized transport problems

This work is concerned with the efficient optimization method for solving a large class of optimal mass transport problems. An inexact primal-dual algorithm is presented from the time discretization of a proper dynamical system, and by using the tool of Lyapunov function, the global (super-)linear convergence rate is established for function residual and feasibility violation. The proposed algorithm contains an inner problem that possesses strong semismoothness property and motivates the use of the semismooth Newton iteration. By exploring the hidden structure of the problem itself, the linear system arising from the Newton iteration is transferred equivalently into a graph Laplacian system, for which a robust algebraic multigrid method is proposed and also analyzed via the famous Xu--Zikatanov identity. Finally, numerical experiments are provided to validate the efficiency of our method.

preprint2022arXiv

GRecX: An Efficient and Unified Benchmark for GNN-based Recommendation

In this paper, we present GRecX, an open-source TensorFlow framework for benchmarking GNN-based recommendation models in an efficient and unified way. GRecX consists of core libraries for building GNN-based recommendation benchmarks, as well as the implementations of popular GNN-based recommendation models. The core libraries provide essential components for building efficient and unified benchmarks, including FastMetrics (efficient metrics computation libraries), VectorSearch (efficient similarity search libraries for dense vectors), BatchEval (efficient mini-batch evaluation libraries), and DataManager (unified dataset management libraries). Especially, to provide a unified benchmark for the fair comparison of different complex GNN-based recommendation models, we design a new metric GRMF-X and integrate it into the FastMetrics component. Based on a TensorFlow GNN library tf_geometric, GRecX carefully implements a variety of popular GNN-based recommendation models. We carefully implement these baseline models to reproduce the performance reported in the literature, and our implementations are usually more efficient and friendly. In conclusion, GRecX enables uses to train and benchmark GNN-based recommendation baselines in an efficient and unified way. We conduct experiments with GRecX, and the experimental results show that GRecX allows us to train and benchmark GNN-based recommendation baselines in an efficient and unified way. The source code of GRecX is available at https://github.com/maenzhier/GRecX.

preprint2022arXiv

Guided Bug Crush: Assist Manual GUI Testing of Android Apps via Hint Moves

Mobile apps are indispensable for people's daily life. Complementing with automated GUI testing, manual testing is the last line of defence for app quality. However, the repeated actions and easily missing of functionalities make manual testing time-consuming and inefficient. Inspired by the game candy crush with flashy candies as hint moves for players, we propose an approach named NaviDroid for navigating testers via highlighted next operations for more effective and efficient testing. Within NaviDroid, we construct an enriched state transition graph with the triggering actions as the edges for two involved states. Based on it, we utilize the dynamic programming algorithm to plan the exploration path, and augment the GUI with visualized hints for testers to quickly explore untested activities and avoid duplicate explorations. The automated experiments demonstrate the high coverage and efficient path planning of NaviDroid and a user study further confirms its usefulness. The NaviDroid can help us develop more robust software that works in more mission-critical settings, not only by performing more thorough testing with the same effort that has been put in before, but also by integrating these techniques into different parts of development pipeline.

preprint2022arXiv

Mass Testing and Characterization of 20-inch PMTs for JUNO

Main goal of the JUNO experiment is to determine the neutrino mass ordering using a 20kt liquid-scintillator detector. Its key feature is an excellent energy resolution of at least 3 % at 1 MeV, for which its instruments need to meet a certain quality and thus have to be fully characterized. More than 20,000 20-inch PMTs have been received and assessed by JUNO after a detailed testing program which began in 2017 and elapsed for about four years. Based on this mass characterization and a set of specific requirements, a good quality of all accepted PMTs could be ascertained. This paper presents the performed testing procedure with the designed testing systems as well as the statistical characteristics of all 20-inch PMTs intended to be used in the JUNO experiment, covering more than fifteen performance parameters including the photocathode uniformity. This constitutes the largest sample of 20-inch PMTs ever produced and studied in detail to date, i.e. 15,000 of the newly developed 20-inch MCP-PMTs from Northern Night Vision Technology Co. (NNVT) and 5,000 of dynode PMTs from Hamamatsu Photonics K. K.(HPK).

preprint2022arXiv

New conforming finite element divdiv complexes in three dimensions

In this paper, the first family of conforming finite element divdiv complexes on cuboid grids in three dimensions is constructed. Besides, a new family of conforming finite element divdiv complexes with enhanced smoothness on tetrahedral grids is presented. These complexes are exact in the sense that the range of each discrete map is the kernel space of the succeeding one.

preprint2022arXiv

Nighthawk: Fully Automated Localizing UI Display Issues via Visual Understanding

Graphical User Interface (GUI) provides a visual bridge between a software application and end users, through which they can interact with each other. With the upgrading of mobile devices and the development of aesthetics, the visual effects of the GUI are more and more attracting, and users pay more attention to the accessibility and usability of applications. However, such GUI complexity posts a great challenge to the GUI implementation. According to our pilot study of crowdtesting bug reports, display issues such as text overlap, component occlusion, missing image always occur during GUI rendering on different devices due to the software or hardware compatibility. They negatively influence the app usability, resulting in poor user experience. To detect these issues, we propose a fully automated approach, Nighthawk, based on deep learning for modelling visual information of the GUI screenshot. Nighthawk can detect GUIs with display issues and also locate the detailed region of the issue in the given GUI for guiding developers to fix the bug. At the same time, training the model needs a large amount of labeled buggy screenshots, which requires considerable manual effort to prepare them. We therefore propose a heuristic-based training data auto-generation method to automatically generate the labeled training data. The evaluation demonstrates that our Nighthawk can achieve average 0.84 precision and 0.84 recall in detecting UI display issues, average 0.59 AP and 0.60 AR in localizing these issues. We also evaluate Nighthawk with popular Android apps on Google Play and F-Droid, and successfully uncover 151 previously-undetected UI display issues with 75 of them being confirmed or fixed so far.

preprint2022arXiv

Non-neglectable entropy effect on sintering of supported nanoparticles

Sintering refers to particle coalescence by heat, which has been known as a thermal phenomenon involving all aspects of natural science for centuries. It is particularly important in heterogeneous catalysis because normally sintering results in deactivation of the catalysts. In previous studies, the enthalpy contribution was considered to be dominant in sintering and the entropy effect is generally considered neglectable. However, we unambiguously demonstrate in this work that entropy could prevail over the enthalpy contribution to dominate the sintering behavior of supported nanoparticles (NPs) by designed experiments and improved theoretical framework. Using in situ Cs-corrected environmental scanning transmission electron microscopy and synchrotron-based ambient pressure X-ray photoelectron spectroscopy, we observe the unprecedent entropy-driven phenomenon that supported NPs reversibly redisperse upon heating and sinter upon cooling in three systems (Pd-CeO2, Cu-TiO2, Ag-TiO2). We quantitatively show that the configurational entropy of highly dispersed ad-atoms is large enough to reverse their sintering tendency at the elevated temperature. This work reshapes the basic understanding of sintering at the nanoscale and opens the door for various de-novo designs of thermodynamically stable nanocatalysts.

preprint2022arXiv

Novel total hip surgery robotic system based on self-localization and optical measurement

This paper presents the development and experimental evaluation of a surgical robotic system for total hip arthroplasty (THA). Although existing robotic systems used in joint replacement surgery have achieved some progresses, the robot arm must be situated accurately at the target position during operation, which depends significantly on the experience of the surgeon. In addition, handheld acetabulum reamers typically exhibit uneven strength and grinding file. Moreover, the lack of techniques to real-time measure femoral neck length may lead to poor outcomes. To tackle these challenges, we propose a real-time traceable optical positioning strategy to reduce unnecessary manual adjustments to the robotic arm during surgery, an end-effector system to stabilise grinding, and an optical probe to provide real-time measurement of the femoral neck length and other parameters used to choose the proper prosthesis. The lengths of the lower limbs are measured as the prosthesis is installed. The experimental evaluation results show that, based on its accuracy, execution ability, and robustness, the proposed surgical robotic system is feasible for THA.

preprint2022arXiv

On the center conjecture for the cyclotomic KLR algebras

The center conjecture for the cyclotomic KLR algebras $R_β^Λ$ asserts that the center of $R_β^Λ$ consists of symmetric elements in its KLR $x$ and $e(ν)$ generators. In this paper we show that this conjecture is equivalent to the injectivity of some natural map $\barι_β^{Λ,i}$ from the cocenter of $R_β^Λ$ to the cocenter of $R_β^{Λ+Λ_i}$ for all $i\in I$ and $Λ\in P^+$. We prove that the map $\barι_β^{Λ,i}$ is given by multiplication with a center element $z(i,β)\in R_β^{Λ+Λ_i}$ and we explicitly calculate the element $z(i,β)$ in terms of the KLR $x$ and $e(ν)$ generators. We present an explicit monomial basis for certain bi-weight spaces of the defining ideal of $R_β^Λ$ and of $R_β^Λ$. For $β=\sum_{j=1}^nα_{i_j}$ with $α_{i_1},\cdots, α_{i_n}$ pairwise distinct, we construct an explicit monomial basis of $R_β^Λ$, prove the map $\barι_β^{Λ,i}$ is injective and thus verify the center conjecture for these $R_β^Λ$.

preprint2022arXiv

On the seminormal bases and dual seminormal bases of the cyclotomic Hecke algebras of type $G(\ell,1,n)$

This paper studies the seminormal bases $\{f_{\mathfrak{s}\mathfrak{t}}\}$ and the dual seminormal bases $\{g_{\mathfrak{s}\mathfrak{t}}\}$ of the non-degenerate and the degenerate cyclotomic Hecke algebras ${H}_{\ell,n}$ of type $G(\ell,1,n)$. We present some explicit formulae for the constants $α_{\mathfrak{s}\mathfrak{t}}:=g_{\mathfrak{s}\mathfrak{t}}/f_{\mathfrak{s}\mathfrak{t}}\in K^\times$ in terms of the $γ$-coefficients $\{γ_{\mathfrak{u}}, γ'_{\mathfrak{u}}\}$ of $H_{\ell,n}$. In particular, we answer a question of Mathas on the rationality of square roots of some quotients of products of $γ$-coefficients. We obtain some explicit formulae for the expansion of each seminormal bases of $H_{\ell,n-1}$ as a linear combination of the seminormal bases of $H_{\ell,n}$ under the natural inclusion $H_{\ell,n-1}\hookrightarrow H_{\ell,n}$.

preprint2022arXiv

Partially discontinuous nodal finite elements for $H(\mathrm{curl})$ and $H(\mathrm{div})$

We investigate discretization of $H(\mathrm{curl})$ and $H(\mathrm{div})$ in two and three space dimensions by partially discontinuous nodal finite elements, i.e., vector-valued Lagrange finite elements with discontinuity in certain directions. These spaces can be implemented as a combination of continuous and discontinuous Lagrange elements and fit in de~Rham complexes. We construct well-conditioned nodal bases.

preprint2022arXiv

Real-time Hyper-Dimensional Reconfiguration at the Edge using Hardware Accelerators

In this paper we present Hyper-Dimensional Reconfigurable Analytics at the Tactical Edge (HyDRATE) using low-SWaP embedded hardware that can perform real-time reconfiguration at the edge leveraging non-MAC (free of floating-point MultiplyACcumulate operations) deep neural nets (DNN) combined with hyperdimensional (HD) computing accelerators. We describe the algorithm, trained quantized model generation, and simulated performance of a feature extractor free of multiply-accumulates feeding a hyperdimensional logic-based classifier. Then we show how performance increases with the number of hyperdimensions. We describe the realized low-SWaP FPGA hardware and embedded software system compared to traditional DNNs and detail the implemented hardware accelerators. We discuss the measured system latency and power, noise robustness due to use of learnable quantization and HD computing, actual versus simulated system performance for a video activity classification task and demonstration of reconfiguration on this same dataset. We show that reconfigurability in the field is achieved by retraining only the feed-forward HD classifier without gradient descent backpropagation (gradient-free), using few-shot learning of new classes at the edge. Initial work performed used LRCN DNN and is currently extended to use Two-stream DNN with improved performance.

preprint2022arXiv

Theoretical analysis of the extended cyclic reduction algorithm

The extended cyclic reduction algorithm developed by Swarztrauber in 1974 was used to solve the block-tridiagonal linear system. The paper fills in the gap of theoretical results concerning the zeros of matrix polynomial $B_{i}^{(r)}$ with respect to a tridiagonal matrix which are computed by Newton's method in the extended cyclic reduction algorithm. Meanwhile, the forward error analysis of the extended cyclic reduction algorithm for solving the block-tridiagonal system is studied. To achieve the two aims, the critical point is to find out that the zeros of matrix polynomial $B_{i}^{(r)}$ are eigenvalues of a principal submatrix of the coefficient matrix.

preprint2021arXiv

A Spurious-Free Characteristic Mode Formulation Based on Surface Integral Equation for Patch Antenna Structures

Conventional surface integral equation (SIE)-based characteristic mode formulation for the patch antenna structure with a finite substrate is susceptible to the spurious (nonphysical) modes due to the dielectric part. To avoid the contamination of spurious modes, we propose a novel generalized eigenvalue formulation based on the electric field integral equation coupled Poggio-Miller-Chang-Harrington-Wu-Tsai (EFIE-PMCHWT) equation. In this formulation, the real and imaginary parts of the exterior integral operators are chosen to construct the finalized weighting matrices, to connect radiated power of the characteristic current. Compared with other SIE-based methods, this equation doesn't need additional post-processing since it can effectively avoid spurious modes. Numerical results compared with the volume-surface integral equation (VSIE) are investigated to validate the accuracy.

preprint2021arXiv

Conforming finite element DIVDIV complexes and the application for the linearized Einstein-Bianchi system

This paper presents the first family of conforming finite element divdiv complexes on tetrahedral grids in three dimensions. In these complexes, finite element spaces of $H(\text{divdiv},Ω;\mathbb{S})$ are from a current preprint [Chen and Huang, arXiv: 2007.12399, 2020] while finite element spaces of both $H(\text{symcurl},Ω;\mathbb{T})$ and $H^1(Ω;\mathbb{R}^3)$ are newly constructed here. It is proved that these finite element complexes are exact. As a result, they can be used to discretize the linearized Einstein-Bianchi system within the dual formulation.

preprint2021arXiv

Efficient Graph Deep Learning in TensorFlow with tf_geometric

We introduce tf_geometric, an efficient and friendly library for graph deep learning, which is compatible with both TensorFlow 1.x and 2.x. tf_geometric provides kernel libraries for building Graph Neural Networks (GNNs) as well as implementations of popular GNNs. The kernel libraries consist of infrastructures for building efficient GNNs, including graph data structures, graph map-reduce framework, graph mini-batch strategy, etc. These infrastructures enable tf_geometric to support single-graph computation, multi-graph computation, graph mini-batch, distributed training, etc.; therefore, tf_geometric can be used for a variety of graph deep learning tasks, such as transductive node classification, inductive node classification, link prediction, and graph classification. Based on the kernel libraries, tf_geometric implements a variety of popular GNN models for different tasks. To facilitate the implementation of GNNs, tf_geometric also provides some other libraries for dataset management, graph sampling, etc. Different from existing popular GNN libraries, tf_geometric provides not only Object-Oriented Programming (OOP) APIs, but also Functional APIs, which enable tf_geometric to handle advanced graph deep learning tasks such as graph meta-learning. The APIs of tf_geometric are friendly, and they are suitable for both beginners and experts. In this paper, we first present an overview of tf_geometric's framework. Then, we conduct experiments on some benchmark datasets and report the performance of several popular GNN models implemented by tf_geometric.

preprint2021arXiv

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

preprint2020arXiv

Asymptotic expansions of eigenvalues by both the Crouzeix-Raviart and enriched Crouzeix-Raviart elements

Asymptotic expansions are derived for eigenvalues produced by both the Crouzeix-Raviart element and the enriched Crouzeix--Raviart element. The expansions are optimal in the sense that extrapolation eigenvalues based on them admit a fourth order convergence provided that exact eigenfunctions are smooth enough. The major challenge in establishing the expansions comes from the fact that the canonical interpolation of both nonconforming elements lacks a crucial superclose property, and the nonconformity of both elements. The main idea is to employ the relation between the lowest-order mixed Raviart--Thomas element and the two nonconforming elements, and consequently make use of the superclose property of the canonical interpolation of the lowest-order mixed Raviart--Thomas element. To overcome the difficulty caused by the nonconformity, the commuting property of the canonical interpolation operators of both nonconforming elements is further used, which turns the consistency error problem into an interpolation error problem. Then, a series of new results are obtained to show the final expansions.

preprint2020arXiv

Bayes' Theorem under Conditional Independence

In this article we provide a substantial discussion on the statistical concept of conditional independence, which is not routinely mentioned in most elementary statistics and mathematical statistics textbooks. Under the assumption of conditional independence, an extended version of Bayes' Theorem is then proposed with illustrations from both hypothetical and real-world examples of disease diagnosis.

preprint2020arXiv

Feasibility and physics potential of detecting $^8$B solar neutrinos at JUNO

The Jiangmen Underground Neutrino Observatory~(JUNO) features a 20~kt multi-purpose underground liquid scintillator sphere as its main detector. Some of JUNO's features make it an excellent experiment for $^8$B solar neutrino measurements, such as its low-energy threshold, its high energy resolution compared to water Cherenkov detectors, and its much large target mass compared to previous liquid scintillator detectors. In this paper we present a comprehensive assessment of JUNO's potential for detecting $^8$B solar neutrinos via the neutrino-electron elastic scattering process. A reduced 2~MeV threshold on the recoil electron energy is found to be achievable assuming the intrinsic radioactive background $^{238}$U and $^{232}$Th in the liquid scintillator can be controlled to 10$^{-17}$~g/g. With ten years of data taking, about 60,000 signal and 30,000 background events are expected. This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter, which will shed new light on the tension between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework. If $Δm^{2}_{21}=4.8\times10^{-5}~(7.5\times10^{-5})$~eV$^{2}$, JUNO can provide evidence of neutrino oscillation in the Earth at the about 3$σ$~(2$σ$) level by measuring the non-zero signal rate variation with respect to the solar zenith angle. Moveover, JUNO can simultaneously measure $Δm^2_{21}$ using $^8$B solar neutrinos to a precision of 20\% or better depending on the central value and to sub-percent precision using reactor antineutrinos. A comparison of these two measurements from the same detector will help elucidate the current tension between the value of $Δm^2_{21}$ reported by solar neutrino experiments and the KamLAND experiment.

preprint2020arXiv

Finite Element Methods For Interface Problems On Local Anisotropic Fitting Mixed Meshes

A simple and efficient interface-fitted mesh generation algorithm is developed in this paper. This algorithm can produce a local anisotropic fitting mixed mesh which consists of both triangles and quadrilaterals near the interface. A new finite element method is proposed for second order elliptic interface problems based on the resulting mesh. Optimal approximation capabilities on anisotropic elements are proved in both the $H^1$ and $L^2$ norms. The discrete system is usually ill-conditioned due to anisotropic and small elements near the interface. Thereupon, a multigrid method is presented to handle this issue. The convergence rate of the multigrid method is shown to be optimal with respect to both the coefficient jump ratio and mesh size. Numerical experiments are presented to demonstrate the theoretical results.

preprint2020arXiv

Hyperfine Structure and Coherent Dynamics of Rare Earth Spins Explored with Electron-Nuclear Double Resonance at Sub-Kelvin Temperatures

An experimental platform of ultralow-temperature pulsed ENDOR (electron-nuclear double resonance) spectroscopy is constructed for the bulk materials. Coherent property of the coupled electron and nuclear spins of the rare-earth (RE) dopants in a crystal (143Nd3+:Y2SiO5) is investigated from 100 mK to 6 K. At the lowest working temperatures, two-pulse-echo coherence time exceeding 2 ms and 40 ms are achieved for the electron and nuclear spins, while the electronic Zeeman and hyperfine population lifetimes are more than 15 s and 10 min. With the aid of the near-unity electron spin polarization at 100 mK, the complete hyperfine level structure with 16 energy levels is measured using ENDOR technique without the assistance of the reconstructed spin Hamiltonian. These results demonstrate the suitability of the deeply cooled paramagnetic RE-doped solids for memory components aimed for quantum communication and quantum computation. The developed experimental platform is expected to be a powerful tool for paramagnetic materials from various research fields.

preprint2020arXiv

Jantzen coefficients and radical filtrations for generalized Verma modules

In this paper we give a sum formula for the radical filtration of generalized Verma modules in any (possibly singular) blocks of parabolic BGG category which can be viewed as a generalization of Jantzen sum formula for Verma modules in the usual BGG category $\mathcal{O}$. Combined with Jantzen coefficients, we determine the radical filtrations for all basic generalized Verma modules. The proof makes use of the graded version of parabolic BGG category. Explicit formulae for the graded decomposition numbers and inverse graded decomposition numbers of generalized Verma modules in any (possibly singular) integral blocks of the parabolic BGG category are also given.

preprint2020arXiv

Owl Eyes: Spotting UI Display Issues via Visual Understanding

Graphical User Interface (GUI) provides a visual bridge between a software application and end users, through which they can interact with each other. With the development of technology and aesthetics, the visual effects of the GUI are more and more attracting. However, such GUI complexity posts a great challenge to the GUI implementation. According to our pilot study of crowdtesting bug reports, display issues such as text overlap, blurred screen, missing image always occur during GUI rendering on different devices due to the software or hardware compatibility. They negatively influence the app usability, resulting in poor user experience. To detect these issues, we propose a novel approach, OwlEye, based on deep learning for modelling visual information of the GUI screenshot. Therefore, OwlEye can detect GUIs with display issues and also locate the detailed region of the issue in the given GUI for guiding developers to fix the bug. We manually construct a large-scale labelled dataset with 4,470 GUI screenshots with UI display issues and develop a heuristics-based data augmentation method for boosting the performance of our OwlEye. The evaluation demonstrates that our OwlEye can achieve 85% precision and 84% recall in detecting UI display issues, and 90% accuracy in localizing these issues. We also evaluate OwlEye with popular Android apps on Google Play and F-droid, and successfully uncover 57 previously-undetected UI display issues with 26 of them being confirmed or fixed so far.

preprint2020arXiv

PEL-BERT: A Joint Model for Protocol Entity Linking

Pre-trained models such as BERT are widely used in NLP tasks and are fine-tuned to improve the performance of various NLP tasks consistently. Nevertheless, the fine-tuned BERT model trained on our protocol corpus still has a weak performance on the Entity Linking (EL) task. In this paper, we propose a model that joints a fine-tuned language model with an RFC Domain Model. Firstly, we design a Protocol Knowledge Base as the guideline for protocol EL. Secondly, we propose a novel model, PEL-BERT, to link named entities in protocols to categories in Protocol Knowledge Base. Finally, we conduct a comprehensive study on the performance of pre-trained language models on descriptive texts and abstract concepts. Experimental results demonstrate that our model achieves state-of-the-art performance in EL on our annotated dataset, outperforming all the baselines.

preprint2020arXiv

Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation

The Legendre spectral Galerkin method of self-adjoint second order elliptic equations usually results in a linear system with a dense and ill-conditioned coefficient matrix. In this paper, the linear system is solved by a preconditioned conjugate gradient (PCG) method where the preconditioner $M$ is constructed by approximating the variable coefficients with a ($T$+1)-term Legendre series in each direction to a desired accuracy. A feature of the proposed PCG method is that the iteration step increases slightly with the size of the resulting matrix when reaching a certain approximation accuracy. The efficiency of the method lies in that the system with the preconditioner $M$ is approximately solved by a one-step iterative method based on the ILU(0) factorization. The ILU(0) factorization of $M\in \mathbb{R}^{(N-1)^d\times(N-1)^d}$ can be computed using $\mathcal{O}(T^{2d} N^d)$ operations, and the number of nonzeros in the factorization factors is of $\mathcal{O}(T^{d} N^d)$, $d=1,2,3$. To further speed up the PCG method, an algorithm is developed for fast matrix-vector multiplications by the resulting matrix of Legendre-Galerkin spectral discretization, without the need to explicitly form it. The complexity of the fast matrix-vector multiplications is of $\mathcal{O}(N^d (\log N)^2)$. As a result, the PCG method has a $\mathcal{O}(N^d (\log N)^2)$ total complexity for a $d$ dimensional domain with $(N-1)^d$ unknows, $d=1,2,3$. Numerical examples are given to demonstrate the efficiency of proposed preconditioners and the algorithm for fast matrix-vector multiplications.

preprint2020arXiv

TAO Conceptual Design Report: A Precision Measurement of the Reactor Antineutrino Spectrum with Sub-percent Energy Resolution

The Taishan Antineutrino Observatory (TAO, also known as JUNO-TAO) is a satellite experiment of the Jiangmen Underground Neutrino Observatory (JUNO). A ton-level liquid scintillator detector will be placed at about 30 m from a core of the Taishan Nuclear Power Plant. The reactor antineutrino spectrum will be measured with sub-percent energy resolution, to provide a reference spectrum for future reactor neutrino experiments, and to provide a benchmark measurement to test nuclear databases. A spherical acrylic vessel containing 2.8 ton gadolinium-doped liquid scintillator will be viewed by 10 m^2 Silicon Photomultipliers (SiPMs) of >50% photon detection efficiency with almost full coverage. The photoelectron yield is about 4500 per MeV, an order higher than any existing large-scale liquid scintillator detectors. The detector operates at -50 degree C to lower the dark noise of SiPMs to an acceptable level. The detector will measure about 2000 reactor antineutrinos per day, and is designed to be well shielded from cosmogenic backgrounds and ambient radioactivities to have about 10% background-to-signal ratio. The experiment is expected to start operation in 2022.

preprint2020arXiv

Unexpectedly strong diamagnetism and superparamagnetism of aromatic peptides due to self-assembling and cations

There is a considerable amount of work that shows the biomagnetism of organic components without ferromagnetic components at the molecular level, but it is of great challenge to cover the giant gap of biomagnetism between their experimental and theoretical results. Here, we show that the diamagnetism of an aromatic peptide, the AYFFF, is greatly enhanced for about 11 times by self-assembling, reaching two orders of magnitude higher than the mass susceptibility of pure water. Moreover, the AYFFF self-assemblies further mixed with ZnCl2 solution of sufficiently high concentrations display superparamagnetism, with the mass susceptibility reaching more than two orders of magnitude higher than the absolute value of pure water, which may approach the mass susceptibility of ferromagnetism. The aromatic rings in the peptide molecules and the cations are the keys to such a strong diamagnetism and superparamagnetism of aromatic peptides.

preprint2020arXiv

VGPN: Voice-Guided Pointing Robot Navigation for Humans

Pointing gestures are widely used in robot navigationapproaches nowadays. However, most approaches only use point-ing gestures, and these have two major limitations. Firstly, they need to recognize pointing gestures all the time, which leads to long processing time and significant system overheads. Secondly,the user's pointing direction may not be very accurate, so the robot may go to an undesired place. To relieve these limitations,we propose a voice-guided pointing robot navigation approach named VGPN, and implement its prototype on a wheeled robot,TurtleBot 2. VGPN recognizes a pointing gesture only if voice information is insufficient for navigation. VGPN also uses voice information as a supplementary channel to help determine the target position of the user's pointing gesture. In the evaluation,we compare VGPN to the pointing-only navigation approach. The results show that VGPN effectively reduces the processing timecost when pointing gesture is unnecessary, and improves the usersatisfaction with navigation accuracy.

preprint2019arXiv

Synthesizing the Quantum Spin Hall Phase for Ultracold Atoms in Bichromatic Chiral Optical Ladders

Realizing the topological bands of helical states poses a challenge in studying ultracold atomic gases. Motivated by the recent experimental success in realizing chiral optical ladders, here we present a scheme for synthesizing topological quantum matter, especially the quantum spin Hall phase, in the chiral optical ladders. More precisely, we first establish the synthetic pseudo-spin-orbit coupling and Zeeman splitting in the chiral ladders. We analyze the band structure of the ladders exposed to the bichromatic optical potentials and report the existence of quantum spin Hall phase. We further identify a rich phase diagram of the bichromatic chiral ladders, illustrating that our proposal features a large space of system parameters exhibiting a variety of quantum phase transitions. Our scheme can be readily implemented in the existing experimental systems and hence provides a new method to engineer the sophisticated topological bands for cold atomic gases.

preprint2016arXiv

A Penalized Crouzeix-Raviart Element Method for Second Order Elliptic Eigenvalue Problems

In this paper we propose a penalized Crouzeix-Raviart element method for eigenvalue problems of second order elliptic operators. The key idea is to add a penalty term to tune the local approximation property and the global continuity property of the discrete eigenfunctions. The feature of this method is that by adjusting the penalty parameter, the resulted discrete eigenvalues can be in a state of "chaos", and consequently a large portion of them can be reliable and approximate the exact ones with high accuracy. Furthermore, we design an algorithm to select such a quasi-optimal penalty parameter. Finally, we provide numerical tests to demonstrate the performance of the proposed method.

preprint2016arXiv

A unified analysis of quasi-optimal convergence for adaptive mixed finite element methods

In this paper, we present a unified analysis of both convergence and optimality of adaptive mixed finite element methods for a class of problems when the finite element spaces and corresponding a posteriori error estimates under consideration satisfy five hypotheses. We prove that these five conditions are sufficient for convergence and optimality of the adaptive algorithms under consideration. The main ingredient for the analysis is a new method to analyze both discrete reliability and quasi-orthogonality. This new method arises from an appropriate and natural choice of the norms for both the discrete displacement and stress spaces, namely, a mesh-dependent discrete $H^1$ norm for the former and a $L^2$ norm for the latter, and a newly defined projection operator from the discrete stress space on the coarser mesh onto the discrete divergence free space on the finer mesh. As applications, we prove these five hypotheses for the Raviart--Thomas and Brezzi--Douglas--Marini elements of the Poisson and Stokes problems in both 2D and 3D.

preprint2016arXiv

Conforming mixed triangular prism and nonconforming mixed tetrahedral elements for the linear elasticity problem

We propose two families of mixed finite elements for solving the classical Hellinger-Reissner mixed problem of the linear elasticity equations in three dimensions. First, a family of conforming mixed triangular prism elements is constructed by product of elements on triangular meshes and elements in one dimension. The well-posedness is established for all elements with $k\geq1$, which are of $k+1$ order convergence for both the stress and displacement. Besides, a family of reduced stress spaces is proposed by dropping the degrees of polynomial functions associated with faces. As a result, the lowest order conforming mixed triangular prism element has 93 plus 33 degrees of freedom on each element. Second, we construct a new family of nonconforming mixed tetrahedral elements. The shape function spaces of our stress spaces are different from those of the elements in literature.

preprint2016arXiv

Fast Auxiliary Space Preconditioner for Linear Elasticity in Mixed Form

A block diagonal preconditioner with the minimal residual method and a block triangular preconditioner with the generalized minimal residual method are developed for Hu-Zhang mixed finite element methods of linear elasticity. They are based on a new stability result of the saddle point system in mesh-dependent norms. The mesh-dependent norm for the stress corresponds to the mass matrix which is easy to invert while the displacement it is spectral equivalent to Schur complement. A fast auxiliary space preconditioner based on the $H^1$ conforming linear element of the linear elasticity problem is then designed for solving the Schur complement. For both diagonal and triangular preconditioners, it is proved that the conditioning numbers of the preconditioned systems are bounded above by a constant independent of both the crucial Lamé constant and the mesh-size. Numerical examples are presented to support theoretical results. As byproducts, a new stabilized low order mixed finite element method is proposed and analyzed and superconvergence results of Hu-Zhang element are obtained.

preprint2016arXiv

On involutions in Weyl groups

Let $(W,S)$ be a Coxeter system and $\ast$ be an automorphism of $W$ with order $\leq 2$ such that $s^{\ast}\in S$ for any $s\in S$. Let $I_{\ast}$ be the set of twisted involutions relative to $\ast$ in $W$. In this paper we consider the case when $\ast=\text{id}$ and study the braid $I_\ast$-transformations between the reduced $I_\ast$-expressions of involutions. If $W$ is the Weyl group of type $B_n$ or $D_n$, we explicitly describe a finite set of basic braid $I_\ast$-transformations for all $n$ simultaneously, and show that any two reduced $I_\ast$-expressions for a given involution can be transformed into each other through a series of basic braid $I_\ast$-transformations. In both cases, these basic braid $I_\ast$-transformations consist of the usual basic braid transformations plus some natural "right end transformations" and plus exactly one extra transformation. The main result generalizes our previous work for the Weyl group of type $A_{n}$.

preprint2016arXiv

Quiver Schur algebras for linear quivers

We define a graded quasi-hereditary covering for the cyclotomic quiver Hecke algebras $\mathcal{R}^Λ_n$ of type $A$ when $e=0$ (the linear quiver) or $e\ge n$. We show that these algebras are quasi-hereditary graded cellular algebras by giving explicit homogeneous bases for them. When $e=0$ we show that the KLR grading on the quiver Hecke algebras is compatible with the gradings on parabolic category $\mathcal{O}$ previously introduced in the works of Beilinson, Ginzburg and Soergel and Backelin. As a consequence, we show that when $e=0$ our graded Schur algebras are Koszul over field of characteristic zero. Finally, we give an LLT-like algorithm for computing the graded decomposition numbers of the quiver Schur algebras in characteristic zero when $e=0$.

preprint2016arXiv

Stabilized mixed finite element methods for linear elasticity on simplicial grids in $\mathbb{R}^{n}$

In this paper, we design two classes of stabilized mixed finite element methods for linear elasticity on simplicial grids. In the first class of elements, we use $\boldsymbol{H}(\mathbf{div}, Ω; \mathbb{S})$-$P_k$ and $\boldsymbol{L}^2(Ω; \mathbb{R}^n)$-$P_{k-1}$ to approximate the stress and displacement spaces, respectively, for $1\leq k\leq n$, and employ a stabilization technique in terms of the jump of the discrete displacement over the faces of the triangulation under consideration; in the second class of elements, we use $\boldsymbol{H}_0^1(Ω; \mathbb{R}^n)$-$P_{k}$ to approximate the displacement space for $1\leq k\leq n$, and adopt the stabilization technique suggested by Brezzi, Fortin, and Marini. We establish the discrete inf-sup conditions, and consequently present the a priori error analysis for them. The main ingredient for the analysis is two special interpolation operators, which can be constructed using a crucial $\boldsymbol{H}(\mathbf{div})$ bubble function space of polynomials on each element. The feature of these methods is the low number of global degrees of freedom in the lowest order case. We present some numerical results to demonstrate the theoretical estimates.

preprint2015arXiv

A family of conforming mixed finite elements for linear elasticity on triangular grids

This paper presents a family of mixed finite elements on triangular grids for solving the classical Hellinger-Reissner mixed problem of the elasticity equations. In these elements, the matrix-valued stress field is approximated by the full $C^0$-$P_k$ space enriched by $(k-1)$ $H(\d)$ edge bubble functions on each internal edge, while the displacement field by the full discontinuous $P_{k-1}$ vector-valued space, for the polynomial degree $k\ge 3$. The main challenge is to find the correct stress finite element space matching the full $C^{-1}$-$P_{k-1}$ displacement space. The discrete stability analysis for the inf-sup condition does not rely on the usual Fortin operator, which is difficult to construct. It is done by characterizing the divergence of local stress space which covers the $P_{k-1}$ space of displacement orthogonal to the local rigid-motion. The well-posedness condition and the optimal a priori error estimate are proved for this family of finite elements. Numerical tests are presented to confirm the theoretical results.

preprint2015arXiv

A new family of efficient conforming mixed finite elements on both rectangular and cuboid meshes for linear elasticity in the symmetric formulation

A new family of mixed finite elements is proposed for solving the classical Hellinger-Reissner mixed problem of the elasticity equations. For two dimensions, the normal stress of the matrix-valued stress field is approximated by an enriched Brezzi-Douglas-Fortin-Marini element of order $k$, and the shear stress by the serendipity element of order $k$, the displacement field by an enriched discontinuous vector-valued $P_{k-1}$ element. The degrees of freedom on each element of the lowest order element, which is of first order, is $10$ plus $4$. For three dimensions, the normal stress is approximated by an enriched Raviart-Thomas element of order $k$, and each component of the shear stress by a product space of the serendipity element space of two variables and the space of polynomials of degree $\leq k-1$ with respect to the rest variable, the displacement field by an enriched discontinuous vector-valued $Q_{k-1}$ element. The degrees of freedom on each element of the lowest order element, which is of first order, is $21$ plus $6$. A family of reduced elements is also proposed by dropping some interior bubble functions of the stress and employing the discontinuous vector-valued $P_{k-1}$ (resp. $Q_{k-1}$) element for the displacement field on each element. As a result the lowest order elements have $8$ plus $2$ and $18$ plus $3$ degrees of freedom on each element for two and three dimensions, respectively. The well-posedness condition and the optimal a priori error estimate are proved for this family of finite elements. Numerical tests are presented to confirm the theoretical results.

preprint2015arXiv

Candidate source of flux noise in SQUIDs: adsorbed oxygen molecules

A major obstacle to using SQUIDs as qubits is flux noise. We propose that the heretofore mysterious spins producing flux noise could be $O_2$ molecules adsorbed on the surface. Using density functional theory calculations, we find that an $O_2$ molecule adsorbed on an α-alumina surface has a magnetic moment of ~1.8 μB. When the spin is oriented perpendicular to the axis of the O-O bond, the barrier to spin rotations is about 10 mK. Monte Carlo simulations of ferromagnetically coupled, anisotropic XY spins on a square lattice find 1/f magnetization noise, consistent with flux noise in Al SQUIDs.

preprint2015arXiv

Capacity of the Adini element for biharmonic equations

This paper is devoted to the convergence analysis of the Adini element scheme for the fourth order problem in arbitrary dimension. We prove that, the Adini element scheme is $\mathcal{O}(h^2)$ order convergent in energy norm provided the exact solution is in $H^4$, and the convergence rate in $L^2$ norm can not be nontrivially higher than $\mathcal{O}(h^2)$ order. Numerical verifications are presented.

preprint2015arXiv

Chern Half Metals: A New Class of Topological Materials to Realize the Quantum Anomalous Hall Effect

The search of new topological insulators that demonstrate the quantum anomalous Hall effect (QAHE) is a cutting-edge research topic in condensed matter physics and materials science. So far, the QAHE has been observed only in Cr-doped (Bi,Sb)2Te3 at extremely low temperature. Therefore, it is important to find new materials with large topological band gap and high thermal stability for the realization of the QAHE. Based on first-principles and tight-binding model calculations, we discovered a new class of topological phase$-$Chern half metal which manifests the QAHE in one spin channel while is metallic in the other spin channel$-$in Co or Rh deposited graphene. Meanwhile, these systems have large perpendicular magnetic anisotropy energies of 5.3 and 11.5 meV, necessary for the observation of the QAHE at reasonably high temperature.

preprint2015arXiv

Finite element approximations of symmetric tensors on simplicial grids in Rn: the high order case

The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements where the discrete stress space is the space of $H(\d,Ω; \mathbb {S})$---$P_{k+1}$ tensors whose divergence is a $P_{k-1}$ polynomial on each triangle for $k\geq 2$.Such a two dimensional family was extended, by Arnold, Awanou and Winther, to a three dimensional family of mixed elements where the discrete stress space is the space of $H(\d,Ω; \mathbb {S})$---$P_{k+2}$ tensors, whose divergence is a $P_{k-1}$ polynomial on each tetrahedron for $k\geq 2$. In this paper, we are able to construct, in a unified fashion, mixed finite element methods with symmetric stress approximations on an arbitrary simplex in $\mathbb{R}^n$ for any space dimension. On the contrary, the discrete stress space here is the space of $H(\d,Ω;\mathbb {S})$---$P_k$ tensors, and the discrete displacement space here is the space of $L^2(Ω; \mathbb{R}^n)$---$P_{k-1}$ vectors for $k\geq n+1$. These finite element spaces are defined with respect to an arbitrary simplicial triangulation of the domain, and can be regarded as extensions to any dimension of those in two and three dimensions by Hu and Zhang.

preprint2015arXiv

Finite element approximations of symmetric tensors on simplicial grids in Rn: the lower order case

In this paper, we construct, in a unified fashion, lower order finite element subspaces of spaces of symmetric tensors with square-integrable divergence on a domain in any dimension. These subspaces are essentially the symmetric H(div)-Pk (1=<k<=n) tensor spaces, enriched, for each n-1 dimensional simplex, by (n+1)n/2 H(div)-Pn+1 bubble functions when 1=< k<= n-1, and by (n-1)n/2 H(div)-P n+1 bubble functions when k= n. These spaces can be used to approximate the symmetric matrix field in a mixed formulation problem where the other variable is approximated by discontinuous piecewise Pk-1 polynomials. This in particular leads to first order mixed elements on simplicial grids with total degrees of freedom per element $18$ plus $3$ in 2D, 48 plus 6 in 3D. The previous record of the degrees of freedom of first order mixed elements is, 21 plus 3 in 2D, and 156 plus 6 in 3D, on simplicial grids. We also derive, in a unified way and without using any tools like differential forms, a family of auxiliary mixed finite elements in any dimension. One example in this family is the Raviart-Thomas elements in one dimension, the second example is the mixed finite elements for linear elasticity in two dimensions due to Arnold and Winther, the third example is the mixed finite elements for linear elasticity in three dimensions due to Arnold, Awanou and Winther.

preprint2015arXiv

Locally Non-rigid Registration for Mobile HDR Photography

Image registration for stack-based HDR photography is challenging. If not properly accounted for, camera motion and scene changes result in artifacts in the composite image. Unfortunately, existing methods to address this problem are either accurate, but too slow for mobile devices, or fast, but prone to failing. We propose a method that fills this void: our approach is extremely fast---under 700ms on a commercial tablet for a pair of 5MP images---and prevents the artifacts that arise from insufficient registration quality.

preprint2015arXiv

Magnetic anisotropy of FePt nanoparticles

We carry out a systematic theoretical investigation of Magneto Crystalline Anisotropy (MCA) of L10 FePt clusters with alternating Fe and Pt planes along the (001) direction. We calculate the structural relaxation and magnetic moment of each cluster by using ab initio spin-polarized density functional theory (DFT), and the MCA with both spin-polarized DFT (including spin-orbit coupling self-consistently) and the torque method. We find that the MCA of any composite structure of a given size is enhanced with respect to that of the same-sized pure Pt or pure Fe cluster as well as to that of any pair of Fe and Pt atoms in bulk L10 FePt. This enhancement results from the hybridization we observe between the 3d orbital of the Fe atoms and the 5d orbital of their Pt neighbors. This hybridization, however, affects the electronic properties of the component atoms in significantly different ways. While it somewhat increases the spin moment of the Fe atoms, it has little effect on their orbital moment; at the same time, it greatly increases both the spin and orbital moment of the Pt atoms. Given the fact that the spin-orbit coupling (SOC) constant of Pt is about 7 times greater than that of Fe, this Fe-induced jump in the orbital moment of the Pt atoms produces the increase in MCA of the composite structures over that of their pure counterparts. That any composite structure exhibits higher MCA than bulk L10 FePt results from the lower coordination of Pt atoms in the cluster, whether Fe or Pt predominates within it. We also find that bipyramidal clusters whose central layer is Pt have higher MCA than their same-sized counterparts whose central layer is Fe. This results from the fact that Pt atoms in such configurations are coordinated with more Fe atoms than in the latter. By thus participating in more instances of hybridization, they contribute higher orbital moments to the overall MCA of the unit.

preprint2015arXiv

Neutrino Physics with JUNO

The Jiangmen Underground Neutrino Observatory (JUNO), a 20 kton multi-purpose underground liquid scintillator detector, was proposed with the determination of the neutrino mass hierarchy as a primary physics goal. It is also capable of observing neutrinos from terrestrial and extra-terrestrial sources, including supernova burst neutrinos, diffuse supernova neutrino background, geoneutrinos, atmospheric neutrinos, solar neutrinos, as well as exotic searches such as nucleon decays, dark matter, sterile neutrinos, etc. We present the physics motivations and the anticipated performance of the JUNO detector for various proposed measurements. By detecting reactor antineutrinos from two power plants at 53-km distance, JUNO will determine the neutrino mass hierarchy at a 3-4 sigma significance with six years of running. The measurement of antineutrino spectrum will also lead to the precise determination of three out of the six oscillation parameters to an accuracy of better than 1\%. Neutrino burst from a typical core-collapse supernova at 10 kpc would lead to ~5000 inverse-beta-decay events and ~2000 all-flavor neutrino-proton elastic scattering events in JUNO. Detection of DSNB would provide valuable information on the cosmic star-formation rate and the average core-collapsed neutrino energy spectrum. Geo-neutrinos can be detected in JUNO with a rate of ~400 events per year, significantly improving the statistics of existing geoneutrino samples. The JUNO detector is sensitive to several exotic searches, e.g. proton decay via the $p\to K^++\barν$ decay channel. The JUNO detector will provide a unique facility to address many outstanding crucial questions in particle and astrophysics. It holds the great potential for further advancing our quest to understanding the fundamental properties of neutrinos, one of the building blocks of our Universe.

preprint2015arXiv

On involutions in symmetric groups and a conjecture of Lusztig

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally endowed with a module structure of the Hecke algebra of $(W, S)$. Lusztig has conjectured that this module is isomorphic to the right ideal of the Hecke algebra (with Hecke parameter $u^2$) associated to $(W,S)$ generated by the element $X_{\emptyset}:=\sum_{w^\ast=w}u^{-\ell(w)}T_w$. In this paper we prove this conjecture in the case when $\ast=\text{id}$ and $W$ is the symmetric group on $n$ letters.

preprint2015arXiv

Phosphorene: Synthesis, Scale-up, and Quantitative Optical Spectroscopy

Phosphorene, a two-dimensional (2D) monolayer of black phosphorus, has attracted considerable theoretical interest, although the experimental realization of monolayer, bilayer, and few-layer flakes has been a significant challenge. Here we systematically survey conditions for liquid exfoliation to achieve the first large-scale production of monolayer, bilayer, and few-layer phosphorus, with exfoliation demonstrated at the 10-gram scale. We describe a rapid approach for quantifying the thickness of 2D phosphorus and show that monolayer and few-layer flakes produced by our approach are crystalline and unoxidized, while air exposure leads to rapid oxidation and the production of acid. With large quantities of 2D phosphorus now available, we perform the first quantitative measurements of the material's absorption edge-which is nearly identical to the material's band gap under our experimental conditions-as a function of flake thickness. Our interpretation of the absorbance spectrum relies on an analytical method introduced in this work, allowing the accurate determination of the absorption edge in polydisperse samples of quantum-confined semiconductors. Using this method, we found that the band gap of black phosphorus increased from 0.33 +/- 0.02 eV in bulk to 1.88 +/- 0.24 eV in bilayers, a range that is larger than any other 2D material. In addition, we quantified a higher-energy optical transition (VB-1 to CB), which changes from 2.0 eV in bulk to 3.23 eV in bilayers. This work describes several methods for producing and analyzing 2D phosphorus while also yielding a class of 2D materials with unprecedented optoelectronic properties.

preprint2015arXiv

Superconvergence of both two and three dimensional rectangular Morley elements for biharmonic equations

In the present paper, superconvergence of second order, after an appropriate postprocessing, is achieved for both the two and three dimensional first order rectangular Morley elements of biharmonic equations. The analysis is dependent on superconvergence of second order for the consistency error and a corrected canonical interpolation operator, which help to establish supercloseness of second order for the corrected canonical interpolation. Then the final superconvergence follows a standard postprocessing. For first order nonconforming finite element methods of both two and three dimensional fourth order elliptic problems, it is the first time that full superconvergence of second order is obtained without an extra boundary condition imposed on exact solutions. It is also the first time that superconvergence is established for nonconforming finite element methods of three dimensional fourth order elliptic problems. Numerical results are presented to demonstrate the theoretical results.

preprint2014arXiv

Control of the magnetism and magnetic anisotropy of a single-molecule magnet with an electric field

Through systematics density functional calculations, the mechanism of the substrate induced spin reorientation transition in FePc/O-Cu(110) was explained in terms of charge transfer and rearrangement of Fe-d orbitals. Moreover, we found giant magnetoelectric effects in this system, manifested by the sensitive dependences of its magnetic moment and magnetic anisotropy energy on external electric field. In particular, the direction of magnetization of FePc/O-Cu(110) is switchable between in-plane and perpendicular axes, simply by applying an external electric field of 0.5 eV/Å along the surface normal.

preprint2014arXiv

Giant magnetic anisotropy of transition-metal dimers on defected graphene

Continuous miniaturization of magnetic units in spintronics and quantum computing devices inspires efforts to search for magnetic nanostructures with large magnetic anisotropy energy (MAE). Typical nanostructures including molecular magnets, magnetic nanoclusters and magnetic nanowires have MAEs of a few meV so their blocking temperature is mostly lower than 50 K. In this work, we demonstrated the feasibility of achieving giant MAE in systems with transition metal dimers on defected and decorated graphene, based on density functional theory calculations. In particular, either a Pt-Ir dimer on a single vacancy or an Os-Ru dimer on a nitrogen-decorated divacancy possesses an MAE larger than 60 meV and high structural stability. Interestingly, their magnetic anisotropy can be conveniently manipulated by using external electric field. These features make them good candidates for the use in room temperature spintronics and quantum computing devices.

preprint2014arXiv

Guaranteed Lower and upper bounds for eigenvalues of second order elliptic operators in any dimension

In this paper, a new method is proposed to produce guaranteed lower bounds for eigenvalues of general second order elliptic operators in any dimension. Unlike most methods in the literature, the proposed method only needs to solve one discrete eigenvalue problem but not involves any base or intermediate eigenvalue problems, and does not need any a priori information concerning exact eigenvalues either. Moreover, it just assumes basic regularity of exact eigenfunctions. This method is defined by a novel generalized Crouzeix-Raviart element which is proved to yield asymptotic lower bounds for eigenvalues of general second order elliptic operators, and a simple post-processing method. As a byproduct, a simple and cheap method is also proposed to obtain guaranteed upper bounds for eigenvalues, which is based on generalized Crouzeix-Raviart element approximate eigenfunctions, an averaging interpolation from the the generalized Crouzeix-Raviart element space to the conforming linear element space, and an usual Rayleigh-Ritz procedure. The ingredients for the analysis consist of a crucial projection property of the canonical interpolation operator of the generalized Crouzeix-Raviart element, explicitly computable constants for two interpolation operators. Numerics are provided to demonstrate the theoretical results.

preprint2014arXiv

Lower bounds of eigenvalues of the biharmonic operators by the rectangular Morley element methods

In this paper, we analyze the lower bound property of the discrete eigenvalues by the rectangular Morley elements of the biharmonic operators in both two and three dimensions. The analysis relies on an identity for the errors of eigenvalues. We explore a refined property of the canonical interpolation operators and use it to analyze the key term in this identity. In particular, we show that such a term is of higher order for two dimensions, and is negative and of second order for three dimensions, which causes a main difficulty. To overcome it, we propose a novel decomposition of the first term in the aforementioned identity. Finally, we establish a saturation condition to show that the discrete eigenvalues are smaller than the exact ones. We present some numerical results to demonstrate the theoretical results.

preprint2014arXiv

Magnetism and Magnetic Anisotropy of Transition Metal-Phthalocyanine Molecules

Search for single-molecule magnets (SMMs) with high blocking temperature (TB) is urgent for practical applications in magnetic recording, molecular spintronics and quantum computing. Based on the First-principles calculations, magnetic anisotropy energies (MAE) of the transition metal-Phthalocyanine (TM-Pc) molecules are investigated and the mechanism that determines the MAE of TM-Pc molecules is established. In particular, colossal MAE > 100 meV can be obtained by adding an Os atom on RuPc and OsPc, so these molecules may offer ultrahigh thermal stability in devices.

preprint2014arXiv

Molecular-Scale Hydrophilicity Induced by Solute: Molecular-thick Charged Pancakes of Aqueous Salt Solution on Hydrophobic Carbon-based Surfaces

We directly observed molecular-thick aqueous salt-solution pancakes on a hydrophobic graphite surface under ambient conditions employing atomic force microscopy. This observation indicates the unexpected molecular-scale hydrophilicity of the salt solution on graphite surfaces, which is different from the macroscopic wetting property of a droplet standing on the graphite surface. Interestingly, the pancakes spontaneously displayed strong positively charged behavior. Theoretical studies showed that the formation of such positively charged pancakes is attributed to cation-π interactions between Na+ ions in the aqueous solution and aromatic rings on the graphite surface, promoting the adsorption of water molecules together with cations onto the graphite surface; i.e., Na+ ions as a medium adsorbed to the graphite surface through cation-π interactions on one side while at the same time bonding to water molecules through hydration interaction on the other side at a molecular scale. These findings suggest that actual interactions regarding carbon-based graphitic surfaces including those of graphene, carbon nanotubes, and biochar may be significantly different from existing theory and they provide new insight into the control of surface wettability, interactions and related physical, chemical and biological processes.

preprint2014arXiv

Runge-Kutta Central Discontinuous Galerkin BGK Method for the Navier-Stokes Equations

In this paper, we propose a Runge-Kutta (RK) central discontinuous Galerkin (CDG) gas-kinetic BGK method for the Navier-Stokes equations. The proposed method is based on the CDG method defined on two sets of overlapping meshes to avoid discontinuous solutions at cell interfaces, as well as the gas-kinetic BGK model to evaluate fluxes for both convection and diffusion terms. Redundant representation of the numerical solution in the CDG method offers great convenience in the design of gas-kinetic BGK fluxes. Specifically, the evaluation of fluxes at cell interfaces of one set of computational mesh is right inside the cells of the staggered mesh, hence the corresponding particle distribution function for flux evaluation is much simpler than that in existing gas-kinetic BGK methods. As a central scheme, the proposed CDG-BGK has doubled the memory requirement as the corresponding DG scheme; on the other hand, {for the convection part,} the CFL time step constraint of the CDG method for numerical stability is relatively large compared with that for the DG method. Numerical boundary conditions have to be treated with special care. Numerical examples for 1D and 2D viscous flow simulations are presented to validate the accuracy and robustness of the proposed RK CDG-BGK method.

preprint2014arXiv

Seminormal forms and cyclotomic quiver Hecke algebras of type $A$

This paper shows that the cyclotomic quiver Hecke algebras of type $A$, and the gradings on these algebras, are intimately related to the classical seminormal forms. We start by classifying all seminormal bases and then give an explicit "integral" closed formula for the Gram determinants of the Specht modules in terms of the combinatorics which utilizes the KLR gradings. We then use seminormal forms to give a deformation of the KLR algebras of type $A$. This makes it possible to study the cyclotomic quiver Hecke algebras in terms of the semisimple representation theory and seminormal forms. As an application we construct a new distinguished graded cellular basis of the cyclotomic KLR algebras of type $A$.

preprint2014arXiv

Superconvergence of both the Crouzeix-Raviart and Morley elements

In this paper, a new method is proposed to prove the superconvergence of both the Crouzeix-Raviart and Morley elements. The main idea is to fully employ equivalences with the first order Raviart-Thomas element and the first order Hellan-Herrmann-Johnson element, respectively. In this way, some special conformity of discrete stresses is explored and superconvergence of mixed elements can be used to analyze superconvergence of nonconforming elements. Finally, a half order superconvergence by postprocessing is proved for both nonconforming elements.

preprint2014arXiv

Superconvergence of simple conforming mixed finite elements for linear elasticity on rectangular grids in any space dimension

This paper is to prove superconvergence of a family of simple conforming mixed finite elements of first orderfor the linear elasticity problem with the Hellinger--Reissner variational formulation. The analysis is based on three main ingredients: a new interpolation operator, a new expansion method, and a new iterative argument for superconvergence analysis.

preprint2014arXiv

The enriched Crouzeix-Raviart elements are equivalent to the Raviart-Thomas elements

For both the Poisson model problem and the Stokes problem in any dimension, this paper proves that the enriched Crouzeix-Raviart elements are actually identical to the first order Raviart-Thomas elements in the sense that they produce the same discrete stresses. This result improves the previous result in literature which, for two dimensions, states that the piecewise constant projection of the stress by the first order Raviart-Thomas element is equal to that by the Crouzeix-Raviart element. For the eigenvalue problem of Laplace operator, this paper proves that the error of the enriched Crouzeix-Raviart element is equivalent to that of the Raviart-Thomas element up to higher order terms.

preprint2013arXiv

Asymmetric transportation induced by thermal noise at the nanoscale

Based on a simple model, we theoretically show that asymmetric transportation is possible in nanoscale systems experiencing thermal noise without the presence of external fluctuations. The key to this theoretical advance is that the correlation lengths of the thermal fluctuations become significantly long for nanoscale systems. This differs from macroscopic systems in which the thermal noises are usually treated as white noise. Our observation does not violate the second law of thermodynamics, since at nanoscale, extra energy is required to keep the asymmetric structure against thermal fluctuations.

preprint2013arXiv

Convergence and optimality of the adaptive Morley element method

This paper is devoted to the convergence and optimality analysis of the adaptive Morley element method for the fourth order elliptic problem. A new technique is developed to establish a quasi-orthogonality which is crucial for the convergence analysis of the adaptive nonconforming method. By introducing a new parameter-dependent error estimator and further establishing a discrete reliability property, sharp convergence and optimality estimates are then fully proved for the fourth order elliptic problem.

preprint2013arXiv

Convergence and optimality of the adaptive nonconforming linear element method for the Stokes problem

In this paper, we analyze the convergence and optimality of a standard adaptive nonconforming linear element method for the Stokes problem. After establishing a special quasi--orthogonality property for both the velocity and the pressure in this saddle point problem, we introduce a new prolongation operator to carry through the discrete reliability analysis for the error estimator. We then use a specially defined interpolation operator to prove that, up to oscillation, the error can be bounded by the approximation error within a properly defined nonlinear approximate class. Finally, by introducing a new parameter-dependent error estimator, we prove the convergence and optimality estimates.

preprint2013arXiv

Intrinsic Spin Seebeck Effect in Au/YIG

The acute magnetic proximity effects in Pt/YIG compromise the suitability of Pt as a spin current detector. We show that Au/YIG, with no anomalous Hall effect and a negligible magnetoresistance, allows the measurements of the intrinsic spin Seebeck effect with a magnitude much smaller than that in Pt/YIG. The experiment results are consistent with the spin-polarized density-functional calculations for Pt with a sizable and Au with a negligible magnetic moment near the interface with YIG.

preprint2013arXiv

Learning Belief Networks in Domains with Recursively Embedded Pseudo Independent Submodels

A pseudo independent (PI) model is a probabilistic domain model (PDM) where proper subsets of a set of collectively dependent variables display marginal independence. PI models cannot be learned correctly by many algorithms that rely on a single link search. Earlier work on learning PI models has suggested a straightforward multi-link search algorithm. However, when a domain contains recursively embedded PI submodels, it may escape the detection of such an algorithm. In this paper, we propose an improved algorithm that ensures the learning of all embedded PI submodels whose sizes are upper bounded by a predetermined parameter. We show that this improved learning capability only increases the complexity slightly beyond that of the previous algorithm. The performance of the new algorithm is demonstrated through experiment.

preprint2013arXiv

Nonconforming finite element methods on quadrilateral meshes

It is well-known that it is comparatively difficult to design nonconforming finite elements on quadrilateral meshes by using Gauss-Legendre points on each edge of triangulations. One reason lies in that these degrees of freedom associated to these Gauss-Legendre points are not all linearly independent for usual expected polynomial spaces, which explains why only several lower order nonconforming quadrilateral finite elements can be found in literature. The present paper proposes two families of nonconforming finite elements of any odd order and one family of nonconforming finite elements of any even order on quadrilateral meshes. Degrees of freedom are given for these elements, which are proved to be well-defined for their corresponding shape function spaces in a unifying way. These elements generalize three lower order nonconforming finite elements on quadrilaterals to any order. In addition, these nonconforming finite element spaces are shown to be full spaces which is somehow not discussed for nonconforming finite elements in literature before.

preprint2013arXiv

The lower bound of the error estimate in the L2 norm for the Adini element of the biharmonic equation

This paper is devoted to the $L^2$ norm error estimate of the Adini element for the biharmonic equation. Surprisingly, a lower bound is established which proves that the $ L^2$ norm convergence rate can not be higher than that in the energy norm. This proves the conjecture of [Lascaux and Lesaint, Some nonconforming finite elements for the plate bending problem, RAIRO Anal. Numer. 9 (1975), pp. 9--53.] that the convergence rates in both $L^2$ and $H^1$ norms can not be higher than that in the energy norm for this element.

preprint2013arXiv

The Lower Bounds for Eigenvalues of Elliptic Operators --By Nonconforming Finite Element Methods

The aim of the paper is to introduce a new systematic method that can produce lower bounds for eigenvalues. The main idea is to use nonconforming finite element methods. The general conclusion herein is that if local approximation properties of nonconforming finite element spaces $V_h$ are better than global continuity properties of $V_h$, corresponding methods will produce lower bounds for eigenvalues. More precisely, under three conditions on continuity and approximation properties of nonconforming finite element spaces we first show abstract error estimates of approximate eigenvalues and eigenfunctions. Subsequently, we propose one more condition and prove that it is sufficient to guarantee nonconforming finite element methods to produce lower bounds for eigenvalues of symmetric elliptic operators. As one application, we show that this condition hold for most nonconforming elements in literature. As another important application, this condition provides a guidance to modify known nonconforming elements in literature and to propose new nonconforming elements. In fact, we enrich locally the Crouzeix-Raviart element such that the new element satisfies the condition; we propose a new nonconforming element for second order elliptic operators and prove that it will yield lower bounds for eigenvalues. Finally, we prove the saturation condition for most nonconforming elements.

preprint2013arXiv

The simplest mixed finite element method for linear elasticity in the symmetric formulation on $n$-rectangular grids

A family of mixed finite elements is proposed for solving the first order system of linear elasticity equations in any space dimension, where the stress field is approximated by symmetric finite element tensors. This family of elements has a perfect matching between the stress components and the displacement. The discrete spaces for the normal stress $σ_{ii}$, the shear stress $σ_{ij}$ and the displacement $u_i$ are $\operatorname{span}\{1,x_i\}$, $\operatorname{span}\{1,x_i,x_j\}$ and $\operatorname{span}\{1\}$, respectively, on rectangular grids. In particular, the definition remains the same for all space dimensions. As a result of these choices, the theoretical analysis is independent of the spatial dimension as well. In 1D, this element is nothing else but the 1D Raviart-Thomas element, which is the only conforming element in this family. In 2D and higher dimensions, they are new elements but of the minimal degrees of freedom. The total degrees of freedom per element is 2 plus 1 in 1D, 7 plus 2 in 2D, and 15 plus 3 in 3D. The previous record of the least degrees of freedom is, 13 plus 4 in 2D, and 54 plus 12 in 3D, on the rectangular grid. These elements are the simplest element for any space dimension. The well-posedness condition and the optimal a priori error estimate of the family of finite elements are proved for both pure displacement and traction problems. Numerical tests in 2D and 3D are presented to show a superiority of the new element over others, as a superconvergence is surprisingly exhibited.

preprint2012arXiv

Giant topological insulator gap in graphene with 5d adatoms

Two-dimensional topological insulators (2D TIs) have been proposed as platforms for many intriguing applications, ranging from spintronics to topological quantum information processing. Realizing this potential will likely be facilitated by the discovery of new, easily manufactured materials in this class. With this goal in mind we introduce a new framework for engineering a 2D TI by hybridizing graphene with impurity bands arising from heavy adatoms possessing partially filled d-shells, in particular osmium and iridium. First principles calculations predict that the gaps generated by this means exceed 0.2 eV over a broad range of adatom coverage; moreover, tuning of the Fermi level is not required to enter the TI state. The mechanism at work is expected to be rather general and may open the door to designing new TI phases in many materials.

preprint2012arXiv

SEAL: Spatio-Textual Similarity Search

Location-based services (LBS) have become more and more ubiquitous recently. Existing methods focus on finding relevant points-of-interest (POIs) based on users' locations and query keywords. Nowadays, modern LBS applications generate a new kind of spatio-textual data, regions-of-interest (ROIs), containing region-based spatial information and textual description, e.g., mobile user profiles with active regions and interest tags. To satisfy search requirements on ROIs, we study a new research problem, called spatio-textual similarity search: Given a set of ROIs and a query ROI, we find the similar ROIs by considering spatial overlap and textual similarity. Spatio-textual similarity search has many important applications, e.g., social marketing in location-aware social networks. It calls for an efficient search method to support large scales of spatio-textual data in LBS systems. To this end, we introduce a filter-and-verification framework to compute the answers. In the filter step, we generate signatures for the ROIs and the query, and utilize the signatures to generate candidates whose signatures are similar to that of the query. In the verification step, we verify the candidates and identify the final answers. To achieve high performance, we generate effective high-quality signatures, and devise efficient filtering algorithms as well as pruning techniques. Experimental results on real and synthetic datasets show that our method achieves high performance.

preprint2012arXiv

Symmetrizers and antisymmetrizers for the BMW algebra

Let $n\in\mathds{N}$ and $B_n(r,q)$ be the generic Birman-Murakami-Wenzl algebra with respect to indeterminants $r$ and $q$. It is known that $B_n(r,q)$ has two distinct linear representations generated by two central elements of $B_n(r,q)$ called the symmetrizer and antisymmetrizer of $B_n(r,q)$. These generate for $n\geq 3$ the only one dimensional two sided ideals of $B_n(r,q)$ and generalize the corresponding notion for Hecke algebras of type $A$. The main result in this paper explicitly determines the coefficients of these elements with respect to the graphical basis of $B_n(r,q)$.

preprint2011arXiv

Decomposition numbers for Hecke algebras of type $G(r,p,n)$: the $(ε,q)$-separated case

The paper studies the modular representation theory of the cyclotomic Hecke algebras of type $G(r,p,n)$ with $(\eps,q)$-separated parameters. We show that the decomposition numbers of these algebras are completely determined by the decomposition matrices of related cyclotomic Hecke algebras of type $G(s,1,m)$, where $1\le s\le r$ and $1\le m\le n$. Furthermore, the proof gives an explicit algorithm for computing these decomposition numbers. Consequently, in principle, the decomposition matrices of these algebras are now known in characteristic zero. In proving these results, we develop a Specht module theory for these algebras, explicitly construct their simple modules and introduce and study analogues of the cyclotomic Schur algebras of type $G(r,p,n)$ when the parameters are $(\eps,q)$-separated. The main results of the paper rest upon two Morita equivalences: the first reduces the calculation of all decomposition numbers to the case of the \textit{$l$-splittable decomposition numbers} and the second Morita equivalence allows us to compute these decomposition numbers using an analogue of the cyclotomic Schur algebras for the Hecke algebras of type $G(r,p,n)$.

preprint2011arXiv

Engineering a robust quantum spin Hall state in graphene via adatom deposition

The 2007 discovery of quantized conductance in HgTe quantum wells delivered the field of topological insulators (TIs) its first experimental confirmation. While many three-dimensional TIs have since been identified, HgTe remains the only known two-dimensional system in this class. Difficulty fabricating HgTe quantum wells has, moreover, hampered their widespread use. With the goal of breaking this logjam we provide a blueprint for stabilizing a robust TI state in a more readily available two-dimensional material---graphene. Using symmetry arguments, density functional theory, and tight-binding simulations, we predict that graphene endowed with certain heavy adatoms realizes a TI with substantial band gap. For indium and thallium, our most promising adatom candidates, a modest 6% coverage produces an estimated gap near 80K and 240K, respectively, which should be detectable in transport or spectroscopic measurements. Engineering such a robust topological phase in graphene could pave the way for a new generation of devices for spintronics, ultra-low-dissipation electronics and quantum information processing.

preprint2011arXiv

On a theorem of Lehrer and Zhang

Let $K$ be an arbitrary field of characteristic not equal to 2. Let $m, n\in\N$ and $V$ an $m$ dimensional orthogonal space over $K$. There is a right action of the Brauer algebra $\bb_n(m)$ on the $n$-tensor space $V^{\otimes n}$ which centralizes the left action of the orthogonal group $O(V)$. Recently G.I. Lehrer and R.B. Zhang defined certain quasi-idempotents $E_i$ in $\bb_n(m)$ (see (\ref{keydfn})) and proved that the annihilator of $V^{\otimes n}$ in $\bb_n(m)$ is always equal to the two-sided ideal generated by $E_{[(m+1)/2]}$ if $\ch K=0$ or $\ch K>2(m+1)$. In this paper we extend this theorem to arbitrary field $K$ with $\ch K\neq 2$ as conjectured by Lehrer and Zhang. As a byproduct, we discover a combinatorial identity which relates to the dimensions of Specht modules over symmetric groups of different sizes and a new integral basis for the annihilator of $V^{\otimes m+1}$ in $\bb_{m+1}(m)$.

preprint2010arXiv

Dual partially harmonic tensors and Brauer-Schur-Weyl duality

Let $V$ be a $2m$-dimensional symplectic vector space over an algebraically closed field $K$. Let $\mbb_n^{(f)}$ be the two-sided ideal of the Brauer algebra $\mbb_n(-2m)$ over $K$ generated by $e_1e_3... e_{2f-1}$, where $0\leq f\leq [n/2]$. Let $\mathcal{HT}_{f}^{\otimes n}$ be the subspace of partially harmonic tensors of valence $f$ in $V^{\otimes n}$. In this paper, we prove that $\dim\mathcal{HT}_f^{\otimes n}$ and $\dim\End_{KSp(V)}\Bigl(V^{\otimes n}/V^{\otimes n}\mbb_n^{(f)}\Bigr)$ are both independent of $K$, and the natural homomorphism from $\mbb_n(-2m)/\mbb_n^{(f)}$ to $\End_{KSp(V)}\Bigl(V^{\otimes n}/V^{\otimes n}\mbb_n^{(f)}\Bigr)$ is always surjective. We show that $\mathcal{HT}_{f}^{\otimes n}$ has a Weyl filtration and is isomorphic to the dual of $V^{\otimes n}\mbb_n^{(f)}/V^{\otimes n}\mbb_n^{(f+1)}$ as a $Sp(V)$-$(\mbb_n(-2m)/\mbb_n^{(f+1)})$-bimodule. We obtain a $Sp(V)$-$\mbb_n$-bimodules filtration of $V^{\otimes n}$ such that each successive quotient is isomorphic to some $\nabla(\lam)\otimes z_{g,\lam}\mbb_n$ with $\lam\vdash n-2g$, $\ell(\lam)\leq m$ and $0\leq g\leq [n/2]$, where $\nabla(\lam)$ is the co-Weyl module associated to $\lam$ and $z_{g,\lam}$ is an explicitly constructed maximal vector of weight $\lam$. As a byproduct, we show that each right $\mbb_n$-module $z_{g,\lam}\mbb_n$ is integrally defined and stable under base change.

preprint2010arXiv

Morita equivalences of cyclotomic Hecke algebras of type G(r,p,n)

We prove a Morita reduction theorem for the cyclotomic Hecke algebras H_{r,p,n}({q,Q})$ of type G(r,p,n). As a consequence, we show that computing the decomposition numbers of H_{r,p,n}(Q) reduces to computing the p'-splittable decomposition numbers of the cyclotomic Hecke algebras H_{r',p',n'}(Q'), where $1\le r'\le r$, $1\le n'\le n$, $ p'\mid p$ and where the parameters Q' are contained in a single $(ε,q)$-orbit and $ε$ is a primitive p'th root of unity.

preprint2010arXiv

On a generalization of Dipper--James--Murphy's Conjecture

Let $K$ be a field and $q\in K^{\times}$. Let $e$ be the multiplicative order of $q$; or 0 if $q$ is not a root of unity. Let $\bQ:=(q^{v_1},...,q^{v_r})$. Let ${K}_r(n)$ be the set of Kleshchev $r$-multipartitions with respect to $(e;\bQ)$. In this paper, we consider an extention of Dipper--James--Murphy's Conjecture to the Ariki--Koike algebra $H_{r,n}(q;\bQ)$ with $r>2$. We show that any $(\bQ,e)$-restricted $r$-multipartition of $n$ is a Kleshchev multipartition in ${K}_r(n)$; and if $e>1$, then any multi-core $\ulam=(\lam^{(1)},...,\lam^{(r)})$ in ${K}_r(n)$ is a $(\bQ,e)$-restricted $r$-multipartition. As a consequence, we show that if $e=0$ (i.e., $q$ is not a root of unity), then ${K}_r(n)$ coincides with the set of $(\bQ,e)$-restricted $r$-multipartitions of $n$ and also coincides with the set of ladder $r$-multipartitions of $n$.

preprint2008arXiv

Schur-Weyl duality for orthogonal groups

We prove Schur--Weyl duality between the Brauer algebra $\mathfrak{B}_n(m)$ and the orthogonal group $O_{m}(K)$ over an arbitrary infinite field $K$ of odd characteristic. If $m$ is even, we show that each connected component of the orthogonal monoid is a normal variety; this implies that the orthogonal Schur algebra associated to the identity component is a generalized Schur algebra. As an application of the main result, an explicit and characteristic-free description of the annihilator of $n$-tensor space $V^{\otimes n}$ in the Brauer algebra $mathfrak{B}_n(m)$ is also given.