Performance Analysis of Discrete-Phase-Shifter IRS-aided Amplify-and-Forward Relay Network

As a new technology to reconfigure wireless communication environment by signal reflection controlled by software, intelligent reflecting surface (IRS) has attracted lots of attention in recent years. Compared with conventional relay system, the relay system aided by IRS can effectively reduce the cost and energy consumption, and significantly enhance the system performance. However, the phase quantization error generated by IRS with discrete phase shifter may degrade the receiving performance of the receiver. To analyze the performance loss caused by IRS phase quantization error, based on the law of large numbers and Rayleigh distribution, the closed-form expressions for the signal-to-noise ratio (SNR) performance loss and achievable rate of the IRS-aided amplify-and-forward (AF) relay network, which are related to the number of phase shifter quantization bits, are derived under the line-of-sight (LoS) channels and Rayleigh channels, respectively. Moreover, their approximate performance loss closed-form expressions are also derived based on the Taylor series expansion. Simulation results show that the performance losses of SNR and achievable rate decrease with the number of quantization bits increases gradually. When the number of quantization bits is larger than or equal to 3, the SNR performance loss of the system is smaller than 0.23dB, and the achievable rate loss is less than 0.04bits/s/Hz, regardless of the LoS channels or Rayleigh channels

Parallel ODETLAP for terrain compression and reconstruction

We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data used for Geographical Information Systems (GIS). ODET-LAP can be used to reconstruct a compressed elevation map, or to generate a dense regular grid from airborne Light Detection and Ranging (LIDAR) point cloud data. With previous methods, the time to execute ODETLAP does not scale well with the size of the input elevation map, resulting in running times that are prohibitively long for large data sets. Our algorithm divides the data set into patches, runs ODET-LAP on each patch, and then merges the patches together. This method gives two distinct speed improvements. First, we provide scalability by reducing the complexity such that the execution time grows almost linearly with the size of the input, even when run on a single processor. Second, we are able to calculate ODETLAP on the patches concurrently in a parallel or distributed environment. Our new patchbased implementation takes 2 seconds to run ODETLAP on an 800 × 800 elevation map using 128 processors, while the original version of ODETLAP takes nearly 10 minutes on a single processor (271 times longer). We demonstrate the effectiveness of the new algorithm by running it on data sets as large as 16000 × 16000 on a cluster of computers. We also discuss our preliminary results from running on an IBM Blue Gene/L system with 32,768 processors

Easy Begun is Half Done: Spatial-Temporal Graph Modeling with ST-Curriculum Dropout

Spatial-temporal (ST) graph modeling, such as traffic speed forecasting and taxi demand prediction, is an important task in deep learning area. However, for the nodes in graph, their ST patterns can vary greatly in difficulties for modeling, owning to the heterogeneous nature of ST data. We argue that unveiling the nodes to the model in a meaningful order, from easy to complex, can provide performance improvements over traditional training procedure. The idea has its root in Curriculum Learning which suggests in the early stage of training models can be sensitive to noise and difficult samples. In this paper, we propose ST-Curriculum Dropout, a novel and easy-to-implement strategy for spatial-temporal graph modeling. Specifically, we evaluate the learning difficulty of each node in high-level feature space and drop those difficult ones out to ensure the model only needs to handle fundamental ST relations at the beginning, before gradually moving to hard ones. Our strategy can be applied to any canonical deep learning architecture without extra trainable parameters, and extensive experiments on a wide range of datasets are conducted to illustrate that, by controlling the difficulty level of ST relations as the training progresses, the model is able to capture better representation of the data and thus yields better generalization

OSlms: A Web Server to Evaluate the Prognostic Value of Genes in Leiomyosarcoma

The availability of transcriptome data and clinical annotation offers the opportunity to identify prognosis biomarkers in cancer. However, efficient online prognosis analysis tools are still lacking. Herein, we developed a user-friendly web server, namely Online consensus Survival analysis of leiomyosarcoma (OSlms), to centralize published gene expression data and clinical datasets of leiomyosarcoma (LMS) patients from The Cancer Genome Atlas (TCGA) and Gene Expression Omnibus (GEO). OSlms comprises of a total of 268 samples from three independent datasets, and employs the Kaplan Meier survival plot with hazard ratio (HR) and log rank test to estimate the prognostic potency of genes of interests for LMS patients. Using OSlms, clinicians and basic researchers could determine the prognostic significance of genes of interests and get opportunities to identify novel potential important molecules for LMS. OSlms is free and publicly accessible at http://bioinfo.henu.edu.cn/LMS/LMSList.jsp

Observation of two PT transitions in an electric circuit with balanced gain and loss

We investigate -symmetry breaking transitions in a dimer comprising two LC oscillators, one with loss and the second with gain. The electric energy of this four-mode model oscillates between the two LC circuits, and between capacitive and inductive energy within each LC circuit. Its dynamics are described by a non-Hermitian, -symmetric Hamiltonian with three different phases separated by two exceptional points. We systematically measure the eigenfrequencies of energy dynamics across the three regions as a function of gain-loss strength. In addition to observe the well-studied transition for oscillations across the two LC circuits, at higher gain-loss strength, transition within each LC circuit is also observed. With their extraordinary tuning ability, -symmetric electronics are ideally suited for classical simulations of non-Hermitian systems

The FBA Motif-Containing Protein NpFBA1 Causes Leaf Curling and Reduces Resistance to Black Shank Disease in Tobacco

Plant leaf morphology has a great impact on plant drought resistance, ornamental research and leaf yield. In this study, we identified a new gene in Nicotiana plumbaginifolia, NpFBA1, that causes leaf curl. The results show that the NpFBA1 protein contains only one unique F-box associated (FBA) domain and does not have an F-box conserved domain. Phylogenetic analysis placed this gene and other Nicotiana FBA genes on a separate branch, and the NpFBA1 protein localized to the nucleus and cytoplasm. The expression of NpFBA1 was induced by black shank pathogen (Phytophthora parasitica var. nicotianae) infection and treatment with salicylic acid (SA) and methyl jasmonate (MeJA). NpFBA1-overexpressing transgenic lines showed leaf curling and aging during the rosette phase. During the bolting period, the leaves were curly and rounded, and the plants were dwarfed. In addition, NpFBA1-overexpressing lines were more susceptible to disease than wild-type (WT) plants. Further studies revealed that overexpression of NpFBA1 significantly downregulated the expression of auxin response factors such as NtARF3 and the lignin synthesis genes NtPAL, NtC4H, NtCAD2, and NtCCR1 in the leaves. In conclusion, NpFBA1 may play a key role in regulating leaf development and the response to pathogen infection

Incremental Road Network Generation Based on Vehicle Trajectories

Nowadays, most vehicles are equipped with positioning devices such as GPS which can generate a tremendous amount of trajectory data and upload them to the server in real time. The trajectory data can reveal the shape and evolution of the road network and therefore has an important value for road planning, vehicle navigation, traffic analysis, and so on. In this paper, a road network generation method is proposed based on the incremental learning of vehicle trajectories. Firstly, the input vehicle trajectory data are cleaned by a preprocess module. Then, the original scattered positions are clustered and mapped to the representation points which stand for the feature points of the real roads. After that, the corresponding representation points are connected based on the original connection information of the trajectories. Finally, all representation points are connected by a Delaunay triangulation network and the real road segments are found by a shortest path searching approach between the connected representation point pairs. Experiments show that this method can build the road network from scratch and refine it with the input data continuously. Both the accuracy and timeliness of the extracted road network can continuously be improved with the growth of real-time trajectory data