In Information-Centric Networking (ICN), different routing and caching schemes have been proposed to efficiently utilize in-network caches and reduce network traffic. Most of them assume that the popularity distribution of user-requested content is homogeneous. However, the actual popularity distribution measured on the Internet is reported to possess spatial and temporal localities, which can heavily affect caching performance in ICN. Breadcrumbs (BC) routing is a key solution to mitigate performance degradation due to spatial locality because of its ability to flexibly discover cached contents in the off-path. In this paper, we deeply investigate the spatial effects of BC by revealing where utilized cached contents are located, how BC discovers these contents, what kind of contents are found, and how BC fill in the locality gap of content popularity. We also focus on another time-dimension perspective, i.e., the temporal locality of content popularity, and conduct a comprehensive study of how BC routing can be adapted to the spatiotemporal locality of content popularity in ICN.

Japan encounters an urgent issue of “Carbon Neutrality” as a member of the international world and is required to make the action plans to accomplish this issue, i.e., the zero emission of CO2 by 2050. Our world must change the industries to adapt to the electrification based on the renewable powers. Microwave chemistry is a candidate of electrification of industries for the carbon neutrality on the conditions of usage of renewable energy power generation. This invited paper shows an example of “Microwave Pidgeon process” for smelting magnesium in which heating with burning fossil coals can be replaced with microwave energy for discussing how microwave technology should be developed for that purpose from both the academic and industrial sides.

We study the mixed-integer optimization (MIO) approach to feature subset selection in nonlinear kernel support vector machines (SVMs) for binary classification. To measure the performance of subset selection, we use the distance between two classes (DBTC) in a high-dimensional feature space based on the Gaussian kernel function. However, DBTC to be maximized as an objective function is nonlinear, nonconvex and nonconcave. Despite the difficulty of linearizing such a nonlinear function in general, our major contribution is to propose a mixed-integer linear optimization (MILO) formulation to maximize DBTC for feature subset selection, and this MILO problem can be solved to optimality using optimization software. We also derive a reduced version of the MILO problem to accelerate our MILO computations. Experimental results show good computational efficiency for our MILO formulation with the reduced problem. Moreover, our method can often outperform the linear-SVM-based MILO formulation and recursive feature elimination in prediction performance, especially when there are relatively few data instances.

Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It’s difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q + 1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].

Model-based sensorless control of permanent magnet synchronous motor (PMSM) is promising for high-speed operation to estimate motor state, which is the speed and the position of the rotor, via electric signals of the stator, beside the inevitable fact that estimation accuracy is degraded by electromagnet interference (EMI) from switching devices of the converter. In this paper, the simulation system based on Luenberger observer and phase-locked loop (PLL) has been established, analyzing impacts of EMI on motor state estimations theoretically, exploring influences of EMI with different cutoff frequency, rated speeds, frequencies and amplitudes. The results show that Luenberger observer and PLL have strong immunity, which enable PMSM can still operate stably even under certain degrees of interference. EMI produces sideband harmonics that enlarge pulsation errors of speed and position estimations. Additionally, estimation errors are positively correlated with cutoff frequency of low-pass filter and the amplitude of EMI, and negatively correlated with rated speed of the motor and the frequency of EMI.  When the frequency is too high, its effects on motor state estimations are negligible. This work contributes to the comprehensive understanding of how EMI affects motor state estimations, which further enhances practical application of sensorless PMSM.

In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely LONGEST INCREASING SUBSEQUENCE RECONFIGURATION. We give a polynomial-time algorithm for deciding whether there is a reconfiguration sequence between two longest increasing subsequences in a sequence. This implies that INDEPENDENT SET RECONFIGURATION and TOKEN SLIDING are polynomial-time solvable on permutation graphs, provided that the input two independent sets are largest among all independent sets in the input graph. We also consider a special case, where the underlying permutation graph of an input sequence is bipartite. In this case, we give a polynomial-time algorithm for finding a shortest reconfiguration sequence (if it exists).

A circular string formed by connecting the first and the last symbols of a string is one of the simplest sequence forms, and it has been used for many applications such as data compression and fragment assembly problem. A sufficient condition on the lengths of substrings with frequencies for reconstruction of an input circular binary string is shown. However, there are no detailed descriptions on the proof of the sufficient condition and reconstruction algorithm. In this paper, we prove a necessary and sufficient condition on the lengths of substrings with frequencies for reconstruction of the circular string. We show the length is shorter than that of previous study for some circular strings. For improving the length, we use minimal absent words (MAWs) for given substrings of length k, and we propose a new construction algorithm of MAWs of length h(>k) while a conventional construction algorithm of MAWs can construct MAWs of length l(≤k). Moreover, we propose reconstruction algorithm of an input circular string for given substrings satisfying the new condition.

Non-autoregressive generation has attracted more and more attention due to its fast decoding speed. Latent alignment objectives, such as CTC, are designed to capture the monotonic alignments between the predicted and output tokens, which have been used for machine translation and sentence summarization. However, our preliminary experiments revealed that CTC performs poorly on document abstractive summarization, where a high compression ratio between the input and output is involved. To address this issue, we conduct a theoretical analysis and propose Hierarchical Latent Alignment (HLA). The basic idea is a two-step alignment process: we first align the sentences in the input and output, and subsequently derive token-level alignment using CTC based on aligned sentences. We evaluate the effectiveness of our proposed approach on two widely used datasets XSUM and CNNDM. The results indicate that our proposed method exhibits remarkable scalability even when dealing with high compression ratios.

It is proven that many public-key cryptosystems would be broken by the quantum computer. The knapsack cryptosystem which is based on the subset sum problem has the potential to be a quantum-resistant cryptosystem. Murakami and Kasahara proposed a SOSI trapdoor sequence which is made by combining shifted-odd (SO) and super-increasing (SI) sequence in the modular knapsack cryptosystem. This paper firstly show that the key generation method could not achieve a secure density against the low-density attack. Second, we propose a high-density key generation method and confirmed that the proposed scheme is secure against the low-density attack.

Most existing multi-view subspace clustering approaches only capture the inter-view similarities between different views and ignore the optimal local geometric structure of the original data. To this end, in this letter, we put forward a novel method named shared latent embedding learning for multi-view subspace clustering (SLE-MSC), which can efficiently capture a better latent space. To be specific, we introduce a pseudo-label constraint to capture the intra-view similarities within each view. Meanwhile, we utilize a novel optimal graph Laplacian to learn the consistent latent representation, in which the common manifold is considered as the optimal manifold to obtain a more reasonable local geometric structure. Comprehensive experimental results indicate the superiority and effectiveness of the proposed method.

This paper proposes an adaptive mixing probability scheme for mixed Gibbs sampling (MGS) or MGS with maximum ratio combining (MRC) in multiple-input multiple-output (MIMO) demodulation. In the conventional MGS algorithm, the mixing probability is fixed. Thus, if a search point is captured by a local minimum, it takes a larger number of samples to escape. In the proposed scheme, the mixing probability is increased when a candidate transmit symbol vector is captured by a local minimum. Using the adaptive mixing probability, the numbers of candidate transmit symbol vectors searched by demodulation algorithms increase. The proposed scheme in MGS as well as MGS with MRC reduces an error floor level as compared with the conventional scheme. Numerical results obtained through computer simulation show that the bit error rates of the MGS as well as the MGS with MRC reduces by about 1/100 when the number of iterations is 100 in a 64×64 MIMO system.

A metasurface absorber capable of monitoring two-dimensional (2-d) electric field distributions has been developed, where a matrix of lumped resistors between surface patches formed on a mushroom-type structure works as a 2-d array of short dipole sensors. In this paper absorption and reflection of a spherical wave incident on the metasurface absorber are analyzed by numerical computation by the plane-wave spectrum (PWS) technique using 2-d Fourier analysis. The electromagnetic field of the spherical wave incident on the absorber surface is expanded into a large number of plane waves, for each of which the TE and TM reflection and absorption coefficients are applied. Then by synthesizing all the plane wave fields we obtain the spatial distributions of reflected and absorbed fields. The detailed formulation of the computation is described, and the computed field distributions are compared with those obtained by simulation and actual measurement when the spherical wave from a dipole is illuminated onto a metasurface absorber. It is demonstrated that the PWS technique is effective and efficient in obtaining the accurate field distributions of the spherical wave on and around the absorber. This is useful for evaluating the performance of the metasurface absorber to absorb and measure the spherical wave field distributions around an EM source.

In this paper, a nonlinear quantized precoding scheme for low-resolution digital-analog converters (DACs) in a massive multiple-input multiple-output (MIMO) system is proposed. The nonlinear quantized precoding determines transmit antenna outputs with a transmit symbol and channel state information. In a full-digital massive MIMO system, low-resolution DACs are used to suppress power consumption. Conventional precoding algorithms for low-resolution DACs do not optimize transmit antenna gains individually. Thus, in this paper, a precoding scheme that optimizes individual transmit antenna gains as well as the DAC outputs is proposed. In the proposed scheme, the subarray of massive MIMO antennas is treated virtually as a single antenna element. Numerical results obtained through computer simulation show that the proposed precoding scheme achieves bit error rate performance close to that of the conventional precoding scheme with much smaller antenna gains on a CDL-A channel.

We evaluated the energy efficiency per 1-bit transmission of an optical light source on InP substrate to achieve optical interconnection. A semiconductor optical amplifier (SOA) assisted extended reach EADFB laser (AXEL) was utilized as the optical light source to enhance the energy efficiency compared to the conventional electro-absorption modulator integrated with a DFB laser (EML). The AXEL has frequency bandwidth extendibility for operation of over 100Gbit/s, which is difficult when using a vertical cavity surface emitting laser (VCSEL) without an equalizer. By designing the AXEL for low power consumption, we were able to achieve 64-Gbit/s, 1.0pJ/bit and 128-Gbit/s, 1.5pJ/bit operation at 50°C with the transmitter dispersion and eye closure quaternary of 1.1dB.

A high-efficiency uniform/selective heating microwave oven was developed. Because the power amplifier requires high-efficiency characteristics to function as a microwave source, a free-standing Gallium Nitride (GaN) substrate was applied in this study. By applying a harmonic tuning circuit, an output power of 71 W and PAE of 73% were achieved in pulsed operation, and an output power of 63 W and PAE of 69% were achieved in CW operation. Moreover, we fabricated a prototype PA module that consists of an oscillator, a driver amplifier, PA, and other RF circuits. The output power was controlled by pulse width modulation to maintain high efficiency regardless of output power. We evaluated the arrangement of antenna polarizations to isolate each antenna. By suppressing the interference of output from adjacent antennas, it is possible to irradiate the object on the top surface of the antenna, thereby demonstrating heating characteristics with small temperature unevenness. The prototype microwave oven successfully demonstrated uniform/selective heating.

This paper provides a new method to implement substrate integrated defected ground structure (SIDGS)-based bandpass filter (BPF) with adjustable frequency and controllable bandwidth. Compared with previous literature, this method implements a new SIDGS-like resonator capable of tunable frequency in the same plane as the slotted line using a varactor diode, increasing the design flexibility. In addition, the method solves the problem that the tunable BPF constituted by the SIDGS resonator cannot control the bandwidth by introducing a T-shaped non-resonant unit. The theoretical design method and the structural design are shown. Moreover, the configured structure is fabricated and measured to show the validity of the design method in this paper.

For any m strings of total length n, we propose an O(mn log n)-time, O(n)-space algorithm that finds a maximal common subsequence of all the strings, in the sense that inserting any character in it no longer yields a common subsequence of them. Such a common subsequence could be treated as indicating a nontrivial common structure we could find in the strings since it is NP-hard to find any longest common subsequence of the strings.

We experimentally evaluated transmission characteristics of 120-GHz-band close-proximity wireless link that employs a split-ring resonator (SRR) millimeter-wave (MMW) absorber integrated on planar slot antennas in 120-GHz-band close-proximity wireless links. We fabricated the SRR MMW absorber made of a 0.28-μm-thick TaN film on a quartz substrate, and integrated it on planar single slot antennas. When the TaN SRRs are not integrated on the planar slot antennas, multiple reflections between the two antennas occur, and a >10-dB fluctuation of S21 at 100-140GHz is observed. When the TaN SRRs are integrated on the planar antennas, the fluctuation of S21 is suppressed to be 3.5dB at 100-140GHz. However, the transmittance of the close-proximity wireless link decreases by integrating TaN SRRs on the planar slot antenna because of reflection at the quartz substrate surface. The integration of the radiator that is composed of single SRR with two capacitors just above the slot antenna increased S21 by 3.5dB at 125GHz. We conducted a data transmission experiment over a close-proximity wireless link that employs radiator-and-TaN-SRR-integrated slot antennas for Tx and Rx, and succeeded to transmit 10-Gbit/s data over the close-proximity wireless link for the first time.

This paper introduces significant improvements over the existing cryptanalysis approaches on Salsa20 and ChaCha stream ciphers. For the first time, we reduced the attack complexity on Salsa20/8 to the lowest possible margin. We introduced an attack on ChaCha7.25. It is the first attack of its type on ChaCha7.25/20. In our approach, we studied differential cryptanalysis of the Salsa20 and ChaCha stream ciphers based on a comprehensive analysis of probabilistic neutral bits (PNBs). The existing differential cryptanalysis approaches on Salsa20 and ChaCha stream ciphers first study the differential bias at specific input and output differential positions and then search for probabilistic neutral bits. However, the differential bias and the set of PNBs obtained in this method are not always the ideal combination to conduct the attack against the ciphers. The researchers have not focused on the comprehensive analysis of the probabilistic neutrality measure of all key bits concerning all possible output difference positions at all possible internal rounds of Salsa20 and ChaCha stream ciphers. Moreover, the relationship between the neutrality measure and the number of inverse quarter rounds has not been scrutinized yet. To address these study gaps, we study the differential cryptanalysis based on the comprehensive analysis of probabilistic neutral bits on the reduced-round Salsa20 and ChaCha. At first, we comprehensively analyze the neutrality measure of 256 key bits positions. Afterward, we select the output difference bit position with the best average neutrality measure and look for the corresponding input differential with the best differential bias. Considering all aspects, we present an attack on Salsa20/8 with a time complexity of 2241.62 and data complexity of 231.5, which is the best-known single bit differential attack on Salsa20/8 and then, we introduced an attack on ChaCha7.25 rounds with a time complexity of 2254.011 and data complexity of 251.81.

Sidon space is an important tool for constructing cyclic subspace codes. In this letter, we construct some Sidon spaces by using primitive elements and the roots of some irreducible polynomials over finite fields. Let q be a prime power, k, m, n be three positive integers and $ ho= lceil rac{m}{2k} ceil-1$, $ heta= lceil rac{n}{2m} ceil-1$. Based on these Sidon spaces and the union of some Sidon spaces, new cyclic subspace codes with size $rac{3(q^{n}-1)}{q-1}$ and $rac{ heta ho q^{k}(q^{n}-1)}{q-1}$ are obtained. The size of these codes is lager compared to the known constructions from [14] and [10].