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.

Indoor free space optical (FSO) communication technology that provides high-speed connectivity to edge users is expected to be introduced in the near future mobile communication system, where the silicon photonics solid-state beam scanning device is a promising tool because of its low cost, long-term reliability, and other beneficial properties. However, the current two-dimensional beam scanning devices using grating coupler arrays have difficulty in increasing the transmission capacity because of bandwidth regulation. To solve the problem, we have introduced a broadband surface optical coupler, “elephant coupler,” which has great potential for combining wavelength and spatial division multiplexing technologies into the beam scanning device, as an alternative to grating couplers. The prototype port-selective silicon beam scanning device fabricated using a 300 mm CMOS pilot line achieved broadband optical beam emission with a 1 dB-loss bandwidth of 40 nm and demonstrated beam scanning using an imaging lens. The device has also exhibited free-space signal transmission of non-return-to-zero on-off-keying signals at 10 Gbps over a wide wavelength range of 60 nm. In this paper, we present an overview of the developed beam scanning device. Furthermore, the theoretical design guidelines for indoor mobile FSO communication are discussed.

The optical phased array (OPA) is an emerging non-mechanical device that enables high-speed beam steering by emitting precisely phase-controlled lightwaves from numerous optical antennas. In practice, however, it is challenging to drive all phase shifters on an OPA in a deterministic manner due to the inevitable fabrication-induced phase errors and crosstalk between the phase shifters. In this work, we fabricate a 16-element silicon photonic non-redundant OPA chip with integrated phase monitors and experimentally demonstrate accurate monitoring of the relative phases of light from each optical antenna. Under the beam steering condition, the optical phase retrieved from the on-chip phase monitors varies linearly with the steering angle, as theoretically expected.

One of cost-effective ways to increase the transmission capacity of current standard wavelength division multiplexing (WDM) transmission systems is to use a wavelength band other than the C-band to transmit in multi-band. We proposed the concept of multi-band system using wavelength conversion, which can simultaneously process signals over a wide wavelength range. All-optical wavelength conversion could be used to convert C-band WDM signals into other bands in a highly nonlinear fiber (HNLF) by four-wave mixing and allow to simultaneously transmit multiple WDM signals including other than the C-band, with only C-band transceivers. Wavelength conversion has been reported for various nonlinear waveguide materials other than HNLF. In such nonlinear materials, we noticed the possibility of wideband transmission by dispersion-tailored silicon-on-insulator (SOI) waveguides. Based on the CMOS process has high accuracy, it is expected that the chromatic dispersion fluctuation could be reduced in mass production. As a first step in the investigation of the broadness of wavelength conversion using SOI-based waveguides, we designed and fabricated dispersion-tailored 12 strip waveguides provided with an edge coupler at both ends. Each of the 12 waveguides having different widths and lengths and is connected to fibers via lensed fibers or by lenses. In order to characterize each waveguide, the pump-probe experimental setup was constructed using a tunable light source as pump and an unmodulated 96-ch C-band WDM test signal. Using this setup, we evaluate insertion loss, input power dependence, conversion bandwidth and conversion efficiency. We confirmed C-band test signal was converted to the S-band and the L-band using the same silicon waveguide with 3dB conversion bandwidth over 100-nm. Furthermore, an increased design tolerance of at least 90nm was confirmed for C-to-S conversion by shortening the waveguide length. It is confirmed that the wavelength converters using the nonlinear waveguide has sufficiently wide conversion bandwidth to enhance the multi-band WDM transmission system.

We propose a novel mode-multiplexed light source using angularly-multiplexed volume holograms. Mode division multiplexing beams can be generated from a simple transmitter that is made of a laser array, single lens, and volume holograms. Hologram media has low recording sensitivity; hence, using holograms in the communication band is difficult. However, a dual wavelength method that uses different wavelengths for recording and reading holograms can realize the volume holograms for the infrared region. The volume holograms for three spatial mode multiplexing are formed using a compact Michelson interferometer type recording setup; simultaneous generations of three modes were demonstrated using a fiber array or vertical cavity surface emitting laser array with the volume holograms. A low loss coupling of three modes to few-mode-fiber can be achieved through the precise design and recording of volume holograms. The simple and low-cost mode-multiplexed light source using the volume holograms has the potential to broaden the application of MDM.

The maximal independent set (MIS) problem is one of the most fundamental problems in the field of distributed computing. This paper focuses on the MIS problem with unreliable communication between processes in the system. We propose a relaxed notion of MIS, named almost MIS (ALMIS), and show that the loosely-stabilizing algorithm proposed in our previous work can achieve exponentially long holding time with logarithmic convergence time and space complexity regarding ALMIS, which cannot be achieved at the same time regarding MIS in our previous work.

An interconnection network is an inevitable component for constructing parallel computers. It connects computation nodes so that the nodes can communicate with each other. As a parallel computation essentially requires inter-node communication according to a parallel algorithm, the interconnection network plays an important role in terms of communication performance. This paper focuses on the collective communication that is frequently performed in parallel computation and this paper addresses the Cup-Stacking method that is proposed in our preceding work. The key issues of the method are splitting a large packet into slices, re-shaping the slice, and stacking the slices, in a genetic algorithm (GA) manner. This paper discusses extending the Cup-Stacking method by introducing additional items (genes) and proposes the extended Cup-Stacking method. Furthermore, this paper places comprehensive discussions on the drawbacks and further optimization of the method. Evaluation results reveal the effectiveness of the extended method, where the proposed method achieves at most seven percent improvement in duration time over the former Cup-Stacking method.

We assess how well the recently created MRI reconstruction technique, Multi-Resolution Convolutional Neural Network (MRCNN), performs in the core medical vision field (classification). The primary goal of MRCNN is to identify the best k-space undersampling patterns to accelerate the MRI. In this study, we use the Figshare brain tumor dataset for MRI classification with 3064 T1-weighted contrast-enhanced MRI (CE-MRI) over three categories: meningioma, glioma, and pituitary tumors. We apply MRCNN to the dataset, which is a method to reconstruct high-quality images from under-sampled k-space signals. Next, we employ the pre-trained VGG16 model, which is a Deep Neural Network (DNN) based image classifier to the MRCNN restored MRIs to classify the brain tumors. Our experiments showed that in the case of MRCNN restored data, the proposed brain tumor classifier achieved 92.79% classification accuracy for a 10% sampling rate, which is slightly higher than that of SRCNN, MoDL, and Zero-filling methods have 91.89%, 91.89%, and 90.98% respectively. Note that our classifier was trained using the dataset consisting of the images with full sampling and their labels, which can be regarded as a model of the usual human diagnostician. Hence our results would suggest MRCNN is useful for human diagnosis. In conclusion, MRCNN significantly enhances the accuracy of the brain tumor classification system based on the tumor location using under-sampled k-space signals.

In this study, we present a spherical style deformation algorithm to be applied on single component models that can deform the models with spherical style, while preserving the local details of the original models. Because 3D models have complex skeleton structures that consist of many components, the deformation around connections between each single component is complicated, especially preventing mesh self-intersections. To the best of our knowledge, there does not exist not only methods to achieve a spherical style in a 3D model consisting of multiple components but also methods suited to a single component. In this study, we focus on spherical style deformation of single component models. Accordingly, we propose a deformation method that transforms the input model with the spherical style, while preserving the local details of the input model. Specifically, we define an energy function that combines the as-rigid-as-possible (ARAP) method and spherical features. The spherical term is defined as l2-regularization on a linear feature; accordingly, the corresponding optimization can be solved efficiently. We also observed that the results of our deformation are dependent on the quality of the input mesh. For instance, when the input mesh consists of many obtuse triangles, the spherical style deformation method fails. To address this problem, we propose an optional deformation method based on convex hull proxy model as the complementary deformation method. Our proxy method constructs a proxy model of the input model and applies our deformation method to the proxy model to deform the input model by projection and interpolation. We have applied our proposed method to simple and complex shapes, compared our experimental results with the 3D geometric stylization method of normal-driven spherical shape analogies, and confirmed that our method successfully deforms models that are smooth, round, and curved. We also discuss the limitations and problems of our algorithm based on the experimental results.

The diffusion model has achieved success in generating and editing high-quality images because of its ability to produce fine details. Its superior generation ability has the potential to facilitate more detailed segmentation. This study presents a novel approach to segmentation tasks using an inverse heat dissipation model, a kind of diffusion-based models. The proposed method involves generating a mask that gradually shrinks to fit the shape of the desired segmentation region. We comprehensively evaluated the proposed method using multiple datasets under varying conditions. The results show that the proposed method outperforms existing methods and provides a more detailed segmentation.

In recent years, physical layer security (PLS), which utilizes the inherent randomness of wireless signals to perform encryption at the physical layer, has attracted attention. We propose chaos modulation as a PLS technique. In addition, a method for encryption using a special encoder of polar codes has been proposed (PLS-polar), in which PLS can be easily achieved by encrypting the frozen bits of a polar code. Previously, we proposed a chaos-modulated polar code transmission method that can achieve high-quality and improved-security transmission using frozen bit encryption in polar codes. However, in principle, chaos modulation requires maximum likelihood sequence estimation (MLSE) for demodulation, and a large number of candidates for MLSE causes characteristic degradation in the low signal-to-noise ratio region in chaos polar transmission. To address this problem, in this study, we propose a versatile frozen bit method for polar codes, in which the frozen bits are also used to reduce the number of MLSE candidates for chaos demodulation. The numerical results show that the proposed method shows a performance improvement by 1.7dB at a block error rate of 10-3 with a code length of 512 and a code rate of 0.25 compared with that of conventional methods. We also show that the complexity of demodulation can be reduced to 1/16 of that of the conventional method without degrading computational security. Furthermore, we clarified the effective region of the proposed method when the code length and code rate were varied.

In this research, we investigated the threshold voltage (VTH) control by partial polarization of metal-ferroelectric-semiconductor field-effect transistors (MFSFETs) with 5 nm-thick nondoped HfO2 gate insulator utilizing Kr-plasma sputtering for Pt gate electrode deposition. The remnant polarization (2Pr) of 7.2 μC/cm2 was realized by Kr-plasma sputtering for Pt gate electrode deposition. The memory window (MW) of 0.58 V was realized by the pulse amplitude and width of -5/5 V, 100 ms. Furthermore, the VTH of MFSFET was controllable by program/erase (P/E) input pulse even with the pulse width below 100 ns which may be caused by the reduction of leakage current with decreasing plasma damage.

We have proposed and demonstrated a device fabrication process of physically defined quantum dots utilizing electron beam lithography employing a negative-tone resist toward high-density integration of silicon quantum bits (qubits). The electrical characterization at 3.8K exhibited so-called Coulomb diamonds, which indicates successful device operation as single-electron transistors. The proposed device fabrication process will be useful due to its high compatibility with the large-scale integration process.

Question-answering tasks over structured knowledge (i.e., tables and graphs) require the ability to encode structural information. Traditional pre-trained language models trained on linear-chain natural language cannot be directly applied to encode tables and graphs. The existing methods adopt the pre-trained models in such tasks by flattening structured knowledge into sequences. However, the serialization operation will lead to the loss of the structural information of knowledge. To better employ pre-trained transformers for structured knowledge representation, we propose a novel structure-aware transformer (SATrans) that injects the local-to-global structural information of the knowledge into the mask of the different self-attention layers. Specifically, in the lower self-attention layers, SATrans focus on the local structural information of each knowledge token to learn a more robust representation of it. In the upper self-attention layers, SATrans further injects the global information of the structured knowledge to integrate the information among knowledge tokens. In this way, the SATrans can effectively learn the semantic representation and structural information from the knowledge sequence and the attention mask, respectively. We evaluate SATrans on the table fact verification task and the knowledge base question-answering task. Furthermore, we explore two methods to combine symbolic and linguistic reasoning for these tasks to solve the problem that the pre-trained models lack symbolic reasoning ability. The experiment results reveal that the methods consistently outperform strong baselines on the two benchmarks.

This paper proposes a fault-resilient ROS platform supporting rapid fault detection and recovery. The platform employs heartbeat-based fault detection and node replication-based recovery. Our prototype implementation on top of the ROS Melodic shows a great performance in evaluations with a Nvidia development board and an inverted pendulum device.

We propose a quantitative measurement technique of video forgery that eliminates the decision burden of subtle boundary between normal and tampered patterns. We also propose the automatic adjustment scheme of spatial and temporal target zones, which maximizes the abnormality measurement of forged videos. Evaluation shows that the proposed scheme provides manifest detection capability against both inter-frame and intra-frame forgeries.

The bin packing problem is a problem of finding an assignment of a sequence of items to a minimum number of bins, each of capacity one. An online algorithm for the bin packing problem is an algorithm that irrevocably assigns each item one by one from the head of the sequence. Gutin, Jensen, and Yeo (2006) considered a version in which all items are only of two different sizes and the online algorithm knows the two possible sizes in advance, and gave an optimal online algorithm for the case when the larger size exceeds 1/2. In this paper we provide an optimal online algorithm for some of the cases when the larger size is at most 1/2, on the basis of a framework that facilitates the design and analysis of algorithms.

Packet classification is used to determine the behavior of incoming packets in network devices according to defined rules. As it is achieved using a linear search on a classification rule list, a large number of rules will lead to longer communication latency. To solve this, the problem of finding the order of rules minimizing the latency has been studied. Misherghi et al. and Harada et al. have proposed a problem that relaxes to policy-based constraints. In this paper, we show that the Relaxed Optimal Rule Ordering (RORO) for the allowlist is NP-hard, and by reducing from this we show that RORO for the general rule list is NP-hard. We also propose a heuristic algorithm based on the greedy method for an allowlist. Furthermore, we demonstrate the effectiveness of our method using ClassBench, which is a benchmark for packet classification algorithms.

Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. Usually, PKI-based AKE schemes are designed to guarantee secrecy of the session key and mutual authentication. However, in practice, there are many cases where mutual authentication is undesirable such as in anonymous networks like Tor and Riffle, or difficult to achieve due to the certificate management at the user level such as the Internet. Goldberg et al. formulated a model of anonymous one-sided AKE which guarantees the anonymity of the client by allowing only the client to authenticate the server, and proposed a concrete scheme. However, existing anonymous one-sided AKE schemes are only known to be secure in the random oracle model. In this paper, we propose generic constructions of anonymous one-sided AKE in the random oracle model and in the standard model, respectively. Our constructions allow us to construct the first post-quantum anonymous one-sided AKE scheme from isogenies in the standard model.

Majority operation has been paid attention as a basic element of beyond-Moore devices on which logic functions are constructed from Majority elements and inverters. Several optimization methods are developed to reduce the number of elements on Majority-Inverter Graphs (MIGs) but more area and power reduction are required. The paper proposes a new exact synthesis method for MIG based on a new topological constraint using node levels. Possible graph structures are clustered by the levels of input nodes, and all possible structures can be enumerated efficiently in the exact synthesis compared with previous methods. Experimental results show that our method decreases the runtime up to 25.33% compared with the fence-based method, and up to 6.95% with the partial-DAG-based method. Furthermore, our implementation can achieve better performance in size optimization for benchmark suites.