Wireless full duplex (FD) communication can double the point-to-point throughput. To fully realize the benefits of the FD technique in wireless local area networks (WLANs), it is important to design the medium access control (MAC) protocols for FD communications. In FD MAC protocols, when a node wins the channel contention and transmits a primary transmission, its destination node can start a secondary transmission triggered by the primary transmission. Each secondary transmitter transmits a data frame even if its backoff timer is not zero. However, the backoff scheme in the FD MAC protocols follows the conventional scheme based on the distributed coordination function (DCF). Therefore, the nodes with FD MAC initialize the contention window (CW) size to minimum CW (CWmin) after their successful secondary transmissions. Therefore, CW initialization in the FD MAC causes further collisions at stations (STAs), which degrades network throughput. This paper proposes a novel backoff scheme for FD MAC protocols. In the proposed scheme, the CW size and backoff timer are not initialized but kept the current value after secondary transmissions. The proposed scheme can mitigate frame collisions at STAs and increase FD-transmission opportunity in the network, and then enhance the throughput significantly. This paper presents comprehensive performance evaluation in simulations, including non-saturation and saturation conditions, and co-existence conditions with legacy half duplex (HD) STAs. For performance analysis, this paper establishes Markov-chain models for the proposed scheme. The analytical results show theoretically that the operation of the proposed scheme enhances network throughput. The simulation results and analytical results show the effectiveness of the proposed scheme.

Matching circuits using LC elements are widely applied to high-frequency circuits such as power amplifier (PA) and low-noise amplifier (LNA). For determining matching condition of multi-stage matching circuits, this paper shows that any multi-stage LC-Ladder matching circuit with resistive termination can be decomposed to the extended L-type matching circuits with resistive termination containing negative elements where the analytical solution exists. The matching conditions of each extended L-type matching circuit are obtained easily from the termination resistances and the design frequency. By synthesizing these simple analysis solutions, it is possible to systematically determine the solution even in a large number of stages (high order) matching circuits.

In the statistic en-route filtering, each report generation node must collect a certain number of endorsements from its neighboring nodes. However, at some point, a node may fail to collect an insufficient number of endorsements since some of its neighboring nodes may have dead batteries. This letter presents a report generation method that can enhance the generation process of sensing reports under such a situation. Simulation results show the effectiveness of the proposed method.

A planar electromagnetic field stirrer with periodically arranged metal patterns and diode switches is proposed for improving uneven heating of a heated object placed in a microwave oven. The reflection phase of the proposed stirrer changes by switching the states of diodes mounted on the stirrer and the electromagnetic field in the microwave oven is stirred. The temperature distribution of a heated object located in a microwave oven was simulated and measured using the stirrer in order to evaluate the improving effect of the uneven heating. As the result, the heated parts of the objects were changed with the diode states and the improving effect of the uneven heating was experimentally indicated.

The accurate calculation of the inductance is the most basic problem of the inductor design. In this paper, the core flux density distribution and leakage flux in core window and winding of core-type inductor are analyzed by finite element analysis (FEA) firstly. Based on it, an improved magnetic equivalent circuit with high accuracy flux density distribution (iMEC) is proposed for a single-phase core-type inductor. Depend on the geometric structure, two leakage paths of the core window are modeled. Furthermore, the iMEC divides the magnetomotive force of the winding into the corresponding core branch. It makes the core flux density distribution consistent with the FEA distribution to improve the accuracy of the inductance. In the iMEC, flux density of the core leg has an error less than 5.6% compared to FEA simulation at 150A. The maximum relative error of the inductance is less than 8.5% and the average relative error is less than 6% compared to the physical prototype test data. At the same time, due to the high computational efficiency of iMEC, it is very suitable for the population-based optimization design.

A multi-band wireless local area network (WLAN) enables flexible use of multiple frequency bands. To efficiently monitor radio resources in multi-band WLANs, a distributed-sensing system that employs a number of stations (STAs) is considered to alleviate sensing constraints at access points (APs). This paper examines the distributed sensing that expands the sensing coverage area and monitors multiple object channels by employing STA-based sensing. To avoid issuing unnecessary reports, each STA autonomously judges whether it should make a report by comparing the importance of its own sensing result and that of the overheard report. We address how to efficiently collect the necessary sensing information from a large number of STAs. We propose a reactive reporting scheme that is highly scalable by the number of STAs to collect such sensing results as the channel occupancy ratio. Evaluation results show that the proposed scheme keeps the number of reports low even if the number of STAs increases. Our proposed sensing scheme provides large sensing coverage.

A low frequency electric field probe that integrates data acquisition and storage is developed in this paper. An electric small monopole antenna printed on the circuit board is used as the receiving antenna; the rear end of the monopole antenna is connected to the integral circuit to achieve the flat frequency response; the logarithmic detection method is applied to obtain a high measurement dynamic range. In addition, a Microprogrammed Control Unit is set inside to realize data acquisition and storage. The size of the probe developed is not exceeding 20 mm × 20 mm × 30 mm. The field strength 0.2 V/m ~ 261 V/m can be measured in the frequency range of 500 Hz ~ 10 MHz, achieving a dynamic range over 62 dB. It is suitable for low frequency electric field strength measurement and shielding effectiveness test of small shield.

We simulate some scenarios that 2/3 LEO satellites enhance 3/4/5 GPS satellites, to assess LEO-augmented GPS RTK positioning in signal-degraded environment. The effects of LEO-augmented GPS RTK in terms of reliability, availability and accuracy are presented, and the DIA algorithm is applied to deal with the poor data quality.

We study wireless networked control systems (WNCSs), where controllers (CLs), controlled objects (COs), and other devices are connected through wireless networks. In WNCSs, COs can become unstable due to bursty packet losses and random delays on wireless networks. To reduce these network-induced effects, we utilize the packetized predictive control (PPC) method, where future control vectors to compensate bursty packet losses are generated in the receiving horizon manner, and they are packed into packets and transferred to a CO unit. In this paper, we extend the PPC method so as to compensate random delays as well as bursty packet losses. In the extended PPC method, generating many control vectors improves the robustness against both problems while it increases traffic on wireless networks. Therefore, we consider control vector selection to improve the robustness effectively under the constraint of single packet transmission. We first reconsider the input strategy of control vectors received by COs and propose a control vector selection scheme suitable for the strategy. In our selection scheme, control vectors are selected based on the estimated average and variance of round-trip delays. Moreover, we solve the problem that the CL may misconceive the CO's state due to insufficient information for state estimation. Simulation results show that our selection scheme achieves the higher robustness against both bursty packet losses and delays in terms of the 2-norm of the CO's state.

Vulnerabilities in hypervisors are crucial in multi-tenant clouds and attractive for attackers because a vulnerability in the hypervisor can undermine all the virtual machine (VM) security. This paper focuses on vulnerabilities in instruction emulators inside hypervisors. Vulnerabilities in instruction emulators are not rare; CVE-2017-2583, CVE-2016-9756, CVE-2015-0239, CVE-2014-3647, to name a few. For backward compatibility with legacy x86 CPUs, conventional hypervisors emulate arbitrary instructions at any time if requested. This design leads to a large attack surface, making it hard to get rid of vulnerabilities in the emulator.This paper proposes FWinst that narrows the attack surface against vulnerabilities in the emulator. The key insight behind FWinst is that the emulator should emulate only a small subset of instructions, depending on the underlying CPU micro-architecture and the hypervisor configuration. FWinst recognizes emulation contexts in which the instruction emulator is invoked, and identifies a legitimate subset of instructions that are allowed to be emulated in the current context. By filtering out illegitimate instructions, FWinst narrows the attack surface. In particular, FWinst is effective on recent x86 micro-architectures because the legitimate subset becomes very small. Our experimental results demonstrate FWinst prevents existing vulnerabilities in the emulator from being exploited on Westmere and Skylake micro-architectures, and the runtime overhead is negligible.

Countermeasures against attacks targeting an operating system are highly effective in preventing security compromises caused by kernel vulnerability. An adversary uses such attacks to overwrite credential information, thereby overcoming security features through arbitrary program execution. CPU features such as Supervisor Mode Access Prevention, Supervisor Mode Execution Prevention and the No eXecute bit facilitate access permission control and data execution in virtual memory. Additionally, Linux reduces actual attacks through kernel vulnerability affects via several protection methods including Kernel Address Space Layout Randomization, Control Flow Integrity, and Kernel Page Table Isolation. Although the combination of these methods can mitigate attacks as kernel vulnerability relies on the interaction between the user and the kernel modes, kernel virtual memory corruption can still occur (e.g., the eBPF vulnerability allows malicious memory overwriting only in the kernel mode). We present the Kernel Memory Observer (KMO), which has a secret observation mechanism to monitor kernel virtual memory. KMO is an alternative design for virtual memory can detect illegal data manipulation/writing in the kernel virtual memory. KMO determines kernel virtual memory corruption, inspects system call arguments, and forcibly unmaps the direct mapping area. An evaluation of KMO reveals that it can detect kernel virtual memory corruption that contains the defeating security feature through actual kernel vulnerabilities. In addition, the results indicate that the system call overhead latency ranges from 0.002 µs to 8.246 µs, and the web application benchmark ranges from 39.70 µs to 390.52 µs for each HTTP access, whereas KMO reduces these overheads by using tag-based Translation Lookaside Buffers.

This paper proposes a novel flexible receiver with virtual channels for overloaded multiple-input multiple-output (MIMO) channels. The receiver applies extended rotation matrices proposed in the paper for the flexibility. In addition, adaptive selection of the extended rotation matrices is proposed for further performance improvement. We propose two techniques to reduce the computational complexity of the adaptive selection. As a result, the proposed receiver gives us an option to reduce the complexity with a slight decrease in the transmission performance by changing receiver configuration parameters. A computer simulation reveals that the adaptive selection attains a gain of about 3dB at the BER of 10-3.

In a dense wireless network, concurrent transmissions normally increase interference and reduce network performance. In such an environment, however, there is a possibility that a frame can be decoded correctly if its receive power is higher than that of another frame by some predefined value (i.e., the so-called capture effect). As a result, the unfairness of throughputs among network nodes likely occurs in that context. This research aims to quantify the throughput performance of only one access point Wireless Local Area Networks (WLANs) with dense network nodes in the presence of the capture effect. We first propose a new analytical model, which can express not only WLANs' throughputs but also WLANs' unfairness transmission. The validity of the proposed model is confirmed by simulation results. Second, relying on the model, we present a novel Medium Access Control (MAC) protocol-based solution, which realizes throughput fairness between network nodes induced by the capture effect.

Based on the concept of polynomial operators, this paper explores generalized direct-form II structure and its state-space realization for two-dimensional separable-denominator digital filters of order (m, n) where a structure with 3(m+n)+mn+1 fixed parameters plus m+n free parameters is introduced and analyzed. An l2-scaling method utilizing different coupling coefficients at different branch nodes to avoid overflow is presented. Expressions of evaluating the roundoff noise for the filter structure as well as its state-space realization are derived and investigated. The availability of the m+n free parameters is shown to be beneficial as the roundoff noise measures can be minimized with respect to these free parameters by means of an exhaustive search over a set with finite number of candidate elements. The important role these parameters can play in the endeavors of roundoff noise reduction is demonstrated by numerical experiments.

In this paper, we explore the security of single-key Even-Mansour ciphers against key-recovery attacks. First, we introduce a simple key-recovery attack using key relations on an n-bit r-round single-key Even-Mansour cipher (r-SEM). This attack is feasible with queries of DTr=O(2rn) and $2^{rac{2r}{r + 1}n}$ memory accesses, which is $2^{rac{1}{r + 1}n}$ times smaller than the previous generic attacks on r-SEM, where D and T are the number of queries to the encryption function EK and the internal permutation P, respectively. Next, we further reduce the time complexity of the key recovery attack on 2-SEM by a start-in-the-middle approach. This is the first attack that is more efficient than an exhaustive key search while keeping the query bound of DT2=O(22n). Finally, we leverage the start-in-the-middle approach to directly improve the previous attacks on 2-SEM by Dinur et al., which exploit t-way collisions of the underlying function. Our improved attacks do not keep the bound of DT2=O(22n), but are the most time-efficient attacks among the existing ones. For n=64, 128 and 256, our attack is feasible with the time complexity of about $2^{n} cdot rac{1}{2 n}$ in the chosen-plaintext model, while Dinur et al.'s attack requires $2^{n} cdot rac{{ m log}(n)}{ n} $ in the known-plaintext model.

As one of the popular topics in the field of human-computer interaction, the Speech Emotion Recognition (SER) aims to classify the emotional tendency from the speakers' utterances. Using the existing deep learning methods, and with a large amount of training data, we can achieve a highly accurate performance result. Unfortunately, it's time consuming and difficult job to build such a huge emotional speech database that can be applicable universally. However, the Siamese Neural Network (SNN), which we discuss in this paper, can yield extremely precise results with just a limited amount of training data through pairwise training which mitigates the impacts of sample deficiency and provides enough iterations. To obtain enough SER training, this study proposes a novel method which uses Siamese Attention-based Long Short-Term Memory Networks. In this framework, we designed two Attention-based Long Short-Term Memory Networks which shares the same weights, and we input frame level acoustic emotional features to the Siamese network rather than utterance level emotional features. The proposed solution has been evaluated on EMODB, ABC and UYGSEDB corpora, and showed significant improvement on SER results, compared to conventional deep learning methods.

A triple-band CP rectenna for ambient RF energy harvesting is presented in this paper. A simple broadband CP slot antenna has been proposed with the bandwidth of 51.1% operating from 1.53 to 2.58GHz, which can cover GSM-1800, UMTS-2100 and 2.45GHz WLAN bands. Accordingly, a triple-band rectifying circuit is designed to convert RF energy in the above bands, with the maximum RF-DC conversion efficiency of 42.5% at a relatively low input power of -5dBm. Additionally, the rectenna achieves the maximum conversion efficiency of 12.7% in the laboratory measurements. The measured results show a good performance in the laboratory measurements.

In radio channel measurements and modeling, directional scanning via highly directive antennas is the most popular method to obtain angular channel characteristics to develop and evaluate advanced wireless systems for high frequency band use. However, it is often insufficient for ray-/cluster-level characterizations because the angular resolution of the measured data is limited by the angular sampling interval over a given scanning angle range and antenna half power beamwidth. This study proposes the sub-grid CLEAN algorithm, a novel technique for high-resolution multipath component (MPC) extraction from the multi-dimensional power image, so called double-directional angular delay power spectrum. This technique can successfully extract the MPCs by using the multi-dimensional power image. Simulation and measurements showed that the proposed technique could extract MPCs for ray-/cluster-level characterizations and channel modeling. Further, applying the proposed method to the data captured at 58.5GHz in an atrium entrance hall environment which is an indoor hotspot access scenario in the fifth generation mobile system, the multipath clusters and corresponding scattering processes were identified.

Aiming at the problem of low accuracy of target selection in indirect touch input, an indirect multi-touch input device was designed and built. We explored here four indirect touch input techniques which were TarConstant, TarEnlarge, TarAttract, TarEnlargeAttract, and investigated their performance when subjects completing the target selection tasks through comparative experiments. Results showed that TarEnlargeAttract enabled the shortest movement time along with the lowest error rate, 2349.9ms and 10.9% respectively. In terms of learning effect, both TarAttract and TarEnlargeAttract had learning effect on movement time, which indicated that the speed of these two techniques can be improved with training. Finally, the strategy of improving the accuracy of indirect touch input was given, which has reference significance for the interface design of indirect touch input.

Full duplex (FD) communication can potentially double the throughput of a point-to-point link in wireless communication. Additionally, FD communication can mitigate the hidden node collision problem. The MAC protocols for FD communications are classified into two types; synchronous FD MAC and asynchronous one. Though the synchronous FD MAC mitigates hidden node collisions by using control frame, overhead duration for each data frame transmission may be a bottleneck for the networks. On the other hand, the asynchronous FD MAC mitigates the hidden node collisions by FD communication. However, it wastes more time due to transmission failure than synchronous FD MAC. Clarifying the effect of two major FD MAC types on networks requires a quantitative evaluation of the effectiveness of these protocols in networks with hidden node collisions. This paper proposes performance analysis of FD MAC protocols for wireless local area networks with hidden node collisions. Through the proposed analytical model, the saturated throughputs in FD WLANs with both asynchronous and synchronous FD MAC for any number of STAs and any payload size can be obtained.