Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
27works
0followers
33topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

27 published item(s)

preprint2026arXiv

Mamoda2.5: Enhancing Unified Multimodal Model with DiT-MoE

We present Mamoda2.5, a unified AR-Diffusion framework that seamlessly integrates multimodal understanding and generation within a single architecture. To efficiently enhance the model's generation capability, we equip the Diffusion Transformer backbone with a fine-grained Mixture-of-Experts (MoE) design (128 experts, Top-8 routing), yielding a 25B-parameter model that activates only 3B parameters, significantly reducing training costs while scaling up the model capacity. Mamoda2.5 achieves top-tier generation performance on VBench 2.0 and sets a new record in video editing quality, surpassing evaluated open-source models and matching the performance of current top-tier proprietary models, including the Kling O1 on OpenVE-Bench. Furthermore, we introduce a joint few-step distillation and reinforcement learning framework that compresses the 30-step editing model into a 4-step model and greatly accelerates model inference. Compared to open-source baselines, Mamoda2.5 achieves up to $95.9\times$ faster video editing inference. In real-world applications, Mamoda2.5 has been successfully deployed for content moderation and creative restoration tasks in advertising scenarios, achieving a 98% success rate in internal advertising video editing scenario.

preprint2025arXiv

Ultrahigh-Energy Gamma-ray Emission Associated with Black Hole-Jet Systems

Black holes (BH), one of the most intriguing objects in the universe, can manifest themselves through electromagnetic radiation initiated by the accretion flow. Some stellar-mass BHs drive relativistic jets when accreting matter from their companion stars, forming microquasars. Non-thermal emission from the radio to tera-electronvolt (TeV) gamma-ray band has been observed from microquasars, indicating the acceleration of relativistic particles. Here we report detection of four microquasars (SS 433, V4641 Sgr, GRS 1915+105, MAXI J1820+070) of spectrum extending to the ultrahigh-energy (UHE; photon energy $E>100$ TeV) band and one microquasar (Cygnus X-1) of spectrum approaching 100 TeV, using the Large High Altitude Air Shower Observatory (LHAASO). Notably, the total emission associated with SS 433 cannot be interpreted with a single leptonic component. In the UHE band, its emission is in spatial coincidence with a giant atomic cloud, which is consistent with a hadronic origin. An elongated source is discovered from V4641 Sgr with the spectrum continuing up to 800 TeV. The detection of UHE gamma rays demonstrates that accreting BHs and their environments can operate as extremely efficient accelerators of particles out of 1 peta-electronvolt (PeV), suggesting microquasars to be important contributors to Galactic cosmic rays especially around the `knee' region.

preprint2022arXiv

A Novel Splitting Criterion Inspired by Geometric Mean Metric Learning for Decision Tree

Decision tree (DT) attracts persistent research attention due to its impressive empirical performance and interpretability in numerous applications. However, the growth of traditional yet widely-used univariate decision trees (UDTs) is quite time-consuming as they need to traverse all the features to find the splitting value with the maximal reduction of the impurity at each internal node. In this paper, we newly design a splitting criterion to speed up the growth. The criterion is induced from Geometric Mean Metric Learning (GMML) and then optimized under its diagonalized metric matrix constraint, consequently, a closed-form rank of feature discriminant abilities can at once be obtained and the top 1 feature at each node used to grow an intent DT (called as dGMML-DT, where d is an abbreviation for diagonalization). We evaluated the performance of the proposed methods and their corresponding ensembles on benchmark datasets. The experiment shows that dGMML-DT achieves comparable or better classification results more efficiently than the UDTs with 10x average speedup. Furthermore, dGMML-DT can straightforwardly be extended to its multivariable counterpart (dGMML-MDT) without needing laborious operations.

preprint2022arXiv

Adversarial Momentum-Contrastive Pre-Training

Recently proposed adversarial self-supervised learning methods usually require big batches and long training epochs to extract robust features, which will bring heavy computational overhead on platforms with limited resources. In order to help the network learn more powerful feature representations in smaller batches and fewer epochs, this paper proposes a novel adversarial momentum contrastive learning method, which introduces two memory banks corresponding to clean samples and adversarial samples, respectively. These memory banks can be dynamically incorporated into the training process to track invariant features among historical mini-batches. Compared with the previous adversarial pre-training model, our method achieves superior performance with smaller batch size and less training epochs. In addition, the model outperforms some state-of-the-art supervised defensive methods on multiple benchmark datasets after being fine-tuned on downstream classification tasks.

preprint2022arXiv

Chaotic diffusion of asteroids in the exterior 1:2 mean motion resonance with Mars

The inner asteroid belt between 2.1 and 2.5 au is of particular dynamical significance because it is the dominant source of both chondritic meteorites and near-Earth asteroids. This inner belt is bounded by an eccentricity-type secular resonance and by the 1:3 mean motion resonance with Jupiter. Unless asteroid perihelia are low enough to allow scattering by Mars, escape requires transport to one of the bounding resonances. In addition Yarkovsky forces are generally ineffective in changing either the eccentricity and/or inclination for asteroids with diameter $\gtrsim$30 km. Thus, large asteroids with pericentres far from Mars may only escape from the inner belt through large changes in their eccentricities. In this paper we study chaotic diffusion of orbits near the 1:2 mean motion resonance with Mars in a systematic way. We show that, while chaotic orbital evolution in both resonant and non-resonant orbits increase the dispersion of the inclinations and eccentricities, it does not significantly change their mean values. We show further that, while the dispersive growth is greatest for resonant orbits, at high $e$ the resonance acts to mitigate asteroid scattering by Mars - making the asteroid lifetime in the belt longer than it would have been for a non-resonant orbit. For asteroids of all sizes in both resonant and non-resonant orbits, the changes in eccentricity needed to account for the observations cannot be achieved by gravitational forces alone. The role of resonant trapping in protecting asteroids from encounters with Mars is also analysed.

preprint2022arXiv

Controlled Alternate Quantum Walk based Block Hash Function

The hash function is an important branch of cryptology. Controlled quantum walk based hash function is a kind of novel hash function, which is safe, flexible, high-efficient, and compatible. All existing controlled quantum walk based hash functions are controlled by one bit message in each step. To process message in batch amounts, in this paper, controlled alternate quantum walk based block hash function is presented by using the time-position-dependent controlled quantum walks on complete graphs with self-loops. The presented hash function accelerate the hash processing dramatically, so it is more high-efficient.

preprint2022arXiv

Eigenvalues of signed graphs

Signed graphs have their edges labeled either as positive or negative. $ρ(M)$ denote the $M$-spectral radius of $Σ$, where $M=M(Σ)$ is a real symmetric graph matrix of $Σ$. Obviously, $ρ(M)=\mbox{max}\{λ_1(M),-λ_n(M)\}$. Let $A(Σ)$ be the adjacency matrix of $Σ$ and $(K_n,H^-)$ be a signed complete graph whose negative edges induce a subgraph $H$. In this paper, we first focus on a central problem in spectral extremal graph theory as follows: Which signed graph with maximum $ρ(A(Σ))$ among $(K_n,T^-)$ where $T$ is a spanning tree? To answer the problem, we characterize the extremal signed graph with maximum $λ_1(A(Σ))$ and minimum $λ_n(A(Σ))$ among $(K_n,T^-)$, respectively. Another interesting graph matrix of a signed graph is distance matrix, i.e. $D(Σ)$ which was defined by Hameed, Shijin, Soorya, Germina and Zaslavsky [8]. Note that $A(Σ)=D(Σ)$ when $Σ\in (K_n,T^-)$. In this paper, we give upper bounds on the least distance eigenvalue of a signed graph $Σ$ with diameter at least 2. This result implies a result proved by Lin [11] was originally conjectured by Aouchiche and Hansen [1].

preprint2022arXiv

GJ 3929: High Precision Photometric and Doppler Characterization of an Exo-Venus and its Hot, Mini-Neptune-mass Companion

We detail the follow up and characterization of a transiting exo-Venus identified by TESS, GJ 3929b, (TOI-2013b) and its non-transiting companion planet, GJ 3929c (TOI-2013c). GJ 3929b is an Earth-sized exoplanet in its star's Venus-zone (P$_{b}$ = 2.616272 $\pm$ 0.000005 days; S$_{b}$ = 17.3$^{+0.8}_{-0.7}$ S$_{\oplus}$) orbiting a nearby M dwarf. GJ 3929c is most likely a non-transiting sub-Neptune. Using the new, ultra-precise NEID spectrometer on the WIYN 3.5 m Telescope at Kitt Peak National Observatory, we are able to modify the mass constraints of planet b reported in previous works and consequently improve the significance of the mass measurement to almost 4$σ$ confidence (M$_{b}$ = 1.75 $\pm$ 0.45 M$_{\oplus}$). We further adjust the orbital period of planet c from its alias at 14.30 $\pm$ 0.03 days to the likely true period of 15.04 $\pm$ 0.03 days, and adjust its minimum mass to m$\sin i$ = 5.71 $\pm$ 0.92 M$_{\oplus}$. Using the diffuser-assisted ARCTIC imager on the ARC 3.5 m telescope at Apache Point Observatory, in addition to publicly available TESS and LCOGT photometry, we are able to constrain the radius of planet b to R$_{p}$ = 1.09 $\pm$ 0.04 R$_{\oplus}$. GJ 3929b is a top candidate for transmission spectroscopy in its size regime (TSM = 14 $\pm$ 4), and future atmospheric studies of GJ 3929b stand to shed light on the nature of small planets orbiting M dwarfs.

preprint2022arXiv

Improve Deep Image Inpainting by Emphasizing the Complexity of Missing Regions

Deep image inpainting research mainly focuses on constructing various neural network architectures or imposing novel optimization objectives. However, on the one hand, building a state-of-the-art deep inpainting model is an extremely complex task, and on the other hand, the resulting performance gains are sometimes very limited. We believe that besides the frameworks of inpainting models, lightweight traditional image processing techniques, which are often overlooked, can actually be helpful to these deep models. In this paper, we enhance the deep image inpainting models with the help of classical image complexity metrics. A knowledge-assisted index composed of missingness complexity and forward loss is presented to guide the batch selection in the training procedure. This index helps find samples that are more conducive to optimization in each iteration and ultimately boost the overall inpainting performance. The proposed approach is simple and can be plugged into many deep inpainting models by changing only a few lines of code. We experimentally demonstrate the improvements for several recently developed image inpainting models on various datasets.

preprint2022arXiv

The Astrometric Performance Test of 80-cm Telescope at Yaoan Station and Precise CCD Positions of Apophis

The 80-cm azimuthal telescope is newly mounted at Yaoan Station, Purple Mountain Observatory in 2018. The astrometric performance of the telescope is tested in the following three aspects. (a) The geometric distortion of its CCD attached. It is stable in both a single epoch and multi epochs. Eight distortion solutions are derived over about one year. The maximum values range from 0.75 to 0.79 pixel and the median values range from 0.14 to 0.16 pixel. (b) The limit magnitude of stars. About 20.5 magnitude (Gaia-G) stars can be detected with Johnson-V filter exposured in 300 seconds. The astrometric error of about 20.5 magnitude stars is estimated at 0.14 arcsec using the fitted sigmoidal function. (c) The astrometric accuracy and the precision of stacked fast-moving faint object. 24 stacked frames of the potentially hazardous asteroid (PHA) (99942) Apophis are derived on April 14 and 15, 2021 (fainter than 18 mag) based on the ephemeris shifts. During data reduction, the newest Gaia EDR3 Catalog and Jet Propulsion Laboratory Horizons ephemeris are referenced as theoretical positions of stars and Apophis, respectively. Our results show that the mean (O-C)s (observed minus computed) of Apophis are -0.018 and 0.020 arcsec in right ascention and declination, and the dispersions are estimated at 0.094 and 0.085 arcsec, respectively, which show the consistency of the stacked results by Astrometrica.

preprint2022arXiv

The primitive equations with magnetic field approximation of the 3D MHD equations

In our earlier work \cite{DLL}, we have shown the global well-posedness of strong solutions to the three-dimensional primitive equations with the magnetic field (PEM) on a thin domain. The heart of this paper is to provide a rigorous justification of the derivation of the PEM as the small aspect ratio limit of the incompressible three-dimensional scaled magnetohydrodynamics (SMHD) equations in the anisotropic horizontal viscosity and magnetic field regime. For the case of $H^1$-initial data case, we prove that global Leray-Hopf weak solutions of the three-dimensional SMHD equation strongly converge to the global strong solutions of the PEM. In the $H^2$-initial data case, the strong solution of the SMHD can be extended to be a global one for small $\v$. As a consequence, we observe that the global strong solutions of the SMHD strong converge to the global strong solutions of the PEM. As a byproduct, the convergence rate is of the same order as the aspect ratio parameter.

preprint2021arXiv

Electrocardiogram Classification and Visual Diagnosis of Atrial Fibrillation with DenseECG

Atrial Fibrillation (AF) is a common cardiac arrhythmia affecting a large number of people around the world. If left undetected, it will develop into chronic disability or even early mortality. However, patients who have this problem can barely feel its presence, especially in its early stage. A non-invasive, automatic, and effective detection method is therefore needed to help early detection so that medical intervention can be implemented in time to prevent its progression. Electrocardiogram (ECG), which records the electrical activities of the heart, has been widely used for detecting the presence of AF. However, due to the subtle patterns of AF, the performance of detection models have largely depended on complicated data pre-processing and expertly engineered features. In our work, we developed DenseECG, an end-to-end model based on 5 layers 1D densely connected convolutional neural network. We trained our model using the publicly available dataset from 2017 PhysioNet Computing in Cardiology(CinC) Challenge containing 8528 single-lead ECG recordings of short-term heart rhythms (9-61s). Our trained model was able to outperform the other state-of-the-art AF detection models on this dataset without complicated data pre-processing and expert-supervised feature engineering.

preprint2021arXiv

Soft magnetic microrobot doped with porous silica for stability-enhanced multimodal locomotion in nonideal environment

As an emerging field of robotics, magnetic-field-controlled soft microrobot has broad application prospects for its flexibility, locomotion diversity as well as remote controllability. Magnetic soft microrobots can perform multimodal locomotion under the control of a magnetic field, which may have potential applications in precision medicine. However, previous researches mainly focus on new locomotion in a relatively ideal environment, lacking exploration on the ability of magnetic microrobot locomotion to resist external disturbances and proceed in a nonideal environment. Here, a porous silica-doped soft magnetic microrobot is constructed for enhanced stability of multimodal locomotion in the nonideal biological environment. Porous silica spheres are doped into NdFeB-silicone elastomer base, improving adhesion properties as well as refining the comprehensive mechanical properties of the microrobot. Multimodal locomotions are achieved, and the influence of porous silica doping on the stability of each locomotion in nonideal environment is explored in depth. Motions in nonideal circumstances such as climbing, loading, current rushing, wind blowing, and obstacle hindering are conducted successfully with porous silica doping. Such a stability-enhanced multimodal locomotion system can be used in biocatalysis as well as thrombus removal, and its prospect for precision medicine is highlighted by in vivo demonstration of multimodal locomotion with nonideal disturbance.

preprint2020arXiv

A simplified primal-dual weak Galerkin finite element method for Fokker-Planck type equations

A simplified primal-dual weak Galerkin (S-PDWG) finite element method is designed for the Fokker-Planck type equation with non-smooth diffusion tensor and drift vector. The discrete system resulting from S-PDWG method has significantly fewer degrees of freedom compared with the one resulting from the PDWG method proposed by Wang-Wang \cite{WW-fp-2018}. Furthermore, the condition number of the S-PDWG method is smaller than the PDWG method \cite{WW-fp-2018} due to the introduction of a new stabilizer, which provides a potential for designing fast algorithms. Optimal order error estimates for the S-PDWG approximation are established in the $L^2$ norm. A series of numerical results are demonstrated to validate the effectiveness of the S-PDWG method.

preprint2020arXiv

Data assimilation and online optimization with performance guarantees

This paper considers a class of real-time stochastic optimization problems dependent on an unknown probability distribution. In the considered scenario, data is streaming frequently while trying to reach a decision. Thus, we aim to devise a procedure that incorporates samples (data) of the distribution sequentially and adjusts decisions accordingly. We approach this problem in a distributionally robust optimization framework and propose a novel Online Data Assimilation Algorithm (ONDA Algorithm) for this purpose. This algorithm guarantees out-of-sample performance of decisions with high probability, and gradually improves the quality of the decisions by incorporating the streaming data. We show that the ONDA Algorithm converges under a sufficiently slow data streaming rate, and provide a criteria for its termination after certain number of data have been collected. Simulations illustrate the results.

preprint2020arXiv

Efficient Bayesian estimation for GARCH-type models via Sequential Monte Carlo

The advantages of sequential Monte Carlo (SMC) are exploited to develop parameter estimation and model selection methods for GARCH (Generalized AutoRegressive Conditional Heteroskedasticity) style models. It provides an alternative method for quantifying estimation uncertainty relative to classical inference. Even with long time series, it is demonstrated that the posterior distribution of model parameters are non-normal, highlighting the need for a Bayesian approach and an efficient posterior sampling method. Efficient approaches for both constructing the sequence of distributions in SMC, and leave-one-out cross-validation, for long time series data are also proposed. Finally, an unbiased estimator of the likelihood is developed for the Bad Environment-Good Environment model, a complex GARCH-type model, which permits exact Bayesian inference not previously available in the literature.

preprint2020arXiv

Grover search with smaller oracles

Grover search is one of the most important quantum algorithms. In this paper, we consider a kind of search that the conditions of satisfaction $T$ can be rewritten as $T=T_1\bigcap T_2$. Then we present a new Grover search with smaller oracles. The time complexity of this algorithm $O(\fracπ{4}\sqrt{\frac{N}{bλ}}+\fracπ{4}\sqrt{\frac{b}τ})$, which is smaller than the time complexity of original Grover search, i.e. $O(\fracπ{4}\sqrt{\frac{N}{M}})$.

preprint2020arXiv

High-Confidence Attack Detection via Wasserstein-Metric Computations

This paper considers a sensor attack and fault detection problem for linear cyber-physical systems, which are subject to system noise that can obey an unknown light-tailed distribution. We propose a new threshold-based detection mechanism that employs the Wasserstein metric, and which guarantees system performance with high confidence employing a finite number of measurements. The proposed detector may generate false alarms with a rate $Δ$ in normal operation, where $Δ$ can be tuned to be arbitrarily small by means of a benchmark distribution which is part of our mechanism. Thus, the proposed detector is sensitive to sensor attacks and faults which have a statistical behavior that is different from that of the system's noise. We quantify the impact of stealthy attacks---which aim to perturb the system operation while producing false alarms that are consistent with the natural system's noise---via a probabilistic reachable set. To enable tractable implementation of our methods, we propose a linear optimization problem that computes the proposed detection measure and a semidefinite program that produces the proposed reachable set.

preprint2020arXiv

Improving Positive Unlabeled Learning: Practical AUL Estimation and New Training Method for Extremely Imbalanced Data Sets

Positive Unlabeled (PU) learning is widely used in many applications, where a binary classifier is trained on the datasets consisting of only positive and unlabeled samples. In this paper, we improve PU learning over state-of-the-art from two aspects. Firstly, existing model evaluation methods for PU learning requires ground truth of unlabeled samples, which is unlikely to be obtained in practice. In order to release this restriction, we propose an asymptotic unbiased practical AUL (area under the lift) estimation method, which makes use of raw PU data without prior knowledge of unlabeled samples. Secondly, we propose ProbTagging, a new training method for extremely imbalanced data sets, where the number of unlabeled samples is hundreds or thousands of times that of positive samples. ProbTagging introduces probability into the aggregation method. Specifically, each unlabeled sample is tagged positive or negative with the probability calculated based on the similarity to its positive neighbors. Based on this, multiple data sets are generated to train different models, which are then combined into an ensemble model. Compared to state-of-the-art work, the experimental results show that ProbTagging can increase the AUC by up to 10%, based on three industrial and two artificial PU data sets.

preprint2020arXiv

Online data assimilation in distributionally robust optimization

This paper considers a class of real-time decision making problems to minimize the expected value of a function that depends on a random variable $ξ$ under an unknown distribution $\mathbb{P}$. In this process, samples of $ξ$ are collected sequentially in real time, and the decisions are made, using the real-time data, to guarantee out-of-sample performance. We approach this problem in a distributionally robust optimization framework and propose a novel Online Data Assimilation Algorithm for this purpose. This algorithm guarantees the out-of-sample performance in high probability, and gradually improves the quality of the data-driven decisions by incorporating the streaming data. We show that the Online Data Assimilation Algorithm guarantees convergence under the streaming data, and a criteria for termination of the algorithm after certain number of data has been collected.

preprint2020arXiv

Online Learning of Parameterized Uncertain Dynamical Environments with Finite-sample Guarantees

We present a novel online learning algorithm for a class of unknown and uncertain dynamical environments that are fully observable. First, we obtain a novel probabilistic characterization of systems whose mean behavior is known but which are subject to additive, unknown subGaussian disturbances. This characterization relies on recent concentration of measure results and is given in terms of ambiguity sets. Second, we extend the results to environments whose mean behavior is also unknown but described by a parameterized class of possible mean behaviors. Our algorithm adapts the ambiguity set dynamically by learning the parametric dependence online, and retaining similar probabilistic guarantees with respect to the additive, unknown disturbance. We illustrate the results on a differential-drive robot subject to environmental uncertainty.

preprint2020arXiv

Query Resolution for Conversational Search with Limited Supervision

In this work we focus on multi-turn passage retrieval as a crucial component of conversational search. One of the key challenges in multi-turn passage retrieval comes from the fact that the current turn query is often underspecified due to zero anaphora, topic change, or topic return. Context from the conversational history can be used to arrive at a better expression of the current turn query, defined as the task of query resolution. In this paper, we model the query resolution task as a binary term classification problem: for each term appearing in the previous turns of the conversation decide whether to add it to the current turn query or not. We propose QuReTeC (Query Resolution by Term Classification), a neural query resolution model based on bidirectional transformers. We propose a distant supervision method to automatically generate training data by using query-passage relevance labels. Such labels are often readily available in a collection either as human annotations or inferred from user interactions. We show that QuReTeC outperforms state-of-the-art models, and furthermore, that our distant supervision method can be used to substantially reduce the amount of human-curated data required to train QuReTeC. We incorporate QuReTeC in a multi-turn, multi-stage passage retrieval architecture and demonstrate its effectiveness on the TREC CAsT dataset.

preprint2020arXiv

Three-state quantum walk on the Cayley Graph of the Dihedral Group

The finite dihedral group generated by one rotation and one reflection is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the dihedral group. Considering the characteristics of the elements in the dihedral group, we propose a model of three-state discrete-time quantum walk (DTQW) on the Caylay graph of the dihedral group with Grover coin. We derive analytic expressions for the the position probability distribution and the long-time limit of the return probability starting from the origin. It is shown that the localization effect is governed by the size of the underlying dihedral group, coin operator and initial state. We also numerically investigate the properties of the proposed model via the probability distribution and the time-averaged probability at the designated position. The abundant phenomena of three-state Grover DTQW on the Caylay graph of the dihedral group can help the community to better understand and to develop new quantum algorithms.

preprint2019arXiv

ATCSpeech: a multilingual pilot-controller speech corpus from real Air Traffic Control environment

Automatic Speech Recognition (ASR) is greatly developed in recent years, which expedites many applications on other fields. For the ASR research, speech corpus is always an essential foundation, especially for the vertical industry, such as Air Traffic Control (ATC). There are some speech corpora for common applications, public or paid. However, for the ATC, it is difficult to collect raw speeches from real systems due to safety issues. More importantly, for a supervised learning task like ASR, annotating the transcription is a more laborious work, which hugely restricts the prospect of ASR application. In this paper, a multilingual speech corpus (ATCSpeech) from real ATC systems, including accented Mandarin Chinese and English, is built and released to encourage the non-commercial ASR research in ATC domain. The corpus is detailly introduced from the perspective of data amount, speaker gender and role, speech quality and other attributions. In addition, the performance of our baseline ASR models is also reported. A community edition for our speech database can be applied and used under a special contrast. To our best knowledge, this is the first work that aims at building a real and multilingual ASR corpus for the air traffic related research.

preprint2019arXiv

Nanoconfined, dynamic electrolyte gating and memory effects in multilayered graphene-based membranes

Multilayered graphene-based nanoporous membranes with electrolyte incorporated between individual sheets is a unique nano-heterostructure system in which nanoconfined electrons in graphene and ions confined in between sheets are intimately coupled throughout the entire membrane. In contrast to the general notion that the electrolyte gating is unlikely to appear in multilayered graphene stacks, it is demonstrated in this work that the electrolyte gating effect in monolayer graphene can be transferred to its corresponding multilayered porous membranes. This gating effect presented on each individual graphene sheets through electrolyte confined in nanopores provides a real-time, electrical approach for probing the complex dynamics of nanoconfined electrical double layer. This has enabled the observation of the ionic memory effect in supercapacitors and produces new insights into the charging dynamics of supercapacitors. Such discoveries may stimulate the design of novel nanoionic devices.

preprint2019arXiv

The relative efficiency of time-to-progression and continuous measures of cognition in pre-symptomatic Alzheimer's

Pre-symptomatic (or Preclinical) Alzheimer's Disease is defined by biomarker evidence of fibrillar amyloid beta pathology in the absence of clinical symptoms. Clinical trials in this early phase of disease are challenging due to the slow rate of disease progression as measured by periodic cognitive performance tests or by transition to a diagnosis of Mild Cognitive Impairment. In a multisite study, experts provide diagnoses by central chart review without the benefit of in-person assessment. We use a simulation study to demonstrate that models of repeated cognitive assessments detect treatment effects more efficiently compared to models of time-to-progression to an endpoint such as change in diagnosis. Multivariate continuous data are simulated from a Bayesian joint mixed effects model fit to data from the Alzheimer's Disease Neuroimaging Initiative. Simulated progression events are algorithmically derived from the continuous assessments using a random forest model fit to the same data. We find that power is approximately doubled with models of repeated continuous outcomes compared to the time-to-progression analysis. The simulations also demonstrate that a plausible informative missing data pattern can induce a bias which inflates treatment effects, yet 5% Type I error is maintained.

preprint2018arXiv

Data-driven Variable Speed Limit Design for Highways via Distributionally Robust Optimization

This paper introduces an optimization problem (P) and a solution strategy to design variable-speed-limit controls for a highway that is subject to traffic congestion and uncertain vehicle arrival and departure. By employing a finite data-set of samples of the uncertain variables, we aim to find a data-driven solution that has a guaranteed out-of-sample performance. In principle, such formulation leads to an intractable problem (P) as the distribution of the uncertainty variable is unknown. By adopting a distributionally robust optimization approach, this work presents a tractable reformulation of (P) and an efficient algorithm that provides a suboptimal solution that retains the out-of-sample performance guarantee. A simulation illustrates the effectiveness of this method.