Searcharxiv⌕ Search

arXiv subjects

Qin Wang

Publications and source records attributed to Qin Wang.

At least 163 records · Page 9Linked to original sources
arXiv2022

Pushing the feature size down to 11 nm by interference photolithography with hyperbolic metamaterials under conventional UV light source

Limited by the cost and complexity, superresolution lithography is hard to achieve through the traditional interference lithography. We here developed the plasmonic interference lithography technique by using a hyperbolic metamaterials (HMMs) / photoresist / metal plasmonic waveguide to push the feature sizes theoretically down to 16 nm and even to 11 nm at the wavelength of 365 nm with TM polarization. The waveguide based on the proposed HMMs can support high-k mode for superresolution lithography. Furthermore, plasmonic mode supported in the proposed lithography structure can be tailored by dimension of HMM and permittivity of the materials, which makes it possible to get higher resolution pattern under conventional UV light. Our findings open up an avenue to pushing the nanolithography node towards 10 nm for low-cost and large area fabrication under conventional UV light source.

physics.optics↗
arXiv2022

Towards Interpretable Video Super-Resolution via Alternating Optimization

In this paper, we study a practical space-time video super-resolution (STVSR) problem which aims at generating a high-framerate high-resolution sharp video from a low-framerate low-resolution blurry video. Such problem often occurs when recording a fast dynamic event with a low-framerate and low-resolution camera, and the captured video would suffer from three typical issues: i) motion blur occurs due to object/camera motions during exposure time; ii) motion aliasing is unavoidable when the event temporal frequency exceeds the Nyquist limit of temporal sampling; iii) high-frequency details are lost because of the low spatial sampling rate. These issues can be alleviated by a cascade of three separate sub-tasks, including video deblurring, frame interpolation, and super-resolution, which, however, would fail to capture the spatial and temporal correlations among video sequences. To address this, we propose an interpretable STVSR framework by leveraging both model-based and learning-based methods. Specifically, we formulate STVSR as a joint video deblurring, frame interpolation, and super-resolution problem, and solve it as two sub-problems in an alternate way. For the first sub-problem, we derive an interpretable analytical solution and use it as a Fourier data transform layer. Then, we propose a recurrent video enhancement layer for the second sub-problem to further recover high-frequency details. Extensive experiments demonstrate the superiority of our method in terms of quantitative metrics and visual quality.

cs.CV↗
arXiv2022

A Bott periodicity theorem for $\ell^p$-spaces and the coarse Novikov conjecture at infinity

We formulate and prove a Bott periodicity theorem for an $\ell^p$-space ($1\leq p<\infty$). For a proper metric space $X$ with bounded geometry, we introduce a version of $K$-homology at infinity, denoted by $K_*^{\infty}(X)$, and the Roe algebra at infinity, denoted by $C^*_{\infty}(X)$. Then the coarse assembly map descents to a map from $\lim_{d\to\infty}K_*^{\infty}(P_d(X))$ to $K_*(C^*_{\infty}(X))$, called the coarse assembly map at infinity. We show that to prove the coarse Novikov conjecture, it suffices to prove the coarse assembly map at infinity is an injection. As a result, we show that the coarse Novikov conjecture holds for any metric space with bounded geometry which admits a fibred coarse embedding into an $\ell^p$-space. These include all box spaces of a residually finite hyperbolic group and a large class of warped cones of a compact space with an action by a hyperbolic group.

math.KT↗
arXiv2022

Coarse embeddings at infinity and generalized expanders at infinity

We introduce a notion of coarse embedding at infinity into Hilbert space for metric spaces, which is a weakening of the notion of fibred coarse embedding and a far generalization of Gromov's concept of coarse embedding. It turns out that a residually finite group admits a coarse embedding into Hilbert space if and only if one (or equivalently, every) box space of the group admits a coarse embedding at infinity into Hilbert space. Moreover, we introduce a concept of generalized expander at infinity and show that it is an obstruction to coarse embeddability at infinity.

math.OA↗
arXiv2022

Amorphous p-Type Conducting Zn-x Ir Oxide (x > 0.13) Thin Films Deposited by Reactive Magnetron Cosputtering

Zinc-iridium oxide (Zn-Ir-O) thin films have been demonstrated as a p-type conducting material. However, the stability of p-type conductivity with respect to chemical composition or temperature is still unclear. In this study we discuss the local atomic structure and the electrical properties of Zn-Ir-O films in the large Ir concentration range. The films are deposited by reactive DC magnetron co-sputtering at two different substrate temperatures-without intentional heating and at 300 °C. Extended X-ray absorption fine structure (EXAFS) analysis reveals that strongly disordered ZnO4 tetrahedra are the main Zn complexes in Zn-Ir-O films with up to 67.4 at% Ir. As the Ir concentration increases, an effective increase of Ir oxidation state is observed. Reverse Monte Carlo analysis of EXAFS at Zn K-edge shows that the average Zn-O interatomic distance and disorder factor increase with the Ir concentration. We observed that the nano-crystalline w-ZnO structure is preserved in a wider Ir concentration range if the substrate is heated during deposition. At low Ir concentration, the transition from n- to p-type conductivity is observed regardless of the temperature of the substrates. Electrical resistivity decreases exponentially with the Ir concentration in the Zn-Ir-O films.

cond-mat.mtrl-sci↗
arXiv2022

Stability Approach to Regularization Selection for Reduced-Rank Regression

The reduced-rank regression model is a popular model to deal with multivariate response and multiple predictors, and is widely used in biology, chemometrics, econometrics, engineering, and other fields. In the reduced-rank regression modelling, a central objective is to estimate the rank of the coefficient matrix that represents the number of effective latent factors in predicting the multivariate response. Although theoretical results such as rank estimation consistency have been established for various methods, in practice rank determination still relies on information criterion based methods such as AIC and BIC or subsampling based methods such as cross validation. Unfortunately, the theoretical properties of these practical methods are largely unknown. In this paper, we present a novel method called StARS-RRR that selects the tuning parameter and then estimates the rank of the coefficient matrix for reduced-rank regression based on the stability approach. We prove that StARS-RRR achieves rank estimation consistency, i.e., the rank estimated with the tuning parameter selected by StARS-RRR is consistent to the true rank. Through a simulation study, we show that StARS-RRR outperforms other tuning parameter selection methods including AIC, BIC, and cross validation as it provides the most accurate estimated rank. In addition, when applied to a breast cancer dataset, StARS-RRR discovers a reasonable number of genetic pathways that affect the DNA copy number variations and results in a smaller prediction error than the other methods with a random-splitting process.

stat.ME↗
arXiv2022

Formal Security Analysis on dBFT Protocol of NEO

NEO is one of the top public chains worldwide. We focus on its backbone consensus protocol, called delegated Byzantine Fault Tolerance (dBFT). The dBFT protocol has been adopted by a variety of blockchain systems such as ONT. dBFT claims to guarantee the security when no more than $f = \lfloor \frac{n}{3} \rfloor$ nodes are Byzantine, where $n$ is the total number of consensus participants. However, we identify attacks to break the claimed security. In this paper, we show our results by providing a security analysis on its dBFT protocol. First, we evaluate NEO's source code and formally present the procedures of dBFT via the state machine replication (SMR) model. Next, we provide a theoretical analysis with two example attacks. These attacks break the security of dBFT with no more than $f$ nodes. Then, we provide recommendations on how to fix the system against the identified attacks. The suggested fixes have been accepted by the NEO official team. Finally, we further discuss the reasons causing such issues, the relationship with current permissioned blockchain systems, and the scope of potential influence.

cs.CR↗
arXiv2022

Exploring Web3 From the View of Blockchain

Web3 is the most hyped concept from 2020 to date, greatly motivating the prosperity of the Internet of Value and Metaverse. However, no solid evidence stipulates the exact definition, criterion, or standard in the sense of such a buzzword. To fill the gap, we aim to clarify the term in this work. We narrow down the connotation of Web3 by separating it from high-level controversy argues and, instead, focusing on its protocol, architecture, and evaluation from the perspective of blockchain fields. Specifically, we have identified all potential architectural design types and evaluated each of them by employing the scenario-based architecture evaluation method. The evaluation shows that existing applications are neither secure nor adoptable as claimed. Meanwhile, we also discuss opportunities and challenges surrounding the Web3 space and answer several prevailing questions from communities. A primary result is that Web3 still relies on traditional internet infrastructure, not as independent as advocated. This report, as of June 2022, provides the first strict research on Web3 in the view of blockchain. We hope that this work would provide a guide for the development of future Web3 services.

cs.CR↗
arXiv2022

A Weak Consensus Algorithm and Its Application to High-Performance Blockchain

A large number of consensus algorithms have been proposed. However, the requirement of strict consistency limits their wide adoption, especially in high-performance required systems. In this paper, we propose a weak consensus algorithm that only maintains the consistency of relative positions between the messages. We apply this consensus algorithm to construct a high-performance blockchain system, called \textit{Sphinx}. We implement the system with 32k+ lines of code including all components like consensus/P2P/ledger/etc. The evaluations show that Sphinx can reach a peak throughput of 43k TPS (with 8 full nodes), which is significantly faster than current blockchain systems such as Ethereum given the same experimental environment. To the best of our knowledge, we present the first weak consensus algorithm with a fully implemented blockchain system.

cs.DC↗
arXiv2022

Proposal for stable atom trapping on a GaN-on-Sapphire chip

The hybrid photon-atom integrated circuits, which include photonic microcavities and trapped single neutral atom in their evanescent field, are of great potential for quantum information processing. In this platform, the atoms provide the single-photon nonlinearity and long-lived memory, which are complementary to the excellent passive photonics devices in conventional quantum photonic circuits. In this work, we propose a stable platform for realizing the hybrid photon-atom circuits based on an unsuspended photonic chip. By introducing high-order modes in the microring, a feasible evanescent-field trap potential well $\sim0.3\,\mathrm{mK}$ could be obtained by only $10\,\mathrm{mW}$-level power in the cavity, compared with $100\,\mathrm{mW}$-level power required in the scheme based on fundamental modes. Based on our scheme, stable single atom trapping with relatively low laser power is feasible for future studies on high-fidelity quantum gates, single-photon sources, as well as many-body quantum physics based on a controllable atom array in a microcavity.

physics.optics↗
arXiv2022

Frontrunning Block Attack in PoA Clique: A Case Study

As a fundamental technology of decentralized finance (DeFi), blockchain's ability to maintain a distributed fair ledger is threatened by manipulation of block/transaction order. In this paper, we propose a frontrunning block attack against the Clique-based Proof of Authority (PoA) algorithms. Our attack can frontrun blocks from honest in-turn sealers by breaking the proper order of leader selection. By falsifying the priority parameters (both \textit{difficulty} and \textit{delay time}), a malicious out-of-turn sealer can always successfully occupy the leader position and produce advantageous blocks that may contain profitable transactions. As a typical instance, we apply our attack to a mature Clique-engined project, HPB (\$3,058,901, as of April 2022). Experimental results demonstrate the effectiveness and feasibility. Then, we further recommend fixes that make identity checks effective. Our investigation and suggestion have been submitted to its official team and got their approval. We believe this work can act as, at least, a warning case for Clique variants to avoid repeating these design mistakes.

cs.CR↗
arXiv2022

Exploring Unfairness on Proof of Authority: Order Manipulation Attacks and Remedies

Proof of Authority (PoA) is a type of permissioned consensus algorithm with a fixed committee. PoA has been widely adopted by communities and industries due to its better performance and faster finality. In this paper, we explore the \textit{unfairness} issue existing in the current PoA implementations. We have investigated 2,500+ \textit{in the wild} projects and selected 10+ as our main focus (covering Ethereum, Binance smart chain, etc.). We have identified two types of order manipulation attacks to separately break the transaction-level (a.k.a. transaction ordering) and the block-level (sealer position ordering) fairness. Both of them merely rely on honest-but-\textit{profitable} sealer assumption without modifying original settings. We launch these attacks on the forked branches under an isolated environment and carefully evaluate the attacking scope towards different implementations. To date (as of Nov 2021), the potentially affected PoA market cap can reach up to $681,087$ million USD. Besides, we further dive into the source code of selected projects, and accordingly, propose our recommendation for the fix. To the best of knowledge, this work provides the first exploration of the \textit{unfairness} issue in PoA algorithms.

cs.CR↗
arXiv2022

How Do Smart Contracts Benefit Security Protocols?

Smart contracts have recently been adopted by many security protocols. However, existing studies lack satisfactory theoretical support on how contracts benefit security protocols. This paper aims to give a systematic analysis of smart contract (SC)-based security protocols to fulfill the gap of unclear arguments and statements. We firstly investigate \textit{state of the art studies} and establish a formalized model of smart contract protocols with well-defined syntax and assumptions. Then, we apply our formal framework to two concrete instructions to explore corresponding advantages and desirable properties. Through our analysis, we abstract three generic properties (\textit{non-repudiation, non-equivocation, and non-frameability}) and accordingly identify two patterns. (1) a smart contract can be as an autonomous subscriber to assist the trusted third party (TTP); (2) a smart contract can replace traditional TTP. To the best of our knowledge, this is the first study to provide in-depth discussions of SC-based security protocols from a strictly theoretical perspective.

cs.CR↗
arXiv2022

SoK: TEE-assisted Confidential Smart Contract

The blockchain-based smart contract lacks privacy since the contract state and instruction code are exposed to the public. Combining smart-contract execution with Trusted Execution Environments (TEEs) provides an efficient solution, called TEE-assisted smart contracts, for protecting the confidentiality of contract states. However, the combination approaches are varied, and a systematic study is absent. Newly released systems may fail to draw upon the experience learned from existing protocols, such as repeating known design mistakes or applying TEE technology in insecure ways. In this paper, we first investigate and categorize the existing systems into two types: the layer-one solution and layer-two solution. Then, we establish an analysis framework to capture their common lights, covering the desired properties (for contract services), threat models, and security considerations (for underlying systems). Based on our taxonomy, we identify their ideal functionalities and uncover the fundamental flaws and reasons for the challenges in each specification design. We believe that this work would provide a guide for the development of TEE-assisted smart contracts, as well as a framework to evaluate future TEE-assisted confidential contract systems.

cs.CR↗
arXiv2022

Multi-grating design for integrated single-atom trapping, manipulation, and readout

An on-chip multi-grating device is proposed to interface single-atoms and integrated photonic circuits, by guiding and focusing lasers to the area with ~10um above the chip for trapping, state manipulation, and readout of single Rubidium atoms. For the optical dipole trap, two 850 nm laser beams are diffracted and overlapped to form a lattice of single-atom dipole trap, with the diameter of optical dipole trap around 2.7um. Similar gratings are designed for guiding 780 nm probe laser to excite and also collect the fluorescence of 87Rb atoms. Such a device provides a compact solution for future applications of single atoms, including the single photon source, single-atom quantum register, and sensor.

physics.optics↗
arXiv2022

Multi-agent Actor-Critic with Time Dynamical Opponent Model

In multi-agent reinforcement learning, multiple agents learn simultaneously while interacting with a common environment and each other. Since the agents adapt their policies during learning, not only the behavior of a single agent becomes non-stationary, but also the environment as perceived by the agent. This renders it particularly challenging to perform policy improvement. In this paper, we propose to exploit the fact that the agents seek to improve their expected cumulative reward and introduce a novel \textit{Time Dynamical Opponent Model} (TDOM) to encode the knowledge that the opponent policies tend to improve over time. We motivate TDOM theoretically by deriving a lower bound of the log objective of an individual agent and further propose \textit{Multi-Agent Actor-Critic with Time Dynamical Opponent Model} (TDOM-AC). We evaluate the proposed TDOM-AC on a differential game and the Multi-agent Particle Environment. We show empirically that TDOM achieves superior opponent behavior prediction during test time. The proposed TDOM-AC methodology outperforms state-of-the-art Actor-Critic methods on the performed experiments in cooperative and \textbf{especially} in mixed cooperative-competitive environments. TDOM-AC results in a more stable training and a faster convergence.

cs.AI↗
arXiv2022

Continual Test-Time Domain Adaptation

Test-time domain adaptation aims to adapt a source pre-trained model to a target domain without using any source data. Existing works mainly consider the case where the target domain is static. However, real-world machine perception systems are running in non-stationary and continually changing environments where the target domain distribution can change over time. Existing methods, which are mostly based on self-training and entropy regularization, can suffer from these non-stationary environments. Due to the distribution shift over time in the target domain, pseudo-labels become unreliable. The noisy pseudo-labels can further lead to error accumulation and catastrophic forgetting. To tackle these issues, we propose a continual test-time adaptation approach~(CoTTA) which comprises two parts. Firstly, we propose to reduce the error accumulation by using weight-averaged and augmentation-averaged predictions which are often more accurate. On the other hand, to avoid catastrophic forgetting, we propose to stochastically restore a small part of the neurons to the source pre-trained weights during each iteration to help preserve source knowledge in the long-term. The proposed method enables the long-term adaptation for all parameters in the network. CoTTA is easy to implement and can be readily incorporated in off-the-shelf pre-trained models. We demonstrate the effectiveness of our approach on four classification tasks and a segmentation task for continual test-time adaptation, on which we outperform existing methods. Our code is available at \url{https://qin.ee/cotta}.

cs.CV↗