This paper presents a class-E power amplifier (PA) with a novel harmonic tuning circuit (HTC) based on composite right-/left-handed transmission lines (CRLH TLs). One of the issues of conventional harmonically tuned PAs is the limited PAE bandwidth. It is shown by simulation that class-E amplifiers have potential of maintaining high PAE over a wider frequency range than for example class-F amplifiers. To make full use of class-E amplifiers with the superior characteristics, an HTC using double CRLH TL stub structure is proposed. The HTC is not only compact but also enhances the inherently wide operation frequency range of class-E amplifier. A 2-GHz 6W GaN-HEMT class-E PA using the proposed HTC demonstrated a PAE bandwidth (≥65%) of 380MHz with maximum drain efficiency and PAE of 78.5% and 74.0%, respectively.

In this study, AM-PM compensation of the cross-coupled capacitance neutralization technique is discussed. Cgd neutralization leads to AM-PM compensation of a power amplifier with negligible change of AM-AM characteristics. AM-PM compensation was confirmed via circuit analysis and measurements. The formulation analysis showed that AM-PM compensation can be derived via gm variation against input power with capacitance neutralization. A differential power amplifier with capacitance neutralization was fabricated with GaN high-electron-mobility transistors. The AM-PM characteristic of the fabricated differential power amplifier was measured at 17.7 GHz. It showed AM-PM reduction of 22° at compared to a single-phase power amplifier without capacitance neutralization at output power of 35 dBm.

A light field (LF), which is represented as a set of dense, multi-view images, has been used in various 3D applications. To make LF acquisition more efficient, researchers have investigated compressive sensing methods by incorporating certain coding functionalities into a camera. In this paper, we focus on a challenging case called snapshot compressive LF imaging, in which an entire LF is reconstructed from only a single acquired image. To embed a large amount of LF information in a single image, we consider two promising methods based on rapid optical control during a single exposure: time-multiplexed coded aperture (TMCA) and coded focal stack (CFS), which were proposed individually in previous works. Both TMCA and CFS can be interpreted in a unified manner as extensions of the coded aperture (CA) and focal stack (FS) methods, respectively. By developing a unified algorithm pipeline for TMCA and CFS, based on deep neural networks, we evaluated their performance with respect to other possible imaging methods. We found that both TMCA and CFS can achieve better reconstruction quality than the other snapshot methods, and they also perform reasonably well compared to methods using multiple acquired images. To our knowledge, we are the first to present an overall discussion of TMCA and CFS and to compare and validate their effectiveness in the context of compressive LF imaging.

Crowdedness of buses is playing an increasingly important role in the disease control of COVID-19. The lack of a practical approach to sensing the crowdedness of buses is a major problem. This paper proposes a bus crowdedness sensing system which exploits deep learning-based object detection to count the numbers of passengers getting on and off a bus and thus estimate the crowdedness of buses in real time. In our prototype system, we combine YOLOv5s object detection model with Kalman Filter object tracking algorithm to implement a sensing algorithm running on a Jetson nano-based vehicular device mounted on a bus. By using the driving recorder video data taken from real bus, we experimentally evaluate the performance of the proposed sensing system to verify that our proposed system system improves counting accuracy and achieves real-time processing at the Jetson Nano platform.

A multibeam massive multiple input multiple output (MIMO) configuration employs beam selection with high power in the analog part and executes a blind algorithm such as the independent component analysis (ICA), which does not require channel state information in the digital part. Two-dimensional (2-D) multibeams are considered in actual power losses and beam steering errors regarding the multibeam patterns. However, the performance of these 2-D beams depends on the beam pattern of the multibeams, and they are not optimal multibeam patterns suitable for multibeam massive MIMO configurations. In this study, we clarify the performance difference due to the difference of the multibeam pattern and consider the multibeam pattern suitable for the system condition. Specifically, the optimal multibeam pattern was determined with the element spacing and beamwidth of the element directivity as parameters, and the effectiveness of the proposed method was verified via computer simulations.

We studied whether a statement similar to the Ghouila-Houri's theorem might hold for alternating orientations of cocomparability graphs. In this paper, we give the negative answer. We prove that it is NP-complete to decide whether a cocomparability graph has an orientation that is alternating and acyclic. Hence, cocomparability graphs with an acyclic alternating orientation form a proper subclass of alternately orientable cocomparability graphs. We also provide a separating example, that is, an alternately orientable cocomparability graph such that no alternating orientation is acyclic.

Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than the output. MPC based on a secret sharing scheme (SS-MPC) and garbled circuit (GC) is known as the most common MPC schemes. Another cryptographic method, homomorphic encryption (HE), computes an arbitrary function represented as a circuit by using ciphertexts without decrypting them. These technologies are in a trade-off relationship for the communication/round complexities, and the computation cost. The private decision tree evaluation (PDTE) is one of the key applications of these technologies. There exist several constant-round PDTE protocols based on GC, HE, or the hybrid schemes that are secure even if a malicious adversary who can deviate from protocol specifications corrupts some parties. There also exist other protocols based only on SS-MPC that are secure only if a semi-honest adversary who follows the protocol specification corrupts some parties. However, to the best of our knowledge, there are currently no constant-round PDTE protocols based only on SS-MPC that are secure against a malicious adversary. In this work, we propose a constant-round four-party PDTE protocol that achieves malicious security. Our protocol provides the PDTE securely and efficiently even when the communication environment has a large latency.

Running IoT applications on edge computing infrastructures has the benefits of low response times and efficient bandwidth usage. System verification on a testbed is required to deploy IoT applications in production environments. In a testbed, Docker containers are preferable for a smooth transition of tested application programs to production environments. In addition, the round-trip times (RTT) of Docker containers to clients must be ensured, according to the target application's response time requirements. However, in existing testbed systems, the RTTs between Docker containers and clients are not ensured. Thus, we must undergo a large amount of configuration data including RTTs between all pairs of wireless base station nodes and servers to set up a testbed environment. In this paper, we present an edge computing testbed system with simple application programming interfaces (API) for testbed users that ensures RTTs between Docker containers and clients. The proposed system automatically determines which servers to place Docker containers on according to virtual regions and the RTTs specified by the testbed users through APIs. The virtual regions provide reduced size information about the RTTs in a network. In the proposed system, the configuration data size is reduced to one divided by the number of the servers and the command arguments length is reduced to approximately one-third or less, whereas the increased system running time is 4.3s.

An interpretation method of inversion phenomena is newly proposed for backward transient scattered field components for both E- and H-polarizations when an ultra-wideband (UWB) pulse wave radiated from a line source is incident on a two-dimensional metal cylinder covered with a lossless dielectric medium layer (coated metal cylinder). A time-domain (TD) asymptotic solution, which is referred to as a TD saddle point technique (TD-SPT), is derived by applying the SPT in evaluating a backward transient scattered field which is expressed by an integral form. The TD-SPT is represented by a combination of a direct geometric optical ray (DGO) and a reflected GO (RGO) series, thereby being able to extract and calculate any backward transient scattered field component from a response waveform. The TD-SPT is useful in understanding the response waveform of a backward transient scattered field by a coated metal cylinder because it can give us the peak value and arrival time of any field component, namely DGO and RGO components, and interpret analytically inversion phenomenon of any field component. The accuracy, validity, and practicality of the TD-SPT are clarified by comparing it with two kinds of reference solutions.

In the online removable knapsack problem, a sequence of items, each labeled with its value and its size, is given one by one. At each arrival of an item, a player has to decide whether to put it into a knapsack or to discard it. The player is also allowed to discard some of the items that are already in the knapsack. The objective is to maximize the total value of the knapsack. Iwama and Taketomi gave an optimal algorithm for the case where the value of each item is equal to its size. In this paper we consider a case with an additional constraint that the capacity of the knapsack is a positive integer N and that the sizes of items are all integral. For each positive integer N, we design an algorithm and prove its optimality. It is revealed that the competitive ratio is not monotonic with respect to N.

Accurately describing user behaviors with appropriate sensors is always important when developing computing cost-effective systems. This paper employs datasets recorded for fine-grained reading detection using the J!NS MEME, an eye-wear device with electrooculography (EOG), accelerometer, and gyroscope sensors. We generate models for all possible combinations of the three sensors and employ self-supervised learning and supervised learning in order to gain an understanding of optimal sensor settings. The results show that only the EOG sensor performs roughly as well as the best performing combination of other sensors. This gives an insight into selecting the appropriate sensors for fine-grained reading detection, enabling cost-effective computation.

Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.

Almost-complementary pairs (ACPs) are sequence pairs whose autocorrelations sum up to zero at all but one non-zero time-shifts. Periodic ACPs (P-ACPs) display almost similar correlation properties to that of the periodic complementary pairs (PCPs). In this letter, we propose systematic constructions of quadriphase P-ACPs (QP-ACPs) from aperiodic (periodic) complementary pairs and almost perfect binary (quadriphase) sequences. The proposed construction gives QP-ACPs of new lengths which are not covered in the literature.

The application of compressed sensing (CS) theory to non-orthogonal multiple access (NOMA) systems has been investigated recently. As described in this paper, we propose a quality-of-service (QoS)-aware, low-complexity, CS-based user selection and power allocation scheme with adaptive resource block selection for downlink NOMA systems, where the tolerable interference threshold is designed mathematically to achieve a given QoS requirement by being relaxed to a constrained l1 norm optimization problem. The proposed scheme adopts two adaptive resource block (RB) selection algorithms that assign proper RB to user pairs, i.e. max-min channel assignment and two-step opportunistic channel assignment. Simulation results show that the proposed scheme is more effective at improving the user rate than other reference schemes while reducing the required complexity. The QoS requirement is approximately satisfied as long as the required QoS value is feasible.

A new software based in-situ training (SBIST) method to achieve high accuracies is proposed for binarized neural networks inference accelerator chips in which measured offsets in sense amplifiers (activation binarizers) are transformed into biases in the training software. To expedite this individual training, the initial values for the weights are taken from results of a common forming training process which is conducted in advance by using the offset fluctuation distribution averaged over the fabrication line. SPICE simulation inference results for the accelerator predict that the accuracy recovers to higher than 90% even when the amplifier offset is as large as 40mV only after a few epochs of the individual training.

A unified construction for yielding optimal and balanced quaternary sequences from ideal/optimal balanced binary sequences was proposed by Zeng et al. In this paper, the linear complexity over finite field 𝔽2, 𝔽4 and Galois ring ℤ4 of the quaternary sequences are discussed, respectively. The exact values of linear complexity of sequences obtained by Legendre sequence pair, twin-prime sequence pair and Hall's sextic sequence pair are derived.

Reservoir computing (RC) is an attractive alternative to machine learning models owing to its computationally inexpensive training process and simplicity. In this work, we propose EnsembleBloomCA, which utilizes cellular automata (CA) and an ensemble Bloom filter to organize an RC system. In contrast to most existing RC systems, EnsembleBloomCA eliminates all floating-point calculation and integer multiplication. EnsembleBloomCA adopts CA as the reservoir in the RC system because it can be implemented using only binary operations and is thus energy efficient. The rich pattern dynamics created by CA can map the original input into a high-dimensional space and provide more features for the classifier. Utilizing an ensemble Bloom filter as the classifier, the features provided by the reservoir can be effectively memorized. Our experiment revealed that applying the ensemble mechanism to the Bloom filter resulted in a significant reduction in memory cost during the inference phase. In comparison with Bloom WiSARD, one of the state-of-the-art reference work, the EnsembleBloomCA model achieves a 43× reduction in memory cost while maintaining the same accuracy. Our hardware implementation also demonstrated that EnsembleBloomCA achieved over 23× and 8.5× reductions in area and power, respectively.

A vertex subset I of a graph G is called a k-path vertex cover if every path on k vertices in G contains at least one vertex from I. The K-PATH VERTEX COVER RECONFIGURATION (K-PVCR) problem asks if one can transform one k-path vertex cover into another via a sequence of k-path vertex covers where each intermediate member is obtained from its predecessor by applying a given reconfiguration rule exactly once. We investigate the computational complexity of K-PVCR from the viewpoint of graph classes under the well-known reconfiguration rules: TS, TJ, and TAR. The problem for k=2, known as the VERTEX COVER RECONFIGURATION (VCR) problem, has been well-studied in the literature. We show that certain known hardness results for VCR on different graph classes can be extended for K-PVCR. In particular, we prove a complexity dichotomy for K-PVCR on general graphs: on those whose maximum degree is three (and even planar), the problem is PSPACE-complete, while on those whose maximum degree is two (i.e., paths and cycles), the problem can be solved in polynomial time. Additionally, we also design polynomial-time algorithms for K-PVCR on trees under each of TJ and TAR. Moreover, on paths, cycles, and trees, we describe how one can construct a reconfiguration sequence between two given k-path vertex covers in a yes-instance. In particular, on paths, our constructed reconfiguration sequence is shortest.

Parallel computing essentially consists of computation and communication and, in many cases, communication performance is vital. Many parallel applications use collective communications, which often dominate the performance of the parallel execution. This paper focuses on collective communication performance to speed-up the parallel execution. This paper firstly offers our experimental result that splitting a session of collective communication to small portions (slices) possibly enables efficient communication. Then, based on the results, this paper proposes a new concept cup-stacking with a genetic algorithm based methodology. The preliminary evaluation results reveal the effectiveness of the proposed method.

At present, the application of different types of memristors in electronics is being deeply studied. Given the nonlinearity characterizing memristors, a circuit with memristors cannot be treated by classical circuit analysis. In this paper, memristor is equivalent to a nonlinear dynamic system composed of linear dynamic system and nonlinear static system by Volterra series. The nonlinear transfer function of memristor is derived. In the complex frequency domain, the n-order complex frequency response of memristor is established by multiple Laplace transform, and the response of MLC parallel circuit is taken as an example to verify. Theoretical analysis shows that the complex frequency domain analysis method of memristor transforms the problem of solving nonlinear circuit in time domain into n times complex frequency domain analysis of linear circuit, which provides an idea for nonlinear dynamic system analysis.