Equivariant motivic integration and proof of the integral identity conjecture for regular functions

We develop Denef-Loeser’s motivic integration to an equivariant version and use it to prove the full integral identity conjecture for regular functions. In comparison with Hartmann’s work, the equivariant Grothendieck ring defined in this article is more elementary and it yields the application to the conjecture

A physical layer network coding based modify-and-forward with opportunistic secure cooperative transmission protocol

This paper investigates a new secure relaying scheme, namely physical layer network coding based modify-and-forward (PMF), in which a relay node linearly combines the decoded data sent by a source node with an encrypted key before conveying the mixed data to a destination node. We first derive the general expression for the generalized secrecy outage probability (GSOP) of the PMF scheme and then use it to analyse the GSOP performance of various relaying and direct transmission strategies. The GSOP performance comparison indicates that these transmission strategies offer different advantages depending on the channel conditions and target secrecy rates, and relaying is not always desirable in terms of secrecy. Subsequently, we develop an opportunistic secure transmission protocol for cooperative wireless relay networks and formulate an optimisation problem to determine secrecy rate thresholds (SRTs) to dynamically select the optimal transmission strategy for achieving the lowest GSOP. The conditions for the existence of the SRTs are derived for various channel scenarios

A new root-knot nematode, Meloidogyne moensi n. sp. (Nematoda : Meloidogynidae), parasitizing Robusta coffee from Western Highlands, Vietnam

A new root-knot nematode, parasitizing Robusta coffee in Dak Lak Province, Western Highlands of Vietnam, is described as Meloidogyne moensi n. sp. Morphological and molecular analyses demonstrated that this species differs clearly from other previously described root-knot nematodes. Morphologically, the new species is characterized by a swollen body of females with a small posterior protuberance that elongated from ovoid to saccate; perineal patterns with smooth striae, continuous and low dorsal arch; lateral lines marked as a faint space or linear depression at junction of the dorsal and ventral striate; distinct phasmids; perivulval region free of striae; visible and wide tail terminus surrounding by concentric circles of striae; medial lips of females in dumbbell-shaped and slightly raised above lateral lips; female stylet is normally straight with posteriorly sloping stylet knobs; lip region of second stage juvenile (J2) is not annulated; medial lips and labial disc of J2 formed dumbbell shape; lateral lips are large and triangular; tail of J2 is conoid with rounded unstriated tail tip; distinct phasmids and hyaline; dilated rectum. Meloidogyne moensi n. sp. is most similar to M. africana, M. ottersoni by prominent posterior protuberance. Results of molecular analysis of rDNA sequences including the D2-D3 expansion regions of 28S rDNA, COI, and partial COII/16S rRNA of mitochondrial DNA support for the new species status

Secure information transmission and power transfer in cellular networks

This letter studies simultaneous data transmission and power transfer for multiple information receivers (IRs) and energy-harvesting receivers (ERs) in cellular networks. We formulate an optimization problem to minimize the total transmit power across the network subject to the following three sets of constraints: i) data reliability by maintaining the required level of signal to interference plus noise ratio (SINR) for all IRs; ii) information security by keeping all SINR levels of the intended IRs measured at each ER below a predefined value, which helps prevent possible eavesdroppers, i.e., ERs, from detecting information aimed for the IRs; and iii) energy harvesting by guaranteeing the required level of received power at each ER. Using semidefinite relaxation technique, the proposed problem is then transformed into a convex form which is proved to always yield rank-one optimal solution

Beamforming in coexisting wireless systems with uncertain channel state information

This paper considers an underlay access strategy for coexisting wireless networks where the secondary system utilizes the primary spectrum to serve its users. We focus on the practical cases where there is uncertainty in the estimation of channel state information (CSI). Here the throughput performance of each system is limited by the interference imposed by the other, resulting in conflicting objectives. We first analyze the fundamental tradeoff between the tolerance interference level at the primary system and the total achievable throughput of the secondary users. We then introduce a beamforming design problem as a multiobjective optimization to minimize the interference imposed on each of the primary users while maximizing the intended signal received at every secondary user, taking into account the CSI uncertainty. We then map the proposed optimization problem to a robust counterpart under the maximum CSI estimation error. The robust counterpart is then transformed into a standard convex semi-definite programming. Simulation results confirm the effectiveness of the proposed scheme against various levels of CSI estimation error. We further show that in the proposed approach, the trade-off in the two systems modelled by Pareto frontier can be engineered by adjusting system parameters. For instance, the simulations show that at the primary system interference thresholds of -10 dBm (-5 dBm) by increasing number of antennas from 4 to 12, the secondary system throughput is increased by 3.3 bits/s/channel-use (5.3 bits/s/channel-use

A secure network coding based modify-and-forward scheme for cooperative wireless relay networks

This paper investigates the security at the physical layer of cooperative relay communications. Inspired by the principle of physical-layer network coding (PNC), we propose a new secure relaying scheme, namely secure PNC-based modify-and-forward (SPMF). In the proposed scheme, the relay node linearly combines the decoded data from the source node with an encrypted key before conveying the mixed data to the destination node. As both the linear PNC operation and encrypted key at the relay are unknown to the eavesdropper, the SPMF scheme provides a double security level in the system. Particularly, taking into account the practical scenario of the imperfect knowledge shared between the relay and destination, the secrecy outage probability (SOP) of the proposed SPMF scheme is analysed and evaluated in comparison with modify-and-forward, cooperative jamming, decode-and-forward and direct transmission schemes. The proposed scheme is shown to achieve a performance improvement of up to 3 dB when compared to the conventional schemes under imperfect knowledge of shared information between the nodes