Catalog footprint

What is connected

154works
67topics
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

154 published item(s)

preprint2026arXiv

PnP-Corrector: A Universal Correction Framework for Coupled Spatiotemporal Forecasting

Coupled spatiotemporal forecasting is important for predicting the future evolution of multiple interacting dynamical systems, such as in climate models. However, existing methods are severely constrained by the persistent bottleneck of compounding errors. In coupled systems, errors from each subsystem simulator propagate and amplify one another, a phenomenon we term Reciprocal Error Amplification, leading to a rapid collapse of long-range predictions. To address this challenge, we propose a universal framework called PnP-Corrector (Plug-and-Play Corrector). The core idea of our framework is to decouple the physical simulation from the error correction process: it freezes pre-trained physics simulation engines and exclusively trains a correction agent to proactively counteract the systematic biases emerging from the coupled system. Furthermore, we design an efficient predictive model architecture, DSLCast, to serve as the backbone of this framework. Extensive experiments demonstrate that our method significantly enhances the long-term stability and accuracy of coupled forecasting systems. For instance, in the challenging task of a 300-day global ocean-atmosphere coupled forecast, our PnP-Corrector framework reduces the prediction error of the baseline model by 29% and surpasses state-of-the-art models on several key metrics.

preprint2026arXiv

RoboAlign-R1: Distilled Multimodal Reward Alignment for Robot Video World Models

Existing robot video world models are typically trained with low-level objectives such as reconstruction and perceptual similarity, which are poorly aligned with the capabilities that matter most for robot decision making, including instruction following, manipulation success, and physical plausibility. They also suffer from error accumulation in long-horizon autoregressive prediction. We present RoboAlign-R1, a framework that combines reward-aligned post-training with stabilized long-horizon inference for robot video world models. We construct RobotWorldBench, a benchmark of 10,000 annotated video-instruction pairs collected from four robot data sources, and train a multimodal teacher judge, RoboAlign-Judge, to provide fine-grained six-dimensional evaluation of generated videos. We then distill the teacher into a lightweight student reward model for efficient reinforcement-learning-based post-training. To reduce long-horizon rollout drift, we further introduce Sliding Window Re-encoding (SWR), a training-free inference strategy that periodically refreshes the generation context. Under our in-domain evaluation protocol, RoboAlign-R1 improves the aggregate six-dimension score by 10.1% over the strongest baseline, including gains of 7.5% on Manipulation Accuracy and 4.6% on Instruction Following; these ranking improvements are further supported by an external VLM-based cross-check and a blinded human study. Meanwhile, SWR improves long-horizon prediction quality with only about 1% additional latency, yielding a 2.8% gain in SSIM and a 9.8% reduction in LPIPS. Together, these results show that reward-aligned post-training and stabilized long-horizon decoding improve task consistency, physical realism, and long-horizon prediction quality in robot video world models.

preprint2025arXiv

Bridging the Perception-Cognition Gap:Re-engineering SAM2 with Hilbert-Mamba for Robust VLM-based Medical Diagnosis

Recent studies suggest that Visual Language Models (VLMs) hold great potential for tasks such as automated medical diagnosis. However, processing complex three-dimensional (3D) multimodal medical images poses significant challenges - specifically, the effective integration of complementary information and the occasional oversight of subtle yet critical pathological features. To address these issues, we present a novel two-stage fusion framework termed Hilbert-VLM. This framework leverages the HilbertMed-SAM module for precise lesion segmentation, with the generated multimodal enhanced prompts then guiding the VLM toward accurate disease classification. Our key innovation lies in the systematic redesign of the Segment Anything Model 2 (SAM2) architecture: we incorporate Hilbert space-filling curves into the scanning mechanism of the Mamba State Space Model (SSM) to maximize the preservation of spatial locality in 3D data, a property critical for medical image analysis. We also introduce a novel Hilbert-Mamba Cross-Attention (HMCA) mechanism and a scale-aware decoder to capture fine-grained details. Meanwhile, the prompt enhancement module unifies segmentation masks and their corresponding textual attributes into an information-dense prompt to support VLM inference. Extensive experiments were conducted to validate the effectiveness of the Hilbert-VLM model. On the BraTS2021 segmentation benchmark, it achieves a Dice score of 82.35 percent, with a diagnostic classification accuracy (ACC) of 78.85 percent. These results demonstrate that the proposed model offers substantial potential to improve the accuracy and reliability of medical VLM-based analysis.

preprint2024arXiv

Possible Meissner effect near room temperature in copper-substituted lead apatite

With copper-substituted lead apatite below room temperature, we observe diamagnetic dc magnetization under magnetic field of 25 Oe with remarkable bifurcation between zero-field-cooling and field-cooling measurements, and under 200 Oe it changes to be paramagnetism. A glassy memory effect is found during cooling. Typical hysteresis loops for superconductors are detected below 250 K, along with an asymmetry between forward and backward sweep of magnetic field. Our experiment suggests at room temperature the Meissner effect is possibly present in this material.

preprint2024arXiv

Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation

The verification of linearizability -- a key correctness criterion for concurrent objects -- is based on trace refinement whose checking is PSPACE-complete. This paper suggests to use \emph{branching} bisimulation instead. Our approach is based on comparing an abstract specification in which object methods are executed atomically to a real object program. Exploiting divergence sensitivity, this also applies to progress properties such as lock-freedom. These results enable the use of \emph{polynomial-time} divergence-sensitive branching bisimulation checking techniques for verifying linearizability and progress. We conducted the experiment on concurrent lock-free stacks to validate the efficiency and effectiveness of our methods.

preprint2023arXiv

Room-Temperature Highly-Tunable Coercivity and Highly-Efficient Nonvolatile Multi-States Magnetization Switching by Small Current in Single 2D Ferromagnet Fe$_3$GaTe$_2$

Room-temperature electrically-tuned coercivity and nonvolatile multi-states magnetization switching is crucial for next-generation low-power 2D spintronics. However, most methods have limited ability to adjust the coercivity of ferromagnetic systems, and room-temperature electrically-driven magnetization switching shows high critical current density and high power dissipation. Here, highly-tunable coercivity and highly-efficient nonvolatile multi-states magnetization switching are achieved at room temperature in single-material based devices by 2D van der Waals itinerant ferromagnet Fe$_3$GaTe$_2$. The coercivity can be readily tuned up to ~98.06% at 300 K by a tiny in-plane electric field that is 2-5 orders of magnitude smaller than that of other ferromagnetic systems. Moreover, the critical current density and power dissipation for room-temperature magnetization switching in 2D Fe$_3$GaTe$_2$ are down to ~1.7E5 A cm$^{-2}$ and ~4E12 W m$^{-3}$, respectively. Such switching power dissipation is 2-6 orders of magnitude lower than that of other 2D ferromagnetic systems. Meanwhile, multi-states magnetization switching are presented by continuously controlling the current, which can dramatically enhance the information storage capacity and develop new computing methodology. This work opens the avenue for room-temperature electrical control of ferromagnetism and potential applications for vdW-integrated 2D spintronics.

preprint2023arXiv

Towards simultaneous coherent radiation in the visible and microwave bands with doped molecular crystals

Coherent sources exploiting the stimulated emission of non-equilibrium quantum systems, i.e. gain media, have proven indispensable for advancing fundamental research and engineering. The operating electromagnetic bands of such coherent sources have been continuously enriched for increasing demands.Nevertheless, for a single bench top coherent source, simultaneous generation of radiation in multiple bands, especially when the bands are widely separated, present formidable challenges with a single gain medium. Here, we propose a mechanism of simultaneously realizing the stimulated emission of radiation in the visible and microwave bands, i.e. lasing and masing actions, at ambient conditions by utilizing photoexcited singlet and triplet states of the pentacene molecules that are doped in p-terphenyl. The possibility is validated by the observed amplified spontaneous emission (ASE) at 645 nm with a narrow linewidth around 1 nm from the pentacene-doped p-terphenyl crystal used for masing at 1.45 GHz and consolidated by a 20 fold lower threshold of ASE compared to the reported masing threshold. The overall threshold of the pentacene-based multiband coherent source can be optimized by appropriate alignment of the pump-light polarization with the pentacene's transition dipole moment. Our work not only shows a great promise on immediate realization of multiband coherent sources but also establishes an intriguing solid-state platform for fundamental research of quantum optics in multiple frequency domains.

preprint2022arXiv

$β$-Divergence-Based Latent Factorization of Tensors model for QoS prediction

A nonnegative latent factorization of tensors (NLFT) model can well model the temporal pattern hidden in nonnegative quality-of-service (QoS) data for predicting the unobserved ones with high accuracy. However, existing NLFT models' objective function is based on Euclidean distance, which is only a special case of $β$-divergence. Hence, can we build a generalized NLFT model via adopting $β$-divergence to achieve prediction accuracy gain? To tackle this issue, this paper proposes a $β$-divergence-based NLFT model ($β$-NLFT). Its ideas are two-fold 1) building a learning objective with $β$-divergence to achieve higher prediction accuracy, and 2) implementing self-adaptation of hyper-parameters to improve practicability. Empirical studies on two dynamic QoS datasets demonstrate that compared with state-of-the-art models, the proposed $β$-NLFT model achieves the higher prediction accuracy for unobserved QoS data.

preprint2022arXiv

A note on time hierarchies for reasonable semantic classes without advice

We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let $\text{CTIME}(f(n))/{g(n)}$ denote the set of all languages decide by machines running in time $O(f(n))$ with advice of $g(n)$ bits in that model, if $\text{CTIME}(t(n))\subseteq \text{CTIME}(T(n))/{A(n)}$ then $\text{CTIME}(t(n))/a \subseteq \text{CTIME}(T(n))/{a+2^aA(n)}$ where $a$ is a constant integer.

preprint2022arXiv

A novel robot calibration method with plane constraint based on dial indicator

In pace with the electronic technology development and the production technology improvement, industrial robot Give Scope to the Advantage in social services and industrial production. However, due to long-term mechanical wear and structural deformation, the absolute positioning accuracy is low, which greatly hinders the development of manufacturing industry. Calibrating the kinematic parameters of the robot is an effective way to address it. However, the main measuring equipment such as laser trackers and coordinate measuring machines are expensive and need special personnel to operate. Additionally, in the measurement process, due to the influence of many environmental factors, measurement noises are generated, which will affect the calibration accuracy of the robot. Basing on these, we have done the following work: a) developing a robot calibration method based on plane constraint to simplify measurement steps; b) employing Square-root Culture Kalman Filter (SCKF) algorithm for reducing the influence of measurement noises; c) proposing a novel algorithm for identifying kinematic parameters based on SCKF algorithm and Levenberg Marquardt (LM) algorithm to achieve the high calibration accuracy; d) adopting the dial indicator as the measuring equipment for slashing costs. The enough experiments verify the effectiveness of the proposed calibration algorithm and experimental platform.

preprint2022arXiv

An Optimal Transport Approach to the Computation of the LM Rate

Mismatch capacity characterizes the highest information rate for a channel under a prescribed decoding metric, and is thus a highly relevant fundamental performance metric when dealing with many practically important communication scenarios. Compared with the frequently used generalized mutual information (GMI), the LM rate has been known as a tighter lower bound of the mismatch capacity. The computation of the LM rate, however, has been a difficult task, due to the fact that the LM rate involves a maximization over a function of the channel input, which becomes challenging as the input alphabet size grows, and direct numerical methods (e.g., interior point methods) suffer from intensive memory and computational resource requirements. Noting that the computation of the LM rate can also be formulated as an entropy-based optimization problem with constraints, in this work, we transform the task into an optimal transport (OT) problem with an extra constraint. This allows us to efficiently and accurately accomplish our task by using the well-known Sinkhorn algorithm. Indeed, only a few iterations are required for convergence, due to the fact that the formulated problem does not contain additional regularization terms. Moreover, we convert the extra constraint into a root-finding procedure for a one-dimensional monotonic function. Numerical experiments demonstrate the feasibility and efficiency of our OT approach to the computation of the LM rate.

preprint2022arXiv

Aspect-driven User Preference and News Representation Learning for News Recommendation

News recommender systems are essential for helping users to efficiently and effectively find out those interesting news from a large amount of news. Most of existing news recommender systems usually learn topic-level representations of users and news for recommendation, and neglect to learn more informative aspect-level features of users and news for more accurate recommendation. As a result, they achieve limited recommendation performance. Aiming at addressing this deficiency, we propose a novel Aspect-driven News Recommender System (ANRS) built on aspect-level user preference and news representation learning. Here, news aspect is fine-grained semantic information expressed by a set of related words, which indicates specific aspects described by the news. In ANRS, news aspect-level encoder and user aspect-level encoder are devised to learn the fine-grained aspect-level representations of user's preferences and news characteristics respectively, which are fed into click predictor to judge the probability of the user clicking the candidate news. Extensive experiments are done on the commonly used real-world dataset MIND, which demonstrate the superiority of our method compared with representative and state-of-the-art methods.

preprint2022arXiv

Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches

We present two new local differentially private algorithms for frequency estimation. One solves the fundamental frequency oracle problem; the other solves the well-known heavy hitters identification problem. Consistent with prior art, these are randomized algorithms. As a function of failure probability~$β$, the former achieves optimal worst-case estimation error for every~$β$, while the latter is optimal when~$β$ is at least inverse polynomial in~$n$, the number of users. In both algorithms, server running time is~$\tilde{O}(n)$ while user running time is~$\tilde{O}(1)$. Our frequency-oracle algorithm achieves lower estimation error than the prior works of Bassily et al. (NeurIPS 2017). On the other hand, our heavy hitters identification method is as easily implementable as as TreeHist (Bassily et al., 2017) and has superior worst-case error, by a factor of $Ω(\sqrt{\log n})$.

preprint2022arXiv

Automation Slicing and Testing for in-App Deep Learning Models

Intelligent Apps (iApps), equipped with in-App deep learning (DL) models, are emerging to offer stable DL inference services. However, App marketplaces have trouble auto testing iApps because the in-App model is black-box and couples with ordinary codes. In this work, we propose an automated tool, ASTM, which can enable large-scale testing of in-App models. ASTM takes as input an iApps, and the outputs can replace the in-App model as the test object. ASTM proposes two reconstruction techniques to translate the in-App model to a backpropagation-enabled version and reconstruct the IO processing code for DL inference. With the ASTM's help, we perform a large-scale study on the robustness of 100 unique commercial in-App models and find that 56\% of in-App models are vulnerable to robustness issues in our context. ASTM also detects physical attacks against three representative iApps that may cause economic losses and security issues.

preprint2022arXiv

AVMiner: Expansible and Semantic-Preserving Anti-Virus Labels Mining Method

With the increase in the variety and quantity of malware, there is an urgent need to speed up the diagnosis and the analysis of malware. Extracting the malware family-related tokens from AV (Anti-Virus) labels, provided by online anti-virus engines, paves the way for pre-diagnosing the malware. Automatically extract the vital information from AV labels will greatly enhance the detection ability of security enterprises and equip the research ability of security analysts. Recent works like AVCLASS and AVCLASS2 try to extract the attributes of malware from AV labels and establish the taxonomy based on expert knowledge. However, due to the uncertain trend of complicated malicious behaviors, the system needs the following abilities to face the challenge: preserving vital semantics, being expansible, and free from expert knowledge. In this work, we present AVMiner, an expansible malware tagging system that can mine the most vital tokens from AV labels. AVMiner adopts natural language processing techniques and clustering methods to generate a sequence of tokens without expert knowledge ranked by importance. AVMiner can self-update when new samples come. Finally, we evaluate AVMiner on over 8,000 samples from well-known datasets with manually labeled ground truth, which outperforms previous works.

preprint2022arXiv

Berry-Esseen bounds with targets and Local Limit Theorems for products of random matrices

Let $μ$ be a probability measure on $\text{GL}_d(\mathbb R)$ and denote by $S_n:= g_n \cdots g_1$ the associated random matrix product, where $g_j$'s are i.i.d.'s with law $μ$. We study statistical properties of random variables of the form $$σ(S_n,x) + u(S_n x),$$ where $x \in \mathbb P^{d-1}$, $σ$ is the norm cocycle and $u$ belongs to a class of admissible functions on $\mathbb P^{d-1}$ with values in $\mathbb R \cup \{\pm \infty\}$. Assuming that $μ$ has a finite exponential moment and generates a proximal and strongly irreducible semigroup, we obtain optimal Berry-Esseen bounds and the Local Limit Theorem for such variables using a large class of observables on $\mathbb R$ and Hölder continuous target functions on $\mathbb P^{d-1}$. As particular cases, we obtain new limit theorems for $σ(S_n,x)$ and for the coefficients of $S_n$.

preprint2022arXiv

Beyond the Limitation of Pulse Width in Optical Time-domain Reflectometry

Optical time-domain reflectometry (OTDR) is the basis for distributed time-domain optical fiber sensing techniques. By injecting pulse light into an optical fiber, the distance information of an event can be obtained based on the time of light flight. The minimum distinguishable event separation along the fiber length is called the spatial resolution, which is determined by the optical pulse width. By reducing the pulse width, the spatial resolution can be improved. However, at the same time, the signal-to-noise ratio of the system is degraded, and higher speed equipment is required. To solve this problem, data processing methods such as iterative subdivision, deconvolution, and neural networks have been proposed. However, they all have some shortcomings and thus have not been widely applied. Here, we propose and experimentally demonstrate an OTDR deconvolution neural network based on deep convolutional neural networks. A simplified OTDR model is built to generate a large amount of training data. By optimizing the network structure and training data, an effective OTDR deconvolution is achieved. The simulation and experimental results show that the proposed neural network can achieve more accurate deconvolution than the conventional deconvolution algorithm with a higher signal-to-noise ratio.

preprint2022arXiv

Cavity Quantum Electrodynamics Effects of Optically Cooled Nitrogen-Vacancy Centers Coupled to a High Frequency Microwave Resonator

Recent experiments demonstrated the cooling of a microwave mode of a high-quality dielectric resonator coupled to optically cooled nitrogen-vacancy (NV) spins in diamond. Our recent theoretical study [arXiv:2110.10950] pointed out the cooled NV spins can be used to realize cavity quantum electrodynamics effects (C-QED) at room temperature. In this article, we propose to modify the setup used in a recent diamond maser experiment [Nature 55, 493-496 (2018)], which features a higher spin transition frequency, a lower spin-dephasing rate and a stronger NV spins-resonator coupling, to realize better microwave mode cooling and the room-temperature CQED effects. To describe more precisely the optical spin cooling and the collective spin-resonator coupling, we extend the standard Jaynes-Cumming model to account for the rich electronic and spin levels of the NV centers. Our calculations show that for the proposed setup it is possible to cool the microwave mode from $293$ K (room temperature) to $116$ K, which is about $72$ K lower than the previous records, and to study the intriguing dynamics of the CQED effects under the weak-to-strong coupling transition by varying the laser power. With simple modifications, our model can be applied to, e.g., other solid-state spins or triplet spins of pentacene molecules, and to investigate other effects, such as the operations of pulsed and continuous-wave masing.

preprint2022arXiv

CGN: A Capacity-Guaranteed Network Architecture for Future Ultra-Dense Wireless Systems

The sixth generation (6G) era is envisioned to be a fully intelligent and autonomous era, with physical and digital lifestyles merged together. Future wireless network architectures should provide a solid support for such new lifestyles. A key problem thus arises that what kind of network architectures are suitable for 6G. In this paper, we propose a capacity-guaranteed network (CGN) architecture, which provides high capacity for wireless devices densely distributed everywhere, and ensures a superior scalability with low signaling overhead and computation complexity simultaneously. Our theorem proves that the essence of a CGN architecture is to decompose the whole network into non-overlapping clusters with equal cluster sum capacity. Simulation results reveal that in terms of the minimum cluster sum capacity, the proposed CGN can achieve at least 30% performance gain compared with existing base station clustering (BS-clustering) architectures. In addition, our theorem is sufficiently general and can be applied for networks with different distributions of BSs and users.

preprint2022arXiv

CODE-MVP: Learning to Represent Source Code from Multiple Views with Contrastive Pre-Training

Recent years have witnessed increasing interest in code representation learning, which aims to represent the semantics of source code into distributed vectors. Currently, various works have been proposed to represent the complex semantics of source code from different views, including plain text, Abstract Syntax Tree (AST), and several kinds of code graphs (e.g., Control/Data Flow Graph). However, most of them only consider a single view of source code independently, ignoring the correspondences among different views. In this paper, we propose to integrate different views with the natural-language description of source code into a unified framework with Multi-View contrastive Pre-training, and name our model as CODE-MVP. Specifically, we first extract multiple code views using compiler tools, and learn the complementary information among them under a contrastive learning framework. Inspired by the type checking in compilation, we also design a fine-grained type inference objective in the pre-training. Experiments on three downstream tasks over five datasets demonstrate the superiority of CODE-MVP when compared with several state-of-the-art baselines. For example, we achieve 2.4/2.3/1.1 gain in terms of MRR/MAP/Accuracy metrics on natural language code retrieval, code similarity, and code defect detection tasks, respectively.

preprint2022arXiv

Compilable Neural Code Generation with Compiler Feedback

Automatically generating compilable programs with (or without) natural language descriptions has always been a touchstone problem for computational linguistics and automated software engineering. Existing deep-learning approaches model code generation as text generation, either constrained by grammar structures in decoder, or driven by pre-trained language models on large-scale code corpus (e.g., CodeGPT, PLBART, and CodeT5). However, few of them account for compilability of the generated programs. To improve compilability of the generated programs, this paper proposes COMPCODER, a three-stage pipeline utilizing compiler feedback for compilable code generation, including language model fine-tuning, compilability reinforcement, and compilability discrimination. Comprehensive experiments on two code generation tasks demonstrate the effectiveness of our proposed approach, improving the success rate of compilation from 44.18 to 89.18 in code completion on average and from 70.3 to 96.2 in text-to-code generation, respectively, when comparing with the state-of-the-art CodeGPT.

preprint2022arXiv

Contrastive Vision-Language Pre-training with Limited Resources

Pioneering dual-encoder pre-training works (e.g., CLIP and ALIGN) have revealed the potential of aligning multi-modal representations with contrastive learning. However, these works require a tremendous amount of data and computational resources (e.g., billion-level web data and hundreds of GPUs), which prevent researchers with limited resources from reproduction and further exploration. To this end, we propose a stack of novel methods, which significantly cut down the heavy resource dependency and allow us to conduct dual-encoder multi-modal representation alignment with limited resources. Besides, we provide a reproducible baseline of competitive results, namely ZeroVL, with only 14M publicly accessible academic datasets and 8 V100 GPUs. Additionally, we collect 100M web data for pre-training, and achieve comparable or superior results than state-of-the-art methods, further proving the effectiveness of our methods on large-scale data. We hope that this work will provide useful data points and experience for future research in contrastive vision-language pre-training. Code is available at https://github.com/zerovl/ZeroVL.

preprint2022arXiv

Digging into Primary Financial Market: Challenges and Opportunities of Adopting Blockchain

Since the emergence of blockchain technology, its application in the financial market has always been an area of focus and exploration by all parties. With the characteristics of anonymity, trust, tamper-proof, etc., blockchain technology can effectively solve some problems faced by the financial market, such as trust issues and information asymmetry issues. To deeply understand the application scenarios of blockchain in the financial market, the issue of securities issuance and trading in the primary market is a problem that must be studied clearly. We conducted an empirical study to investigate the main difficulties faced by primary market participants in their business practices and the potential challenges of the deepening application of blockchain technology in the primary market. We adopted a hybrid method combining interviews (qualitative methods) and surveys (quantitative methods) to conduct this research in two stages. In the first stage, we interview 15 major primary market participants with different backgrounds and expertise. In the second phase, we conducted a verification survey of 54 primary market practitioners to confirm various insights from the interviews, including challenges and desired improvements. Our interviews and survey results revealed several significant challenges facing blockchain applications in the primary market: complex due diligence, mismatch, and difficult monitoring. On this basis, we believe that our future research can focus on some aspects of these challenges.

preprint2022arXiv

Distinctive Image Captioning via CLIP Guided Group Optimization

Image captioning models are usually trained according to human annotated ground-truth captions, which could generate accurate but generic captions. In this paper, we focus on generating distinctive captions that can distinguish the target image from other similar images. To evaluate the distinctiveness of captions, we introduce a series of metrics that use large-scale vision-language pre-training model CLIP to quantify the distinctiveness. To further improve the distinctiveness of captioning models, we propose a simple and effective training strategy that trains the model by comparing target image with similar image group and optimizing the group embedding gap. Extensive experiments are conducted on various baseline models to demonstrate the wide applicability of our strategy and the consistency of metric results with human evaluation. By comparing the performance of our best model with existing state-of-the-art models, we claim that our model achieves new state-of-the-art towards distinctiveness objective.

preprint2022arXiv

Dual Power Spectrum Manifold and Toeplitz HPD Manifold: Enhancement and Analysis for Matrix CFAR Detection

Recently, an innovative matrix CFAR detection scheme based on information geometry, also referred to as the geometric detector, has been developed speedily and exhibits distinct advantages in several practical applications. These advantages benefit from the geometry of the Toeplitz Hermitian positive definite (HPD) manifold $\mathcal{M}_{\mathcal{T}H_{++}}$, but the sophisticated geometry also results in some challenges for geometric detectors, such as the implementation of the enhanced detector to improve the SCR (signal-to-clutter ratio) and the analysis of the detection performance. To meet these challenges, this paper develops the dual power spectrum manifold $\mathcal{M}_{\text{P}}$ as the dual space of $\mathcal{M}_{\mathcal{T}H_{++}}$. For each affine invariant geometric measure on $\mathcal{M}_{\mathcal{T}H_{++}}$, we show that there exists an equivalent function named induced potential function on $\mathcal{M}_{\text{P}}$. By the induced potential function, the measurements of the dissimilarity between two matrices can be implemented on $\mathcal{M}_{\text{P}}$, and the geometric detectors can be reformulated as the form related to the power spectrum. The induced potential function leads to two contributions: 1) The enhancement of the geometric detector, which is formulated as an optimization problem concerning $\mathcal{M}_{\mathcal{T}H_{++}}$, is transformed to an equivalent and simpler optimization on $\mathcal{M}_{\text{P}}$. In the presented example of the enhancement, the closed-form solution, instead of the gradient descent method, is provided through the equivalent optimization. 2) The detection performance is analyzed based on $\mathcal{M}_{\text{P}}$, and the advantageous characteristics, which benefit the detection performance, can be deduced by analyzing the corresponding power spectrum to the maximal point of the induced potential function.

preprint2022arXiv

Edge YOLO: Real-Time Intelligent Object Detection System Based on Edge-Cloud Cooperation in Autonomous Vehicles

Driven by the ever-increasing requirements of autonomous vehicles, such as traffic monitoring and driving assistant, deep learning-based object detection (DL-OD) has been increasingly attractive in intelligent transportation systems. However, it is difficult for the existing DL-OD schemes to realize the responsible, cost-saving, and energy-efficient autonomous vehicle systems due to low their inherent defects of low timeliness and high energy consumption. In this paper, we propose an object detection (OD) system based on edge-cloud cooperation and reconstructive convolutional neural networks, which is called Edge YOLO. This system can effectively avoid the excessive dependence on computing power and uneven distribution of cloud computing resources. Specifically, it is a lightweight OD framework realized by combining pruning feature extraction network and compression feature fusion network to enhance the efficiency of multi-scale prediction to the largest extent. In addition, we developed an autonomous driving platform equipped with NVIDIA Jetson for system-level verification. We experimentally demonstrate the reliability and efficiency of Edge YOLO on COCO2017 and KITTI data sets, respectively. According to COCO2017 standard datasets with a speed of 26.6 frames per second (FPS), the results show that the number of parameters in the entire network is only 25.67 MB, while the accuracy (mAP) is up to 47.3%.

preprint2022arXiv

Enhanced quantum sensing with room-temperature solid-state masers

Quantum sensing with solid-state systems finds broad applications in diverse areas ranging from material and biomedical sciences to fundamental physics. Several solid-state spin sensors have been developed, facilitating the ultra-sensitive detection of physical quantities such as magnetic and electric fields and temperature. Exploiting collective behaviour of non-interacting spins holds the promise of pushing the detection limit to even lower levels, while to date, those levels are scarcely reached due to the broadened linewidth and inefficient readout of solid-state spin ensembles. Here, we experimentally demonstrate that such drawbacks can be overcome by newly reborn maser technology at room temperature in the solid state. Owing to maser action, we observe a 4-fold reduction in the inhomogeneously broadened linewidth of a molecular spin ensemble, which is narrower than the same measured from single spins at cryogenic temperatures. The maser-based readout applied to magnetometry showcases a signal-to-noise ratio (SNR) of 30 dB for single shots. This technique would be a significant addition to the toolbox for boosting the sensitivity of solid-state ensemble spin sensors.

preprint2022arXiv

Ergodic Deviations of Degenerate Multidimensional Actions -- Symmetric Convex Bodies

We prove that the ergodic deviation of a degenerate $\mathbb{Z}^2$-action on the torus $\mathbb{T}^2$ relative to a symmetric, strictly convex body can be decomposed into two parts, and that each part admits a limit distribution after choosing a suitable normalizer. Specifically, the first part is similar to an ergodic sum of smooth observables after being normalized by $N$, and the second part is similar to the case of a random toral translation, i.e., the $\mathbb{Z}$-action, but with a normalizer of $N^{\frac{1}{2}}$. The key difference is that we employ the product flow on the product space of $\mathbb{Z}^2$ lattices for the multidimensional action.

preprint2022arXiv

Experimental test of Tsirelson's bound with a single photonic qubit

For many protocols, quantum strategies have advantages compared with their classical counter-partners, and these advantages have attracted many interests and applications. One of the famous examples is the Clauser-Horne-Shimony-Holt (CHSH) game, which recasts Bell's theorem~\cite{2} into the framework of a game. In the CHSH game, two space-like separated players, Alice and Bob are each assigned a classical bit $a$ and $b$ respectively. Then they return bits $x$ and $y$ according to some pre-agreed strategies. They will win the game when $x\oplus y= a\cdot b$. In the game, if the players use the classical strategies, the optimal success probability $w(\text{CHSH})=0.75$.However, if they add some quantum resources, the success probability will increase and up to maximal value $cos^2(π/8)$, which is know as the Tsirelson's bound. Moreover, Popescu and Rohrlich noted that the perfect success probability $1$ can also be achieved in a more general theory without violating the no-signaling assumption

preprint2022arXiv

Exploiting Unlabeled Data for Target-Oriented Opinion Words Extraction

Target-oriented Opinion Words Extraction (TOWE) is a fine-grained sentiment analysis task that aims to extract the corresponding opinion words of a given opinion target from the sentence. Recently, deep learning approaches have made remarkable progress on this task. Nevertheless, the TOWE task still suffers from the scarcity of training data due to the expensive data annotation process. Limited labeled data increase the risk of distribution shift between test data and training data. In this paper, we propose exploiting massive unlabeled data to reduce the risk by increasing the exposure of the model to varying distribution shifts. Specifically, we propose a novel Multi-Grained Consistency Regularization (MGCR) method to make use of unlabeled data and design two filters specifically for TOWE to filter noisy data at different granularity. Extensive experimental results on four TOWE benchmark datasets indicate the superiority of MGCR compared with current state-of-the-art methods. The in-depth analysis also demonstrates the effectiveness of the different-granularity filters. Our codes are available at https://github.com/TOWESSL/TOWESSL.

preprint2022arXiv

Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport

In our previous work [arXiv:2202.10042], the complexity of Sinkhorn iteration is reduced from $O(N^2)$ to the optimal $O(N)$ by leveraging the special structure of the kernel matrix. In this paper, we explore the special structure of kernel matrices by defining and utilizing the properties of the Lower-ColLinear Triangular Matrix (L-CoLT matrix) and Upper-ColLinear Triangular Matrix (U-CoLT matrix). We prove that (1) L/U-CoLT matrix-vector multiplications can be carried out in $O(N)$ operations; (2) both families of matrices are closed under the Hadamard product and matrix scaling. These properties help to alleviate two key difficulties for reducing the complexity of the Inexact Proximal point method (IPOT), and allow us to significantly reduce the number of iterations to $O(N)$. This yields the Fast Sinkhorn II (FS-2) algorithm for accurate computation of optimal transport with low algorithm complexity and fast convergence. Numerical experiments are presented to show the effectiveness and efficiency of our approach.

preprint2022arXiv

FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labeling

The recently proposed FixMatch achieved state-of-the-art results on most semi-supervised learning (SSL) benchmarks. However, like other modern SSL algorithms, FixMatch uses a pre-defined constant threshold for all classes to select unlabeled data that contribute to the training, thus failing to consider different learning status and learning difficulties of different classes. To address this issue, we propose Curriculum Pseudo Labeling (CPL), a curriculum learning approach to leverage unlabeled data according to the model's learning status. The core of CPL is to flexibly adjust thresholds for different classes at each time step to let pass informative unlabeled data and their pseudo labels. CPL does not introduce additional parameters or computations (forward or backward propagation). We apply CPL to FixMatch and call our improved algorithm FlexMatch. FlexMatch achieves state-of-the-art performance on a variety of SSL benchmarks, with especially strong performances when the labeled data are extremely limited or when the task is challenging. For example, FlexMatch achieves 13.96% and 18.96% error rate reduction over FixMatch on CIFAR-100 and STL-10 datasets respectively, when there are only 4 labels per class. CPL also significantly boosts the convergence speed, e.g., FlexMatch can use only 1/5 training time of FixMatch to achieve even better performance. Furthermore, we show that CPL can be easily adapted to other SSL algorithms and remarkably improve their performances. We open-source our code at https://github.com/TorchSSL/TorchSSL.

preprint2022arXiv

Free Component Analysis: Theory, Algorithms & Applications

We describe a method for unmixing mixtures of freely independent random variables in a manner analogous to the independent component analysis (ICA) based method for unmixing independent random variables from their additive mixtures. Random matrices play the role of free random variables in this context so the method we develop, which we call Free component analysis (FCA), unmixes matrices from additive mixtures of matrices. Thus, while the mixing model is standard, the novelty and difference in unmixing performance comes from the introduction of a new statistical criteria, derived from free probability theory, that quantify freeness analogous to how kurtosis and entropy quantify independence. We describe the theory, the various algorithms, and compare FCA to vanilla ICA which does not account for spatial or temporal structure. We highlight why the statistical criteria make FCA also vanilla despite its matricial underpinnings and show that FCA performs comparably to, and sometimes better than, (vanilla) ICA in every application, such as image and speech unmixing, where ICA has been known to succeed. Our computational experiments suggest that not-so-random matrices, such as images and short time fourier transform matrix of waveforms are (closer to being) freer "in the wild" than we might have theoretically expected.

preprint2022arXiv

Joint Offloading Decision and Resource Allocation for Vehicular Fog-Edge Computing Networks: A Contract-Stackelberg Approach

With the popularity of mobile devices and development of computationally intensive applications, researchers are focusing on offloading computation to Mobile Edge Computing (MEC) server due to its high computational efficiency and low communication delay. As the computing resources of an MEC server are limited, vehicles in the urban area who have abundant idle resources should be fully utilized. However, offloading computing tasks to vehicles faces many challenging issues. In this paper, we introduce a vehicular fog-edge computing paradigm and formulate it as a multi-stage Stackelberg game to deal with these issues. Specifically, vehicles are not obligated to share resources, let alone disclose their private information (e.g., stay time and the amount of resources). Therefore, in the first stage, we design a contract-based incentive mechanism to motivate vehicles to contribute their idle resources. Next, due to the complicated interactions among vehicles, road-side unit (RSU), MEC server and mobile device users, it is challenging to coordinate the resources of all parties and design a transaction mechanism to make all entities benefit. In the second and third stages, based on Stackelberg game, we develop pricing strategies that maximize the utilities of all parties. The analytical forms of optimal strategies for each stage are given. Simulation results demonstrate the effectiveness of our proposed incentive mechanism, reveal the trends of energy consumption and offloading decisions of users with various parameters, and present the performance comparison between our framework and existing MEC offloading paradigm in vehicular networks.

preprint2022arXiv

LiGCN: Label-interpretable Graph Convolutional Networks for Multi-label Text Classification

Multi-label text classification (MLTC) is an attractive and challenging task in natural language processing (NLP). Compared with single-label text classification, MLTC has a wider range of applications in practice. In this paper, we propose a label-interpretable graph convolutional network model to solve the MLTC problem by modeling tokens and labels as nodes in a heterogeneous graph. In this way, we are able to take into account multiple relationships including token-level relationships. Besides, the model allows better interpretability for predicted labels as the token-label edges are exposed. We evaluate our method on four real-world datasets and it achieves competitive scores against selected baseline methods. Specifically, this model achieves a gain of 0.14 on the F1 score in the small label set MLTC, and 0.07 in the large label set scenario.

preprint2022arXiv

Mobility Support for Millimeter Wave Communications: Opportunities and Challenges

Millimeter-wave (mmWave) communication technology offers a potential and promising solution to support 5G and B5G wireless networks in dynamic scenarios and applications. However, mobility introduces many challenges as well as opportunities to mmWave applications. To address these problems, we conduct a survey of the opportunities and technologies to support mmWave communications in mobile scenarios. Firstly, we summarize the mobile scenarios where mmWave communications are exploited, including indoor wireless local area network (WLAN) or wireless personal area network (WPAN), cellular access, vehicle-to-everything (V2X), high speed train (HST), unmanned aerial vehicle (UAV), and the new space-air-ground-sea communication scenarios. Then, to address users' mobility impact on the system performance in different application scenarios, we introduce several representative mobility models in mmWave systems, including human mobility, vehicular mobility, high speed train mobility and ship mobility. Next we survey the key challenges and existing solutions to mmWave applications, such as channel modeling, channel estimation, anti-blockage, and capacity improvement. Lastly, we discuss the open issues concerning mobility-aware mmWave communications that deserve further investigation. In particular, we highlight future heterogeneous mobile networks, dynamic resource management, artificial intelligence (AI) for mobility and integration of geographical information, deployment of large intelligent surface and reconfigurable antenna technology, and finally, the evolution to Terahertz (THz) communications.

preprint2022arXiv

On the Mass-Conserving Allen-Cahn Approximation for Incompressible Binary Fluids

This paper is devoted to the global well-posedness of two Diffuse Interface systems modeling the motion of an incompressible two-phase fluid mixture in presence of capillarity effects in a bounded smooth domain $Ω\subset \mathbb{R}^d$, $d=2,3$. We focus on dissipative mixing effects originating from the mass-conserving Allen-Cahn dynamics with the physically relevant Flory-Huggins potential. More precisely, we study the mass-conserving Navier-Stokes-Allen-Cahn system for nonhomogeneous fluids and the mass-conserving Euler-Allen-Cahn system for homogeneous fluids. We prove existence and uniqueness of global weak and strong solutions as well as their property of separation from the pure states. In our analysis, we combine the energy and entropy estimates, a novel end-point estimate of the product of two functions, a new estimate for the Stokes problem with non-constant viscosity, and logarithmic type Gronwall arguments.

preprint2022arXiv

Physics-embedded inverse analysis with automatic differentiation for the earth's subsurface

Inverse analysis has been utilized to understand unknown underground geological properties by matching the observational data with simulators. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented with embedded physics and a technique known as automatic differentiation. We use a physics-embedded generative model, which takes statistically simple parameters as input and outputs subsurface properties (e.g., permeability or P-wave velocity), that embeds physical knowledge of the subsurface properties into inverse analysis and improves its performance. We tested the application of this approach on four geologic problems: two heterogeneous hydraulic conductivity fields, a hydraulic fracture network, and a seismic inversion for P-wave velocity. This physics-embedded inverse analysis approach consistently characterizes these geological problems accurately. Furthermore, the excellent performance in matching the observational data demonstrates the reliability of the proposed method. Moreover, the application of automatic differentiation makes this an easy and fast approach to inverse analysis when dealing with complicated geological structures.

preprint2022arXiv

Production of neutron-rich actinide nuclides in isobaric collisions via multinucleon transfer reactions

We have calculated the multinucleon transfer reactions of $^{208}$Os, $^{208}$Pt, $^{208}$Hg, $^{208}$Pb,$^{208}$Po, $^{208}$Rn, $^{208}$Ra,$^{132,136}$Xe bombarding on $^{232}$Th and $^{248}$Cm at Coulomb barrier energies within the dinuclear system model, systematically. The results are in good agreement with the available experimental data. Coulomb effect and shell effect on production of actinides in these reactions have been investigated thoroughly. Potential energy surface and total kinetic energy mass distributions in the reactions $^{208}$Hg, $^{208}$Pb and$^{208}$Po colliding on $^{248}$Cm and $^{232}$Th are calculated and analyzed, respectively. It is found that PES and TKE spectra manifest the fragment formation mechanism in the multinucleon transfer reactions. The isospin effect and shell effect are shown in PES and TKE. Production cross-sections of multinucleon transfer products are highly dependent on the isobar projectiles with mass number $A=208$. The isobar projectiles with larger N/Z ratios are favorable for creating the neutron-rich target-like fragments. The isobar projectiles with larger charge number induced products tend to shift to proton-rich region. Coulomb potential coupled to shell effect is shown in production cross-sections of actinide isotopes. Based on the radioactive projectiles induced reactions, we have predicted massive new actinide isotopes around nuclear drip lines, even could access the superheavy nuclei region.

preprint2022arXiv

Protection of quantum evolutions under parity-time symmetric non-Hermitian Hamiltonians by dynamical decoupling

Parity-time (PT) symmetric non-Hermitian Hamiltonians bring about many novel features and interesting applications such as quantum gates faster than those in Hermitian systems, and topological state transfer. The performance of evolutions under $\mathcal{PT}$-symmetric Hamiltonians is degraded by the inevitable noise and errors due to system-environment interaction and experimental imperfections. In contrast to Hermitian Hamiltonians, the fluctuations in dissipative beams that are utilized to generate non-Hermitian contributions in the PT-symmetric Hamiltonians cause additional errors. Here we achieve the protection of PT-symmetric Hamiltonians against noise acting along the qubit's quantization axis by combining quantum evolutions with dynamical decoupling sequences. We demonstrate the performance of our method by numerical simulations. Realistic noise sources and parameters are chosen including: constant detuning error, time-varying detuning noise and dissipative-beam noise. The fidelities of the protected evolutions are well above the unprotected ones under all the above situations. Our work paves the way for further studies and applications of non-Hermitian $\mathcal{PT}$-symmetric physics in noisy quantum systems.

preprint2022arXiv

Quasi-Continuous Cooling of a Microwave Mode on a Benchtop using Hyperpolarized NV$^-$ Diamond

We demonstrate the cooling of a microwave mode at 2872 MHz through its interaction with optically spin-polarized NV$^-$ centers in diamond at zero applied magnetic field, removing thermal photons from the mode. By photo-exciting (pumping) a brilliant-cut red diamond jewel with a continuous-wave 532-nm laser, outputting 2 W, the microwave mode is cooled down to a noise temperature of 188 K. This noise temperature can be preserved continuously for as long as the diamond is optically excited and kept cool. The latter requirement restricted operation out to 10 ms in our preliminary setup. The mode-cooling performance of NV$^-$ diamond is directly compared against that of pentacene-doped para-terphenyl, where we find that the former affords the advantages of cooling immediately upon light excitation without needing to mase beforehand (or at all) and being able to cool continuously at substantially lower optical pump power.

preprint2022arXiv

Randomize the Future: Asymptotically Optimal Locally Private Frequency Estimation Protocol for Longitudinal Data

Longitudinal data tracking under Local Differential Privacy (LDP) is a challenging task. Baseline solutions that repeatedly invoke a protocol designed for one-time computation lead to linear decay in the privacy or utility guarantee with respect to the number of computations. To avoid this, the recent approach of Erlingsson et al. (2020) exploits the potential sparsity of user data that changes only infrequently. Their protocol targets the fundamental problem of frequency estimation protocol for longitudinal binary data, with $\ell_\infty$ error of $O ( (1 / ε) \cdot (\log d)^{3 / 2} \cdot k \cdot \sqrt{ n \cdot \log ( d / β) } )$, where $ε$ is the privacy budget, $d$ is the number of time periods, $k$ is the maximum number of changes of user data, and $β$ is the failure probability. Notably, the error bound scales polylogarithmically with $d$, but linearly with $k$. In this paper, we break through the linear dependence on $k$ in the estimation error. Our new protocol has error $O ( (1 / ε) \cdot (\log d) \cdot \sqrt{ k \cdot n \cdot \log ( d / β) } )$, matching the lower bound up to a logarithmic factor. The protocol is an online one, that outputs an estimate at each time period. The key breakthrough is a new randomizer for sequential data, FutureRand, with two key features. The first is a composition strategy that correlates the noise across the non-zero elements of the sequence. The second is a pre-computation technique which, by exploiting the symmetry of input space, enables the randomizer to output the results on the fly, without knowing future inputs. Our protocol closes the error gap between existing online and offline algorithms.

preprint2022arXiv

Realizing quantum speed limit in open system with a PT-symmetric trapped-ion qubit

Evolution time of a qubit under a Hamiltonian operation is one of the key issues in quantum control, quantum information processing and quantum computing. It has a lower bound in Hermitian system, which is limited by the coupling between two states of the qubit, while it is proposed that in a non-Hermitian system it can be made much smaller without violating the time-energy uncertainty principle. Here we have experimentally confirmed the proposal in a single dissipative qubit system and demonstrate that the evolution time of a qubit from an initial state to an arbitrary state can be controlled by tuning the dissipation intensity in a non-Hermitian Parity-Time-Symmetric ($\mathcal{P T}$-symmetric) quantum system. It decreases with increasing dissipation intensity and also gives a tighter bound for quantum speed limit (QSL). We also find that the evolution time of its reversal operation increases with the increasing dissipation intensity. These findings give us a well-controlled knob for speeding up the qubit operation, and pave the way towards fast and practical quantum computation, opening the door for solving sophisticated problems with only a few qubits.

preprint2022arXiv

Resilience in Industrial Internet of Things Systems: A Communication Perspective

Industrial Internet of Things is an ultra-large-scale system that is much more sophisticated and fragile than conventional industrial platforms. The effective management of such a system relies heavily on the resilience of the network, especially the communication part. Imperative as resilient communication is, there is not enough attention from literature and a standardized framework is still missing. In awareness of these, this paper intends to provide a systematic overview of resilience in IIoT with a communication perspective, aiming to answer the questions of why we need it, what it is, how to enhance it, and where it can be applied. Specifically, we emphasize the urgency of resilience studies via examining existing literature and analyzing malfunction data from a real satellite communication system. Resilience-related concepts and metrics, together with standardization efforts are then summarized and discussed, presenting a basic framework for analyzing the resilience of the system before, during, and after disruptive events. On the basis of the framework, key resilience concerns associated with the design, deployment, and operation of IIoT are briefly described to shed light on the methods for resilience enhancement. Promising resilient applications in different IIoT sectors are also introduced to highlight the opportunities and challenges in practical implementations.

preprint2022arXiv

Robust quantum control for the manipulation of solid-state spins

Robust and high-fidelity control of electron spins in solids is the cornerstone for facilitating applications of solid-state spins in quantum information processing and quantum sensing. However, precise control of spin systems is always challenging due to the presence of a variety of noises originating from the environment and control fields. Herein, noise-resilient quantum gates, designed with robust optimal control (ROC) algorithms, are demonstrated experimentally with nitrogen-vacancy (NV) centers in diamond to realize tailored robustness against detunings and Rabi errors simultaneously. In the presence of both 10% off-resonant detuning and deviation of a Rabi frequency, we achieve an average single-qubit gate fidelity of up to 99.97%. Our experiments also show that, ROCbased multipulse quantum sensing sequences can suppress spurious responses resulting from finite widths and imperfections of microwave pulses, which provides an efficient strategy for enhancing the performance of existing multipulse quantum sensing sequences.

preprint2022arXiv

Scheduling of UAV-assisted Millimeter Wave Communications for High-Speed Railway

To exploit richer spectrum resources for even better service quality, millimeter wave (mmWave) communication has been considered for high-speed railway (HSR) communication systems. In this paper, we focus on scheduling as many flows as possible while satisfying their QoS requirements. Due to interference, eavesdropping, or other problems, some flows may not be directly transmitted from the track-side BS. In this paper, we propose an UAV-assisted scheduling scheme which utilizes a UAV to serve as relay for such flows. The proposed scheme also utilize two mmWave bands, one for the BS links and the other for the UAV links. The proposed algorithm aims to maximize the number of flows with their QoS requirements satisfied. Simulations demonstrate that the proposed scheme achieves a superior performance on the number of completed flows and the system throughput over two baseline schemes.

preprint2022arXiv

The Effective Sample Size in Bayesian Information Criterion for Level-Specific Fixed and Random Effects Selection in a Two-Level Nested Model

Popular statistical software provides Bayesian information criterion (BIC) for multilevel models or linear mixed models. However, it has been observed that the combination of statistical literature and software documentation has led to discrepancies in the formulas of the BIC and uncertainties of the proper use of the BIC in selecting a multilevel model with respect to level-specific fixed and random effects. These discrepancies and uncertainties result from different specifications of sample size in the BIC's penalty term for multilevel models. In this study, we derive the BIC's penalty term for level-specific fixed and random effect selection in a two-level nested design. In this new version of BIC, called BIC_E, this penalty term is decomposed into two parts if the random effect variance-covariance matrix has full rank: (a) a term with the log of average sample size per cluster whose multiplier involves the overlapping number of dimensions between the column spaces of the random and fixed effect design matrices and (b) the total number of parameters times the log of the total number of clusters. Furthermore, we study the behavior of BIC_E in the presence of redundant random effects. The use of BIC_E is illustrated with a textbook example data set and a numerical demonstration shows that the derived formulae adheres to empirical values.

preprint2022arXiv

The Moment Passing Method for Wireless Channel Capacity Estimation

Wireless network capacity can be regarded as the most important performance metric for wireless communication systems. With the fast development of wireless communication technology, future wireless systems will become more and more complicated. As a result, the channel gain matrix will become a large-dimensional random matrix, leading to an extremely high computational cost to obtain the capacity. In this paper, we propose a moment passing method (MPM) to realize the fast and accurate capacity estimation for future ultra-dense wireless systems. It can determine the capacity with quadratic complexity, which is optimal considering that the cost of a single matrix operation is not less than quadratic complexity. Moreover, it has high accuracy. The simulation results show that the estimation error of this method is below 2 percent. Finally, our method is highly general, as it is independent of the distributions of BSs and users, and the shape of network areas. More importantly, it can be applied not only to the conventional multi-user multiple input and multiple output (MU-MIMO) networks, but also to the capacity-centric networks designed for B5G/6G.

preprint2022arXiv

The Quadratic Wasserstein Metric With Squaring Scaling For Seismic Velocity Inversion

The quadratic Wasserstein metric has shown its power in measuring the difference between probability densities, which benefits optimization objective function with better convexity and is insensitive to data noise. Nevertheless, it is always an important question to make the seismic signals suitable for comparison using the quadratic Wasserstein metric. The squaring scaling is worth exploring since it guarantees the convexity caused by data shift. However, as mentioned in [Commun. Inf. Syst., 2019, 19:95-145], the squaring scaling may lose uniqueness and result in more local minima to the misfit function. In our previous work [J. Comput. Phys., 2018, 373:188-209], the quadratic Wasserstein metric with squaring scaling was successfully applied to the earthquake location problem. But it only discussed the inverse problem with few degrees of freedom. In this work, we will present a more in-depth study on the combination of squaring scaling technique and the quadratic Wasserstein metric. By discarding some inapplicable data, picking seismic phases, and developing a new normalization method, we successfully invert the seismic velocity structure based on the squaring scaling technique and the quadratic Wasserstein metric. The numerical experiments suggest that this newly proposed method is an efficient approach to obtain more accurate inversion results.

preprint2022arXiv

Triple-Band Scheduling with Millimeter Wave and Terahertz Bands for Wireless Backhaul

With the explosive growth of mobile traffic demand, densely deployed small cells underlying macrocells have great potential for 5G and beyond wireless networks. In this paper, we consider the problem of supporting traffic flows with diverse QoS requirements by exploiting three high frequency bands, i.e., the 28GHz band, the E-band, and the Terahertz (THz) band. The cooperation of the three bands is helpful for maximizing the number of flows with their QoS requirements satisfied. To solve the formulated nonlinear integer programming problem, we propose a triple-band scheduling scheme which can select the optimum scheduling band for each flow among three different frequency bands. The proposed scheme also efficiently utilizes the resource to schedule flow transmissions in time slots. Extensive simulations demonstrate the superior performance of the proposed scheme over three baseline schemes with respect to the number of completed flows and the system throughput.

preprint2022arXiv

Walking to Hide: Privacy Amplification via Random Message Exchanges in Network

The *shuffle model* is a powerful tool to amplify the privacy guarantees of the *local model* of differential privacy. In contrast to the fully decentralized manner of guaranteeing privacy in the local model, the shuffle model requires a central, trusted shuffler. To avoid this central shuffler, recent work of Liew et al. (2022) proposes shuffling locally randomized data in a decentralized manner, via random walks on the communication network constituted by the clients. The privacy amplification bound it thus provides depends on the topology of the underlying communication network, even for infinitely long random walks. It does not match the state-of-the-art privacy amplification bound for the shuffle model (Feldman et al., 2021). In this work, we prove that the output of~$n$ clients' data, each perturbed by an $ε_0$-local randomizer, and shuffled by random walks with a logarithmic number of steps, is $( {O} ( (1 - e^{-ε_0} ) \sqrt{ ( e^{ε_0} / n ) \ln (1 / δ) } ), O(δ) )$-differentially private. Importantly, this bound is independent of the topology of the communication network, and asymptotically closes the gap between the privacy amplification bounds for the network shuffle model (Liew et al., 2022) and the shuffle model (Feldman et al., 2021). Our proof is based on a reduction to the shuffle model, and an analysis of the distribution of random walks of finite length. Building on this, we further show that if each client is sampled independently with probability~$p$, the privacy guarantee of the network shuffle model can be further improved to $( {O} ( (1 - e^{-ε_0} ) \sqrt{p ( e^{ε_0} / n ) \ln (1 / δ) } ) , O(δ) )$. Importantly, the subsampling is also performed in a fully decentralized manner that does not require a trusted central entity; compared with related bounds in prior work, our bound is stronger.

preprint2021arXiv

A Convergent Semi-Proximal Alternating Direction Method of Multipliers for Recovering Internet Traffics from Link Measurements

It is challenging to recover the large-scale internet traffic data purely from the link measurements. With the rapid growth of the problem scale, it will be extremely difficult to sustain the recovery accuracy and the computational cost. In this work, we propose a new Sparsity Low-Rank Recovery (SLRR) model and its Schur Complement Based semi-proximal Alternating Direction Method of Multipliers (SCB-spADMM) solver. Our approach distinguishes itself mainly for the following two aspects. First, we fully exploit the spatial low-rank property and the sparsity of traffic data, which are barely considered in the literature. Our model can be divided into a series of subproblems, which only relate to the traffics in a certain individual time interval. Thus, the model scale is significantly reduced. Second, we establish a globally convergent ADMM-type algorithm inspired by [Li et al., Math. Program., 155(2016)] to solve the SLRR model. In each iteration, all the intermediate variables' optimums can be calculated analytically, which makes the algorithm fast and accurate. Besides, due to the separability of the SLRR model, it is possible to design a parallel algorithm to further reduce computational time. According to the numerical results on the classic datasets Abilene and GEANT, our method achieves the best accuracy with a low computational cost. Moreover, in our newly released large-scale Huawei Origin-Destination (HOD) network traffics, our method perfectly reaches the seconds-level feedback, which meets the essential requirement for practical scenarios.

preprint2021arXiv

A Review on the Cahn-Hilliard Equation: Classical Results and Recent Advances in Dynamic Boundary Conditions

The Cahn-Hilliard equation is a fundamental model that describes the phase separation process in multi-component mixtures. It has been successfully extended to many different contexts in several scientific fields. In this survey article, we briefly review the derivation, structure as well as some analytical issues for the Cahn-Hilliard equation and its variants. Our focus will be placed on the well-posedness and long-time behavior of the Cahn-Hilliard equation in the classical setting and recent progresses on the dynamic boundary conditions accounting for non-trivial boundary effects.

preprint2021arXiv

Coalition Game Based Full-duplex Popular Content Distribution in mmWave Vehicular Networks

The millimeter wave (mmWave) communication has drawn intensive attention with abundant band resources. In this paper, we consider the popular content distribution (PCD) problem in the mmWave vehicular network. In order to offload the communication burden of base stations (BSs), vehicle-to-vehicle (V2V) communication is introduced into the PCD problem to transmit contents between on-board units (OBUs) and improve the transmission efficiency. We propose a full-duplex (FD) cooperative scheme based on coalition formation game, and the utility function is provided based on the maximization of the number of received contents. The contribution of each member in the coalition can be transferable to its individual profit. While maximizing the number of received contents in the fixed time, the cooperative scheme also ensures the individual profit of each OBU in the coalition. We evaluate the proposed scheme by extensive simulations in mmWave vehicular networks. Compared with other existing schemes, the proposed scheme has superior performances on the number of possessed contents and system fairness. Besides, the low complexity of the proposed algorithm is demonstrated by the switch operation number and CPU time.

preprint2021arXiv

Evidence of Andreev blockade in a double quantum dot coupled to a superconductor

We design and investigate an experimental system capable of entering an electron transport blockade regime in which a spin-triplet localized in the path of current is forbidden from entering a spin-singlet superconductor. To stabilize the triplet a double quantum dot is created electrostatically near a superconducting lead in an InAs nanowire. The dots are filled stochastically with electrons of either spin. The superconducting lead is a molecular beam epitaxy grown Al shell. The shell is etched away over a wire segment to make room for the double dot and the normal metal gold lead. The quantum dot closest to the normal lead exhibits Coulomb diamonds, the dot closest to the superconducting lead exhibits Andreev bound states and an induced gap. The experimental observations compare favorably to a theoretical model of Andreev blockade, named so because the triplet double dot configuration suppresses Andreev reflections. Observed leakage currents can be accounted for by finite temperature. We observe the predicted quadruple level degeneracy points of high current and a periodic conductance pattern controlled by the occupation of the normal dot. Even-odd transport asymmetry is lifted with increased temperature and magnetic field. This blockade phenomenon can be used to study spin structure of superconductors. It may also find utility in quantum computing devices that utilize Andreev or Majorana states.

preprint2021arXiv

Normalizing field flows: Solving forward and inverse stochastic differential equations using physics-informed flow models

We introduce in this work the normalizing field flows (NFF) for learning random fields from scattered measurements. More precisely, we construct a bijective transformation (a normalizing flow characterizing by neural networks) between a Gaussian random field with the Karhunen-Loève (KL) expansion structure and the target stochastic field, where the KL expansion coefficients and the invertible networks are trained by maximizing the sum of the log-likelihood on scattered measurements. This NFF model can be used to solve data-driven forward, inverse, and mixed forward/inverse stochastic partial differential equations in a unified framework. We demonstrate the capability of the proposed NFF model for learning Non Gaussian processes and different types of stochastic partial differential equations.

preprint2021arXiv

Well-posedness of a Hydrodynamic Phase-field Model for Functionalized Membrane-Fluid Interaction

In this paper, we study a hydrodynamic phase-field system modeling the deformation of functionalized membranes in incompressible viscous fluids. The governing PDE system consists of the Navier-Stokes equations coupled with a convective sixth-order Cahn-Hilliard type equation driven by the functionalized Cahn-Hilliard free energy, which describes phase separation in mixtures with an amphiphilic structure. In the three dimensional case, we first prove existence of global weak solutions provided that the initial total energy is finite. Then we establish uniqueness of weak solutions under suitable regularity assumptions only imposed on the velocity field (or its gradient). Finally, we prove the existence and uniqueness of local strong solutions for arbitrary regular initial data and derive some blow-up criteria. The results are obtained in the general setting with variable viscosity and mobility.

preprint2020arXiv

A Deep Neural Network Model of Particle Thermal Radiation in Packed Bed

Prediction of particle radiative heat transfer flux is an important task in the large discrete granular systems, such as pebble bed in power plants and industrial fluidized beds. For particle motion and packing, discrete element method (DEM) now is widely accepted as the excellent Lagrangian approach. For thermal radiation, traditional methods focus on calculating the obstructed view factor directly by numerical algorithms. The major challenge for the simulation is that the method is proven to be time-consuming and not feasible to be applied in the practical cases. In this work, we propose an analytical model to calculate macroscopic effective conductivity from particle packing structures Then, we develop a deep neural network (DNN) model used as a predictor of the complex view factor function. The DNN model is trained by a large dataset and the computational speed is greatly improved with good accuracy. It is feasible to perform real-time simulation with DNN model for radiative heat transfer in large pebble bed. The trained model also can be coupled with DEM and used to analyze efficiently the directional radiative conductivity, anisotropic factor and wall effect of the particle thermal radiation.

preprint2020arXiv

Amortized Population Gibbs Samplers with Neural Sufficient Statistics

We develop amortized population Gibbs (APG) samplers, a class of scalable methods that frames structured variational inference as adaptive importance sampling. APG samplers construct high-dimensional proposals by iterating over updates to lower-dimensional blocks of variables. We train each conditional proposal by minimizing the inclusive KL divergence with respect to the conditional posterior. To appropriately account for the size of the input data, we develop a new parameterization in terms of neural sufficient statistics. Experiments show that APG samplers can train highly structured deep generative models in an unsupervised manner, and achieve substantial improvements in inference accuracy relative to standard autoencoding variational methods.

preprint2020arXiv

Beyond the Limits of Conventional Stark Deceleration

Stark deceleration enables the production of cold and dense molecular beams with applications in trapping, collisional studies, and precision measurement. Improving the efficiency of Stark deceleration, and hence the achievable molecular densities, is central to unlock the full potential of such studies. One of the chief limitations arises from the transverse focusing properties of Stark decelerators. We introduce a new operation strategy that circumvents this limit without any hardware modifications, and experimentally verify our results for hydroxyl radicals. Notably, improved focusing results in significant gains in molecule yield with increased operating voltage, formerly limited by transverse-longitudinal coupling. At final velocities sufficiently small for trapping, molecule flux improves by a factor of four, and potentially more with increased voltage. The improvement is more significant for less readily polarized species, thereby expanding the class of candidate molecules for Stark deceleration.

preprint2020arXiv

Chiral symmetry breaking for deterministic switching of perpendicular magnetization by spin-orbit torque

Symmetry breaking is a characteristic to determine which branch of a bifurcation system follows upon crossing a critical point. Specifically, in spin-orbit torque (SOT) devices, a fundamental question arises: how to break the symmetry of the perpendicular magnetic moment by the in-plane spin polarization? Here, we show that the chiral symmetry breaking by the DMI can induce the deterministic SOT switching of the perpendicular magnetization. By introducing a gradient of saturation magnetization or magnetic anisotropy, non-collinear spin textures are formed by the gradient of effective SOT strength, and thus the chiral symmetry of the SOT-induced spin textures is broken by the DMI, resulting in the deterministic magnetization switching. We introduce a strategy to induce an out-of-plane (z) gradient of magnetic properties, as a practical solution for the wafer-scale manufacture of SOT devices.

preprint2020arXiv

Crossing estimates from metric graph and discrete GFF

We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $δ\mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $δ$ goes to 0. In particular, we look at the probability that there is a path that crosses the rectangle in the horizontal direction on which the field is positive. We show this probability is strictly larger in the discrete graph. In the metric graph case, we show that for appropriate boundary conditions the probability that there exists a closed pivotal edge for the horizontal crossing event decays logarithmically in $δ$. In the discrete graph case, we compute the limit of the probability of a horizontal crossing for appropriate boundary conditions.

preprint2020arXiv

Data Age Aware Scheduling for Wireless Powered Mobile-Edge Computing in Industrial Internet of Things

Wireless powered mobile edge computing has been envisioned as a promising paradigm to enhance the computation capability of low-power wireless devices in Industrial Internet of Things. An efficient resource scheduling method is critical yet challenging to design in such a scenario due to stochastic traffic arrival, time-coupling uplink/downlink decision and incomplete system state knowledge. To tackle these challenges, an online optimization algorithm is proposed in this paper to maximize long-term system utility balancing throughput and fairness, subject to data age and stability constraints. A set of virtual queues is designed to transform the scheduling task, which is hard to solve due to time-dependent data age constraints, into a stochastic optimization problem. Leveraging Lyapunov and convex optimization techniques, the proposed approach can achieve asymptotically near-optimal online decisions without any prior statistical knowledge, and maintain the asymptotic optimality in the presence of partial and outdated network state information. Numerical simulations corroborate the theoretical analysis and demonstrate the effectiveness of the proposed approach.

preprint2020arXiv

DeepDualMapper: A Gated Fusion Network for Automatic Map Extraction using Aerial Images and Trajectories

Automatic map extraction is of great importance to urban computing and location-based services. Aerial image and GPS trajectory data refer to two different data sources that could be leveraged to generate the map, although they carry different types of information. Most previous works on data fusion between aerial images and data from auxiliary sensors do not fully utilize the information of both modalities and hence suffer from the issue of information loss. We propose a deep convolutional neural network called DeepDualMapper which fuses the aerial image and trajectory data in a more seamless manner to extract the digital map. We design a gated fusion module to explicitly control the information flows from both modalities in a complementary-aware manner. Moreover, we propose a novel densely supervised refinement decoder to generate the prediction in a coarse-to-fine way. Our comprehensive experiments demonstrate that DeepDualMapper can fuse the information of images and trajectories much more effectively than existing approaches, and is able to generate maps with higher accuracy.

preprint2020arXiv

Distributed Brillouin frequency shift extraction via a convolutional neural network

Distributed optical fiber Brillouin sensors detect the temperature and strain along a fiber according to the local Brillouin frequency shift, which is usually calculated by the measured Brillouin spectrum using Lorentzian curve fitting. In addition, cross-correlation, principal component analysis, and machine learning methods have been proposed for the more efficient extraction of Brillouin frequency shifts. However, existing methods only process the Brillouin spectrum individually, ignoring the correlation in the time domain, indicating that there is still room for improvement. Here, we propose and experimentally demonstrate a full convolution neural network to extract the distributed Brillouin frequency shift directly from the measured two-dimensional data. Simulated ideal Brillouin spectrum with various parameters are used to train the network. Both the simulation and experimental results show that the extraction accuracy of the network is better than that of the traditional curve fitting algorithm with a much shorter processing time. This network has good universality and robustness and can effectively improve the performances of existing Brillouin sensors.

preprint2020arXiv

Electric generation from drops impacting onto charged surfaces

The impact of liquid drops onto solid surfaces leads to conversion of kinetic energy of directed drop motion into various forms of energy including surface energy, vibrational energy, heat, and under suitable conditions, electrical energy. The latter has attracted substantial attention in recent years for its potential to directly convert energy from random environmental flows such as rainfall, spray, and wave motion on the sea to electrical energy. Despite the invention of numerous configurations of such energy harvesters, the underlying physical principles and optimum operation conditions have remained elusive. In this letter, we use a combination of high-speed electrical current and video imaging measurements to develop a parameter-free quantitative description of the energy harvesting process for an optimized electrode configuration. A novel electrowetting-assisted charge injection method, EWCI, enables highly stable surface charges and robust energy conversion for several months with record efficiencies exceeding 2.5 percent of the initial kinetic energy.

preprint2020arXiv

Integer Quantization for Deep Learning Inference: Principles and Empirical Evaluation

Quantization techniques can reduce the size of Deep Neural Networks and improve inference latency and throughput by taking advantage of high throughput integer instructions. In this paper we review the mathematical aspects of quantization parameters and evaluate their choices on a wide range of neural network models for different application domains, including vision, speech, and language. We focus on quantization techniques that are amenable to acceleration by processors with high-throughput integer math pipelines. We also present a workflow for 8-bit quantization that is able to maintain accuracy within 1% of the floating-point baseline on all networks studied, including models that are more difficult to quantize, such as MobileNets and BERT-large.

preprint2020arXiv

Kernel Embedding based Variational Approach for Low-dimensional Approximation of Dynamical Systems

Transfer operators such as Perron-Frobenius or Koopman operator play a key role in modeling and analysis of complex dynamical systems, which allow linear representations of nonlinear dynamics by transforming the original state variables to feature spaces. However, it remains challenging to identify the optimal low-dimensional feature mappings from data. The variational approach for Markov processes (VAMP) provides a comprehensive framework for the evaluation and optimization of feature mappings based on the variational estimation of modeling errors, but it still suffers from a flawed assumption on the transfer operator and therefore sometimes fails to capture the essential structure of system dynamics. In this paper, we develop a powerful alternative to VAMP, called kernel embedding based variational approach for dynamical systems (KVAD). By using the distance measure of functions in the kernel embedding space, KVAD effectively overcomes the theoretical and practical limitations of VAMP. In addition, we develop a data-driven KVAD algorithm for seeking the ideal feature mapping within a subspace spanned by given basis functions, and numerical experiments show that the proposed algorithm can significantly improve the modeling accuracy compared to VAMP.

preprint2020arXiv

Learning Based Distributed Tracking

Inspired by the great success of machine learning in the past decade, people have been thinking about the possibility of improving the theoretical results by exploring data distribution. In this paper, we revisit a fundamental problem called Distributed Tracking (DT) under an assumption that the data follows a certain (known or unknown) distribution, and propose a number data-dependent algorithms with improved theoretical bounds. Informally, in the DT problem, there is a coordinator and k players, where the coordinator holds a threshold N and each player has a counter. At each time stamp, at most one counter can be increased by one. The job of the coordinator is to capture the exact moment when the sum of all these k counters reaches N. The goal is to minimise the communication cost. While our first type of algorithms assume the concrete data distribution is known in advance, our second type of algorithms can learn the distribution on the fly. Both of the algorithms achieve a communication cost bounded byO(k log log N) with high probability, improving the state-of-the-art data-independent bound O(k log N/k). We further propose a number of implementation optimisation heuristics to improve both efficiency and robustness of the algorithms. Finally, we conduct extensive experiments on three real datasets and four synthetic datasets. The experimental results show that the communication cost of our algorithms is as least as 20% of that of the state-of-the-art algorithms.

preprint2020arXiv

Masked Face Recognition Dataset and Application

In order to effectively prevent the spread of COVID-19 virus, almost everyone wears a mask during coronavirus epidemic. This almost makes conventional facial recognition technology ineffective in many cases, such as community access control, face access control, facial attendance, facial security checks at train stations, etc. Therefore, it is very urgent to improve the recognition performance of the existing face recognition technology on the masked faces. Most current advanced face recognition approaches are designed based on deep learning, which depend on a large number of face samples. However, at present, there are no publicly available masked face recognition datasets. To this end, this work proposes three types of masked face datasets, including Masked Face Detection Dataset (MFDD), Real-world Masked Face Recognition Dataset (RMFRD) and Simulated Masked Face Recognition Dataset (SMFRD). Among them, to the best of our knowledge, RMFRD is currently theworld's largest real-world masked face dataset. These datasets are freely available to industry and academia, based on which various applications on masked faces can be developed. The multi-granularity masked face recognition model we developed achieves 95% accuracy, exceeding the results reported by the industry. Our datasets are available at: https://github.com/X-zhangyang/Real-World-Masked-Face-Dataset.

preprint2020arXiv

Multivariate Regression of Mixed Responses for Evaluation of Visualization Designs

Information visualization significantly enhances human perception by graphically representing complex data sets. The variety of visualization designs makes it challenging to efficiently evaluate all possible designs catering to users' preferences and characteristics. Most of existing evaluation methods perform user studies to obtain multivariate qualitative responses from users via questionnaires and interviews. However, these methods cannot support online evaluation of designs as they are often time-consuming. A statistical model is desired to predict users' preferences on visualization designs based on non-interference measurements (i.e., wearable sensor signals). In this work, we propose a multivariate regression of mixed responses (MRMR) to facilitate quantitative evaluation of visualization designs. The proposed MRMR method is able to provide accurate model prediction with meaningful variable selection. A simulation study and a user study of evaluating visualization designs with 14 effective participants are conducted to illustrate the merits of the proposed model.

preprint2020arXiv

Optical Vortex Shaping & Multiple Singularities Manipulation via High-order Cross-phase

Increasing demand for practical applications is forcing deeper research into optical vortices (OVs): from the generation and measurement to shaping and multiple singularities manipulation of OVs. Herein, we propose a new type of phase structure called the high-order cross phase (HOCP) can be employed to modulate OVs to implement both polygonal shaping and singularities manipulation. Theoretically, we investigate the propagation characteristics of OVs with the HOCP. In experiments, we achieve the shaping and singularities manipulation of OVs by utilizing the HOCP. On this basis, we discuss the interference patterns of superposed OVs after the modulation. This work provides an alternative method to achieve both polygonal shaping and multiple singularities manipulation, which will facilitate applications in optical micro-manipulation, optical communication, and high-dimensional quantum entanglement.

preprint2020arXiv

Real-time Human Activity Recognition Using Conditionally Parametrized Convolutions on Mobile and Wearable Devices

Recently, deep learning has represented an important research trend in human activity recognition (HAR). In particular, deep convolutional neural networks (CNNs) have achieved state-of-the-art performance on various HAR datasets. For deep learning, improvements in performance have to heavily rely on increasing model size or capacity to scale to larger and larger datasets, which inevitably leads to the increase of operations. A high number of operations in deep leaning increases computational cost and is not suitable for real-time HAR using mobile and wearable sensors. Though shallow learning techniques often are lightweight, they could not achieve good performance. Therefore, deep learning methods that can balance the trade-off between accuracy and computation cost is highly needed, which to our knowledge has seldom been researched. In this paper, we for the first time propose a computation efficient CNN using conditionally parametrized convolution for real-time HAR on mobile and wearable devices. We evaluate the proposed method on four public benchmark HAR datasets consisting of WISDM dataset, PAMAP2 dataset, UNIMIB-SHAR dataset, and OPPORTUNITY dataset, achieving state-of-the-art accuracy without compromising computation cost. Various ablation experiments are performed to show how such a network with large capacity is clearly preferable to baseline while requiring a similar amount of operations. The method can be used as a drop-in replacement for the existing deep HAR architectures and easily deployed onto mobile and wearable devices for real-time HAR applications.

preprint2020arXiv

Response to LiveBot: Generating Live Video Comments Based on Visual and Textual Contexts

Live video commenting systems are an emerging feature of online video sites. Recently the Chinese video sharing platform Bilibili, has popularised a novel captioning system where user comments are displayed as streams of moving subtitles overlaid on the video playback screen and broadcast to all viewers in real-time. LiveBot was recently introduced as a novel Automatic Live Video Commenting (ALVC) application. This enables the automatic generation of live video comments from both the existing video stream and existing viewers comments. In seeking to reproduce the baseline results reported in the original Livebot paper, we found differences between the reproduced results using the project codebase and the numbers reported in the paper. Further examination of this situation suggests that this may be caused by a number of small issues in the project code, including a non-obvious overlap between the training and test sets. In this paper, we study these discrepancies in detail and propose an alternative baseline implementation as a reference for other researchers in this field.

preprint2020arXiv

Room-temperature quasi-continuous-wave pentacene maser pumped by an invasive Ce:YAG luminescent concentrator

We present in this work a quasi-continuous-wave (CW) pentacene maser operating at 1.45 GHz in the Earth's magnetic field at room temperature with a duration of $\sim$4 ms and an output power of up to -25 dBm. The maser is optically pumped by a cerium-doped YAG (Ce:YAG) luminescent concentrator (LC) whose wedge-shaped output is embedded inside a 0.1% pentacene-doped para-terphenyl (Pc:Ptp) crystal. The pumped crystal is located inside a ring of strontium titanate (STO) that supports a TE$_{01δ}$ mode of high magnetic Purcell factor. Combined with simulations, our results indicate that CW operation of pentacene masers at room-temperature is perfectly feasible so long as excessive heating of the crystal is avoided.

preprint2020arXiv

Scaling Limits of Crossing Probabilities in Metric Graph GFF

We consider metric graph Gaussian free field (GFF) defined on polygons of $δ\mathbb{Z}^2$ with alternating boundary data. The crossing probabilities for level-set percolation of metric graph GFF have scaling limits. When the boundary data is well-chosen, the scaling limits of crossing probabilities can be explicitly constructed as "fusion" of multiple SLE$_4$ pure partition functions.

preprint2020arXiv

Structural-Aware Sentence Similarity with Recursive Optimal Transport

Measuring sentence similarity is a classic topic in natural language processing. Light-weighted similarities are still of particular practical significance even when deep learning models have succeeded in many other tasks. Some light-weighted similarities with more theoretical insights have been demonstrated to be even stronger than supervised deep learning approaches. However, the successful light-weighted models such as Word Mover's Distance [Kusner et al., 2015] or Smooth Inverse Frequency [Arora et al., 2017] failed to detect the difference from the structure of sentences, i.e. order of words. To address this issue, we present Recursive Optimal Transport (ROT) framework to incorporate the structural information with the classic OT. Moreover, we further develop Recursive Optimal Similarity (ROTS) for sentences with the valuable semantic insights from the connections between cosine similarity of weighted average of word vectors and optimal transport. ROTS is structural-aware and with low time complexity compared to optimal transport. Our experiments over 20 sentence textural similarity (STS) datasets show the clear advantage of ROTS over all weakly supervised approaches. Detailed ablation study demonstrate the effectiveness of ROT and the semantic insights.

preprint2019arXiv

A State-Failure--Network Method to Identify Critical Components in Power Systems

In order to mitigate cascading failure blackout risks in power systems, the critical components whose failures lead to high blackout risks should be identified. In this paper, such critical components are identified by the state-failure network (SF-network) formed by cascading failure chain and loss data, which can be gathered from either utilities or simulations. The failures along the chains are recombined in the SF-network, where each failure is allocated a value that can reveal the blackout risks after their occurrences. Thus, critical failures can be identified in the SF-network where the failures raise up blackout risks, and thus the critical components can be found based on their critical failure risks. The simulation results validate the effectiveness of the proposed method.

preprint2019arXiv

Experimental creation and annihilation of nonvolatile magnetic skyrmions using voltage control of magnetic anisotropy without an external magnetic field

In this work, we utilize voltage controlled magnetic anisotropy (VCMA) to manipulate magnetic skyrmions that are fixed in space. Memory devices based on this strategy can potentially be of smaller footprint and better energy efficiency than current-controlled motion-based skyrmionic devices. To demonstrate VCMA induced manipulation of skyrmions, we fabricate antiferromagnet/ferromagnet/oxide heterostructure films where skyrmions can be stabilized without any external magnetic field due to the presence of exchange bias. These isolated skyrmions were annihilated by applying a voltage pulse that increased PMA. On the other hand, decreasing PMA promoted formation of more skyrmions. Furthermore, skyrmions can be created from chiral domains by increasing PMA of the system. To corroborate our experimental observations, we performed micromagnetic simulation. The proposed method could potentially lead to novel skyrmion-based memory devices.

preprint2019arXiv

Generation and Measurement of High-order Optical Vortex via Cross-Phase

The generation and measurement of optical vortex (OV) are the basis for a variety of related applications. However, the special case of high-order OVs has not been sufficient addressed yet. Herein, a generation and measurement method of high-order OV via utilizing the CP is investigated. In the experiment, we generate OVs with l=60, p=20 and successfully measure OVs with l=200,p=0, where experimental results agree well with simulation outcome. On this basis, the intensity distributions of LG and HG beams (corresponding to the generation and measurement) versus waist radius of initial light beams is discussed. This work provides an alternative method to generate or measure high-order OV, which will facilitate applications in optical micro-manipulation, quantum entanglement and rotation speed detection.

preprint2016arXiv

A conformally invariant growth process of SLE excursions

We construct an aggregation process of chordal SLE(κ) excursions in the unit disk, starting from the boundary, growing towards all inner points simultaneously, invariant under all conformal self-maps of the disk. We prove that this conformal growth process of excursions, abbreviated as CGE(κ), exists iff κ\in [0,4), and that it does not create additional fractalness: the Hausdorff dimension of the closure of all the SLE(κ) arcs attached is 1+κ/8 almost surely. We determine the dimension of points that are approached by CGE(κ) at an atypical rate, and construct conformally invariant random fields on the disk based on CGE(κ).

preprint2016arXiv

A new earthquake location method based on the waveform inversion

In this paper, a new earthquake location method based on the waveform inversion is proposed. As is known to all, the waveform misfit function is very sensitive to the phase shift between the synthetic waveform signal and the real waveform signal. Thus, the convergence domain of the conventional waveform based earthquake location methods is very small. In present study, by introducing and solving a simple sub-optimization problem, we greatly expand the convergence domain of the waveform based earthquake location method. According to a large number of numerical experiments, the new method expands the range of convergence by several tens of times. This allows us to locate the earthquake accurately even from some relatively bad initial values.

preprint2016arXiv

Amoeboid swimming in a channel

Several micro-organisms, such as bacteria, algae, or spermatozoa, use flagella or cilia to swim in a fluid, while many other micro-organisms instead use ample shape deformation, described as amoeboid, to propel themselves by either crawling on a substrate or swimming. Many eukaryotic cells were believed to require an underlying substratum to migrate (crawl) by using membrane deformation (like blebbing or generation of lamellipodia) but there is now increasing evidence that a large variety of cells (including those of the immune system) can migrate without the assistance of focal adhesion, allowing them to swim as efficiently as they can crawl. This paper details the analysis of amoeboid swimming in a confined fluid by modeling the swimmer as an inextensible membrane deploying local active forces. The swimmer displays a rich behavior: it may settle into a straight trajectory in the channel or navigate from one wall to the other depending on its confinement. The nature of the swimmer is also found to be affected by confinement: the swimmer can behave, on the average over one swimming cycle, as a pusher at low confinement, and becomes a puller at higher confinement. The swimmer's nature is thus not an intrinsic property. The scaling of the swimmer velocity V with the force amplitude A is analyzed in detail showing that at small enough A, $V\sim A^2/η^2$, whereas at large enough A, V is independent of the force and is determined solely by the stroke frequency and swimmer size. This finding starkly contrasts with currently known results found from swimming models where motion is based on flagellar or ciliary activity, where $V\sim A/η$. To conclude, two definitions of efficiency as put forward in the literature are analyzed with distinct outcomes. We find that one type of efficiency has an optimum as a function of confinement while the other does not. Future perspectives are outlined.

preprint2016arXiv

Building an Evaluation Scale using Item Response Theory

Evaluation of NLP methods requires testing against a previously vetted gold-standard test set and reporting standard metrics (accuracy/precision/recall/F1). The current assumption is that all items in a given test set are equal with regards to difficulty and discriminating power. We propose Item Response Theory (IRT) from psychometrics as an alternative means for gold-standard test-set generation and NLP system evaluation. IRT is able to describe characteristics of individual items - their difficulty and discriminating power - and can account for these characteristics in its estimation of human intelligence or ability for an NLP task. In this paper, we demonstrate IRT by generating a gold-standard test set for Recognizing Textual Entailment. By collecting a large number of human responses and fitting our IRT model, we show that our IRT model compares NLP systems with the performance in a human population and is able to provide more insight into system performance than standard evaluation metrics. We show that a high accuracy score does not always imply a high IRT score, which depends on the item characteristics and the response pattern.

preprint2016arXiv

Cloud Server Benchmarks for Performance Evaluation of New Hardware Architecture

Adding new hardware features to a cloud computing server requires testing both the functionalities and the performance of the new hardware mechanisms. However, commonly used cloud computing server workloads are not well-represented by the SPEC integer and floating-point benchmark and Parsec suites typically used by the computer architecture community. Existing cloud benchmark suites for scale-out or scale-up computing are not representative of the most common cloud usage, and are very difficult to run on a cycle-accurate simulator that can accurately model new hardware, like gem5. In this paper, we present PALMScloud, a suite of cloud computing benchmarks for performance evaluation of cloud servers, that is ready to run on the gem5 cycle-accurate simulator. We demonstrate how our cloud computing benchmarks are used in evaluating the cache performance of a new secure cache called Newcache as a case study. We hope that these cloud benchmarks, ready to run on a dual-machine gem5 simulator or on real machines, can be useful to other researchers interested in improving hardware micro-architecture and cloud server performance.

preprint2016arXiv

Forecasting the Flu: Designing Social Network Sensors for Epidemics

Early detection and modeling of a contagious epidemic can provide important guidance about quelling the contagion, controlling its spread, or the effective design of countermeasures. A topic of recent interest has been to design social network sensors, i.e., identifying a small set of people who can be monitored to provide insight into the emergence of an epidemic in a larger population. We formally pose the problem of designing social network sensors for flu epidemics and identify two different objectives that could be targeted in such sensor design problems. Using the graph theoretic notion of dominators we develop an efficient and effective heuristic for forecasting epidemics at lead time. Using six city-scale datasets generated by extensive microscopic epidemiological simulations involving millions of individuals, we illustrate the practical applicability of our methods and show significant benefits (up to twenty-two days more lead time) compared to other competitors. Most importantly, we demonstrate the use of surrogates or proxies for policy makers for designing social network sensors that require from nonintrusive knowledge of people to more information on the relationship among people. The results show that the more intrusive information we obtain, the longer lead time to predict the flu outbreak up to nine days.

preprint2016arXiv

Gate-induced insulator to band-like transport transition in organolead halide perovskite

Understanding the intrinsic charge transport in organolead halide perovskites is essential for the development of high-efficiency photovoltaics and other optoelectronic devices. Despite the rapid advancement of the organolead halide perovskite in photovoltaic and optoelectronic applications, the intrinsic charge carrier transport in these materials remains elusive partly due to the difficulty of fabricating electrical devices and obtaining good electrical contact. Here, we report the fabrication of organolead halide perovskite microplates with monolayer graphene as low barrier electrical contact. A systematic charge transport studies reveal an insulator to band-like transport transition. Our studies indicate that the insulator to band-like transport transition depends on the orthorhombic-to-tetragonal phase transition temperature and defect densities of the organolead halide perovskite microplates. Our findings are not only important for the fundamental understanding of charge transport behavior but also offer valuable practical implications for photovoltaics and optoelectronic applications based on the organolead halide perovskite.

preprint2016arXiv

Generating Realistic Synthetic Population Datasets

Modern studies of societal phenomena rely on the availability of large datasets capturing attributes and activities of synthetic, city-level, populations. For instance, in epidemiology, synthetic population datasets are necessary to study disease propagation and intervention measures before implementation. In social science, synthetic population datasets are needed to understand how policy decisions might affect preferences and behaviors of individuals. In public health, synthetic population datasets are necessary to capture diagnostic and procedural characteristics of patient records without violating confidentialities of individuals. To generate such datasets over a large set of categorical variables, we propose the use of the maximum entropy principle to formalize a generative model such that in a statistically well-founded way we can optimally utilize given prior information about the data, and are unbiased otherwise. An efficient inference algorithm is designed to estimate the maximum entropy model, and we demonstrate how our approach is adept at estimating underlying data distributions. We evaluate this approach against both simulated data and on US census datasets, and demonstrate its feasibility using an epidemic simulation application.

preprint2016arXiv

Hierarchical Neural Language Models for Joint Representation of Streaming Documents and their Content

We consider the problem of learning distributed representations for documents in data streams. The documents are represented as low-dimensional vectors and are jointly learned with distributed vector representations of word tokens using a hierarchical framework with two embedded neural language models. In particular, we exploit the context of documents in streams and use one of the language models to model the document sequences, and the other to model word sequences within them. The models learn continuous vector representations for both word tokens and documents such that semantically similar documents and words are close in a common vector space. We discuss extensions to our model, which can be applied to personalized recommendation and social relationship mining by adding further user layers to the hierarchy, thus learning user-specific vectors to represent individual preferences. We validated the learned representations on a public movie rating data set from MovieLens, as well as on a large-scale Yahoo News data comprising three months of user activity logs collected on Yahoo servers. The results indicate that the proposed model can learn useful representations of both documents and word tokens, outperforming the current state-of-the-art by a large margin.

preprint2016arXiv

Interactive and Iterative Discovery of Entity Network Subgraphs

Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective interestingness from a user's viewpoint. Furthermore, existing approaches to mine graphs are not interactive and cannot incorporate user feedbacks in any natural manner. In this paper, we address these gaps by proposing a graph maximum entropy model to discover surprising connected subgraph patterns from entity graphs. This model is embedded in an interactive visualization framework to enable human-in-the-loop, model-guided data exploration. Using case studies on real datasets, we demonstrate how interactions between users and the maximum entropy model lead to faster and explainable conclusions.

preprint2016arXiv

Level Lines of Gaussian Free Field II: Whole-Plane GFF

We study the level lines of GFF starting from interior points. We show that the level line of GFF starting from an interior point turns out to be a sequence of level loops. The sequence of level loops satisfies "target-independent" property. All sequences of level loops starting from interior points give a tree-structure of the plane. We also introduce the continuum exploration process of GFF starting from interior. The continuum exploration process of whole-plane GFF satisfies "reversibility".

preprint2016arXiv

Proving Linearizability via Branching Bisimulation

Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit branching bisimulation, a fundamental semantic equivalence relation developed for process algebras which can be computed efficiently, in checking these properties. A quotient construction is provided which results in huge state space reductions. We confirm the advantages of the proposed approach on more than a dozen benchmark problems.

preprint2016arXiv

Reversible Markov chain estimation using convex-concave programming

We present a convex-concave reformulation of the reversible Markov chain estimation problem and outline an efficient numerical scheme for the solution of the resulting problem based on a primal-dual interior point method for monotone variational inequalities. Extensions to situations in which information about the stationary vector is available can also be solved via the convex- concave reformulation. The method can be generalized and applied to the discrete transition matrix reweighting analysis method to perform inference from independent chains with specified couplings between the stationary probabilities. The proposed approach offers a significant speed-up compared to a fixed-point iteration for a number of relevant applications.

preprint2016arXiv

Sparse Estimation of Multivariate Poisson Log-Normal Models from Count Data

Modeling data with multivariate count responses is a challenging problem due to the discrete nature of the responses. Existing methods for univariate count responses cannot be easily extended to the multivariate case since the dependency among multiple responses needs to be properly accommodated. In this paper, we propose a multivariate Poisson log-normal regression model for multivariate data with count responses. By simultaneously estimating the regression coefficients and inverse covariance matrix over the latent variables with an efficient Monte Carlo EM algorithm, the proposed regression model takes advantages of association among multiple count responses to improve the model prediction performance. Simulation studies and applications to real world data are conducted to systematically evaluate the performance of the proposed method in comparison with conventional methods.

preprint2015arXiv

A Graph-Partition-Based Scheduling Policy for Heterogeneous Architectures

In order to improve system performance efficiently, a number of systems choose to equip multi-core and many-core processors (such as GPUs). Due to their discrete memory these heterogeneous architectures comprise a distributed system within a computer. A data-flow programming model is attractive in this setting for its ease of expressing concurrency. Programmers only need to define task dependencies without considering how to schedule them on the hardware. However, mapping the resulting task graph onto hardware efficiently remains a challenge. In this paper, we propose a graph-partition scheduling policy for mapping data-flow workloads to heterogeneous hardware. According to our experiments, our graph-partition-based scheduling achieves comparable performance to conventional queue-base approaches.

preprint2015arXiv

Amoeboid motion in confined geometry

Many eukaryotic cells undergo frequent shape changes (described as amoeboid motion) that enable them to move forward. We investigate the effect of confinement on a minimal model of amoeboid swimmer. Complex pictures emerge: (i) The swimmer's nature (i.e., either pusher or puller) can be modified by confinement, thus suggesting that this is not an intrinsic property of the swimmer. This swimming nature transition stems from intricate internal degrees of freedom of membrane deformation. (ii) The swimming speed might increase with increasing confinement before decreasing again for stronger confinements. (iii) A straight amoeoboid swimmer's trajectory in the channel can become unstable, and ample lateral excursions of the swimmer prevail. This happens for both pusher- and puller-type swimmers. For weak confinement, these excursions are symmetric, while they become asymmetric at stronger confinement, whereby the swimmer is located closer to one of the two walls. In this study, we combine numerical and theoretical analyses.

preprint2015arXiv

Anisotropy and Strong-Coupling Effects on the Collective Mode Spectrum of Chiral Superconductors: Application to Sr$_2$RuO$_4$

Recent theories of Sr$_2$RuO$_4$ based on the interplay of strong interactions, spin-orbit coupling and multi-band anisotropy predict chiral or helical ground states with strong anisotropy of the pairing states, with deep minima in the excitation gap, as well as strong phase anisotropy for the chiral ground state. We develop time-dependent mean field theory to calculate the Bosonic spectrum for the class of 2D chiral superconductors spanning $^3$He-A to chiral superconductors with strong anisotropy. Chiral superconductors support a pair of massive Bosonic excitations of the time-reversed pairs labeled by their parity under charge conjugation. These modes are degenerate for 2D $^3$He-A. Crystal field anisotropy lifts the degeneracy. Strong anisotropy also leads to low-lying Fermions, and thus to channels for the decay of the Bosonic modes. Selection rules and phase space considerations lead to large asymmetries in the lifetimes and hybridization of the Bosonic modes with the continuum of un-bound Fermion pairs. We also highlight results for the excitation of the Bosonic modes by microwave radiation that provide clear signatures of the Bosonic modes of an anisotropic chiral ground state.

preprint2015arXiv

Clustering Assisted Fundamental Matrix Estimation

In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory determination and 3D reconstruction. In this paper we propose a new method for fundamental matrix estimation that makes use of clustering a group of 4D vectors. The key insight is the observation that among the 4D vectors constructed from matching pairs of points obtained from the SIFT algorithm, well-defined cluster points tend to be reliable inliers suitable for fundamental matrix estimation. Based on this, we utilizes a recently proposed efficient clustering method through density peaks seeking and propose a new clustering assisted method. Experimental results show that the proposed algorithm is faster and more accurate than currently commonly used methods.

preprint2015arXiv

Estimation and uncertainty of reversible Markov models

Reversibility is a key concept in Markov models and Master-equation models of molecular kinetics. The analysis and interpretation of the transition matrix encoding the kinetic properties of the model relies heavily on the reversibility property. The estimation of a reversible transition matrix from simulation data is therefore crucial to the successful application of the previously developed theory. In this work we discuss methods for the maximum likelihood estimation of transition matrices from finite simulation data and present a new algorithm for the estimation if reversibility with respect to a given stationary vector is desired. We also develop new methods for the Bayesian posterior inference of reversible transition matrices with and without given stationary vector taking into account the need for a suitable prior distribution preserving the meta- stable features of the observed process during posterior inference. All algorithms here are implemented in the PyEMMA software - http://pyemma.org - as of version 2.0.

preprint2015arXiv

High Current Density Vertical Tunneling Transistors from Graphene/Highly-Doped Silicon Heterostructures

Graphene/silicon heterostructures have attracted tremendous interest as a new platform for diverse electronic and photonic devices such as barristors, solar cells, optical modulators, and chemical sensors. The studies to date largely focus on junctions between graphene and lightly-doped silicon, where a Schottky barrier is believed to dominate the carrier transport process. Here we report a systematic investigation of carrier transport across the heterojunctions formed between graphene and highly-doped silicon. By varying the silicon doping level and the measurement temperature, we show that the carrier transport across the graphene/p++-Si heterojunction is dominated by tunneling effect through the native oxide. We further demonstrate that the tunneling current can be effectively modulated by the external gate electrical field, resulting in a vertical tunneling transistor. Benefited from the large density of states of highly doped silicon, our tunneling transistors can deliver a current density over 20 A/cm2, about two orders of magnitude higher than previous graphene/insulator/graphene tunneling transistor at the same on/off ratio.

preprint2015arXiv

Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models

Modern visual analytic tools promote human-in-the-loop analysis but are limited in their ability to direct the user toward interesting and promising directions of study. This problem is especially acute when the analysis task is exploratory in nature, e.g., the discovery of potentially coordinated relationships in massive text datasets. Such tasks are very common in domains like intelligence analysis and security forensics where the goal is to uncover surprising coalitions bridging multiple types of relations. We introduce new maximum entropy models to discover surprising chains of relationships leveraging count data about entity occurrences in documents. These models are embedded in a visual analytic system called MERCER that treats relationship bundles as first class objects and directs the user toward promising lines of inquiry. We demonstrate how user input can judiciously direct analysis toward valid conclusions whereas a purely algorithmic approach could be led astray. Experimental results on both synthetic and real datasets from the intelligence community are presented.

preprint2015arXiv

Personalized QoS Prediction of Cloud Services via Learning Neighborhood-based Model

The explosion of cloud services on the Internet brings new challenges in service discovery and selection. Particularly, the demand for efficient quality-of-service (QoS) evaluation is becoming urgently strong. To address this issue, this paper proposes neighborhood-based approach for QoS prediction of cloud services by taking advantages of collaborative intelligence. Different from heuristic collaborative filtering and matrix factorization, we define a formal neighborhood-based prediction framework which allows an efficient global optimization scheme, and then exploit different baseline estimate component to improve predictive performance. To validate the proposed methods, a large-scale QoS-specific dataset which consists of invocation records from 339 service users on 5,825 web services on a world-scale distributed network is used. Experimental results demonstrate that the learned neighborhood-based models can overcome existing difficulties of heuristic collaborative filtering methods and achieve superior performance than state-of-the-art prediction methods.

preprint2015arXiv

Remarks on the intersection of SLE$_κ(ρ)$ curve with the real line

SLE$_κ(ρ)$ is a variant of SLE$_κ$ where $ρ$ characterizes the repulsion (if $ρ>0$) or attraction $(ρ<0)$ from the boundary. This paper examines the probabilities of SLE$_κ(ρ)$ to get close to the boundary. We show how close the chordal SLE$_κ(ρ)$ curves get to the boundary asymptotically, and provide an estimate for the probability that the SLE$_κ(ρ)$ curve hits graph of functions. These generalize the similar result derived by Schramm and Zhou for standard SLE$_κ$ curves.

preprint2015arXiv

Simple CLE in Doubly Connected Domains

We study Conformal Loop Ensemble (CLE$_κ$) in doubly connected domains: annuli, the punctured disc, and the punctured plane. We restrict attention to CLE$_κ$ for which the loops are simple, i.e. $κ\in (8/3,4]$. In the paper "Conformal Loop Ensemble" by Sheffield and Werner, simple CLE in the unit disc is introduced and constructed as the collection of outer boundaries of outermost clusters of the Brownian loop soup. For simple CLE in the unit disc, any fixed interior point is almost surely surrounded by some loop of CLE. The gasket of the collection of loops in CLE, i.e. the set of points that are not surrounded by any loop, almost surely has Lebesgue measure zero. In the current paper, simple CLE in an annulus is constructed similarly: it is the collection of outer boundaries of outermost clusters of the Brownian loop soup conditioned on the event that there is no cluster disconnecting the two components of the boundary of the annulus. Simple CLE in the punctured disc can be viewed as simple CLE in the unit disc conditioned on the event that the origin is in the gasket. Simple CLE in the punctured plane can be viewed as simple CLE in the whole plane conditioned on the event that both the origin and infinity are in the gasket. We construct and study these three kinds of CLEs, along with the corresponding exploration processes.

preprint2015arXiv

The Computational Principles of Learning Ability

It has been quite a long time since AI researchers in the field of computer science stop talking about simulating human intelligence or trying to explain how brain works. Recently, represented by deep learning techniques, the field of machine learning is experiencing unprecedented prosperity and some applications with near human-level performance bring researchers confidence to imply that their approaches are the promising candidate for understanding the mechanism of human brain. However apart from several ancient philological criteria and some imaginary black box tests (Turing test, Chinese room) there is no computational level explanation, definition or criteria about intelligence or any of its components. Base on the common sense that learning ability is one critical component of intelligence and inspect from the viewpoint of mapping relations, this paper presents two laws which explains what is the "learning ability" as we familiar with and under what conditions a mapping relation can be acknowledged as "Learning Model".

preprint2015arXiv

Wafer-scale growth of large arrays of perovskite microplate crystals for functional electronics and optoelectronics

Methylammonium lead iodide perovskite has attracted intensive interest for its diverse optoelectronic applications. However, most studies to date have been limited to bulk thin films that are difficult to implement for integrated device arrays because of their incompatibility with typical lithography processes. We report the first patterned growth of regular arrays of perovskite microplate crystals for functional electronics and optoelectronics. We show that large arrays of lead iodide microplates can be grown from an aqueous solution through a seeded growth process and can be further intercalated with methylammonium iodide to produce perovskite crystals. Structural and optical characterizations demonstrate that the resulting materials display excellent crystalline quality and optical properties. We further show that perovskite crystals can be selectively grown on prepatterned electrode arrays to create independently addressable photodetector arrays and functional field effect transistors. The ability to grow perovskite microplates and to precisely place them at specific locations offers a new material platform for the fundamental investigation of the electronic and optical properties of perovskite materials and opens a pathway for integrated electronic and optoelectronic systems.

preprint2015arXiv

What is Learning? A primary discussion about information and Representation

Nowadays, represented by Deep Learning techniques, the field of machine learning is experiencing unprecedented prosperity and its influence is demonstrated in academia, industry and civil society. "Intelligent" has become a label which could not be neglected for most applications; celebrities and scientists also warned that the development of full artificial intelligence may spell the end of the human race. It seems that the answer to building a computer system that could automatically improve with experience is right on the next corner. While for AI and machine learning researchers, it is a consensus that we are not anywhere near the core technique which could bring the Terminator, Number 5 or R2D2 into real life, and there is not even a formal definition about what is intelligence, or one of its basic properties: Learning. Therefore, even though researchers know these concerns are not necessary currently, there is no generalized explanation about why these concerns are not necessary, and what properties people should take into account that would make these concerns to be necessary. In this paper, starts from analysing the relation between information and its representation, a necessary condition for a model to be a learning model is proposed. This condition and related future works could be used to verify whether a system is able to learn or not, and enrich our understanding of learning: one important property of Intelligence.

preprint2015arXiv

xTRAM: Estimating equilibrium expectations from time-correlated simulation data at multiple thermodynamic states

Computing the equilibrium properties of complex systems, such as free energy differences, is often hampered by rare events in the dynamics. Enhanced sampling methods may be used in order to speed up sampling by, for example, using high temperatures, as in parallel tempering, or simulating with a biasing potential such as in the case of umbrella sampling. The equilibrium properties of the thermodynamic state of interest (e.g., lowest temperature or unbiased potential) can be computed using reweighting estimators such as the weighted histogram analysis method or the multistate Bennett acceptance ratio (MBAR). weighted histogram analysis method and MBAR produce unbiased estimates, the simulation samples from the global equilibria at their respective thermodynamic state--a requirement that can be prohibitively expensive for some simulations such as a large parallel tempering ensemble of an explicitly solvated biomolecule. Here, we introduce the transition-based reweighting analysis method (TRAM)--a class of estimators that exploit ideas from Markov modeling and only require the simulation data to be in local equilibrium within subsets of the configuration space. We formulate the expanded TRAM (xTRAM) estimator that is shown to be asymptotically unbiased and a generalization of MBAR. Using four exemplary systems of varying complexity, we demonstrate the improved convergence (ranging from a twofold improvement to several orders of magnitude) of xTRAM in comparison to a direct counting estimator and MBAR, with respect to the invested simulation effort. Lastly, we introduce a random-swapping simulation protocol that can be used with xTRAM, gaining orders-of-magnitude advantages over simulation protocols that require the constraint of sampling from a global equilibrium.

preprint2014arXiv

A Family of Transverse Link Homologies

We define a homology $\mathcal{H}_N$ for closed braids by applying Khovanov and Rozansky's matrix factorization construction with potential $ax^{N+1}$. Up to a grading shift, $\mathcal{H}_0$ is the HOMFLYPT homology defined in arXiv:math/0505056. We demonstrate that, for $N \geq 1$, $\mathcal{H}_N$ is a $\mathbb{Z}_2\oplus\mathbb{Z}^{\oplus 3}$-graded $\mathbb{Q}[a]$-module that is invariant under transverse Markov moves, but not under negative stabilization/de-stabilization. Thus, for $N\geq 1$, this homology is an invariant for transverse links in the standard contact $S^3$, but not for smooth links. We also discuss the decategorification of $\mathcal{H}_N$ and the relation between $\mathcal{H}_N$ and the $\mathfrak{sl}(N)$ Khovanov-Rozansky homology defined in arXiv:math/0401268.

preprint2014arXiv

Existence and uniqueness of global weak solutions to a Cahn-Hilliard-Stokes-Darcy system for two phase incompressible flows in karstic geometry

We study the well-posedness of a coupled Cahn-Hilliard-Stokes-Darcy system which is a diffuse-interface model for essentially immiscible two phase incompressible flows with matched density in a karstic geometry. Existence of finite energy weak solution that is global in time is established in both 2D and 3D. Weak-strong uniqueness property of the weak solutions is provided as well.

preprint2014arXiv

Maximum Margin Clustering for State Decomposition of Metastable Systems

When studying a metastable dynamical system, a prime concern is how to decompose the phase space into a set of metastable states. Unfortunately, the metastable state decomposition based on simulation or experimental data is still a challenge. The most popular and simplest approach is geometric clustering which is developed based on the classical clustering technique. However, the prerequisites of this approach are: (1) data are obtained from simulations or experiments which are in global equilibrium and (2) the coordinate system is appropriately selected. Recently, the kinetic clustering approach based on phase space discretization and transition probability estimation has drawn much attention due to its applicability to more general cases, but the choice of discretization policy is a difficult task. In this paper, a new decomposition method designated as maximum margin metastable clustering is proposed, which converts the problem of metastable state decomposition to a semi-supervised learning problem so that the large margin technique can be utilized to search for the optimal decomposition without phase space discretization. Moreover, several simulation examples are given to illustrate the effectiveness of the proposed method.

preprint2014arXiv

On the Transverse Khovanov-Rozansky Homologies: Graded Module Structure and Stabilization

In arXiv:1308.3152, the author proved that the Khovanov-Rozansky homology $\mathcal{H}_N$ with potential $ax^{N+1}$ is an invariant for transverse links in the standard contact $3$-sphere. In the current paper, we study the $\mathbb{Z}_2 \oplus \mathbb{Z}^{\oplus 3}$-graded $\mathbb{Q}[a]$-module structure of $\mathcal{H}_N$, which leads to better understanding of the effect of stabilization on $\mathcal{H}_N$. As an application, we compute $\mathcal{H}_N$ for all transverse unknots.

preprint2014arXiv

Statistically optimal analysis of state-discretized trajectory data from multiple thermodynamic states

We propose a discrete transition-based reweighting analysis method (dTRAM) for analyzing configuration-space-discretized simulation trajectories produced at different thermodynamic states (temperatures, Hamiltonians, etc.) dTRAM provides maximum-likelihood estimates of stationary quantities (probabilities, free energies, expectation values) at any thermodynamic state. In contrast to the weighted histogram analysis method (WHAM), dTRAM does not require data to be sampled from global equilibrium, and can thus produce superior estimates for enhanced sampling data such as parallel/simulated tempering, replica exchange, umbrella sampling, or metadynamics. In addition, dTRAM provides optimal estimates of Markov state models (MSMs) from the discretized state-space trajectories at all thermodynamic states. Under suitable conditions, these MSMs can be used to calculate kinetic quantities (e.g. rates, timescales). In the limit of a single thermodynamic state, dTRAM estimates a maximum likelihood reversible MSM, while in the limit of uncorrelated sampling data, dTRAM is identical to WHAM. dTRAM is thus a generalization to both estimators.

preprint2013arXiv

A colored sl(N)-homology for links in S^3

Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every component of the link is colored by 1, this chain complex is isomorphic to the chain complex defined by Khovanov and Rozansky in arXiv:math/0401268. The homology of this chain complex decategorifies to the Reshetikhin-Turaev sl(N) polynomial of links colored by exterior powers of the defining representation.

preprint2013arXiv

Equivariant Khovanov-Rozansky Homology and Lee-Gornik Spectral Sequence

Lobb observed in [arXiv:1103.1412] that each equivariant sl(N) Khovanov-Rozansky homology over C[a] admits a standard decomposition of a simple form. In the present paper, we derive a formula for the corresponding Lee-Gornik spectral sequence in terms of this decomposition. Based on this formula, we give a simple alternative definition of the Lee-Gornik spectral sequence using exact couples. We also demonstrate that an equivariant sl(N) Khovanov-Rozansky homology over C[a] can be recovered from the corresponding Lee-Gornik spectral sequence via this formula. Therefore, these two algebraic invariants are equivalent and contain the same information about the link. As a byproduct of the exact couple construction, we generalize Lee's endomorphism on the rational Khovanov homology to a natural exterior algebra action on the sl(N) Khovanov-Rozansky homology. A numerical link invariant called torsion width comes up naturally in our work. It determines when the corresponding Lee-Gornik spectral sequence collapses and is bounded from above by the homological thickness of the sl(N) Khovanov-Rozansky homology. We use the torsion width to explain why the Lee spectral sequences of certain H-thick links collapse so fast.

preprint2013arXiv

Global weak solution and blow-up criterion of the general Ericksen-Leslie system for nematic liquid crystal flows

In this paper we investigate the three dimensional general Ericksen-Leslie (E--L) system with Ginzburg-Landau type approximation modeling nematic liquid crystal flows. First, by overcoming the difficulties from lack of maximum principle for the director equation and high order nonlinearities for the stress tensor, we prove existence of global-in-time weak solutions under physically meaningful boundary conditions and suitable assumptions on the Leslie coefficients, which ensures that the total energy of the E--L system is dissipated. Moreover, for the E--L system with periodic boundary conditions, we prove the local well-posedness of classical solutions under the so-called Parodi's relation and establish a blow-up criterion in terms of the temporal integral of both the maximum norm of the curl of the velocity field and the maximum norm of the gradient of the liquid crystal director field.

preprint2013arXiv

Intersections of SLE Paths: the double and cut point dimension of SLE

We compute the almost-sure Hausdorff dimension of the double points of chordal SLE_kappa for kappa > 4, confirming a prediction of Duplantier-Saleur (1989) for the contours of the FK model. We also compute the dimension of the cut points of chordal SLE_kappa for kappa > 4 as well as analogous dimensions for the radial and whole-plane SLE_kappa(rho) processes for kappa > 0. We derive these facts as consequences of a more general result in which we compute the dimension of the intersection of two flow lines of the formal vector field e^{ih/chi}, where h is a Gaussian free field and chi > 0, of different angles with each other and with the domain boundary.

preprint2013arXiv

Long-time behavior for a hydrodynamic model on nematic liquid crystal flows with asymptotic stabilizing boundary condition and external force

In this paper, we consider a simplified Ericksen-Leslie model for the nematic liquid crystal flow. The evolution system consists of the Navier-Stokes equations coupled with a convective Ginzburg-Landau type equation for the averaged molecular orientation. We suppose that the Navier-Stokes equations are characterized by a no-slip boundary condition and a time-dependent external force g(t), while the equation for the molecular director is subject to a time-dependent Dirichlet boundary condition h(t). We show that, in 2D, each global weak solution converges to a single stationary state when h(t) and g(t) converge to a time-independent boundary datum h_\infty and 0, respectively. Estimates on the convergence rate are also obtained. In the 3D case, we prove that global weak solutions are eventually strong so that results similar to the 2D case can be proven. We also show the existence of global strong solutions, provided that either the viscosity is large enough or the initial datum is close to a given equilibrium.

preprint2013arXiv

Long-time dynamics of the nonhomogeneous incompressible flow of nematic liquid crystals

We study the long-time behavior of global strong solutions to a hydrodynamic system for nonhomogeneous incompressible nematic liquid crystal flows driven by two types of external forces in a smooth bounded domain in $\mathbb{R}^2$. For arbitrary large regular initial data with the initial density being away from vacuum, we prove the decay of the velocity field for both cases. Furthermore, for the case with asymptotically autonomous external force, we can prove the convergence of the density function and the director vector as time goes to infinity. Estimates on convergence rate are also provided.

preprint2013arXiv

Majorana Excitations, Spin- and Mass Currents on the Surface of Topological Superfluid $^3$He-B

The B-phase of superfluid $^3$He is a 3D time-reversal invariant (TRI) topological superfluid with an isotropic energy gap separating the ground-state and bulk continuum states. We report calculations of surface spectrum, spin- and mass current densities originating from the Andreev surface states for confined $^3$He-B. The surface states are Majorana Fermions with their spins polarized transverse to their direction of propagation along the surface. The negative energy states give rise to a ground-state helical spin current confined on the surface. The spectral functions reveal the subtle role of the spin-polarized surface states in relation to the ground-state spin current. By contrast, these states do not contribute to the $T=0$ mass current. Superfluid flow through a channel of confined $^3$He-B is characterized by the flow field, $p_s$. The flow field breaks 2D rotational symmetry and time reversal (T). However, the Bogoliubov-Nambu Hamiltonian remains invariant under $T$ combined with a 180 degree rotation about the normal to the film. As a result the B-phase in the presence of a superflow remains a topological phase with a gapless spectrum of Majorana modes on the surface. Thermal excitation of the Doppler shifted Majorana branches leads to a power law suppression of the superfluid mass current, providing a direct signature of the Majorana branches of surface excitations in the fully gapped 3D topological superfluid, $^3$He-B. Results are reported for the superfluid fraction (mass current) and helical spin current for confined $^3$He-B, including the temperature dependences, as well as dependences on confinement, interactions between quasiparticles and pressure.

preprint2013arXiv

Non-isothermal viscous Cahn--Hilliard equation with inertial term and dynamic boundary conditions

We consider a non-isothermal modified Cahn--Hilliard equation which was previously analyzed by M. Grasselli et al. Such an equation is characterized by an inertial term and a viscous term and it is coupled with a hyperbolic heat equation. The resulting system was studied in the case of no-flux boundary conditions. Here we analyze the case in which the order parameter is subject to a dynamic boundary condition. This assumption requires a more refined strategy to extend the previous results to the present case. More precisely, we first prove the well-posedness for solutions with bounded energy as well as for weak solutions. Then we establish the existence of a global attractor. Finally, we prove the convergence of any given weak solution to a single equilibrium by using a suitable Lojasiewicz--Simon inequality.

preprint2013arXiv

Projected and Hidden Markov Models for calculating kinetics and metastable states of complex molecules

Markov state models (MSMs) have been successful in computing metastable states, slow relaxation timescales and associated structural changes, and stationary or kinetic experimental observables of complex molecules from large amounts of molecular dynamics simulation data. However, MSMs approximate the true dynamics by assuming a Markov chain on a clusters discretization of the state space. This approximation is difficult to make for high-dimensional biomolecular systems, and the quality and reproducibility of MSMs has therefore been limited. Here, we discard the assumption that dynamics are Markovian on the discrete clusters. Instead, we only assume that the full phase- space molecular dynamics is Markovian, and a projection of this full dynamics is observed on the discrete states, leading to the concept of Projected Markov Models (PMMs). Robust estimation methods for PMMs are not yet available, but we derive a practically feasible approximation via Hidden Markov Models (HMMs). It is shown how various molecular observables of interest that are often computed from MSMs can be computed from HMMs / PMMs. The new framework is applicable to both, simulation and single-molecule experimental data. We demonstrate its versatility by applications to educative model systems, an 1 ms Anton MD simulation of the BPTI protein, and an optical tweezer force probe trajectory of an RNA hairpin.

preprint2013arXiv

Robust exponential attractors for the modified phase-field crystal equation

We consider the modified phase-field crystal (MPFC) equation that has recently been proposed by P. Stefanovic et al. This is a variant of the phase-field crystal (PFC) equation, introduced by K.-R. Elder et al., which is characterized by the presence of an inertial term $βϕ_{tt}$. Here $ϕ$ is the phase function standing for the number density of atoms and $β\geq 0$ is a relaxation time. The associated dynamical system for the MPFC equation with respect to the parameter $β$ is analyzed. More precisely, we establish the existence of a family of exponential attractors $\mathcal{M}_β$ that are Hölder continuous with respect to $β$.

preprint2013arXiv

SU(3) deconfining phase transition with finite volume corrections due to a confined exterior

Using the geometry of a double-layered torus we investigate the deconfining phase transition of pure SU(3) lattice gauge theory by Markov chain Monte Carlo simulations. In one layer, called "outside", the temperature is set below the deconfining temperature and in the other, called "inside", it is iterated to a pseudo-transition temperature. Lattice sizes are chosen in a range suggested by the physical volumes achieved in relativistic heavy ion collisions and both temperatures are kept close enough to stay in the SU(3) scaling region. Properties of the transition are studied as function of the volume for three outside temperatures. When compared with infinite volume extrapolations, small volume corrections of the deconfining temperature and width become competitive with those found by including quarks. Effective finite size scaling exponents of the specific and Polyakov loop susceptibilities are also calculated.

preprint2013arXiv

Well-posedness and longtime behavior for the modified phase-field crystal equation

We consider a modification of the so-called phase-field crystal (PFC) equation introduced by K.R. Elder et al. This variant has recently been proposed by P. Stefanovic et al. to distinguish between elastic relaxation and diffusion time scales. It consists of adding an inertial term (i.e. a second-order time derivative) into the PFC equation. The mathematical analysis of the resulting equation is more challenging with respect to the PFC equation, even at the well-posedness level. Moreover, its solutions do not regularize in finite time as in the case of PFC equation. Here we analyze the modified PFC (MPFC) equation endowed with periodic boundary conditions. We first prove the existence and uniqueness of a solution with initial data in a bounded energy space. This solution satisfies some uniform dissipative estimates which allow us to study the global longtime behavior of the corresponding dynamical system. In particular, we establish the existence of an exponential attractor. Then we demonstrate that any trajectory originating from the bounded energy phase space does converge to a unique equilibrium. This is done by means of a suitable version of the Łojasiewicz-Simon inequality. A convergence rate estimate is also given.

preprint2012arXiv

Analysis of a diffuse-interface model for the binary viscous incompressible fluids with thermo-induced Marangoni effects

In this paper we study the well-posedness and long-time dynamics of a diffuse-interface model for the mixture of two viscous incompressible Newtonian fluids with thermo-induced Marangoni effects. The governing system consists of modified Navier--Stokes equations coupled with phase-field and energy transport equations. We first derive an energy inequality that illustrates the dissipative nature of the system under the assumption that the initial temperature variation is properly small. Then we establish the existence of weak/strong solutions via the energy method and discuss the long-time dynamics as well as stability of the system.

preprint2012arXiv

Finite--dimensional global attractor for a system modeling the 2D nematic liquid crystal flow

We consider a 2D system that models the nematic liquid crystal flow through the Navier--Stokes equations suitably coupled with a transport-reaction-diffusion equation for the averaged molecular orientations. This system has been proposed as a reasonable approximation of the well-known Ericksen--Leslie system. Taking advantage of previous well-posedness results and proving suitable dissipative estimates, here we show that the system endowed with periodic boundary conditions is a dissipative dynamical system with a smooth global attractor of finite fractal dimension.

preprint2012arXiv

Gaussian Beam Methods for the Dirac Equation in the Semi-classical Regime

The Dirac equation is an important model in relativistic quantum mechanics. In the semi-classical regime $ε\ll1$, even a spatially spectrally accurate time splitting method \cite{HuJi:05} requires the mesh size to be $O(ε)$, which makes the direct simulation extremely expensive. In this paper, we present the Gaussian beam method for the Dirac equation. With the help of an eigenvalue decomposition, the Gaussian beams can be independently evolved along each eigenspace and summed to construct an approximate solution of the Dirac equation. Moreover, the proposed Eulerian Gaussian beam keeps the advantages of constructing the Hessian matrices by simply using level set functions' derivatives. Finally, several numerical examples show the efficiency and accuracy of the method.

preprint2012arXiv

Metamodel Instance Generation: A systematic literature review

Modelling and thus metamodelling have become increasingly important in Software Engineering through the use of Model Driven Engineering. In this paper we present a systematic literature review of instance generation techniques for metamodels, i.e. the process of automatically generating models from a given metamodel. We start by presenting a set of research questions that our review is intended to answer. We then identify the main topics that are related to metamodel instance generation techniques, and use these to initiate our literature search. This search resulted in the identification of 34 key papers in the area, and each of these is reviewed here and discussed in detail. The outcome is that we are able to identify a knowledge gap in this field, and we offer suggestions as to some potential directions for future research.

preprint2012arXiv

On the General Ericksen-Leslie System: Parodi's Relation, Well-posedness and Stability

In this paper we investigate the role of Parodi's relation in the well-posedness and stability of the general Ericksen-Leslie system modeling nematic liquid crystal flows. First, we give a formal physical derivation of the Ericksen-Leslie system through an appropriate energy variational approach under Parodi's relation, in which we can distinguish the conservative/dissipative parts of the induced elastic stress. Next, we prove global well-posedness and long-time behavior of the Ericksen-Leslie system under the assumption that the viscosity $μ_4$ is sufficiently large. Finally, under Parodi's relation, we show the global well-posedness and Lyapunov stability for the Ericksen-Leslie system near local energy minimizers. The connection between Parodi's relation and linear stability of the Ericksen-Leslie system is also discussed.

preprint2012arXiv

On the Kauffman-Vogel and the Murakami-Ohtsuki-Yamada Graph Polynomials

This paper consists of three parts. First, we generalize the Jaeger Formula to express the Kauffman-Vogel graph polynomial as a state sum of the Murakami-Ohtsuki-Yamada graph polynomial. Then, we demonstrate that reversing the orientation and the color of a MOY graph along a simple circuit does not change the sl(N) Murakami-Ohtsuki-Yamada polynomial or the sl(N) homology of this MOY graph. In fact, reversing the orientation and the color of a component of a colored link only changes the sl(N) homology by an overall grading shift. Finally, as an application of the first two parts, we prove that the so(6) Kauffman polynomial is equal to the 2-colored sl(4) Reshetikhin-Turaev link polynomial, which implies that the 2-colored sl(4) link homology categorifies the so(6) Kauffman polynomial.

preprint2012arXiv

Optimal estimation of free energies and stationary densities from multiple biased simulations

When studying high-dimensional dynamical systems such as macromolecules, quantum systems and polymers, a prime concern is the identification of the most probable states and their stationary probabilities or free energies. Often, these systems have metastable regions or phases, prohibiting to estimate the stationary probabilities by direct simulation. Efficient sampling methods such as umbrella sampling, metadynamics and conformational flooding have developed that perform a number of simulations where the system's potential is biased such as to accelerate the rare barrier crossing events. A joint free energy profile or stationary density can then be obtained from these biased simulations with weighted histogram analysis method (WHAM). This approach (a) requires a few essential order parameters to be defined in which the histogram is set up, and (b) assumes that each simulation is in global equilibrium. Both assumptions make the investigation of high-dimensional systems with previously unknown energy landscape difficult. Here, we introduce the transition matrix unweighting (TMU) method, a simple and efficient estimation method which dismisses both assumptions. The configuration space is discretized into sets, but these sets are not only restricted to the selected slow coordinate but can be clusters that form a partition of high-dimensional state space. The assumption of global equilibrium is replaced by requiring only local equilibrium within the discrete sets, and the stationary density or free energy is extracted from the transitions between clusters. We prove the asymptotic convergence and normality of TMU, give an efficient approximate version of it and demonstrate its usefulness on numerical examples.

preprint2012arXiv

Resource Availability-Aware Advance Reservation for Parallel Jobs with Deadlines

Advance reservation is important to guarantee the quality of services of jobs by allowing exclusive access to resources over a defined time interval on resources. It is a challenge for the scheduler to organize available resources efficiently and to allocate them for parallel AR jobs with deadline constraint appropriately. This paper provides a slot-based data structure to organize available resources of multiprocessor systems in a way that enables efficient search and update operations, and formulates a suite of scheduling policies to allocate resources for dynamically arriving AR requests. The performance of the scheduling algorithms were investigated by simulations with different job sizes and durations, system loads and scheduling flexibilities. Simulation results show that job sizes and durations, system load and the flexibility of scheduling will impact the performance metrics of all the scheduling algorithms, and the PE-Worst-Fit algorithm becomes the best algorithm for the scheduler with the highest acceptance rate of AR requests, and the jobs with the First-Fit algorithm experience the lowest average slowdown. The data structure and scheduling policies can be used to organize and allocate resources for parallel AR jobs with deadline constraint in large-scale computing systems.

preprint2012arXiv

Simplified Khovanov-Rozansky Chain Complexes of Open 2-braids

Motivated by the works of Krasner [arXiv:0801.4018] and Lobb [arXiv:1103.1412], we simplify the Khovanov-Rozansky chain complexes of open 2-braids. As an application, we show that, for a knot containing a "long" 2-braid, the sl(N) Rasmussen invariant of this knot depends linearly on the length of this 2-braid. We refine this result for (2,2k+1) cable knots and, as a simple corollary, compute the sl(2) Rasmussen invariants of (2,2k+1) cables of slice and amphicheiral knots.

preprint2012arXiv

Strong solutions, global regularity and stability of a hydrodynamic system modeling vesicle and fluid interactions

In this paper, we study a hydrodynamic system modeling the deformation of vesicle membranes in incompressible viscous fluids. The system consists of the Navier-Stokes equations coupled with a fourth order phase-field equation. In the three dimensional case, we prove the existence/uniqueness of local strong solutions for arbitrary initial data as well as global strong solutions under the large viscosity assumption. We also establish some regularity criteria in terms of the velocity for local smooth solutions. Finally, we investigate the stability of the system near local minimizers of the elastic bending energy.

preprint2012arXiv

The extremal genus embedding of graphs

Let Wn be a wheel graph with n spokes. How does the genus change if adding a degree-3 vertex v, which is not in V (Wn), to the graph Wn? In this paper, through the joint-tree model we obtain that the genus of Wn+v equals 0 if the three neighbors of v are in the same face boundary of P(Wn); otherwise, °(Wn + v) = 1, where P(Wn) is the unique planar embedding of Wn. In addition, via the independent set, we provide a lower bound on the maximum genus of graphs, which may be better than both the result of D. Li & Y. Liu and the result of Z. Ouyang etc: in Europ. J. Combinatorics. Furthermore, we obtain a relation between the independence number and the maximum genus of graphs, and provide an algorithm to obtain the lower bound on the number of the distinct maximum genus embedding of the complete graph Km, which, in some sense, improves the result of Y. Caro and S. Stahl respectively.

preprint2011arXiv

Colored sl(N) link homology via matrix factorizations

The Reshetikhin-Turaev sl(N) polynomial of links colored by wedge powers of the defining representation has been categorified via several different approaches. Here, we give a concise introduction to the categorification using matrix factorizations, which is a direct generalization of the Khovanov-Rozansky homology. Full details of the construction are given in [arXiv:0907.0695]. We also briefly review deformations and applications of this categorification given in [arXiv:1002.2662, arXiv:1011.2254, arXiv:1102.0586].

preprint2011arXiv

Equivariant colored sl(N)-homology for links

We construct an equivariant colored sl(N)-homology for links, which generalizes both the colored sl(N)-homology defined by the author and the equivariant sl(N)-homology defined by Krasner. The construction is a straightforward generalization of that of the colored sl(N)-homology. The proof of invariance is based on a simple observation which allows us to translate the proof of the invariance of the colored sl(N)-homology into the new setting. As an application, we prove that deformations over C of the colored sl(N)-homology are link invariants. We also construct a spectral sequence connecting the colored sl(N)-homology to its deformations over C, which generalizes the spectral sequence given by Lee and Gornik.

preprint2011arXiv

Finite Volume Corrections to the SU(3) Deconfining Temperature due to a Confined Exterior

Deconfined regions in relativistic heavy ion collisions are limited to small volumes surrounded by a confined exterior. Using the geometry of a double layered torus, we keep an outside temperature slightly lower than the inside temperature, so that both regions are in the SU(3) scaling region. Deconfined volume sizes are chosen to be in a range typical for such volumes created at the BNL RHIC. Even with small temperature differences a dependence of the (pseudo) deconfining temperature on a colder surrounding temperature is clearly visible. For temporal lattice sizes Ntau=4, 6 and 8 we find consistency with SU(3) scaling behavior for the measured transition temperature signals.

preprint2011arXiv

Generic deformations of the colored sl(N)-homology for links

We generalize the works of Lee [arXiv:math/0210213v3] and Gornik [arXiv:math/0402266v2] to construct a basis for generic deformations of the colored sl(N)-homology defined in [arXiv:1002.2662v1]. As applications, we construct non-degenerate pairings and co-pairings which lead to dualities of generic deformations of the colored sl(N)-homology. We also define and study colored sl(N)-Rasmussen invariants. Among other things, we observe that these invariants vanish on amphicheiral knots and discuss some implications of this observation.

preprint2011arXiv

Spatiotemporal dynamics on small-world neuronal networks: The roles of two types of time-delayed coupling

We investigate temporal coherence and spatial synchronization on small-world networks consisting of noisy Terman-Wang (TW) excitable neurons in dependence on two types of time-delayed coupling: $\{x_j(t-τ)-x_i (t)\}$ and $\{x_j(t-τ)-x_i(t-τ)\}$. For the former case, we show that time delay in the coupling can dramatically enhance temporal coherence and spatial synchrony of the noise-induced spike trains. In addition, if the delay time $τ$ is tuned to nearly match the intrinsic spike period of the neuronal network, the system dynamics reaches a most ordered state, which is both periodic in time and nearly synchronized in space, demonstrating an interesting resonance phenomenon with delay. For the latter case, however, we can not achieve a similar spatiotemporal ordered state, but the neuronal dynamics exhibits interesting synchronization transition with time delay from zigzag fronts of excitations to dynamic clustering anti-phase synchronization (APS), and further to clustered chimera states which have spatially distributed anti-phase coherence separated by incoherence. Furthermore, we also show how these findings are influenced by the change of the noise intensity and the rewiring probability. Finally, qualitative analysis is given to illustrate the numerical results.

preprint2010arXiv

Asymptotic Behavior for a Nematic Liquid Crystal Model with Different Kinematic Transport Properties

We study the asymptotic behavior of global solutions to hydrodynamical systems modeling the nematic liquid crystal flows under kinematic transports for molecules of different shapes. The coupling system consists of Navier-Stokes equations and kinematic transport equations for the molecular orientations. We prove the convergence of global strong solutions to single steady states as time tends to infinity as well as estimates on the convergence rate both in 2D for arbitrary regular initial data and in 3D for certain particular cases.

preprint2010arXiv

Finite dimensional global and exponential attractors for a coupled time-dependent Ginzburg-Landau equations for atomic Fermi gases near the BCS-BEC crossover

We study a coupled nonlinear evolution system arising from the Ginzburg-Landau theory for atomic Fermi gases near the BCS-BEC crossover. First, we prove that the initial boundary value problem generates a strongly continuous semigroup on a suitable phase-space which possesses the global attractor. Then we establish the existence of an exponential attractor. As a consequence, we show that the global attractor is of finite fractal dimension.

preprint2010arXiv

Finite dimensional reduction and convergence to equilibrium for incompressible Smectic-A liquid crystal flows

We consider a hydrodynamic system that models the Smectic-A liquid crystal flow. The model consists of the Navier-Stokes equation for the fluid velocity coupled with a fourth-order equation for the layer variable $\vp$, endowed with periodic boundary conditions. We analyze the long-time behavior of the solutions within the theory of infinite-dimensional dissipative dynamical systems. We first prove that in 2D, the problem possesses a global attractor $\mathcal{A}$ in certain phase space. Then we establish the existence of an exponential attractor $\mathcal{M}$ which entails that the global attractor $\mathcal{A}$ has finite fractal dimension. Moreover, we show that each trajectory converges to a single equilibrium by means of a suitable Lojasiewicz--Simon inequality. Corresponding results in 3D are also discussed.

preprint2010arXiv

Global existence for the generalized two-component Hunter-Saxton system

We study the global existence of solutions to a two-component generalized Hunter-Saxton system in the periodic setting. We first prove a persistence result of the solutions. Then for some particular choices of parameters $(α, κ)$, we show the precise blow-up scenarios and the existence of global solutions to the generalized Hunter-Saxton system under proper assumptions on the initial data. This significantly improves recent results obtained in [M. Wunsch, DCDS Ser. B 12 (2009), 647-656] and [M. Wunsch, SIAM J. Math. Anal. 42 (2010), 1286-1304].

preprint2009arXiv

Deconfining phase transition on a double-layered torus

Deconfined regions in relativistic heavy ion collisions are limited to small volumes surrounded by a confined exterior. Here the geometry of a double layered torus is discussed, which allows for different temperatures in its two layers. This geometry enables one to approach the QCD continuum limit for small deconfined volumes with confined exteriors in a more realistic fashion than by using periodic boundary conditions. Preliminary data from a study for pure SU(3) lattice gauge theory support a substantial increase in a pseudo transition temperature.

preprint2009arXiv

Long-time Behavior for Nonlinear Hydrodynamic System Modeling the Nematic Liquid Crystal Flows

We study a simplified system of the original Ericksen--Leslie equations for the flow of nematic liquid crystals. This is a coupled non-parabolic dissipative dynamic system. We show the convergence of global classical solutions to single steady states as time goes to infinity (uniqueness of asymptotic limit) by using the Łojasiewicz--Simon approach. Moreover, we provide an estimate on the convergence rate. Finally, we discuss some possible extensions of the results to certain generalized problems with changing density or free-slip boundary condition.

preprint2008arXiv

Long-time Behavior for a Nonlinear Plate Equation with Thermal Memory

We consider a nonlinear plate equation with thermal memory effects due to non-Fourier heat flux laws. First we prove the existence and uniqueness of global solutions as well as the existence of a global attractor. Then we use a suitable Lojasiewicz--Simon type inequality to show the convergence of global solutions to single steady states as time goes to infinity under the assumption that the nonlinear term $f$ is real analytic. Moreover, we provide an estimate on the convergence rate.