With the continued innovation of deep neural networks, spiking neural networks (SNNs) that more closely resemble biological brain synapses have attracted attention because of their low power consumption. Unlike artificial neural networks (ANNs), for continuous data values, they must employ an encoding process to convert the values to spike trains, suppressing the SNN's performance. To avoid this degradation, the incoming analog signal must be regulated prior to the encoding process, which is also realized in living things eg, the basement membranes of humans mechanically perform the Fourier transform. To this end, we combine an ANN and an SNN to build ANN-to-SNN hybrid neural networks (HNNs) that improve the concerned performance. To qualify this performance and robustness, MNIST and CIFAR-10 image datasets are used for various classification tasks in which the training and encoding methods changes. In addition, we present simultaneous and separate training methods for the artificial and spiking layers, considering the encoding methods of each. We find that increasing the number of artificial layers at the expense of spiking layers improves the HNN performance. For straightforward datasets such as MNIST, similar performances as ANN's are achieved by using duplicate coding and separate learning. However, for more complex tasks, the use of Gaussian coding and simultaneous learning is found to improve the accuracy of the HNN while lower power consumption.

Broadcast services for wireless local area networks (WLANs) are being standardized in the IEEE 802.11 task group bc. Envisaging the upcoming coexistence of broadcast access points (APs) with densely-deployed legacy APs, this paper addresses a learning-based spatial reuse with only partial receiver-awareness. This partial awareness means that the broadcast APs can leverage few acknowledgment frames (ACKs) from recipient stations (STAs). This is in view of the specific concerns of broadcast communications. In broadcast communications for a very large number of STAs, ACK implosions occur unless some STAs are stopped from responding with ACKs. Given this, the main contribution of this paper is to demonstrate the feasibility to improve the robustness of learning-based spatial reuse to hidden interferers only with the partial receiver-awareness while discarding any re-training of broadcast APs. The core idea is to leverage robust adversarial reinforcement learning (RARL), where before a hidden interferer is installed, a broadcast AP learns a rate adaptation policy in a competition with a proxy interferer that provides jamming signals intelligently. Therein, the recipient STAs experience interference and the partial STAs provide a feedback overestimating the effect of interference, allowing the broadcast AP to select a data rate to avoid frame losses in a broad range of recipient STAs. Simulations demonstrate the suppression of the throughput degradation under a sudden installation of a hidden interferer, indicating the feasibility of acquiring robustness to the hidden interferer.

Quadrature voltage-controlled oscillators (VCOs) with current-weight-average and voltage-weight-average phase-adjusting architectures are studied. The phase adjusting equalizes the oscillation frequency to the LC-resonant frequency. The merits of the equalization are explained by using Leeson's phase noise equation and the impulse sensitivity function (ISF). Quadrature VCOs with the phase-adjusting architectures are fabricated using 180-nm TSMC CMOS and show low-phase-noise performances compared to a conventional differential VCO. The ISF analysis and small-signal analysis also show that the drawbacks of the current-weight-average phase-adjusting and voltage-weight-average phase-adjusting architectures are current-source noise effect and large additional capacitance, respectively. A voltage-average-adjusting circuit with a source follower at its input alleviates the capacitance increase.

Mobile communication systems are not only the core of the Information and Communication Technology (ICT) infrastructure but also that of our social infrastructure. The 5th generation mobile communication system (5G) has already started and is in use. 5G is expected for various use cases in industry and society. Thus, many companies and research institutes are now trying to improve the performance of 5G, that is, 5G Enhancement and the next generation of mobile communication systems (Beyond 5G (6G)). 6G is expected to meet various highly demanding requirements even compared with 5G, such as extremely high data rate, extremely large coverage, extremely low latency, extremely low energy, extremely high reliability, extreme massive connectivity, and so on. Artificial intelligence (AI) and machine learning (ML), AI/ML, will have more important roles than ever in 6G wireless communications with the above extreme high requirements for a diversity of applications, including new combinations of the requirements for new use cases. We can say that AI/ML will be essential for 6G wireless communications. This paper introduces some ML techniques and applications in 6G wireless communications, mainly focusing on the physical layer.

Deep neural networks (DNNs) perform well for image recognition, speech recognition, and pattern analysis. However, such neural networks are vulnerable to adversarial examples. An adversarial example is a data sample created by adding a small amount of noise to an original sample in such a way that it is difficult for humans to identify but that will cause the sample to be misclassified by a target model. In a military environment, adversarial examples that are correctly classified by a friendly model while deceiving an enemy model may be useful. In this paper, we propose a method for generating a selective adversarial example that is correctly classified by a friendly gait recognition system and misclassified by an enemy gait recognition system. The proposed scheme generates the selective adversarial example by combining the loss for correct classification by the friendly gait recognition system with the loss for misclassification by the enemy gait recognition system. In our experiments, we used the CASIA Gait Database as the dataset and TensorFlow as the machine learning library. The results show that the proposed method can generate selective adversarial examples that have a 98.5% attack success rate against an enemy gait recognition system and are classified with 87.3% accuracy by a friendly gait recognition system.

Intelligent reconfigurable surfaces (IRS) have attracted much attention from both industry and academia due to their performance improving capability and low complexity for 6G wireless communication systems. In this letter, we introduce an IRS-assisted space-time line code (STLC) technique. The STLC was introduced as a promising technique to acquire the optimal diversity gain in 1×2 single-input multiple-output (SIMO) channel without channel state information at receiver (CSIR). Using the cosine similarity theorem, we propose a novel phase-steering technique for the proposed IRS-assisted STLC technique. We also mathematically characterize the proposed IRS-assisted STLC technique in terms of outage probability and bit-error rate (BER). Based on computer simulations, it is shown that the results of analysis shows well match with the computer simulation results for various communication scenarios.

In this letter, we propose an energy beamforming empowered relaying scheme for a batteryless IoT network, where wireless-powered relays are deployed between the hybrid access point (HAP) and batteryless IoT devices to assist the uplink information transmission from the devices to the HAP. In particular, the HAP first exploits energy beamforming to efficiently transmit radio frequency (RF) signals to transfer energy to the relays and as the incident signals to enable the information backscattering of batteryless IoT devices. Then, each relay uses the harvested energy to forward the decoded signals from its corresponding batteryless IoT device to the HAP, where the maximum-ratio combing is used for further performance improvement. To maximize the network sum-rate, the joint optimization of energy beamforming vectors at the HAP, network time scheduling, power allocation at the relays, and relection coefficient at the users is investigated. As the formulated problem is non-convex, we propose an alternating optimization algorithm with the variable substitution and semi-definite relaxation (SDR) techniques to solve it efficiently. Specifically, we prove that the obtained energy beamforming matrices are always rank-one. Numerical results show that compared to the benchmark schemes, the proposed scheme can achieve a significant sum-rate gain.

In this paper, we report the recent progress in visible light positioning and communication systems using light-emitting diodes (LEDs). Due to the wide deployment of LEDs for indoor illumination, visible light positioning (VLP) and visible light communication (VLC) using existing LEDs fixtures have attracted great attention in recent years. Here, we review our recent works on visible light positioning and communication, including image sensor-based VLP, photodetector-based VLP, integrated VLC and VLP (VLCP) systems, and heterogeneous radio frequency (RF) and VLC (RF/VLC) systems.

Aiming at the problem of non-line of sight (NLOS) signal recognition for Ultra Wide Band (UWB) positioning, we utilize the concepts of Neural Network Clustering and Neural Network Pattern Recognition. We propose a classification algorithm based on self-organizing feature mapping (SOM) neural network batch processing, and a recognition algorithm based on convolutional neural network (CNN). By assigning different weights to learning, training and testing parts in the data set of UWB location signals with given known patterns, a strong NLOS signal recognizer is trained to minimize the recognition error rate. Finally, the proposed NLOS signal recognition algorithm is verified using data sets from real scenarios. The test results show that the proposed algorithm can solve the problem of UWB NLOS signal recognition under strong signal interference. The simulation results illustrate that the proposed algorithm is significantly more effective compared with other algorithms.

This paper proposes multi-input physical layer network coding (multi-input PLNC) for high speed wireless communication in two-dimensional wireless multihop networks. In the proposed PLNC, all the terminals send their packets simultaneously for the neighboring relays to maximize the network throughput in the first slot, and all the relays also do the same to the neighboring terminals in the second slot. Those simultaneous signal transmissions cause multiple signals to be received at the relays and the terminals. Signal reception in the multi-input PLNC uses multichannel filtering to mitigate the difficulties caused by the multiple signal reception, which enables the two-input PLNC to be applied. In addition, a non-linear precoding is proposed to reduce the computational complexity of the signal detection at the relays and the terminals. The proposed multi-input PLNC makes all the terminals exchange their packets with the neighboring terminals in only two time slots. The performance of the proposed multi-input PLNC is confirmed by computer simulation. The proposed multi-input physical layer network coding achieves much higher network throughput than conventional techniques in a two-dimensional multihop wireless network with 7 terminals. The proposed multi-input physical layer network coding attains superior transmission performance in wireless hexagonal multihop networks, as long as more than 6 antennas are placed on the terminals and the relays.

With the development of network technology, next-generation networks must satisfy many new requirements for network functions and performance. The processing of overlong packet fields is one of the requirements and is also the basis for ID-based routing and content lookup, and packet field addition/deletion mechanisms. The current SDN switches do not provide good support for the processing of overlong fields. In this paper, we propose a series of optimization mechanisms for protocol-oblivious instructions, in which we address the problem of insufficient support for overlong data in existing SDN switches by extending the bit width of instructions and accelerating them using SIMD instruction sets. We also provide an intermediate representation of the protocol-oblivious instruction set to improve the efficiency of storing and reading instruction blocks, and further reduce the execution time of instruction blocks by preprocessing them. The experiments show that our approach improves the performance of overlong data processing by 56%. For instructions involving packet field addition and deletion, the improvement in performance reaches 455%. In normal forwarding scenarios, our solution reduces the packet forwarding latency by around 30%.

This study examined whether distance learning in a first-year PBL courses in the first unit of instruction improves the effectiveness of subsequent group work learning over face-to-face learning. The first-year PBL consisted of three units: an input unit, a group work unit and an outcomes presentation unit. In 2017/2018, the input unit was conducted in the classroom with face-to-face learning. In 2017, a workshop was held in addition to face-to-face learning in classroom. In 2020/2021, the input unit was conducted with distance learning. In the years, approximately 100 people completed the questionnaire. A preliminary check confirmed that the average score of students' self-assessment of their own social skills were not significantly different among the four years. Analysis showed that in 2018, the perceived efficacy in the group work unit depended on learners' high social skills. Alternatively, in 2017/2020/2021, the perceived efficacy in group work was not dependent on learners' social skills. This suggests that distance learning and face-to-face learning with workshop learning, instead of full face-to-face learning for the units placed before the group work unit facilitates the learning efficacy of the group work unit, even for students with social skill concerns.

In this study, we have proposed a millimeter-wave (MMW) single-pixel imaging (SPI) system with a liquid-crystal (LC) mask cell. The LC cell functions as an electrically switchable mask based on the change in absorption properties, which depend on the orientation of the LC. We investigated the influence of noise on the measured and estimated data (reconstructed image). The proposed system exhibited moderate robustness against random noise (that were added) compared to raster scan-based and Hadamard matrix-based SPI systems. Finally, the results of some demonstrative experiments were introduced to ensure the applicability of the constructed MMW-SPI system, and steps for improving the reconstructed image quality were discussed.

During the COVID-19 pandemic there was a rapid shift to emergency remote teaching practices and online tools for education have already gained further attention. While eLearning initiatives are developed and its implementation at scale are widely discussed, this research focuses on the utilization of data which can be logged in such eLearning systems. We demonstrate the need and potential of utilizing learning logs to create services supporting sustainable quality improvement of education. Learning and Evidence Analytics Framework (LEAF), is the overarching technology framework with affordances to adopt evidence-based practices for education. It aims to promote learning for all by introducing data-driven services for personalized approaches.

On an overlay network where a number of nodes work autonomously in a decentralized way, the efficiency of broadcasts has a significant impact on the performance of distributed systems built on the network. While a broadcast method using a spanning tree produces a small number of messages, the routing path lengths are prone to be relatively large. Moreover, when multiple nodes can be source nodes, inefficient broadcasts often occur because the efficient tree topology differs for each node. To address this problem, we propose a novel protocol in which a source node selects an efficient tree from multiple spanning trees when broadcasting. Our method shortens routing paths while maintaining a small number of messages. We examined path lengths and the number of messages for broadcasts on various topologies. As a result, especially for a random graph, our proposed method shortened path lengths by approximately 28% compared with a method using a spanning tree, with almost the same number of messages.

Digital Microfluidic Biochips (DMFBs) can execute biochemical experiments very efficiently, and thus they are drawing attention recently. In biochemical experiments on a DMFB, “sample preparation” is an important task to generate a sample droplet with the desired concentration value. We merge/split droplets in a DMFB to perform sample preparation. When we split a droplet into two droplets, the split cannot be done evenly in some cases. By some unbalanced splits, the generated concentration value may have unacceptable errors. This paper shows that we can decrease the impact of errors caused by unbalanced splits if we duplicate some mixing nodes in a given dilution graph for most cases. We then propose an efficient method to transform a dilution graph in order to decrease the impact of errors caused by unbalanced splits. We also present a preliminary experimental result to show the potential of our method.

Currently, NDN-based VANETs protocols have several problems with packet overhead of rebroadcasting, control packet, and the accuracy of next-hop selection due to the dynamic topology. To deal with these problems in this paper, we propose a robust and lightweight forwarding protocol in Vehicular ad-hoc Named Data Networking. The concept of our forwarding protocol is adopting a packet-free approach. A vehicle collects its neighbor's visual identification by a pair of cameras (front and rear) to assign a unique visual ID for each node. Based on these IDs, we construct a hop-by-hop FIB-based forwarding strategy effectively. Furthermore, the Face duplication [1] in the wireless environment causes an all-broadcast problem. We add the visual information to Face to distinguish the incoming and outgoing Face to prevent broadcast-storm and make FIB and PIT work more accurate and efficiently. The performance evaluation results focusing on the communication overhead show that our proposal has better results in overall network traffic costs and Interest satisfaction ratio than previous works.

Sememes are the smallest semantic units of human languages, the composition of which can represent the meaning of words. Sememes have been successfully applied to many downstream applications in natural language processing (NLP) field. Annotation of a word's sememes depends on language experts, which is both time-consuming and labor-consuming, limiting the large-scale application of sememe. Researchers have proposed some sememe prediction methods to automatically predict sememes for words. However, existing sememe prediction methods focus on information of the word itself, ignoring the expert-annotated knowledge bases which indicate the relations between words and should value in sememe predication. Therefore, we aim at incorporating the expert-annotated knowledge bases into sememe prediction process. To achieve that, we propose a CilinE-guided sememe prediction model which employs an existing word knowledge base CilinE to remodel the sememe prediction from relational perspective. Experiments on HowNet, a widely used Chinese sememe knowledge base, have shown that CilinE has an obvious positive effect on sememe prediction. Furthermore, our proposed method can be integrated into existing methods and significantly improves the prediction performance. We will release the data and code to the public.

The mean, median, and mode are usually calculated from univariate observations as the most basic representative values of a random variable. To measure the spread of the distribution, the standard deviation, interquartile range, and modal interval are also calculated. When we analyze continuous relations between a pair of random variables from bivariate observations, regression analysis is often used. By minimizing appropriate costs evaluating regression errors, we estimate the conditional mean, median, and mode. The conditional standard deviation can be estimated if the bivariate observations are obtained from a Gaussian process. Moreover, the conditional interquartile range can be calculated for various distributions by the quantile regression that estimates any conditional quantile (percentile). Meanwhile, the study of the modal interval regression is relatively new, and spline regression models, known as flexible models having the optimality on the smoothness for bivariate data, are not yet used. In this paper, we propose a modal interval regression method based on spline quantile regression. The proposed method consists of two steps. In the first step, we divide the bivariate observations into bins for one random variable, then detect the modal interval for the other random variable as the lower and upper quantiles in each bin. In the second step, we estimate the conditional modal interval by constructing both lower and upper quantile curves as spline functions. By using the spline quantile regression, the proposed method is widely applicable to various distributions and formulated as a convex optimization problem on the coefficient vectors of the lower and upper spline functions. Extensive experiments, including settings of the bin width, the smoothing parameter and weights in the cost function, show the effectiveness of the proposed modal interval regression in terms of accuracy and visual shape for synthetic data generated from various distributions. Experiments for real-world meteorological data also demonstrate a good performance of the proposed method.

Increased demand for DNS privacy has driven the creation of several encrypted DNS protocols, such as DNS over HTTPS (DoH), DNS over TLS (DoT), and DNS over QUIC (DoQ). Recently, DoT and DoH have been deployed by some vendors like Google and Cloudflare. This paper addresses privacy leakage in these three encrypted DNS protocols (especially DoQ) with different DNS recursive resolvers (Google, NextDNS, and Bind) and DNS proxy (AdGuard). More particularly, we investigate encrypted DNS traffic to determine whether the adversary can infer the category of websites users visit for this purpose. Through analyzing packet traces of three encrypted DNS protocols, we show that the classification performance of the websites (i.e., user's privacy leakage) is very high in terms of identifying 42 categories of the websites both in public (Google and NextDNS) and local (Bind) resolvers. By comparing the case with cache and without cache at the local resolver, we confirm that the caching effect is negligible as regards identification. We also show that discriminative features are mainly related to the inter-arrival time of packets for DNS resolving. Indeed, we confirm that the F1 score decreases largely by removing these features. We further investigate two possible countermeasures that could affect the inter-arrival time analysis in the local resolver: AdBlocker and DNS prefetch. However, there is no significant improvement in results with these countermeasures. These findings highlight that information leakage is still possible even in encrypted DNS traffic regardless of underlying protocols (i.e., HTTPS, TLS, QUIC).