Catalog footprint

What is connected

47works
23topics
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

47 published item(s)

preprint2026arXiv

Agentic Trading: When LLM Agents Meet Financial Markets

A growing body of work explores how Large Language Models (LLMs) can be embedded in trading systems as agents that perceive market information, retrieve context, reason about decisions, emit tradable actions, and adapt under market feedback. This paper reframes LLM-based trading agents as expert-system decision pipelines and presents an audit-oriented evidence map of 77 included studies in a protocol-coded snapshot screened through 2026-03-09. A primary empirical subset (n=19) satisfies the minimum boundary of Action Output plus Closed-Loop Evaluation; the remaining 58 included studies are retained as background and design context. The central empirical finding is protocol incomparability: within the primary subset, only 2/19 studies report extractable time-consistent split protocols, 1/19 reports an explicit transaction-cost model, 1/19 documents universe or survivorship handling, 11/19 report execution timing or semantics, 15/19 are coded as R0, and no study reaches R3 reproducibility. We therefore use Architecture-Capability-Adaptation as a working analytical lens rather than a validated taxonomy, and we foreground the evidence ledger, reproducibility audit, and reporting checklist as the main contributions. The resulting survey shows that architectural experimentation is expanding rapidly, while comparable evaluation protocols, execution semantics, and reproducible artifacts remain the field's immediate bottlenecks.

preprint2022arXiv

Cataloguing MoSi$_2$N$_4$ and WSi$_2$N$_4$ van der Waals Heterostructures: An Exceptional Material Platform for Excitonic Solar Cell Applications

Two-dimensional (2D) materials van der Waals heterostructures (vdWHs) provides a revolutionary route towards high-performance solar energy conversion devices beyond the conventional silicon-based pn junction solar cells. Despite tremendous research progress accomplished in recent years, the searches of vdWHs with exceptional excitonic solar cell conversion efficiency and optical properties remain an open theoretical and experimental quest. Here we show that the vdWH family composed of MoSi$_2$N$_4$ and WSi$_2$N$_4$ monolayers provides a compelling material platform for developing high-performance ultrathin excitonic solar cells and photonics devices. Using first-principle calculations, we construct and classify 51 types of MoSi$_2$N$_4$ and WSi$_2$N$_4$-based [(Mo,W)Si$_2$N$_4$] vdWHs composed of various metallic, semimetallic, semiconducting, insulating and topological 2D materials. Intriguingly, MoSi$_2$N$_4$/(InSe, WSe$_2$) are identified as Type-II vdWHs with exceptional excitonic solar cell power conversion efficiency reaching well over 20%, which are competitive to state-of-art silicon solar cells. The (Mo,W)Si$_2$N$_4$ vdWH family exhibits strong optical absorption in both the visible and ultraviolet regimes. Exceedingly large peak ultraviolet absorptions over 40%, approaching the maximum absorption limit of a free-standing 2D material, can be achieved in (Mo,W)Si$_2$N$_4$/$α_2$-(Mo,W)Ge$_2$P$_4$ vdWHs. Our findings unravel the enormous potential of (Mo,W)Si$_2$N$_4$ vdWHs in designing ultimately compact excitonic solar cell device technology.

preprint2022arXiv

Energy-Efficient Backscatter-Assisted Coded Cooperative-NOMA for B5G Wireless Communications

In this manuscript, we propose an alternating optimization framework to maximize the energy efficiency of a backscatter-enabled cooperative Non-orthogonal multiple access (NOMA) system by optimizing the transmit power of the source, power allocation coefficients (PAC), and power of the relay node under imperfect successive interference cancellation (SIC) decoding. A three-stage low-complexity energy-efficient alternating optimization algorithm is introduced which optimizes the transmit power, PAC, and relay power by considering the quality of service (QoS), power budget, and cooperation constraints. Subsequently, a joint channel coding framework is introduced to enhance the performance of far user which has no direct communication link with the base station (BS) and has bad channel conditions. In the destination node, the far user data is jointly decoded using a Sum-product algorithm (SPA) based joint iterative decoder realized by jointly-designed Quasi-cyclic Low-density parity-check (QC-LDPC) codes. Simulation results evince that the proposed backscatter-enabled cooperative NOMA system outperforms its counterpart by providing an efficient performance in terms of energy efficiency. Also, proposed jointly-designed QC-LDPC codes provide an excellent bit-error-rate (BER) performance by jointly decoding the far user data for considered BSC cooperative NOMA system with only a few decoding iterations.

preprint2022arXiv

Energy-Efficient Beamforming and Resource Optimization for AmBSC-Assisted Cooperative NOMA IoT Networks

In this manuscript, we present an energy-efficient alternating optimization framework based on the multi-antenna ambient backscatter communication (AmBSC) assisted cooperative non-orthogonal multiple access (NOMA) for next-generation (NG) internet-of-things (IoT) enabled communication networks. Specifically, the energy-efficiency maximization is achieved for the considered AmBSC-enabled multi-cluster cooperative IoT NOMA system by optimizing the active-beamforming vector and power-allocation coefficients (PAC) of IoT NOMA users at the transmitter, as well as passive-beamforming vector at the multi-antenna assisted backscatter node. Usually, increasing the number of IoT NOMA users in each cluster results in inter-cluster interference (ICI) (among different clusters) and intra-cluster interference (among IoT NOMA users). To combat the impact of ICI, we exploit a zero-forcing (ZF) based active-beamforming, as well as an efficient clustering technique at the source node. Further, the effect of intra-cluster interference is mitigated by exploiting an efficient power-allocation policy that determines the PAC of IoT NOMA users under the quality-of-service (QoS), cooperation, SIC decoding, and power-budget constraints. Moreover, the considered non-convex passive-beamforming problem is transformed into a standard semi-definite programming (SDP) problem by exploiting the successive-convex approximation (SCA) approximation, as well as the difference of convex (DC) programming, where Rank-1 solution of passive-beamforming is obtained based on the penalty-based method. Furthermore, the numerical analysis of simulation results demonstrates that the proposed energy-efficiency maximization algorithm exhibits an efficient performance by achieving convergence within only a few iterations.

preprint2022arXiv

High-performance and Low-power Transistors Based on Anisotropic Monolayer $β$-TeO$_2$

Two-dimensional (2D) semiconductors offer a promising prospect for high-performance and energy-efficient devices especially in the sub-10 nm regime. Inspired by the successful fabrication of 2D $β$-TeO$_2$ and the high on/off ratio and high air-stability of fabricated field effect transistors (FETs) [Nat. Electron. 2021, 4, 277], we provide a comprehensive investigation of the electronic structure of monolayer $β$-TeO$_2$ and the device performance of sub-10 nm metal oxide semiconductors FETs (MOSFETs) based on this material. The anisotropic electronic structure of monolayer $β$-TeO$_2$ plays a critical role in the anisotropy of transport properties for MOSFETs. We show that the 5.2-nm gate-length n-type MOSFET holds an ultra-high on-state current exceeding 3700 μA/μm according to International Roadmap for Devices and Systems (IRDS) 2020 goals for high-performance devices, which is benefited by the highly anisotropic electron effective mass. Moreover, monolayer $β$-TeO$_2$ MOSFETs can fulfill the IRDS 2020 goals for both high-performance and low-power devices in terms of on-state current, sub-threshold swing, delay time, and power-delay product. This study unveils monolayer $β$-TeO$_2$ as a promising candidate for ultra-scaled devices in future nanoelectronics.

preprint2022arXiv

PNC Enabled IIoT: A General Framework for Channel-Coded Asymmetric Physical-Layer Network Coding

This paper investigates the application of physical-layer network coding (PNC) to Industrial Internet-of-Things (IIoT) where a controller and a robot are out of each other's transmission range, and they exchange messages with the assistance of a relay. We particularly focus on a scenario where the controller has more transmitted information, and the channel of the controller is stronger than that of the robot. To reduce the communication latency, we propose an asymmetric transmission scheme where the controller and robot transmit different amount of information in the uplink of PNC simultaneously. To achieve this, the controller chooses a higher order modulation. In addition, the both users apply channel codes to guarantee the reliability. A problem is a superimposed symbol at the relay contains different amount of source information from the two end users. It is thus hard for the relay to deduce meaningful network-coded messages by applying the current PNC decoding techniques which require the end users to transmit the same amount of information. To solve this problem, we propose a lattice-based scheme where the two users encode-and-modulate their information in lattices with different lattice construction levels. Our design is versatile on that the two end users can freely choose their modulation orders based on their channel power, and the design is applicable for arbitrary channel codes.

preprint2022arXiv

Quality-aware Part Models for Occluded Person Re-identification

Occlusion poses a major challenge for person re-identification (ReID). Existing approaches typically rely on outside tools to infer visible body parts, which may be suboptimal in terms of both computational efficiency and ReID accuracy. In particular, they may fail when facing complex occlusions, such as those between pedestrians. Accordingly, in this paper, we propose a novel method named Quality-aware Part Models (QPM) for occlusion-robust ReID. First, we propose to jointly learn part features and predict part quality scores. As no quality annotation is available, we introduce a strategy that automatically assigns low scores to occluded body parts, thereby weakening the impact of occluded body parts on ReID results. Second, based on the predicted part quality scores, we propose a novel identity-aware spatial attention (ISA) module. In this module, a coarse identity-aware feature is utilized to highlight pixels of the target pedestrian, so as to handle the occlusion between pedestrians. Third, we design an adaptive and efficient approach for generating global features from common non-occluded regions with respect to each image pair. This design is crucial, but is often ignored by existing methods. QPM has three key advantages: 1) it does not rely on any outside tools in either the training or inference stages; 2) it handles occlusions caused by both objects and other pedestrians;3) it is highly computationally efficient. Experimental results on four popular databases for occluded ReID demonstrate that QPM consistently outperforms state-of-the-art methods by significant margins. The code of QPM will be released.

preprint2021arXiv

Community Detection in Blockchain Social Networks

In this work, we consider community detection in blockchain networks. We specifically take the Bitcoin network and Ethereum network as two examples, where community detection serves in different ways. For the Bitcoin network, we modify the traditional community detection method and apply it to the transaction social network to cluster users with similar characteristics. For the Ethereum network, on the other hand, we define a bipartite social graph based on the smart contract transactions. A novel community detection algorithm which is designed for low-rank signals on graph can help find users' communities based on user-token subscription. Based on these results, two strategies are devised to deliver on-chain advertisements to those users in the same community. We implement the proposed algorithms on real data. By adopting the modified clustering algorithm, the community results in the Bitcoin network is basically consistent with the ground-truth of betting site community which has been announced to the public. At the meanwhile, we run the proposed strategy on real Ethereum data, visualize the results and implement an advertisement delivery on the Ropsten test net.

preprint2021arXiv

Detection of Insider Attacks in Distributed Projected Subgradient Algorithms

The gossip-based distributed algorithms are widely used to solve decentralized optimization problems in various multi-agent applications, while they are generally vulnerable to data injection attacks by internal malicious agents as each agent locally estimates its decent direction without an authorized supervision. In this work, we explore the application of artificial intelligence (AI) technologies to detect internal attacks. We show that a general neural network is particularly suitable for detecting and localizing the malicious agents, as they can effectively explore nonlinear relationship underlying the collected data. Moreover, we propose to adopt one of the state-of-art approaches in federated learning, i.e., a collaborative peer-to-peer machine learning protocol, to facilitate training our neural network models by gossip exchanges. This advanced approach is expected to make our model more robust to challenges with insufficient training data, or mismatched test data. In our simulations, a least-squared problem is considered to verify the feasibility and effectiveness of AI-based methods. Simulation results demonstrate that the proposed AI-based methods are beneficial to improve performance of detecting and localizing malicious agents over score-based methods, and the peer-to-peer neural network model is indeed robust to target issues.

preprint2021arXiv

Secure Blockchain Platform for Industrial IoT with Trusted Computing Hardware

As a disruptive technology that originates from cryptocurrency, blockchain provides a trusted platform to facilitate industrial IoT (IIoT) applications. However, implementing a blockchain platform in IIoT scenarios confronts various security challenges due to the rigorous deployment condition. To this end, we present a novel design of secure blockchain based on trusted computing hardware for IIoT applications. Specifically, we employ the trusted execution environment (TEE) module and a customized security chip to safeguard the blockchain against different attacking vectors. Furthermore, we implement the proposed secure IIoT blockchain on the ARM-based embedded device and build a small-scale IIoT network to evaluate its performance. Our experimental results show that the secure blockchain platform achieves a high throughput (150TPS) with low transaction confirmation delay (below 66ms), demonstrating its feasibility in practical IIoT scenarios. Finally, we outline the open challenges and future research directions.

preprint2021arXiv

When Blockchain Meets AI: Optimal Mining Strategy Achieved By Machine Learning

This work applies reinforcement learning (RL) from the AI machine learning field to derive an optimal Bitcoin-like blockchain mining strategy without knowing the details of the blockchain network model. Previously, the most profitable mining strategy was believed to be honest mining encoded in the default blockchain protocol. It was shown later that it is possible to gain more mining rewards by deviating from honest mining. In particular, the mining problem can be formulated as a Markov Decision Process (MDP) which can be solved to give the optimal mining strategy. However, solving the mining MDP requires knowing the values of various parameters that characterize the blockchain network model. In real blockchain networks, these parameter values are not easy to obtain and may change over time. This hinders the use of the MDP model-based solution. In this work, we employ RL to dynamically learn a mining strategy with performance approaching that of the optimal mining strategy by observing and interacting with the network. Since the mining MDP problem has a non-linear objective function (rather than linear functions of standard MDP problems), we design a new multi-dimensional RL algorithm to solve the problem. Experimental results indicate that, without knowing the parameter values of the mining MDP model, our multi-dimensional RL mining algorithm can still achieve the optimal performance over time-varying blockchain networks.

preprint2020arXiv

Game-Theoretical Analysis of Mining Strategy for Bitcoin-NG Blockchain Protocol

Bitcoin-NG, a scalable blockchain protocol, divides each block into a key block and many micro blocks to effectively improve the transaction processing capacity. Bitcoin-NG has a special incentive mechanism (i.e. splitting transaction fees to the current and the next leader) to maintain its security. However, this design of the incentive mechanism ignores the joint effect of transaction fees, mint coins and mining duration lengths on the expected mining reward. In this paper, we identify the advanced mining attack that deliberately ignores micro blocks to enlarge the mining duration length to increase the likelihood of winning the mining race. We first show that an advanced mining attacker can maximize its expected reward by optimizing its mining duration length. We then formulate a game-theoretical model in which multiple mining players perform advanced mining to compete with each other. We analyze the Nash equilibrium for the mining game. Our analytical and simulation results indicate that all mining players in the mining game converge to having advanced mining at the equilibrium and have no incentives for deviating from the equilibrium; the transaction processing capability of the Bitcoin-NG network at the equilibrium is decreased by advanced mining. Therefore, we conclude that the Bitcoin-NG blockchain protocol is vulnerable to advanced mining attack. We discuss how to reduce the negative impact of advanced mining for Bitcoin-NG.

preprint2020arXiv

PubChain: A Decentralized Open-Access Publication Platform with Participants Incentivized by Blockchain Technology

We design and implement Publication Chain (PubChain), a decentralized open-access publication platform built on decentralized and distributed technologies of blockchain and IPFS peer-to-peer file sharing systems. The existing publication platforms have some severe drawbacks. First, instead of promoting widespread knowledge sharing, access to publications on the platforms owned by publishers is often on a fee basis. This drawback of pay wall prevents researchers from "standing on the shoulders of giants". Moreover, the peer review process on most all existing publication platforms (including both open-access and publisher platforms) is prone to be ineffective, since there is no proper incentive to reviewers for performing high-qualified reviews. PubChain is an alternative platform to the existing publication venues aiming to address their drawbacks. No central third-party owns the contents (i.e., papers and reviews) of PubChain. Exploiting blockchain technology, we devise an elaborate incentive scheme on PubChain to incentivize key stakeholders (i.e., authors, readers and reviewers) to participate publication activities on PubChain in a substantive manner by earning credits and rewards through self-motivated interactions. We have performed simulations to investigate the robustness of our proposed incentive scheme against fraudulent publications and reviews. We also have implemented a prototype of PubChain to demonstrate its key concepts.

preprint2020arXiv

Structural transition, metallization and superconductivity in quasi 2D layered PdS$_2$ under compression

Based on first-principles simulations and calculations, we explore the evolution of crystal structure, electronic structure and transport properties of quasi 2D layered PdS2 under uniaxial stress and hydrostatic pressure. The coordination of the Pd ions plays crucial roles in the structural transition, electronic structure and transport properties of PdS2. An interesting ferroelastic phase transition with lattice reorientation is revealed under uniaxial compressive stress, which originates from the bond reconstructions of the unusual PdS4 square-planar coordination. By contrast, the layered structure transforms to 3D cubic pyrite-type structure under hydrostatic pressure. In contrast to the experimental proposed coexistence of layered PdS2-type structure with cubic pyrite-type structure at intermediate pressure range, we predict that the compression-induced intermediate phase showing the same structural symmetry with the ambient phase, except of sharply contracted interlayer-distances. The coordination environments of the Pd ions have changed from square-planar to distorted octahedra in the intermediate phase, which results in the bandwidth broaden and orbital-selective metallization. In addition, the superconductivity comes from the cubic pyrite-type structure protected topological nodal-line states. The strong correlations between structural transition, electronic structure and transport properties in PdS2 provide a platform to study the fundamental physics of the interplay between crystal structure and transport behavior, and the competition between diverse phases.

preprint2016arXiv

Collective fermion excitation in a warm massless Dirac system

Basing on a self-consistent method, we predict theoretically that there occurs not only a normal (quasi) fermion mode, but also a collective fermion mode, plasmino, in a warm 2D massless Dirac system, especially in a warm intrinsic graphene system. Results of Landau damping show that both fermion and plasmino are well defined modes. We find that there are sharp differences between the discussed system and the QCD/QED system. Firstly, the thermal mass is proportional to $α_g^{3/4}T$ but not $α_g T$. Secondly, at $0<q<q_c$, the fermion channel and plasmino channel are nearly degenerate and furthermore, the energy difference between fermion and plasmino becomes more and more larger with increasing $q$ at the region $q>q_c$. Thirdly, the fermion behaves as a "relativity particles" with none zero mass and the plasmino exhibits an anormal dispersion at moderate momentum.

preprint2016arXiv

Low-energy quantum scattering induced by graphene ripples

We report a quantum study of the carrier scattering induced by graphene ripples. Crucial differences between the scattering induced by the ripple and ordinary scattering were found. In contrast to the latter, in which the Born approximation is valid for high-energy process, the former is valid for the low-energy process with a quite broad energy range. Furthermore, in polar symmetry ripples, the scattering amplitude exhibits a pseudo-spin structure, an additional factor $\cosθ/2$, which leads to an absence of backward scattering. We also elucidate that the scattering cross sections are proportional to the energy cubed of the incident carrier.

preprint2015arXiv

Improving Two-Way Selective Decode-and-forward Wireless Relaying with Energy-Efficient One-bit Soft Forwarding

Motivated by applications such as battery-operated wireless sensor networks (WSN), we propose an easy-to-implement energy-efficient two-way relaying scheme. In particular, we address the challenge of improving the standard two-way selective decode-and-forward protocol (TW-SDF) in terms of block-error-rate (BLER) with minor additional complexity and energy consumption. By following the principle of soft relaying, our solution is the two-way one-bit soft forwarding (TW-1bSF) protocol in which the relay forwards the one-bit quantization of a posterior information metric about the transmitted bits, associated with an appropriately designed reliability parameter. In WSN-related standards (such as IEEE802.15.6 and Bluetooth), block codes are adopted instead of convolutional and other sophisticated codes, due to their efficient decoder hardware implementation. As the second main contribution, we derive tight upper bounds on the BLER performance for both TW-SDF and TW-1bSF, when the two-way relaying network employs block codes and hard decoding. The error probability analysis confirms the superiority of TW-1bSF. Moreover, we derive the asymptotic performance gain of TW-1bSF over TW-SDF, which further suggests that the proposed protocol is a good choice, especially when long block codes are used.

preprint2015arXiv

Joint Multiple Symbol Differential Detection and Channel Decoding for Noncoherent UWB Impulse Radio by Belief Propagation

This paper proposes a belief propagation (BP) message passing algorithm based joint multiple symbol differential detection (MSDD) and channel decoding scheme for noncoherent differential ultra-wideband impulse radio (UWB-IR) systems. MSDD is an effective means to improve the performance of noncoherent differential UWB-IR systems. To optimize the overall detection and decoding performance, in this paper, we propose a novel soft-in soft-out (SISO) MSDD scheme and its integration with SISO channel decoding for noncoherent differential UWB-IR. we first propose a new auto-correlation receiver (AcR) architecture to sample the received UWB-IR signal. The proposed AcR can exploit the dependencies (imposed by the differential modulation) among data symbols throughout the whole packet. The signal probabilistic model has a hidden Markov chain structure. We use a factor graph to represent this hidden Markov chain. Then, we apply BP message passing algorithm on the factor graph to develop a SISO MSDD scheme, which has better performance than the previous MSDD scheme and is easy to be integrated with SISO channel decoding to form a joint MSDD and channel decoding scheme. Simulation results indicate the performance advantages of our MSDD scheme and joint MSDD and channel decoding scheme.

preprint2015arXiv

Near-Optimal Modulo-and-Forward Scheme for the Untrusted Relay Channel

This paper studies an untrusted relay channel, in which the destination sends artificial noise simultaneously with the source sending a message to the relay, in order to protect the source's confidential message. The traditional amplify-and-forward (AF) scheme shows poor performance in this situation because of the interference power dilemma: providing better security by using stronger artificial noise will decrease the confidential message power from the relay to the destination. To solve this problem, a modulo-and-forward (MF) operation at the relay with nested lattice encoding at the source is proposed. For this system with full channel state information at the transmitter (CSIT), theoretical analysis shows that the proposed MF scheme approaches the secrecy capacity within 1/2 bit for any channel realization, and hence achieves full generalized security degrees of freedom (G-SDoF). In contrast, the AF scheme can only achieve a small fraction of the G-SDoF. For this system without any CSIT, the total outage event, defined as either connection outage or secrecy outage, is introduced. Based on this total outage definition, analysis shows that the proposed MF scheme achieves the full generalized secure diversity gain (G-SDG) of order one. On the other hand, the AF scheme can only achieve a G-SDG of 1/2 at most.

preprint2015arXiv

STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks

The data center network (DCN), wired or wireless, features large amounts of Many-to-One (M2O) sessions. Each M2O session is currently operated based on Point-to-Point (P2P) communications and Store-and-Forward (SAF) relays, and is generally followed by certain further computation at the destination. %typically a weighted summation of the received digits. Different from this separate P2P/SAF-based-transmission and computation strategy, this paper proposes STAC, a novel physical layer scheme that achieves Simultaneous Transmission and Air Computation in wireless DCNs. In particular, STAC takes advantage of the superposition nature of electromagnetic (EM) waves, and allows multiple transmitters to transmit in the same time slot with appropriately chosen parameters, such that the received superimposed signal can be directly transformed to the needed summation at the receiver. Exploiting the static channel environment and compact space in DCN, we propose an enhanced Software Defined Network (SDN) architecture to enable STAC, where wired connections are established to provide the wireless transceivers external reference signals. Theoretical analysis and simulation show that with STAC used, both the bandwidth and energy efficiencies can be improved severalfold.

preprint2014arXiv

Conformation characters of gel sheets with rotational symmetry: the role of boundary

In this paper, we systemically study the conformation characters of rotational symmetric gel sheets with free boundary and investigate the role of boundary on the equilibrium conformation. In gel sheet the boundary provides a residual strain which leads to re-distribution of stress and impacts the shape of equilibrium conformation accordingly. For sheet with boundary, the in-plane stretching energy is far larger than the bending energy in some cases. It is intrinsic different from closed membrane. In gel sheets, the boundary doesn't only quantitatively amend to the elastic energy. The residual strain on boundary cooperates with bending and stretching to determine the equilibrium conformation rather than just the last two factors. Furthermore, on the boundary of gel sheet, there is an additional energy induced by boundary line tension $γ$. If $γ=0$, there is $10\%$ difference of elastic energy from the experimental result. Finally, we discuss the effects of such line tension $γ$ and propose a way to measure it by the border radius. It redounds to study the physical origination of $γ$.

preprint2014arXiv

Electron spin-orbit interaction in helically coiled carbon nanotube

Recent theoretical and experimental works on carbon nanotubes (CNTs) have revealed that spin-orbit interaction (SOI) is more robust than it was thought. Motivated by this, we investigate the SOI in helically coiled CNTs. Calculations are performed within the tight-binding model with the inclusion of a four-orbital basis set; thereby the full symmetry of the helical lattice and the hybridization of $π$\ and $σ$ bands are considered. By virtue of unitary transformation and perturbation approach, we obtain the analytic solution for the torsion-dependent SOI in helically coiled CNTs. Due to the enhancement of curvature and torsion, the calculated SOI values reach the order of meV which has been confirmed by \textit{ab initio} electronic structure calculation.

preprint2014arXiv

The Capacity of Known Interference Channel (updated)

In this paper, we investigate the capacity of known interference channel, where the receiver knows the interference data but not the channel gain of the interference data. We first derive a tight upper bound for the capacity of this known-interference channel. After that, we obtain an achievable rate of the channel with a blind known interference cancellation (BKIC) scheme in closed form. We prove that the aforementioned upper bound in the high SNR regime can be approached by our achievable rate. Moreover, the achievable rate of our BKIC scheme is much larger than that of the traditional interference cancellation scheme. In particular, the achievable rate of BKIC continues to increase with SNR in the high SNR regime (non-zero degree of freedom), while that of the traditional scheme approaches a fixed bound that does not improve with SNR (zero degree of freedom).

preprint2013arXiv

Manipulate the coiling and uncoiling movements of Lepidoptera proboscis by its conformation optimizing

Many kinds of adult Lepidoptera insects possess a long proboscis which is used to suck liquids and has the coiling and uncoiling movements. Although experiments revealed qualitatively that the coiling movement is governed by the hydraulic mechanism and the uncoiling movement is due to the musculature and the elasticity, it needs a quantitative investigation to reveal how insects achieve these behaviors accurately. Here a quasi-one-dimensional (Q1D) curvature elastica model is proposed to reveal the mechanism of these behaviors. We find that the functions of internal stipes muscle and basal galeal muscle which locate at the bottom of proboscis are to adjust the initial states in the coiling and uncoiling processes, respectively. The function of internal galeal muscle which exists along proboscis is to adjust the line tension. The knee bend shape is due to the local maximal spontaneous curvature and is an advantage for nectar-feeding butterfly. When there is no knee bend, the proboscis of fruit-piercing butterfly is easy to achieve the piercing movement which induced by the increase of internal hydraulic pressure. All of the results are in good agreement with experiential observation. Our study provides a revelatory method to investigate the mechanical behaviors of other 1D biologic structures, such as proboscis of marine snail and elephant. Our method and results are also significant in designing the bionic devices.

preprint2013arXiv

Mapping and Coding Design for Channel Coded Physical-layer Network Coding

Although BICM can significantly improves the BER performance by iteration processing between the demapping and the decoding in a traditional receiver, its design and performance in PNC system has fewer studied. This paper investigates a bit interleaved coded modulation (BICM) scheme in a Gaussian two-way relay channel operated with physical layer network coding (PNC). In particular, we first present an iterative demapping and decoding framework specially designed for PNC. After that, we compare different constellation mapping schemes in this framework, with the convergence analysis by using the EXIT chart. It is found that the anti-Gray mapping outperforms the Gray mapping, which is the best mapping in the traditional decoding schemes. Finally, the numerical simulation shows the better performance of our framework and verifies the mapping design.

preprint2013arXiv

Secrecy Rate Study in Two-Hop Relay Channel with Finite Constellations

Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or co-located with the relay. Similar as physical layer network coding, the friendly jamming signal will prevent the eavesdropper from detecting the useful information originated from the source and will not affect the destination on detecting the source information with the presence of the known jamming signal. However, existing investigations are confined to Gaussian distributed signals, which are seldom used in real systems. When finite constellation signals are applied, the behavior of the secrecy rate becomes very different. For example, the secrecy rate depends on phase difference between the input signals with finite constellations, which is not observed with Gaussian signals. In this paper, we investigate the secrecy capacity and derive its upper bound for the two-hop relay model, by assuming an eavesdropper near the relay and the widely used M-PSK modulation. With our upper bound, the best and worst phase differences in high SNR region are then given. Numerical studies verify our analysis and show that the derived upper bound is relatively tight.

preprint2013arXiv

Throughput Analysis of CSMA Wireless Networks with Finite Offered-load

This paper proposes an approximate method, equivalent access intensity (EAI), for the throughput analysis of CSMA wireless networks in which links have finite offered-load and their MAC-layer transmit buffers may be empty from time to time. Different from prior works that mainly considered the saturated network, we take into account in our analysis the impacts of empty transmit buffers on the interactions and dependencies among links in the network that is more common in practice. It is known that the empty transmit buffer incurs extra waiting time for a link to compete for the channel airtime usage, since when it has no packet waiting for transmission, the link will not perform channel competition. The basic idea behind EAI is that this extra waiting time can be mapped to an equivalent "longer" backoff countdown time for the unsaturated link, yielding a lower link access intensity that is defined as the mean packet transmission time divided by the mean backoff countdown time. That is, we can compute the "equivalent access intensity" of an unsaturated link to incorporate the effects of the empty transmit buffer on its behavior of channel competition. Then, prior saturated ideal CSMA network (ICN) model can be adopted for link throughput computation. Specifically, we propose an iterative algorithm, "Compute-and-Compare", to identify which links are unsaturated under current offered-load and protocol settings, compute their "equivalent access intensities" and calculate link throughputs. Simulation shows that our algorithm has high accuracy under various offered-load and protocol settings. We believe the ability to identify unsaturated links and compute links throughputs as established in this paper will serve an important first step toward the design and optimization of general CSMA wireless networks with offered-load control.

preprint2012arXiv

Faraday rotation effect in periodic graphene structure

We report the magneto-optical rotation effect in a periodic graphene-sheet structure. Due to the masslessness of carriers in graphene, the magnetic response is very sensitive and the magneto-optical rotation effect is therefore significant. We predict that the Verdet constant of the periodic graphene-sheet structure is roughly 10-100 times that of rare-earth-doped magneto-optical glass in the infrared region.

preprint2012arXiv

MIMO Physical Layer Network Coding Based on VBLAST Detection

For MIMO two-way relay channel, this paper proposes a novel scheme, VBLAST-PNC, to transform the two superimposed packets received by the relay to their network coding form. Different from traditional schemes, which tries to detect each packet before network coding them, VBLAST-PNC detects the summation of the two packets before network coding. In particular, after firstly detecting the second layer signal in 2-by-2 MIMO system with VBLAST, we only cancel part of the detected signal, rather than canceling all the components, from the first layer. Then we directly map the obtained signal, summation of the first layer and the second layer, to their network coding form. With such partial interference cancellation, the error propagation effect is mitigated and the performance is thus improved as shown in simulations.

preprint2011arXiv

Blind Known Interference Cancellation

This paper investigates interference-cancellation schemes at the receiver, in which the original data of the interference is known a priori. Such a priori knowledge is common in wireless relay networks. For example, a transmitting relay could be relaying data that was previously transmitted by a node, in which case the interference received by the node now is actually self information. Besides the case of self information, the node could also have overheard or received the interference data in a prior transmission by another node. Directly removing the known interference requires accurate estimate of the interference channel, which may be difficult in many situations. In this paper, we propose a novel scheme, Blind Known Interference Cancellation (BKIC), to cancel known interference without interference channel information. BKIC consists of two steps. The first step combines adjacent symbols to cancel the interference, exploiting the fact that the channel coefficients are almost the same between successive symbols. After such interference cancellation, however, the signal of interest is also distorted. The second step recovers the signal of interest amidst the distortion. We propose two algorithms for the critical second steps. The first algorithm (BKIC-S) is based on the principle of smoothing. It is simple and has near optimal performance in the slow fading scenario. The second algorithm (BKIC-RBP) is based on the principle of real-valued belief propagation. It can achieve MAP-optimal performance with fast convergence, and has near optimal performance even in the fast fading scenario. Both BKIC schemes outperform the traditional self-interference cancellation schemes with perfect initial channel information by a large margin, while having lower complexities.

preprint2011arXiv

Implementation of Physical-layer Network Coding

This paper presents the first implementation of a two-way relay network based on the principle of physical-layer network coding. To date, only a simplified version of physical-layer network coding (PNC) method, called analog network coding (ANC), has been successfully implemented. The advantage of ANC is that it is simple to implement; the disadvantage, on the other hand, is that the relay amplifies the noise along with the signal before forwarding the signal. PNC systems in which the relay performs XOR or other denoising PNC mappings of the received signal have the potential for significantly better performance. However, the implementation of such PNC systems poses many challenges. For example, the relay must be able to deal with symbol and carrier-phase asynchronies of the simultaneous signals received from the two end nodes, and the relay must perform channel estimation before detecting the signals. We investigate a PNC implementation in the frequency domain, referred to as FPNC, to tackle these challenges. FPNC is based on OFDM. In FPNC, XOR mapping is performed on the OFDM samples in each subcarrier rather than on the samples in the time domain. We implement FPNC on the universal soft radio peripheral (USRP) platform. Our implementation requires only moderate modifications of the packet preamble design of 802.11a/g OFDM PHY. With the help of the cyclic prefix (CP) in OFDM, symbol asynchrony and the multi-path fading effects can be dealt with in a similar fashion. Our experimental results show that symbol-synchronous and symbol-asynchronous FPNC have essentially the same BER performance, for both channel-coded and unchannel-coded FPNC.

preprint2011arXiv

Information-disturbance tradeoff in sending Direction information via antiparallel quantum spin

For sending unknown direction information, antiparallel spins contains more direction information than parallel spins(Gisin and Popescu, 1999, \textit{Phys. Rev. Lett.} 83, 432).In this paper, the optimal information-disturbance tradeoff bound for antiparallel spins is derived. The quantum measurements which attain the optimal tradeoff bound are obtained. This result can be of practical relevance for posing some general limits on Eve's eavesdropping process. Finally, we also present a comparison between the bound for antiparallel spins and the bound for parallel spins.

preprint2011arXiv

Local Gaussian operations can enhance continuous-variable entanglement distillation

Entanglement distillation is a fundamental building block in long-distance quantum communication. Though known to be useless on their own for distilling Gaussian entangled states, local Gaussian operations may still help to improve non-Gaussian entanglement distillation schemes. Here we show that by applying local squeezing operations, both the performance and the efficiency of existing distillation protocols can be enhanced. We derive the optimal enhancement through local Gaussian unitaries, which can be obtained even in the most natural scenario when Gaussian mixed entangled states are shared after their distribution through a lossy-fiber communication channel.

preprint2011arXiv

Multipartite continuous-variable entanglement distillation using local squeezing and only one photon-subtraction operation

In this paper, we study entanglement distillation of multipartite continuous-variable Gaussian entangled states. Following Opatrný \emph{et al.}'s photon subtraction (PS) scheme, the probability of successful distillation decreases exponentially with the number of parties $N$. However, here, we shall propose an entanglement distillation scheme whose success probability scales as a constant with $N$. Our protocol employs several local squeezers, but it requires only a single PS operation. Using the logarithmic negativity as a measure of entanglement, we find that both the success probability and the distilled entanglement can be improved at the same time. Moreover, an $N$-mode transfer theorem (transferring states from phase space to Hilbert space) is presented.

preprint2011arXiv

Non-memoryless Analog Network Coding in Two-Way Relay Channel

Physical-layer Network Coding (PNC) can significantly improve the throughput of two-way relay channels. An interesting variant of PNC is Analog Network Coding (ANC). Almost all ANC schemes proposed to date, however, operate in a symbol by symbol manner (memoryless) and cannot exploit the redundant information in channel-coded packets to enhance performance. This paper proposes a non-memoryless ANC scheme. In particular, we design a soft-input soft-output decoder for the relay node to process the superimposed packets from the two end nodes to yield an estimated MMSE packet for forwarding back to the end nodes. Our decoder takes into account the correlation among different symbols in the packets due to channel coding, and provides significantly improved MSE performance. Our analysis shows that the SNR improvement at the relay node is lower bounded by 1/R (R is the code rate) with the simplest LDPC code (repeat code). The SNR improvement is also verified by numerical simulation with LDPC code. Our results indicate that LDPC codes of different degrees are preferred in different SNR regions. Generally speaking, smaller degrees are preferred for lower SNRs.

preprint2011arXiv

Optimal Decoding Algorithm for Asynchronous Physical-Layer Network Coding

A key issue in physical-layer network coding (PNC) is how to deal with the asynchrony between signals transmitted by multiple transmitters. That is, symbols transmitted by different transmitters could arrive at the receiver with symbol misalignment as well as relative carrier-phase offset. In this paper, 1) we propose and investigate a general framework based on belief propagation (BP) that can effectively deal with symbol and phase asynchronies; 2) we show that for BPSK and QPSK modulations, our BP method can significantly reduce the SNR penalty due to asynchrony compared with prior methods; 3) we find that symbol misalignment makes the system performance less sensitive and more robust against carrier-phase offset. Observation 3) has the following practical implication. It is relatively easier to control symbol timing than carrier-phase offset. Our results indicate that if we could control the symbol offset in PNC, it would actually be advantageous to deliberately introduce symbol misalignment to desensitize the system to phase offset.

preprint2011arXiv

Physical-Layer Network Coding: Tutorial, Survey, and Beyond

The concept of physical-layer network coding (PNC) was proposed in 2006 for application in wireless networks. Since then it has developed into a subfield of network coding with wide followings. The basic idea of PNC is to exploit the network coding operation that occurs naturally when electromagnetic (EM) waves are superimposed on one another. This simple idea turns out to have profound and fundamental ramifications. Subsequent works by various researchers have led to many new results in the domains of 1) wireless communication; 2) wireless information theory; and 3) wireless networking. The purpose of this paper is fourfold. First, we give a brief tutorial on the basic concept of PNC. Second, we survey and discuss recent key results in the three aforementioned areas. Third, we examine a critical issue in PNC: synchronization. It has been a common belief that PNC requires tight synchronization. Our recent results suggest, however, that PNC may actually benefit from asynchrony. Fourth, we propose that PNC is not just for wireless networks; it can also be useful in optical networks. We provide an example showing that the throughput of a passive optical network (PON) could potentially be raised by 100% with PNC.

preprint2010arXiv

Anomalous Valley Magnetic Moment of Graphene

Carrier interactions on graphene are studied. The study shows that besides the well known Coulomb repulsion between carriers, there also exist four-fermion interactions associated with U-process, one of which attracts carriers in different valleys. We then calculate the contributions to valley magnetic moment from vertex correction and from four-fermion corrections explicitly. The relative contributions are -18% and 3% respectively. At last we point out that we can mimic heavy quarkonium system by carrier interactions in graphene.

preprint2010arXiv

Channel Coding and Decoding in a Relay System Operated with Physical layer Network Coding

Physical-layer Network Coding (PNC) can significantly improve the throughput of wireless two way relay channel (TWRC) by allowing the two end nodes to transmit messages to the relay simultaneously. To achieve reliable communication, channel coding could be applied on top of PNC. This paper investigates link-by-link channel-coded PNC, in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes plus noise, Y3=X1+X2+W3, to the network-coded combination of the source packets, S1 XOR S2 . This is in distinct to the traditional multiple-access problem, in which the goal is to obtain S1 and S2 separately. The transformation from Y3 to (S1 XOR S2) is referred to as the Channel-decoding-Network-Coding process (CNC) in that it involves both channel decoding and network coding operations. A contribution of this paper is the insight that in designing CNC, we should first (i) channel-decode Y3 to the superimposed source symbols S1+S2 before (ii) transforming S1+S2 to the network-coded packets (S1 XOR S2) . Compared with previously proposed strategies for CNC, this strategy reduces the channel-coding network-coding mismatch. It is not obvious, however, that an efficient decoder for step (i) exists. A second contribution of this paper is to provide an explicit construction of such a decoder based on the use of the Repeat Accumulate (RA) code. Specifically, we redesign the belief propagation algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.

preprint2010arXiv

Channel-coded Collision Resolution by Exploiting Symbol Misalignment

In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously, resulting in packet collisions. Traditionally, the collided packets are simply discarded. To improve performance, advanced signal processing techniques can be applied to extract the individual packets from the collided signals. Prior work of ours has shown that the symbol misalignment among the collided packets can be exploited to improve the likelihood of successfully extracting the individual packets. However, the failure rate is still unacceptably high. This paper investigates how channel coding can be used to reduce the failure rate. We propose and investigate a decoding scheme that incorporates the exploitation of the aforementioned symbol misalignment into the channel decoding process. This is a fine-grained integration at the symbol level. In particular, collision resolution and channel decoding are applied in an integrated manner. Simulation results indicate that our method outperforms other schemes, including the straightforward method in which collision resolution and channel coding are applied separately.

preprint2010arXiv

Distillation of mixed-state continuous-variable entanglement by photon subtraction

We present a detailed theoretical analysis for the distillation of one copy of a mixed two-mode continuous-variable entangled state using beamsplitters and coherent photon-detection techniques, including conventional on-off detectors and photon number resolving detectors. The initial Gaussian mixed-entangled states are generated by transmitting a two-mode squeezed state through a lossy bosonic channel, corresponding to the primary source of errors in current approaches to optical quantum communication. We provide explicit formulas to calculate the entanglement in terms of logarithmic negativity before and after distillation, including losses in the channel and the photon detection, and show that one-copy distillation is still possible even for losses near the typical fiber channel attenuation length. A lower bound for the transmission coefficient of the photon-subtraction beamsplitter is derived, representing the minimal value that still allows to enhance the entanglement.

preprint2010arXiv

Physical layer network coding with multiple antennas

The two-phase MIMO NC (network coding) scheme can be used to boost the throughput in a two-way relay channel in which nodes are equipped with multiple antennas. The obvious strategy is for the relay node to extract the individual packets from the two end nodes and mix the two packets to form a network-coded packet. In this paper, we propose a new scheme called MIMO PNC (physical network coding), in which the relay extracts the summation and difference of the two end packets and then converts them to the network-coded form. MIMO PNC is a natural combination of the single-antenna PNC scheme and the linear MIMO detection scheme. The advantages of MIMO PNC are many. First, it removes the stringent carrier-phase requirement in single-antenna PNC. Second, it is linear in complexity with respect to the constellation size and the number of simultaneous data streams in MIMO. Simulation shows that MIMO PNC outperforms the straightforward MIMO NC significantly under random Rayleigh fading channel. Based on our analysis, we further conjecture that MIMO PNC outperforms MIMO NC under all possible realizations of the channel.

preprint2010arXiv

Quantum transport in a curved one-dimensional quantum wire with spin-orbit interactions

The one-dimensional effective Hamiltonian for a planar curvilinear quantum wire with arbitrary shape is proposed in the presence of the Rashba spin-orbit interaction. Single electron propagation through a device of two straight lines conjugated with an arc has been investigated and the analytic expressions of the reflection and transmission probabilities have been derived. The effects of the device geometry and the spin-orbit coupling strength $α$ on the reflection and transmission probabilities and the conductance are investigated in the case of spin polarized electron incidence. We find that no spin-flip exists in the reflection of the first junction. The reflection probabilities are mainly influenced by the arc angle and the radius, while the transmission probabilities are affected by both spin-orbit coupling and the device geometry. The probabilities and the conductance take the general behavior of oscillation versus the device geometry parameters and $α$. Especially the electron transportation varies periodically versus the arc angle $θ_{w}$. We also investigate the relationship between the conductance and the electron energy, and find that electron resonant transmission occurs for certain energy. Finally, the electron transmission for the incoming electron with arbitrary state is considered. For the outgoing electron, the polarization ratio is obtained and the effects of the incoming electron state are discussed. We find that the outgoing electron state can be spin polarization and reveal the polarized conditions.

preprint2010arXiv

The Modulation of de Haas-van Alphen Effect in Graphene by Electric Field

This paper is to explore the de Haas-van Alphen effect $(dHvA)$ of graphene in the presence of an in-plane uniform electric field. Three major findings are yielded. First of all, the electric field is found to modulate the de Haas-van Alphen magnetization and magnetic susceptibility through the dimensionless parameter $(β=\frac{E}{\upsilon_{F}B})$. As the parameter $β$ increases, the values of magnetization and magnetic susceptibility increase to positive infinity or decrease to negative infinity at the exotic point $β_{c}=1$. Besides, the $dHvA$ oscillation amplitude rises abruptly to infinity for zero temperature at $β_{c}=1$, but eventually collapses at a finite temperature thereby leading to the vanishing of de Haas-van Alphen effect. In addition, the magnetic susceptibility depends on the electric and magnetic fields, suggesting that the graphene should be a non-linear magnetic medium in the presence of the external field. These results, which are different from those obtained in the standard nonrelativistic 2D electron gas, are attributed to its anomalous Landau level spectrum in graphene.

preprint2009arXiv

Synchronization Analysis in Physical Layer Network Coding

Physical-layer Network Coding (PNC) makes use of the additive nature of the electromagnetic (EM) waves to apply network coding arithmetic at the physical layer. With PNC,the destructive effect of interference in wireless networks is eliminated and the capacity of networks can be boosted significantly. This paper addresses a key outstanding issue in PNC: synchronization among transmitting nodes. We first investigate the impact of imperfect synchronization (i.e., finite synchronization errors) in a 3-node network. It is shown that with QPSK modulation, PNC still yields significantly higher capacity than straightforward network coding when there are synchronization errors. Significantly, this remains to be so even in the extreme case when synchronization is not performed at all. Moving beyond a 3-node network, we propose and investigate a synchronization scheme for PNC in a general chain network. At last, numerical simulation verifies that PNC is robust to synchronization errors. In particular, for the mutual information performance, there is about 0.5dB loss without time synchronization and there is at most 2dB loss without phase synchronization.

preprint2008arXiv

Kramers-Kronig relation of graphene conductivity

Utilizing a complete Lorentz-covariant and local-gauge-invariant formulation, we discuss graphene response to arbitrary external electric field. The relation, which is called as Kramers-Kr(\ddot{o})nig relation in the paper, between imaginary part and real part of ac conductivity is given. We point out there exists an ambiguity in the conductivity computing, attributed to the wick behavior at ultraviolet vicinity. We argue that to study electrical response of graphene completely, non-perturbational contribution should be considered.

preprint2008arXiv

The C-value enigma and timing of the Cambrian explosion

The Cambrian explosion is a grand challenge to science today and involves multidisciplinary study. This event is generally believed as a result of genetic innovations, environmental factors and ecological interactions, even though there are many conflicts on nature and timing of metazoan origins. The crux of the matter is that an entire roadmap of the evolution is missing to discern the biological complexity transition and to evaluate the critical role of the Cambrian explosion in the overall evolutionary context. Here we calculate the time of the Cambrian explosion by an innovative and accurate "C-value clock"; our result (560 million years ago) quite fits the fossil records. We clarify that the intrinsic reason of genome evolution determined the Cambrian explosion. A general formula for evaluating genome size of different species has been found, by which major questions of the C-value enigma can be solved and the genome size evolution can be illustrated. The Cambrian explosion is essentially a major transition of biological complexity, which corresponds to a turning point in genome size evolution. The observed maximum prokaryotic complexity is just a relic of the Cambrian explosion and it is supervised by the maximum information storage capability in the observed universe. Our results open a new prospect of studying metazoan origins and molecular evolution.