Search

Energy harvesting (EH) aided communications hold a great potential in the design of green communication systems for their high energy efficiency. However, the random power supply due to EH may cause an intolerable delay in data transmission. To overcome this, a Reliable Energy Source (RES) is desired to provide transmission power when the large delay is induced. In this paper, we study the delay-optimal scheduling policy for EH aided communications with the constraint of average power provided by RES. More specifically, the delay-minimal scheduling is obtained through the two-dimensional Markov chain modeling and linear programming (LP) formulation. To further reduce the computational complexity, we present a value iteration algorithm, based on which we not only reveal a threshold-based structure of the delay-optimal scheduling policy for EH-aided communications with large-capacity batteries, but also conceive a low complexity policy that is asymptotically optimal. For EH-aided communications with finite-capacity batteries, we present a unified framework based on large deviation theory. The non-asymptotic framework demonstrates that the delay-power tradeoff curve of the low complexity scheduling policy is capable of converging to that of the delay-optimal policy exponentially as the capacity of the battery increases.

Due to the unequispaced pulse repetition interval (PRI), the low-oversampling ratio and the range-variant blockage, the echo of the low-oversampled staggered SAR (LS-SAR) is nonuniformly sampled with sub-Nyquist and range-variant rate. However, the existing LS-SAR processing methods lack robustness with regards to the scenario type and the PRI variation mode. In this article, a compressive-sensing-based image reconstruction method for the LS-SAR is proposed. First, a hybrid-domain model (HDM) of the LS-SAR echo is presented. In the HDM, the coupled range cell migration (RCM), the unequispaced PRI, and the conflict blockage are formulated as the matrix multiplications with a 3-D tensor, a 2-D matrix, and a Hadamard product, respectively. Based on the HDM, the image reconstruction is realized through the 2-D fast iterative shrinkage thresholding algorithm (ISTA), in which the gradient is derived by exploiting the properties of the tensor and matrix trace. The fast Fourier transform (FFT) and the nonuniform FFT are implemented to accelerate the computation. Due to good accommodation of the RCM and the LS-SAR sampling characteristics, the proposed method can work well for various PRI variation modes and scenario types. Simulations using the point scatter and the distributed target with wide-swath extension demonstrate the effectiveness as well as the robustness of the proposed method.

Multistatic SAR is able to observe targets from different angles simultaneously, which enhances the information acquiring capability. However, multistatic SAR can still be affected by electromagnetic jamming, resulting in the misinterpretation of multistatic SAR images. This article proposes a method to locate multiple range-deception jammers and suppress jamming signals. First, the echo model of multistatic SAR under a multijammer environment is established. Second, the detection of interested targets in multistatic SAR images can be achieved through visual saliency detection methods based on spectral residual. Third, location distribution features of false targets in multistatic SAR images are analyzed, and the Euclidean distance criteria are used to effectively distinguish false targets. Accurate localization is then achieved by combing multistatic SAR configuration information. Finally, using a linear constrained minimum variance beamforming algorithm to suppress jamming signals, multistatic SAR images without jamming signals can be obtained. Simulation results validate the effectiveness of the proposed method in this article.

Bistatic forward-looking synthetic aperture radar (BFSAR) is a kind of bistatic SAR system that can image forward-looking terrain in the flight direction of the receiver. Current literature and reports about BFSAR mainly concentrate on the stationary scene and ground-moving target imaging. Unlike stationary and ground-moving targets, the translational and rotational movements of ship targets usually lead to complicated range cell migration (RCM) and Doppler frequency migration (DFM). Moreover, the characteristics of RCM and DFM for different scattering points of the ship target are significantly different, i.e., the characteristics of the RCM and DFM are 2-D spatial variation, ultimately leading to severe defocusing of ship target in the SAR image. To solve these problems, a kind of hybrid SAR-ISAR imaging formation is proposed for BFSAR ship target imaging. First, to solve the problem of the Doppler ambiguity caused by the forward-looking mode of the receiver, an efficient ambiguity estimation method based on the minimum entropy criterion is presented. Then, keystone transform and range alignment processing can be applied to correct the spatial variant range walk and higher order RCM, respectively. Moreover, in order to obtain a high-resolution and well-focused image after translational compensation, a new method based on the fractional Fourier transform (FrFT) and the Wigner-Ville distribution (WVD) is proposed, where FrFT is applied to separate the multiple main scattering points in each range cell, and WVD is applied to obtain the high-resolution time-frequency distribution of each scattering point. Compared with the conventional ISAR range-Doppler (RD) algorithm and time-frequency estimation-based imaging methods, this method not only has no cross terms but also has high processing accuracy and better antinoise performance.

Clutter suppression is a challenging task in synthetic aperture radar-ground moving target indication (SAR-GMTI). In general, sufficient secondary samples are not easily acquired due to the non-stationary and non-homogeneous characteristics of bistatic SAR (BiSAR) clutter, resulting in worse clutter suppression results. Recently, space-time adaptive processing based on sparse recovery (SR-STAP) has been developed since its better clutter suppression performance with less samples. However, since the off-grid problem in space-time domain caused by BiSARs separate configuration, existing SR-STAP would suffer from severe performance degradation. To address this problem, a clutter-ridge matched STAP (CRM-STAP) method for BiSAR non-stationary clutter suppression is proposed. First, clutter distribution modeling with arbitrary BiSAR configuration is applied to accurately obtain the clutter ridge in space-time domain. Then, keystone transform and time-division processing are applied to correct range cell migration and eliminate Doppler frequency migration, respectively. Next, to solve the off-grid problem, the CRM dictionary is reconstructed via adaptive gradient method, which is established along the direction of clutter ridge and its orthogonal direction. Then, with the constructed CRM dictionary, the clutter covariance matrix (CCM) estimation process is transformed to a multi-measured vector optimization problem, and it can be directly solved by the sparse Bayesian learning algorithm. Finally, based on the estimated CCM, the CRM-STAP filter is built to suppress the non-stationary clutter effectively. Compared with the existing STAP and SR-STAP methods, this method can avoid the performance degradation in clutter suppression caused by the off-grid problem and overcomes the strong non-stationary problem of BiSAR clutter in heterogeneous environments. In October 2020, we have successfully carried out the world’s first airborne BiSAR-GMTI experiment, and the experimental results are given to verify the effectiveness of this method.

We study the joint scheduling of deferrable demands (e.g., the charging of electric vehicles) and storage systems in the presence of random supply, demand arrivals, processing costs, and subject to processing rate limit constraint. We formulate the scheduling problem as a dynamic program so as to minimize the expected total cost, the sum of processing costs, and the noncompletion penalty (incurred when a task is not fully processed by its deadline). Under mild assumptions, we characterize an optimal index-based priority rule: Tasks with less laxity should be processed first, and for two tasks with the same laxity, the task with a later deadline has the priority. Based on the established optimal control policy characterizations (on resource allocation among multitasks and storage operation), we propose to apply data-driven reinforcement learning (RL) methods to make energy procurement decisions. Numerical results show that the proposed approach significantly outperforms existing RL methods combined with the earliest deadline first priority rule (by reducing 26%–32% of system cost).

In this work, we focus on the optimization of charging scheduling policy for shared electric vehicles (EVs) integrated with wind power generation. This problem is of significant importance nowadays because of the large adoption of EVs in modern societies and the increasing penetration of renewables. A particular challenge of the problem is the large action space, the size of which may increase exponentially with respect to the number of EVs in the system. This makes the problem difficult to solve in practice. A lot of efforts have been made to overcome the above difficulty. The previous study proposed least-laxity-longer-processing-time-first (LLLP) principle, a rule-based algorithm to schedule EVs’ battery charging. The LLLP principle assigns higher priority to vehicles with less laxity and longer processing time. We extend the LLLP principle and further study the structural property of the charging scheduling problem. The main contributions in this work are as follows. First, we show that the LLLP applies to our problem and may be used to narrow down the action space while preserving the global optimality. Second, we provide a modified LLLP algorithm that may construct a policy in $O(NT)$ , where $N$ is the number of the EVs and $T$ is the number of time steps in the scheduling problem. Third, we use numerical experiments to show that the new algorithm performs better than other existing algorithms, including the least-laxity-shorter-processing-time-first (LLSP) principle, the earliest-deadline-first (EDF) principle, and the latest-deadline-first (LDF) principle. The new algorithm finds near-optimal policies (within 1% performance loss) and is at least 40 times faster than CPLEX. We hope that this work provides insight into the charging scheduling of shared EVs in general.

Low-latency and energy-efficient wireless communication holds the potential of enabling the industrial internet of things (IIoT), automatic driving, and telesurgery. Cross-layer scheduling, which is aware of both the channel and queue states, has attracted considerable attention recently because it is capable of reducing the average delay substantially while meeting a given average power constraint. As a result, there has been considerable work, in which joint channel and buffer aware scheduling is formulated as a constrained Markov decision process (CMDP). In general, the optimal solution to a CMDP problem is characterized by the stationary probability of actions, yielding probabilistic cross-layer scheduling with possibly high complexity in practice. In this paper, we are interested in the low-latency and energy-efficient stationary cross-layer scheduling policy for wireless channels with continuous channel states, e.g. Rayleigh fading. It is interestingly shown that a deterministic cross-layer scheduling policy can achieve the optimal tradeoff between the average delay and power. In other words, the signaling complexity of cross-layer scheduling can be significantly reduced without causing sub-optimality. Simulation results also demonstrate that our work provides a low-complexity solution for low-latency and energy-efficient wireless communications.

The prevalence of online user-generated content has attracted great interest in textual sentiment analysis, which provides a low-cost yet effective way to discern consumers and markets. A mainstream of sentiment analysis is to construct a classification model with Bag-of-Words (BoW) features, but the large vocabulary base and skewed distribution of term frequency consistently pose research challenges, which is made even worse by the limited valid sentiment labels. In light of this, in this paper, we propose a novel method called Structural Holes based Sentiment Classifier (SHSC) for BoW-based sentiment classification. The key to SHSC is to reinforce the classification contribution of semantically rich words with clear-cut sentiment polarity. To this end, a word co-occurrence network is carefully constructed to represent both high and low frequency words. The work to find classification-inefficient words is then transformed into the identification of so-called bridge nodes that occupy the positions of structural holes in the network. Two interesting measures, i.e., information advantage rank and control advantage weight, are then designed elaborately for this purpose, which are based on the proposed sentiment-label propagation and short-path computation algorithms, respectively. SHSC finally feeds this information as the key regularizers into a simple regression model to guide parametric learning. Extensive experiments on real-world text datasets demonstrate the advantage of our SHSC model over competitive benchmarks, particularly when sentiment labels are scarce. The effectiveness of uncovering structural holes for sentiment classification is also carefully verified with some robustness checks and demonstration cases.

The fuzzy cognitive map (FCM) is a powerful model for system state prediction and interpretable knowledge representation. Recent years have witnessed the tremendous efforts devoted to enhancing the basic FCM, such as introducing temporal factors, uncertainty or fuzzy rules to improve interpretation, and introducing fuzzy neural networks or wavelets to improve time series prediction. But how to achieve high-precision yet interpretable prediction in cross-domain real-life applications remains a great challenge. In this article, we propose a novel FCM extension called deep FCM (DFCM) for multivariate time series forecasting, in order to take both the advantage of FCM in interpretation and the advantage of deep neural networks in prediction. Specifically, to improve the predictive power, DFCM leverages a fully connected neural network to model connections (relationships) among concepts in a system, and a recurrent neural network to model unknown exogenous factors that have influences on system dynamics. Moreover, to foster model interpretability encumbered by the embedded deep structures, a partial derivative-based approach is proposed to measure the connection strengths between concepts in DFCM. An alternate function gradient descent algorithm is then proposed for parameter inference. The effectiveness of DFCM is validated over four publicly available datasets with the presence of seven baselines. DFCM indeed provides an important clue to building interpretable predictors for real-life applications.

In synthetic aperture radar (SAR) imaging, moving target is generally mixed with stationary targets. Meanwhile, the image of a moving target is distorted and displaced due to the lack of its prior velocity information. Furthermore, imaging of a moving target for geosynchronous (GEO) spaceborne-airborne bistatic SAR (GEO SA-BiSAR) is a more challenging problem because the echo is sub-Nyquist sampled in azimuth. In this article, a simultaneous moving and stationary target imaging method for GEO SA-BiSAR is proposed. First, range models and the corresponding echo models of moving and stationary targets are established. The observation models for both moving and stationary targets with two receiving channels are derived based on the inverse of an efficient imaging algorithm. After that, the imaging problem of moving and stationary targets is modeled as a joint velocity estimation and sparse decomposition problem, which aims at optimizing the entropy of the moving target image and residual error of the formed images at the same time. Finally, a joint optimization method based on the particle swarm optimization (PSO) method and alternating direction method of multipliers (ADMM) is applied to achieve the imaging of moving and stationary targets and estimation of the moving target velocity. With two receiving channels, the accurate separation and focusing of stationary and moving targets as well as the precise estimation of moving target velocity can be achieved with sub-Nyquist sampling echo. Simulation results are presented to validate the effectiveness of the proposed method.

Recent years have witnessed the emergence of worldwide megalopolises and the accompanying public safety events, making urban safety a top priority in modern urban management. Among various threats, dangerous goods such as gas and hazardous chemicals transported through cities have bred repeated tragedies and become the deadly “bomb” we sleep with every day. While tremendous research efforts have been devoted to dealing with dangerous goods transportation (DGT) issues, further study is still in great need to quantify this problem and explore its intrinsic dynamics from a big data perspective. In this article, we present a novel system called DGeye , to feature a fusion between DGT trajectory data and residential population data for dangers perception and prediction. Specifically, DGeye first develops a probabilistic graphical model-based approach to mine spatio-temporally adjacent risk patterns from population-aware risk trajectories. Then, DGeye builds the novel causality network among risk patterns for risk pain-point identification, risk source attribution, and online risky state prediction. Experiments on both Beijing and Tianjin cities demonstrate the effectiveness of DGeye in real-life DGT risk management. As a case in point, our report powered by DGeye successfully drove the government to lay down gas pipelines for the famous Guijie food street in Beijing.

Big data analytics (BDA) is regarded as an advanced tool for achieving sustainable development as part of the grand challenges (GCs). However, it is not clear how BDA can be used by data scientists to solve the GCs with multisource data in a cross-disciplinary approach. Based on a case study of city-based dangerous goods transportation (DGT), this paper explores how data scientists use BDA to triangulate data, methods, knowledge and solutions for solving GCs. The contribution of this study is threefold: (1) it contributes to research on GCs and discusses how BDA can be used in problem solving for multidomain GCs from a management perspective; (2) it enriches the theory of information triangulation and proposes several steps for information triangulation in BDA to solve GCs; and (3) it contributes some practical implications for the management of organizations when solving social problems and pursuing sustainable development.

Writing sequences play an important role in handwriting of Chinese characters. However, little is known regarding the integral brain patterns and network mechanisms of processing Chinese character writing sequences. The present study decoded brain patterns during observing Chinese characters in motion by using multi-voxel pattern analysis, meta-analytic decoding analysis, and extended unified structural equation model. We found that perception of Chinese character writing sequence recruited brain regions not only for general motor schema processing, i.e., the right inferior frontal gyrus, shifting, and inhibition functions, i.e., the right postcentral gyrus and bilateral pre-SMA/dACC, but also for sensorimotor functions specific for writing sequences. More importantly, these brain regions formed a cooperatively top-down brain network where information was transmitted from brain regions for general motor schema processing to those specific for writing sequences. These findings not only shed light on the neural mechanisms of Chinese character writing sequences, but also extend the hierarchical control model on motor schema processing.

We investigate the route choice behavior of pedestrians under the condition of local view by using a field observation in a subway station and a microscopic pedestrian model with discrete space representation. The local view of a pedestrian means that the pedestrian's field of vision can be blocked by obstacles. Several typical phenomena with respect to behavior affected by the local view of pedestrians are observed through recording the movement of pedestrians in the subway station. Based on these observed phenomena and behaviors, a route choice model considering the effect of local view of pedestrians is developed. In the model, an algorithm for dividing feasibly vision areas is formulated. Two algorithms for computing the potential fields are then developed based on the results of dividing feasibly vision areas. By numerical experiments, the simulation results of the model are compared with the empirical observations to validate the model.

A polar format algorithm (PFA) as a high-efficient imaging method is widely used in bistatic spotlight synthetic aperture radar (SAR). In cases where motion error causes great defocusing in PFA images, phase gradient autofocus (PGA) is suitable for motion error compensation due to its robustness. However, a significant coupling of range-azimuth directions in bistatic SAR (BiSAR) makes conventional PGA unapplicable in PFA images. For this limitation, this letter gives the solution to the adaptability of PGA in BiSAR based on the azimuth migration correction in the wavenumber domain. The bistatic motion error is modeled, and the caused phase error is derived and analyzed. Through the wavenumber-domain analysis, the 2-D coupling is indicated still existing after polar format imaging, unlike other algorithms that utilize range cell migration correction (RCMC). Then, a phase compensation for the migration of azimuth direction is proposed to remove the 2-D coupling. Based on this, the new autofocus arithmetic flow for bistatic PFA is designed. The effectiveness of the proposed method is verified by numerical simulations.

Bistatic forward-looking spotlight synthetic aperture radar with stationary transmitter and maneuvering receiver (STMR-BFSSAR) is a promising sensor for various applications, such as the automatic navigation and landing of maneuvering vehicles. Because of the bistatic forward-looking configuration and the receiver’s maneuvers, conventional image formation algorithms suffer from high computational complexity or small size of a well-focused scene if applied to STMR-BFSSAR. In this article, we propose a wavenumber-domain algorithm for STMR-BFSSAR image formation, which is termed the bistatic-range-Doppler-aperture wavenumber algorithm (BDWA). First, a novel range model in bistatic-range and Doppler-aperture coordinate space instead of conventional Cartesian coordinate space is established by employing the elliptic polar coordinate system and the method of series reversion. The novel range model not only makes the echo’s samples to be regular along the direction of the bistatic-range wavenumber axis but also constructs a curved wavefront close to the true wavefront. Second, an operation termed wavenumber-domain gridding is conceived to regularize the echo’s samples along the Doppler-aperture wavenumber axis, which can be implemented by 1-D interpolation. The proposed algorithm significantly outperforms the conventional algorithms in terms of computational complexity and scene size limits. Both point and distributed targets are simulated for two STMR-BFSSAR systems with different parameters. The simulation results verify the validity and superiority of the proposed BDWA.

Geosynchronous spaceborne–airborne bistatic synthetic aperture radar (GEO-SA-BiSAR) can achieve high-resolution Earth observation with superior system flexibility and efficiency, which offers huge potential for advanced SAR applications. In this article, the echo characteristics of GEO-SA-BiSAR are analyzed in detail, including range history, the Doppler parameters, and spatial variance. The distinct features of GEO-SAR and airborne receiver result in the failure of the traditional bistatic SAR range model and imaging methods. In order to deal with these problems and achieve high-precision data focusing on GEO-SA-BiSAR, this article first proposes a novel range model based on one-stationary equivalence (RMOSE) to accommodate the distinctiveness of the GEO-SA-BiSAR echo, which changes with orbit positions of GEO transmitter. Then, a 2-D frequency-domain imaging algorithm is put forward based on RMOSE, which solves the problem of the 2-D spatial variance of GEO-SA-BiSAR. Finally, simulations are presented to demonstrate the effectiveness of the proposed range model and algorithm.

Bistatic SAR (BiSAR) imaging is becoming more and more mature, nevertheless restricted by the significant problem of 2-D space-variation of echo signal. In practical applications, the geometry configurations and platform motion of BiSAR are often complicated, making the problem of space-variation severe and causing it hard to efficiently process BiSAR data of large imaging scene. Focusing on this problem, this article proposes a new imaging method for large scene-size imaging that can adapt to general spotlight BiSAR with complicated platform motion. This method first roughly focuses the echo data in range-Doppler domain through azimuth-dechirp and removes the residual range-azimuth coupling via Keystone transform. Then making use of the tolerance of SAR imaging to slight phase error, the full Doppler axis is down-sampled with a certain ratio to form a much smaller amount of Doppler cells called Doppler bands. Through restricting the value of the down-sampling ratio, the variance of differential phase in each Doppler band after the dechirp is controlled within a given tolerance. As a result, the differential phase can be compensated for in variable Doppler bands for a large imaging scene with high efficiency. The computational complexity of the proposed method is indicated as low as logarithmic and its effectiveness is verified through numerical simulations.

Traditional computation is driven by parallel accelerators or distributed computation nodes in order to improve computing performance, save energy, and decrease delays in accessing memory. Recently, artificial intelligent algorithms, frameworks, and computing models are growing to help with high computational performance.

Due to its ability of forming continuous images for a ground scene of interest, the video synthetic aperture radar (SAR) has been studied in recent years. However, as video SAR needs to reconstruct many frames, the data are of enormous amount and the imaging process is of large computational cost, which limits its applications. In this article, we exploit the redundancy property of multiframe video SAR data, which can be modeled as low-rank tensor, and formulate the video SAR imaging process as a low-rank tensor recovery problem, which is solved by an efficient alternating minimization method. We empirically compare the proposed method with several state-of-the-art video SAR imaging algorithms, including the fast back-projection (FBP) method and the compressed sensing (CS)-based method. Experiments on both simulated and real data show that the proposed low-rank tensor-based method requires significantly less amount of data samples while achieving similar or better imaging performance.

Low-earth-orbit (LEO) synthetic aperture radar (SAR) can achieve advanced remote sensing applications benefiting from the large beam coverage and long duration time of interested area provided by a geosynchronous (GEO) SAR illuminator. In addition, the receiving LEO SAR system is also cost-effective because the transmitting module can be omitted. In this article, an imaging method for GEO-LEO bistatic SAR (BiSAR) is proposed. First, the propagation delay characteristics of GEO-LEO BiSAR are studied. It is found that the traditional “stop-and-go” propagation delay assumption is not appropriate due to the long transmitting path and high speed of the LEO SAR receiver. Then, an improved propagation delay model and the corresponding range model for GEO-LEO BiSAR are established to lay the foundation of accurate imaging. After analyzing the sampling characteristics of GEO-LEO BiSAR, it is found that only 12.5% sampling data can be acquired in the azimuth direction. To handle the serious sub-Nyquist sampling problem and achieve good focusing results, an imaging method combined with multireceiving technique and compressed sensing is proposed. The multireceiving observation model is first obtained based on the inverse process of a nonlinear chirp-scaling imaging method, which can handle 2-D space-variant echo. Following that, the imaging problem of GEO-LEO BiSAR is converted to an $L_{1}$ regularization problem. Finally, an effective recovery method named complex approximate message passing (CAMP) is applied to obtain the final nonambiguous image. Simulation results show that the proposed method can suppress eight times Doppler ambiguity and obtain the well-focused image with three receiving channels. With the proposed method, the number of required receiving channels can be greatly reduced.

The main challenge of cross-domain text classification is to train a classifier in a source domain while applying it to a different target domain. Many transfer learning-based algorithms, for example, dual transfer learning, triplex transfer learning, etc., have been proposed for cross-domain classification, by detecting a shared low-dimensional feature representation for both source and target domains. These methods, however, often assume that the word clusters matrix or the clusters association matrix as knowledge transferring bridges are exactly the same across different domains, which is actually unrealistic in real-world applications and, therefore, could degrade classification performance. In light of this, in this paper, we propose a softly associative transfer learning algorithm for cross-domain text classification. Specifically, we integrate two non-negative matrix tri-factorizations into a joint optimization framework, with approximate constraints on both word clusters matrices and clusters association matrices so as to allow proper diversity in knowledge transfer, and with another approximate constraint on class labels in source domains in order to handle noisy labels. An iterative algorithm is then proposed to solve the above problem, with its convergence verified theoretically and empirically. Extensive experimental results on various text datasets demonstrate the effectiveness of our algorithm, even with the presence of abundant state-of-the-art competitors.

Fraud detection from massive user behaviors is often regarded as trying to find a needle in a haystack. In this paper, we suggest abnormal behavioral patterns can be better revealed if both sequential and interaction behaviors of users can be modeled simultaneously, which however has rarely been addressed in prior work. Along this line, we propose a COllective Sequence and INteraction (COSIN) model, in which the behavioral sequences and interactions between source and target users in a dynamic interaction network are modeled uniformly in a probabilistic graphical model. More specifically, the sequential schema is modeled with a hierarchical Hidden Markov Model, and meanwhile it is shifted to the interaction schema to generate the interaction counts through Poisson factorization. A hybrid Gibbs-Variational algorithm is then proposed for efficient parameter estimation of the COSIN model. We conduct extensive experiments on both synthetic and real-world telecom datasets in different scales, and the results show that the proposed model outperforms some competitive baseline methods and is scalable. A case is further presented to show the precious explainability of the model.

Whether investor sentiment affects stock prices is an issue of long-standing interest for economists. We conduct a comprehensive study of the predictability of investor sentiment, which is measured directly by extracting expectations from online user-generated content (UGC) on the stock message board of Eastmoney.com in the Chinese stock market. We consider the influential factors in prediction, including the selections of different text classification algorithms, price forecasting models, time horizons, and information update schemes. Using comparisons of the long short-term memory (LSTM) model, logistic regression, support vector machine, and Naive Bayes model, the results show that daily investor sentiment contains predictive information only for open prices, while the hourly sentiment has two hours of leading predictability for closing prices. Investors do update their expectations during trading hours. Moreover, our results reveal that advanced models, such as LSTM, can provide more predictive power with investor sentiment only if the inputs of a model contain predictive information.

Echoes of bistatic forward-looking synthetic aperture radar (BFSAR) disperse to multiple range cells and exist spatial frequency extension as well as Doppler spectrum extension (i.e., namely space–time extension). Furthermore, the characteristics of BFSAR clutter are strongly nonstationary and spatial variants. Because of the abovementioned issues, clutter and moving targets are fully overlapped in the initial 3-D space–time–range raw data domain, and the clutter cannot be suppressed effectively. To solve this problem, a BFSAR multipulse displaced phase center antenna (MP-DPCA) method is proposed in this article. First, keystone transform without Doppler ambiguity is applied to remove the coupling between the space–time and range domains. Hence, the overall complex 3-D processing in the space–time–range domain is reduced to independent 2-D processing in each space–time domain. Subsequently, a spatial-dechirp processing is applied in the space–time domain to eliminate the spatial frequency extension. Meanwhile, Doppler parameters of clutter point scatterers are equalized by nonlinear chirp scaling processing in the frequency and time domains. Accordingly, the Doppler spectrum extension of point scatterers can be eliminated by a uniform azimuth dechirp processing. After aforesaid three steps, the clutter and moving targets are separated in the space–time domain. Finally, based on the linear phase difference of clutter between the channels, a multipulse canceller can be designed to suppress the clutter. Compared with the existing space–time adaptive procession (STAP) and DPCA methods, this method not only overcomes the nonstationary problem in BFSAR but also conquers the strict application conditions of DPCA. Simulation results are given to verify the effectiveness of the proposed method.

Personality plays a pivotal role at work. Many scholars have investigated the association between personality and language usage habits in the English corpus. Given that the Chinese language has the largest number of native speakers in the world, it is essential to analyze the pattern of personality expression in Chinese, which has garnered less attention. In this study, we used the TextMind system to examine the correlation between word categories and personality traits based on Chinese Weibo content. We also compared the results with previous studies to demonstrate the similarities and differences of personality expression between English and Chinese. Additionally, this paper established a prediction model based on machine learning methods to recognize personality. Results showed that language features were powerful indicators of personality. Finally, we made recommendations for using personality expression in the recruitment and selection.

In recent years, short text topic modeling has drawn considerable attentions from interdisciplinary researchers. Various customized topic models have been proposed to tackle the semantic sparseness nature of short texts. Most (if not all) of them follow the bag-of-words assumption, which, however, is not adequate since word order and phrases are often critical to capturing the meaning of texts. On the other hand, while some existing topic models are sensitive to word order, they do not perform well on short texts due to the severe data sparseness. To address these issues, we propose the Pseudo-document-based Topical N-Grams model (PTNG), which alleviates the data sparsity problem of short texts while is sensitive to word order. Extensive experiments on three real-world data sets with state-of-the-art baselines demonstrate the high quality of topics learned by PTNG according to UCI coherence scores and more discriminative semantic representation of short texts according to classification results.

It is always deemed crucial to identify the key factors that could have significant impact on the stock market trend. Recently, an interesting phenomenon has emerged that some of President Trump’s posts in Twitter can surge into a dominant role on the stock market for a certain time period, although studies along this line are still in their infancy. Therefore, in this article, we study whether and how this new-rising information can help boost the performance of stock market prediction. Specifically, we have found that the echoing reinforced effect of financial news with Trump’s market-related tweets can influence the market movement—that is, some of Trump’s tweets directly impact the stock market in a short time, and the impact can be further intensified when it echoes with other financial news reports. Along this line, we propose a deep information echoing model to predict the hourly stock market trend, such as the rise and fall of the Dow Jones Industrial Average. In particular, to model the discovered echoing reinforced impact, we design a novel information echoing module with a gating mechanism in a sequential deep learning framework to capture the fused knowledge from both Trump’s tweets and financial news. Extensive experiments have been conducted on the real-world U.S. stock market data to validate the effectiveness of our model and its interpretability in understanding the usability of Trump’s posts. Our proposed deep echoing model outperforms other baselines by achieving the best accuracy of 60.42% and obtains remarkable accumulated profits in a trading simulation, which confirms our assumption that Trump’s tweets contain indicative information for short-term market trends. Furthermore, we find that Trump’s tweets about trade and political events are more likely to be associated with short-term market movement, and it seems interesting that the impact would not degrade as time passes.

Lifelong topic model (LTM), an emerging paradigm for never-ending topic learning, aims to yield higher-quality topics as time passes through knowledge accumulated from the past yet learned for the future. In this paper, we propose a novel lifelong topic model based on non-negative matrix factorization (NMF), called Affinity Regularized NMF for LTM (NMF-LTM), which to our best knowledge is distinctive from the popular LDA-based LTMs. NMF-LTM achieves lifelong learning by introducing word-word graph Laplacian as semantic affinity regularization. Other priors such as sparsity, diversity, and between-class affinity are incorporated as well for better performance, and a theoretical guarantee is provided for the algorithmic convergence to a local minimum. Extensive experiments on various public corpora demonstrate the effectiveness of NMF-LTM, particularly its human-like behaviors in two carefully designed learning tasks and the ability in topic modeling of big data. A further exploration of semantic relatedness in knowledge graphs and a case study on a large-scale real-world corpus exhibit the strength of NMF-LTM in discovering high-quality topics in an efficient and robust way.

Employer Brand Evaluation (EBE) is to understand an employer’s unique characteristics to identify competitive edges. Traditional approaches rely heavily on employers’ financial information, including financial reports and filings submitted to the Securities and Exchange Commission (SEC), which may not be readily available for private companies. Fortunately, online recruitment services provide a variety of employers’ information from their employees’ online ratings and comments, which enables EBE from an employee’s perspective. To this end, in this article, we propose a method named Company Profiling–based Collaborative Topic Regression (CPCTR) to collaboratively model both textual (i.e., reviews) and numerical information (i.e., salaries and ratings) for learning latent structural patterns of employer brands. With identified patterns, we can effectively conduct both qualitative opinion analysis and quantitative salary benchmarking. Moreover, a Gaussian processes--based extension, GPCTR, is proposed to capture the complex correlation among heterogeneous information. Extensive experiments are conducted on three real-world datasets to validate the effectiveness and generalizability of our methods in real-life applications. The results clearly show that our methods outperform state-of-the-art baselines and enable a comprehensive understanding of EBE.

Reducing the energy consumption of the storage systems disk read/write requests plays an important role in improving the overall energy efficiency of high-performance computing systems. We propose a method to reduce disk energy consumption by delaying the dispatch of disk requests to the end of a time window, which we call time window-based lazy scheduling. We prove that sorting requests within a single time window can reduce the disk energy consumption, and we discuss the relationship between the size of the time window and the disk energy consumption, proving that the energy consumption is highly likely to decrease with increasing window size. To exploit this opportunity, we propose the Lazy Scheduling based Disk Energy Optimization (LSDEO) algorithm, which adopts a feedback method to periodically adjust the size of the time window, and minimizes the local disk energy consumption by sorting disk requests within each time window. We implement the LSDEO algorithm in an OS kernel and conduct both simulations and actual measurements on the algorithm, confirming that increasing the time window increases disk energy savings. When the average request arrival rate is 300 and the threshold of average request response time is 50 ms, LSDEO can yield disk energy savings of 21.5%.

The correlation network, typically formed by computing pairwise correlations between variables, has recently become a competitive paradigm to discover insights in various application domains, such as climate prediction, financial marketing, and bioinformatics. In this study, we adopt this paradigm to detect cheating behavior hidden in business distribution channels, where falsified big deals are often made by collusive partners to obtain lower product prices—a behavior deemed to be extremely harmful to the sale ecosystem. To this end, we assume that abnormal deals are likely to occur between two partners if their purchase-volume sequences have a strong negative correlation. This seemingly intuitive rule, however, imposes several research challenges. First, existing correlation measures are usually symmetric and thus cannot distinguish the different roles of partners in cheating. Second, the tick-to-tick correspondence between two sequences might be violated due to the possible delay of purchase behavior, which should also be captured by correlation measures. Finally, the fact that any pair of sequences could be correlated may result in a number of false-positive cheating pairs, which need to be corrected in a systematic manner. To address these issues, we propose a correlation network analysis framework for cheating detection. In the framework, we adopt an asymmetric correlation measure to distinguish the two roles, namely, cheating seller and cheating buyer , in a cheating alliance. Dynamic Time Warping is employed to address the time offset between two sequences in computing the correlation. We further propose two graph-cut methods to convert the correlation network into a bipartite graph to rank cheating partners, which simultaneously helps to remove false-positive correlation pairs. Based on a 4-year real-world channel dataset from a worldwide IT company, we demonstrate the effectiveness of the proposed method in comparison to competitive baseline methods.

Fraud detection is usually compared to finding a needle in a haystack and remains a challenging task because fraudulent acts are buried in massive amounts of normal behavior and true intentions may be disguised in a single snapshot. Indeed, fraudulent incidents usually take place in consecutive time steps to gain illegal benefits, which provides unique clues for probing fraudulent behavior by considering a complete behavioral sequence rather than detecting fraud from a snapshot of behavior. Additionally, fraudulent behavior may involve different parties, such that the interaction patterns between sources and targets can help distinguish fraudulent acts from normal behavior. Therefore, in this paper, we model the attributed behavioral sequences generated from consecutive behaviors in order to capture the sequential patterns, while those that deviate from the pattern can be detected as fraudulence. Considering the characteristics of the behavioral sequence, we propose a novel model, NHA-LSTM, by augmenting the traditional LSTM with a modified forget gate, where the interval time between consecutive time steps is considered. Furthermore, we design a self-historical attention mechanism to allow for long time dependencies, which can help identify repeated or cyclical appearances. In addition, we propose an enhanced network embedding method, FraudWalk, to construct embeddings for the nodes in the interaction network with regard to higher-order interactions and particular time constraints for revealing potential group fraudulence. The node embeddings, along with the feature vectors, are fed into the model to capture the interactions between sources and targets. To validate the effectiveness of sequential behavior embeddings, we experiment on a real-world telecommunication dataset with prediction and classification tasks based on the learned embeddings. The experimental results show that the learned embeddings can better identify fraudulent behavior. Finally, we visualize the weights of the attention mechanism to provide a rational interpretation of human behavioral patterns.

Bistatic synthetic aperture radar (BiSAR) imaging is faced with two major challenges: large scene imaging and adaptability to unideal platform motion in practice. In order to deal with these two problems, a generalized wavefront-curvature-corrected polar format algorithm (PFA) is proposed in this article. The traditional PFA is little restricted on geometry configuration and platform motion, but its application to large scene imaging is limited by the far-field planar wavefront assumption. To solve this limitation, this article derives the phase error caused by wavefront curvature and analyzes its influence on both geometric distortion and defocusing effect in detail. Based on the analysis, we present a wavefront curvature completely correcting method through space-variant phase compensation using the analytical wavefront curvature phase in wavenumber-domain, which is derived through method of series reversion. What's more, an efficient realization of the space-variant phase compensation based on two-stage image division is given to avoid high overlap rate in the traditional image division method. The proposed method can obtain well focused and geometric undistorted image for BiSAR under complicated flight paths, and it also keeps the logarithmic complexity of traditional PFA. The effectiveness of the proposed method is verified by numerical simulations.

In recent years, the research of multistatic synthetic aperture radar (SAR) has become a hot spot because of its great potentials in military and civil applications. However, it is inevitably disturbed by electronic countermeasures. In the multistatic SAR image, the false target caused by transmitting deceptive jamming leads to misjudgment of the image information. In this article, a new antideceptive jamming method for multistatic SAR is proposed. This method can locate the deceptive jammer and effectively suppress it. First of all, the echo model of multistatic SAR in the jamming environment is set up. Based on this model, the relationship expression for the location of jammer is derived. Then, we use the maximally stable extremal region method and the Euclidean-distance-based method to detect and identify false target in the multistatic SAR image. By using the location information of false target, receivers, and transmitters, the expression of the jammer localization is solved to locate the jammer. Finally, the minimum variance distortionless response beamforming method and image mosaic method are used to effectively suppress the jamming. The simulation results show that the method is effective.

Synthetic aperture radar (SAR) has extensive applications in both civilian and military fields for its ability to create high-resolution images of the ground target without being affected by weather conditions and daytime or nighttime effect. As fueled by the several decades’ advancement of SAR, existing SAR systems exhibit high imaging capabilities, namely, significantly high two-dimensional resolution. However, in accordance with Nyquist's sampling theory, the increase in resolution implies an evident increase in the amount of sampling data, thereby causing numerous limitations to practical application. To solve this problem, several compressive sensing (CS) and matrix sensing (MS) techniques have been applied to SAR imaging, wherein the existing knowledge of sparsity or low-rankness is exploited to reconstruct the SAR image based on an under-sampled SAR raw data. In this study, we take a different approach, wherein redundancy property of the SAR image is further exploited. The SAR image is split into a sparse matrix and a low rank matrix. Thus, the SAR imaging processor is modelled as a problem of joint sparse and low rank matrices recovery. An Orthogonal Sparse and Rank-one Pursuit (OSRanP) algorithm is newly proposed to solve this problem in SAR imaging case, where there isn’t any prior information of the exact sparsity or low-rankness value at hand. As revealed from the results here, the proposed method outmatches the CS and MS methods in sampling efficiency in both simulations and experiments.

In real application scenario of bistatic forward-looking synthetic aperture radar (BFSAR), ground moving target (GMT) is generally smeared severely in SAR image, due to its unknown range cell migration (RCM) and Doppler frequency migration (DFM). When GMT moves along an unknown curve trajectory, its high-order RCM and DFM (including the second- and third-order terms) would further aggravate the difficulty of GMT refocusing. To address this issue, an efficient GMT refocusing method via keystone-based delay-correlation transform and fast searching Fourier transform (KDCT-FSFT) is proposed. First, the KDCT is proposed to correct the first- to third-order RCMs regardless of target's motion state and position information. Meanwhile, the order of GMT's phase response is reduced as well. Then, FSFT is applied to estimate the third-order Doppler parameter of GMT. In the following, a 2-D fast Fourier transform (2D-FFT) can be applied to integrate the target signal coherently in Doppler parameters domain, where the Doppler centroid and Doppler frequency rate of GMT can be estimated. Finally, with the aforesaid estimated Doppler parameters, RCM and DFM can be well corrected and target with unknown curve motion can be finely refocused. Compared with the existing methods, not only the refocusing accuracy of the proposed method is higher, but also its processing is more efficient, since the procedures in the proposed method are performed with respect to all the range cells in the corresponding aperture, i.e., GMT refocusing is achieved by the 2-D data received in one aperture, rather than along every single range cell. Both the simulation and experimental results are given to validate the effectiveness of the proposed method.

Real-time passenger flow prediction plays an important role in subway network design and management. Most of the existing prediction algorithms only consider the sequence of passenger flow volume, however, ignore the influence of other outer factors, for example, the weather conditions, air quality and temperature. In this paper, a systematic framework, MetroEye, is proposed for weather-aware prediction of real-time passenger flow. The framework contains an offline system and an online system. The offline system adopts a conditional random field (CRF) model to establish the relationship between passenger flow volume and weather factors. Experimental results show the superior prediction accuracy of the model, especially in large stations. The online system provides efficient methods to simulate the real-time passenger flow volume. Due to its high practicality, MetroEye has been adopted by Beijing Urban Rail Transit Control Center to monitor the passenger flow status of the Beijing subway system.

The BeiDou navigation satellite system shows its potential for passive radar vessel target detection owing to its global-scale coverage. However, the restrained power budget from BeiDou satellite hampers the detection performance. To solve this limitation, this paper proposes a long-time optimized integration method to obtain an adequate signal-to-noise ratio (SNR). During the long observation time, the range migration, intricate Doppler migration, and noncoherence characteristic bring challenges to the integration processing. In this paper, first, the keystone transform is applied to correct the range walk. Then, considering the noncoherence of the entire echo, the hybrid integration strategy is adopted. To remove the Doppler migration and correct the residual range migration, the long-time integration is modeled as an optimization problem. Finally, the particle swarm optimization (PSO) algorithm is applied to solve the optimization problem, after which the target echo over the long observation time is well concentrated, providing a reliable detection performance for the BeiDou-based passive radar. Its effectiveness is shown by the simulated and experimental results.

Synthetic aperture radar (SAR) is an advanced microwave imaging system of great importance. The recognition of real-world targets from SAR images, i.e., automatic target recognition (ATR), is an attractive but challenging issue. The majority of existing SAR ATR methods are designed for single-view SAR images. However, multiview SAR images contain more abundant classification information than single-view SAR images, which benefits automatic target classification and recognition. This paper proposes an end-to-end deep feature extraction and fusion network (FEF-Net) that can effectively exploit recognition information from multiview SAR images and can boost the target recognition performance. The proposed FEF-Net is based on a multiple-input network structure with some distinct and useful learning modules, such as deformable convolution and squeeze-and-excitation (SE). Multiview recognition information can be effectively extracted and fused with these modules. Therefore, excellent multiview SAR target recognition performance can be achieved by the proposed FEF-Net. The superiority of the proposed FEF-Net was validated based on experiments with the moving and stationary target acquisition and recognition (MSTAR) dataset.

In our earlier study, an energy-efficient passive UAV radar imaging system was formulated, which comprehensively analyzed the system performance. In this article, based on the evaluator set, a mission planning framework for the underlying energy-efficient passive UAV radar imaging system is proposed to achieve optimized mission performance for a given remote sensing task. First, the mission planning problem is defined in the context of the proposed synthetic aperture radar (SAR) system and a general framework is outlined, including mission specification, illuminator selection, and path planning. It is found that the performance of the system is highly dependent upon the flight path adopted by the UAV platform in a 3-D terrain environment, which offers the potential of optimizing the mission performance by adjusting the UAV path. Then, the path planning problem is modeled as a single-objective optimization problem with multiple constraints. Path planning can be divided into two substages based on different mission orientations and low mutual correlation. Based on this property, a path planning method, called substage division collaborative search (Sub-DiCoS), is proposed. The problem is divided into two subproblems with the corresponding decision space and subpopulation, which significantly relax the constraints for each subproblem and facilitates the search for feasible solutions. Then, differential evolution and the whole-stage best guidance technique are devised to cooperatively lead the subpopulations to search for the best solution. Finally, simulations are presented to demonstrate the effectiveness of the proposed Sub-DiCoS method. The result of the mission planning method can be used to guide the UAV platform to safely travel through a 3-D rough terrain in an energy-efficient manner and achieve optimized SAR imaging and communication performance during the flight.

Video synthetic aperture radar (SAR) have received more and more attention in recent years as it can provide continuous images of the observed area. However, the enormous data generated by the multi-frame images in video SAR brings big challenges to its transmission, storage and processing, especially for small unmanned aerial vehicle (UAV) platform. In this paper, we aim at proposing an efficient video formation method for SAR system with reduced data. The video formation problem is modelled as a joint low-rank and sparse tensors recovery problem. After that, this problem is solved by an efficient tensor recovery method based on alternating direction method of multiplier. Compared with frequency-domain or time-domain imaging methods, the amount of data samples used can be greatly reduced. Numerical simulations validate the effectiveness of the proposed method.

The echo signal of slow-moving target is usually submerged in clutter signal. As a consequence, ground moving target (GMT) separation is challenging because of the decreasing of detection performance. To solve this problem, this paper proposes a moving target detection method with single-channel for bistatic forward-looking SAR (BFSAR) which mainly contains three steps. First, range cell migration (RCM) is corrected by Keystone transform. Next, Extended Nonlinear Chirp Signal (NLCS) algorithm is applied to equalize the spatial variant Doppler parameters and subpress clutter spectrum broadening. At last, according to the difference of Doppler FM rate between GMT and the stationary clutter, the Short Time Fourier Transform (STFT) is devoted to separate GMT from the stationary clutter. The effectiveness of the detection method proposed in this paper has been demonstrated and illustrated by numerical simulations.

Miniaturized radar near-field imaging systems have become a hot spot for SAR imaging in recent years. The irregular synthetic aperture caused by arbitrary motion of miniaturized system is an important factor affecting imaging quality. On the other hand, the design of fast and high resolution 3D imaging methods is also a major issue. In this paper, a fast time-frequency joint three-dimensional imaging algorithm based on aperture linearization is proposed. First, irregular synthetic aperture is adjusted through special linearization method, and then the target is quickly and accurately imaged. Through formula derivation and simulation test analysis, the results show that the proposed method is feasible and maneuverable, which can solve the current problems.

Synthetic Aperture Radar (SAR) image is highly useful in civilian and military fields, such as ship detection, maritime search and rescue. Considering the target detection from SAR image, we propose a SAR image reconstruction and target extraction method via low-rank and sparsity constrains from under-sampled data. Firstly, the low-rank and sparsity constrains are incorporated into the SAR image reconstruction model, and the objective function is established based on Robust Principal Component Analysis (RPCA) theory. Then, the Augment Lagrange Multiplier (ALM) algorithm is used to transform this objective function to a convex optimization problem. Lastly, SAR image reconstruction and target extraction are obtained by Alternating Direction Method of Multipliers (ADMM) algorithm. The simulations are conducted to verify the effectiveness of the proposed method.

The survivability and stability of synthetic aperture radar (SAR) in the increasingly severe electromagnetic environment are widely concerned. With the development of interception receiver technology, it is very difficult to prevent the competitor from detecting the radio frequency (RF) energy of radar. Therefore, more complex intra pulse modulation waveform is needed to prevent the competitor from effectively acquiring and analyzing information. In this paper, a novel low probability of intercept (LPI) waveform optimization framework is proposed. Symmetric piecewise linear functions (PWL) is used to define the waveform search space and a constrained multi-objective evolutionary algorithm is employed to solve the waveform optimization problem. Simulation results show that the proposed waveform has good performance of low interception and auto-correlation, which is suitable for SAR imaging.