Graph Neural Network (GNN)-based fake news detectors apply various methods to construct graphs, aiming to learn distinctive news embeddings for classification. Since the construction details are unknown for attackers in a black-box scenario, it is unrealistic to conduct the classical adversarial attacks that require a specific adjacency matrix. In this paper, we propose the first general black-box adversarial attack framework, i.e., General Attack via Fake Social Interaction (GAFSI), against detectors based on different graph structures. Specifically, as sharing is an important social interaction for GNN-based fake news detectors to construct the graph, we simulate sharing behaviors to fool the detectors. Firstly, we propose a fraudster selection module to select engaged users leveraging local and global information. In addition, a post injection module guides the selected users to create shared relations by sending posts. The sharing records will be added to the social context, leading to a general attack against different detectors. Experimental results on empirical datasets demonstrate the effectiveness of GAFSI.

Reinforcement learning is an effective way to solve the decision-making problems. It is a meaningful and valuable direction to investigate autonomous air combat maneuver decision-making method based on reinforcement learning. However, when using reinforcement learning to solve the decision-making problems with sparse rewards, such as air combat maneuver decision-making, it costs too much time for training and the performance of the trained agent may not be satisfactory. In order to solve these problems, the method based on curriculum learning is proposed. First, three curricula of air combat maneuver decision-making are designed: angle curriculum, distance curriculum and hybrid curriculum. These courses are used to train air combat agents respectively, and compared with the original method without any curriculum. The training results show that angle curriculum can increase the speed and stability of training, and improve the performance of the agent; distance curriculum can increase the speed and stability of agent training; hybrid curriculum has a negative impact on training, because it makes the agent get stuck at local optimum. The simulation results show that after training, the agent can handle the situations where targets come from different directions, and the maneuver decision results are consistent with the characteristics of missile.

Quickly and accurately predicting the flight trajectory of a blue army fighter in close-range air combat helps a red army fighter gain a dominant situation, which is the winning factor in later air combat. However,due to the high speed and even hypersonic capabilities of advanced fighters, the diversity of tactical maneuvers,and the instantaneous nature of situational transitions,it is difficult to meet the requirements of practical combat applications in terms of prediction this http URL improve prediction accuracy,this paper proposes a spatio-temporal graph attention network (ST-GAT) using encoding and decoding structures to predict the flight trajectory. The encoder adopts a parallel structure of Transformer and GAT branches embedded with the multi-head self-attention mechanism in each front end. The Transformer branch network is used to extract the temporal characteristics of historical trajectories and capture the impact of the fighter's historical state on future trajectories, while the GAT branch network is used to extract spatial features in historical trajectories and capture potential spatial correlations between this http URL we concatenate the outputs of the two branches into a new feature vector and input it into a decoder composed of a fully connected network to predict the future position coordinates of the blue army this http URL computer simulation results show that the proposed network significantly improves the prediction accuracy of flight trajectories compared to the enhanced CNN-LSTM network (ECNN-LSTM), with improvements of 47% and 34% in both ADE and FDE indicators,providing strong support for subsequent autonomous combat missions.

Speech Emotion Recognition (SER) is to recognize human emotions in a natural verbal interaction scenario with machines, which is considered as a challenging problem due to the ambiguous human emotions. Despite the recent progress in SER, state-of-the-art models struggle to achieve a satisfactory performance. We propose a self-attention based method with combined use of label-adaptive mixup and center loss. By adapting label probabilities in mixup and fitting center loss to the mixup training scheme, our proposed method achieves a superior performance to the state-of-the-art methods.

Maneuver decision-making is the core of unmanned combat aerial vehicle for autonomous air combat. To solve this problem, we propose an automatic curriculum reinforcement learning method, which enables agents to learn effective decisions in air combat from scratch. The range of initial states are used for distinguishing curricula of different difficulty levels, thereby maneuver decision is divided into a series of sub-tasks from easy to difficult, and test results are used to change sub-tasks. As sub-tasks change, agents gradually learn to complete a series of sub-tasks from easy to difficult, enabling them to make effective maneuvering decisions to cope with various states without the need to spend effort designing reward functions. The ablation studied show that the automatic curriculum learning proposed in this article is an essential component for training through reinforcement learning, namely, agents cannot complete effective decisions without curriculum learning. Simulation experiments show that, after training, agents are able to make effective decisions given different states, including tracking, attacking and escaping, which are both rational and interpretable.

This work studies a beamforming design for downlink transmission of a multi-user multiple-input single-output (MISO) system where each legitimate user employs a power splitting (PS) based simultaneous wireless information and power transfer (SWIPT) technique. The transmitter intends to send confidential information to its legitimate users in the presence of purely unknown eavesdroppers. Since the transmitter does not have any knowledge of the eavesdroppers' channel state information (CSI), we consider an artificial noise (AN) approach to establishing secure communication. This beamforming design is developed by maximizing the AN power to interfere with the eavesdropper as much as possible. Based on the assumption of imperfect CSI of legitimate users at the transmitter, two robust design approaches for the joint beamforming and PS ratio have been studied to maximize the AN power under both energy harvesting (EH) and signal-to-interference-plus-noise ratio (SINR) requirements at each legitimate user. In the first robust design, we consider the bounded channel uncertainties, and employ semidefinite relaxation (SDR) and a linear matrix inequality (LMI) representation to transform the original problem into a semidefinite program (SDP). In the second robust design, we consider the statistical channel uncertainties, and show that the proposed problem can be reformulated into another form of SDP through both SDR and Bernstein-type inequality. In addition, the non-linear energy harvesting (EH) model is incorporated in this work as it could reflect the characteristics of practical radio frequency(RF)-EH conversion circuit. Simulation results have been provided to demonstrate the performance of our proposed robust designs.

Aiming at the problem of low accuracy of flight trajectory prediction caused by the high speed of fighters, the diversity of tactical maneuvers, and the transient nature of situational change in close range air combat, this paper proposes an enhanced CNN-LSTM network as a fighter flight trajectory prediction method. Firstly, we extract spatial features from fighter trajectory data using CNN, aggregate spatial features of multiple fighters using the social-pooling module to capture geographic information and positional relationships in the trajectories, and use the attention mechanism to capture mutated trajectory features in air combat; subsequently, we extract temporal features by using the memory nature of LSTM to capture long-term temporal dependence in the trajectories; and finally, we merge the temporal and spatial features to predict the flight trajectories of enemy fighters. Extensive simulation experiments verify that the proposed method improves the trajectory prediction accuracy compared to the original CNN-LSTM method, with the improvements of 32% and 34% in ADE and FDE indicators.

Conjucyclic codes are an important and special family of classical error-correcting codes, which have been used to construct binary quantum error-correcting codes (QECCs). However, at present, the research on the conjucyclic codes is extremely insufficient. This paper will explore the algebraic structure of additive conjucyclic codes over $\mathbb{F}_{q^{2}}$ for the first time. Mainly via the trace function from $\mathbb{F}_{q^{2}}$ down $\mathbb{F}_{q}$, we will firstly build an isomorphic mapping between $q^2$-ary additive conjucyclic codes and $q$-ary linear cyclic codes. Since the mapping preserves the weight and orthogonality, then the dual structure of these codes with respect to the alternating inner product will be described. Then a new construction of QECCs from conjucyclic codes can be obtained. Finally, the enumeration of $q^2$-ary additive conjucyclic codes of length $n$ and the explicit forms of their generator and parity-check matrices will be determined.

Data analytics helps basketball teams to create tactics. However, manual data collection and analytics are costly and ineffective. Therefore, we applied a deep bidirectional long short-term memory (BLSTM) and mixture density network (MDN) approach. This model is not only capable of predicting a basketball trajectory based on real data, but it also can generate new trajectory samples. It is an excellent application to help coaches and players decide when and where to shoot. Its structure is particularly suitable for dealing with time series problems. BLSTM receives forward and backward information at the same time, while stacking multiple BLSTMs further increases the learning ability of the model. Combined with BLSTMs, MDN is used to generate a multi-modal distribution of outputs. Thus, the proposed model can, in principle, represent arbitrary conditional probability distributions of output variables. We tested our model with two experiments on three-pointer datasets from NBA SportVu data. In the hit-or-miss classification experiment, the proposed model outperformed other models in terms of the convergence speed and accuracy. In the trajectory generation experiment, eight model-generated trajectories at a given time closely matched real trajectories.

In this paper, we obtain sufficient and necessary conditions for quasi-cyclic codes with index even to be symplectic self-orthogonal. Then, we propose a method for constructing symplectic self-orthogonal quasi-cyclic codes, which allows arbitrary polynomials that coprime $x^{n}-1$ to construct symplectic self-orthogonal codes. Moreover, by decomposing the space of quasi-cyclic codes, we provide lower and upper bounds on the minimum symplectic distances of a class of 1-generator quasi-cyclic codes and their symplectic dual codes. Finally, we construct many binary symplectic self-orthogonal codes with excellent parameters, corresponding to 117 record-breaking quantum codes, improving Grassl's table (Bounds on the Minimum Distance of Quantum Codes. http://www.codetables.de).

Extensive utilization of deep reinforcement learning (DRL) policy networks in diverse continuous control tasks has raised questions regarding performance degradation in expansive state spaces where the input state norm is larger than that in the training environment. This paper aims to uncover the underlying factors contributing to such performance deterioration when dealing with expanded state spaces, using a novel analysis technique known as state division. In contrast to prior approaches that employ state division merely as a post-hoc explanatory tool, our methodology delves into the intrinsic characteristics of DRL policy networks. Specifically, we demonstrate that the expansion of state space induces the activation function $\tanh$ to exhibit saturability, resulting in the transformation of the state division boundary from nonlinear to linear. Our analysis centers on the paradigm of the double-integrator system, revealing that this gradual shift towards linearity imparts a control behavior reminiscent of bang-bang control. However, the inherent linearity of the division boundary prevents the attainment of an ideal bang-bang control, thereby introducing unavoidable overshooting. Our experimental investigations, employing diverse RL algorithms, establish that this performance phenomenon stems from inherent attributes of the DRL policy network, remaining consistent across various optimization algorithms.

Let $t \in \{2,8,10,12,14,16,18\}$ and $n=31s+t\geq 14$, $d_{a}(n,5)$ and $d_{l}(n,5)$ be distances of binary $[n,5]$ optimal linear codes and optimal linear complementary dual (LCD) codes, respectively. We show that an $[n,5,d_{a}(n,5)]$ optimal linear code is not an LCD code, there is an $[n,5,d_{l}(n,5)]=[n,5,d_{a}(n,5)-1]$ optimal LCD code if $t\neq 16$, and an optimal $[n,5,d_{l}(n,5)]$ optimal LCD code has $d_{l}(n,5)=16s+6=d_{a}(n,5)-2$ for $t=16$. Combined with known results on optimal LCD code, $d_{l}(n,5)$ of all $[n,5]$ LCD codes are completely determined.

With entanglement-assisted (EA) formalism, arbitrary classical linear codes are allowed to transform into EAQECCs by using pre-shared entanglement between the sender and the receiver. In this paper, based on classical cyclic MDS codes by exploiting pre-shared maximally entangled states, we construct two families of $q$-ary entanglement-assisted quantum MDS codes $[[\frac{q^{2}+1}{a},\frac{q^{2}+1}{a}-2(d-1)+c,d;c]]$, where q is a prime power in the form of $am+l$, and $a=(l^2+1)$ or $a=\frac{(l^2+1)}{5}$. We show that all of $q$-ary EAQMDS have minimum distance upper limit much larger than the known quantum MDS (QMDS) codes of the same length. Most of these $q$-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing. Then, a new method for constructing binary quantum codes using symplectic dual-containing codes is proposed. As an application, we construct 8 binary quantum codes that exceed the best-known results. Further, another 36 new binary quantum codes are obtained by propagation rules, all of which improve the lower bound on the minimum distances.

Linear complementary dual (LCD) codes can be used to against side-channel attacks and fault noninvasive attacks. Let $d_{a}(n,6)$ and $d_{l}(n,6)$ be the minimum weights of all binary optimal linear codes and LCD codes with length $n$ and dimension 6, respectively.In this article, we aim to obtain the values of $d_{l}(n,6)$ for $n\geq 51$ by investigating the nonexistence and constructions of LCD codes with given parameters. Suppose that $s \ge 0$ and $0\leq t\leq 62$ are two integers and $n=63s+t$. Using the theories of defining vectors, generalized anti-codes, reduced codes and nested codes, we exactly determine $d_{l}(n,6)$ for $t \notin\{21,22,25,26,33,34,37,38,45,46\}$, while we show that $d_{l}(n,6)\in$$\{d_{a}(n,6)$ $-1,d_{a}(n,6)\}$ for $t\in\{21,22,26,34,37,38,46\}$ and $d_{l}(n,6)\in$$\{d_{a}(n,6)-2,$ $d_{a}(n,6)-1\}$ fort\in{25,33,45\}.

The Brewster effect, dating back to the pioneering work of Sir David Brewster in 1815, offers a crucial route to achieve 100% energy conversion between the incident and transmitted propagating waves at an optical interface and is of fundamental importance to many practical applications, such as polarization filtering, beam steering, and optical broadband angular selectivity. However, whether the Brewster effect of surface waves can be implemented without the involvement of negative-permittivity or negative-permeability materials remains elusive. This is due to the formidable challenge to fully suppress both the parasitic scattering into propagating waves and the reflection into surface waves under the incidence of surface waves. Here, we reveal a feasible route to achieve scattering-free plasmonic Brewster effect via isotropic metasurfaces, along with the usage of positive-permittivity and positive-permeability metamaterials with both anisotropic and magnetic responses. In essence, the anisotropic response of metamaterials is judiciously designed to fully suppress the parasitic scattering into propagating waves, while the magnetic response of metamaterials facilitates the full suppression of the reflection into surface waves supported by metasurfaces. Moreover, we find that this plasmonic Brewster effect via metasurfaces can be further engineered to occur for arbitrary incident angles, giving rise to the exotic phenomenon of all-angle scattering-free plasmonic Brewster effect.

To achieve sustainable development, there is widespread of the need to protect natural resource and improve government oversight in achieving China's economic security and ecological civilization. Compilation of natural resources balance sheet (NRBS) and enhancement of resources management are becoming an important topic in China. How to compile NRBS to affix the responsibility for government and officials for inadequate supervision is still not resolved satisfactorily. This paper proposes the NRBS to enable governments to identify the importance of natural resource restoration and to hold leading cadres accountable for a lack of adequate supervision. The NRBS consist of three accounts: natural resource assets, natural resource liabilities, and net worth. Important components of the NRBS for the liabilities account with a property rights regime are developed to measure and assign responsibility. The compilation of an NRBS is applied to the Chinese province of Shaanxi as an illustration to demonstrate that the accounting framework and the compilation steps are tractable using financial methods and available data. The accounting results of natural resource assets and liabilities unveil the threat to resource management and the policy implications to government and officials. Finally, the advantages and limitations of NRBS are discussed.

This paper proposes a three-layer unmanned combat aerial vehicle (UCAV) dogfight frame where Deep reinforcement learning (DRL) is responsible for high-level maneuver decision. A four-channel low-level control law is firstly constructed, followed by a library containing eight basic flight maneuvers (BFMs). Double deep Q network (DDQN) is applied for BFM selection in UCAV dogfight, where the opponent strategy during the training process is constructed with DT. Our simulation result shows that, the agent can achieve a win rate of 85.75% against the DT strategy, and positive results when facing various unseen opponents. Based on the proposed frame, interpretability of the DRL-based dogfight is significantly improved. The agent performs yo-yo to adjust its turn rate and gain higher maneuverability. Emergence of "Dive and Chase" behavior also indicates the agent can generate a novel tactic that utilizes the drawback of its opponent.

Elastocaloric cooling with shape memory alloys (SMAs) is emerging as a promising candidate for next-generation, environmentally friendly refrigeration. However, its development is hindered by the large driving force and low efficiency associated with uniaxial loading modes. In response, we present an innovative elastocaloric air cooling approach that utilizes the bending of NiTi beams, offering a low-force and energy-efficient solution. We achieve a continuous maximum temperature drop of 0.91 K and a dissipated energy of 15.1 N mm at a low specific driving force of 220 N. Notably, the specimen achieves over 5 million cycles under a maximum surface tensile strain of 1.94% for macroscopic cyclic bending, via a pre-strained, warm laser shock peening (pw-LSP) method. This unprecedented fatigue resistance originates from the formation of a hierarchical microstructure and a large compressive residual stress of over 1 GPa. This work demonstrates the great potential of bending induced elastocaloric cooling in the near future.

A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented. Relations of symplectic subspaces and quaternary additive codes concerning parameters of EAQECCs are described. Thus, parameters of EA stabilizer codes are revealed in the nomenclature of additive codes. Our techniques enable us solve some open problems about optimal EAQECCs and entanglement-assisted quantum minimum distance separable (EAQMDS) codes, and are also useful for designing encoding and decoding quantum circuit of EA stabilizer codes.