Brain-computer interfaces (BCIs) have been used by users to convey their intentions directly with brain signals. For example, a spelling system that uses EEGs allows letters on a display to be selected. In comparison, previous studies have investigated decoding speech information such as syllables, words from single-trial brain signals during speech comprehension, or articulatory imagination. Such decoding realizes speech recognition with a relatively short time-lag and without relying on a display. Previous magnetoencephalogram (MEG) research showed that a template matching method could be used to classify three English sentences by using phase patterns in theta oscillations. This method is based on the synchronization between speech rhythms and neural oscillations during speech processing, that is, theta oscillations synchronized with syllabic rhythms and low-gamma oscillations with phonemic rhythms. The present study aimed to approximate this classification method to a BCI application. To this end, (1) we investigated the performance of the EEG-based classification of three Japanese sentences and (2) evaluated the generalizability of our models to other different users. For the purpose of improving accuracy, (3) we investigated the performances of four classifiers: template matching (baseline), logistic regression, support vector machine, and random forest. In addition, (4) we propose using novel features including phase patterns in a higher frequency range. Our proposed features were constructed in order to capture synchronization in a low-gamma band, that is, (i) phases in EEG oscillations in the range of 2-50 Hz from all electrodes used for measuring EEG data (all) and (ii) phases selected on the basis of feature importance (selected). The classification results showed that, except for random forest, most classifiers perform similarly. Our proposed features improved the classification accuracy with statistical significance compared with a baseline feature, which is a phase pattern in neural oscillations in the range of 4-8 Hz from the right hemisphere. The best mean accuracy across folds was 55.9% using template matching trained by all features. We concluded that the use of phase information in a higher frequency band improves the performance of EEG-based sentence classification and that this model is applicable to other different users.

This paper gives an overview on the design process of modulated metasurface (MTS) antennas and focus on their performance in terms of efficiency and bandwidth. The basic concept behind MTS antennas is that the MTS imposes the impedance boundary conditions (IBCs) seen by a surface wave (SW) propagating on it. The MTS having a spatially modulated equivalent impedance transforms the SW into a leaky wave with controlled amplitude, phase and polarization. MTS antennas are hence highly customizable in terms of performances by simply changing the IBCs imposed by the MTS, without affecting the overall structure. The MTS can be configured for high gain (high aperture efficiency) with moderate bandwidth, for wide bandwidth with moderate aperture efficiency, or for a trade-off performance for bandwidth and aperture efficiency. The design process herein described relies on a generalized form of the Floquet wave theorem adiabatically applied to curvilinear locally periodic IBCs. Several technological solutions can be adopted to implement the IBCs defined by the synthesis process, from sub-wavelength patches printed on a grounded slab at microwave frequencies, to a bed of nails structure for millimeter waves: in any case, the resulting device has light weight and a low profile.

Aimed at long-term monitoring of daily office conversations without recording the conversational content, a system is presented for estimating acoustic nonverbal information such as utterance duration, utterance frequency, and turn-taking. The system combines a sound localization technique based on the sound energy distribution with 16 beam-forming microphone-array modules mounted in the ceiling for reducing the influence of multiple sound reflection. Furthermore, human detection using a wide field of view camera is integrated to the system for more robust speaker estimation. The system estimates the speaker for each utterance and calculates nonverbal information based on it. An evaluation analyzing data collected over ten 12-hour workdays in an office with three assigned workers showed that the system had 72% speech segmentation detection accuracy and 86% speaker identification accuracy when utterances were correctly detected. Even with false voice detection and incorrect speaker identification and even in cases where the participants frequently made noise or where seven participants had gathered together for a discussion, the order of the amount of calculated acoustic nonverbal information uttered by the participants coincided with that based on human-coded acoustic nonverbal information. Continuous analysis of communication dynamics such as dominance and conversation participation roles through nonverbal information will reveal the dynamics of a group. The main contribution of this study is to demonstrate the feasibility of unconstrained long-term monitoring of daily office activity through acoustic nonverbal information.

We introduce a notion of watermarking for cryptographic functions and propose a concrete scheme for watermarking cryptographic functions. Informally speaking, a digital watermarking scheme for cryptographic functions embeds information, called a mark, into functions such as one-way functions and decryption functions of public-key encryption. There are two basic requirements for watermarking schemes. A mark-embedded function must be functionally equivalent to the original function. It must be difficult for adversaries to remove the embedded mark without damaging the original functionality. In spite of its importance and usefulness, there have only been a few theoretical works on watermarking for functions (or programs). Furthermore, we do not have rigorous definitions of watermarking for cryptographic functions and concrete constructions. To solve the problem above, we introduce a notion of watermarking for cryptographic functions and define its security. Furthermore, we present a lossy trapdoor function (LTF) based on the decisional bilinear Diffie-Hellman problem problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the symmetric external Diffie-Hellman assumption in the standard model. We use techniques of dual system encryption and dual pairing vector spaces (DPVS) to construct our watermarking scheme. This is a new application of DPVS.

Device-to-device (D2D) communication in cellular networks is defined as direct communication between two mobile users without traversing the base station (BS) or core network. D2D communication can occur on the cellular frequencies (i.e., inband) or unlicensed spectrum (i.e., outband). A high capacity IEEE 802.11-based outband device-to-device communication system for cellular networks is introduced in this paper. Transmissions in device-to-device connections are managed using our proposed medium access control (MAC) protocol. In the proposed MAC protocol, backoff window size is adjusted dynamically considering the current network status and utilizing an appropriate transmission attempt rate. We have considered both cases that the request to send/clear to send (RTS/CTS) mechanism is and is not used in our protocol design. Describing mechanisms for guaranteeing quality of service (QoS) and enhancing reliability of the system is another part of our work. Moreover, performance of the system in the presence of channel impairments is investigated analytically and through simulations. Analytical and simulation results demonstrate that our proposed system has high throughput, and it can provide different levels of QoS for its users.

Head action recognition, as a specific problem in action recognition, has been studied in this paper. Different from most existing researches, our head action recognition problem is specifically defined for the requirement of some practical applications. Based on our definition, we build a corresponding head action dataset which contains many challenging cases. For action recognition, we proposed a real-time head action recognition framework based on HOF and ELM. The framework consists of face detection based ROI determination, HOF feature extraction in ROI, and ELM based action prediction. Experiments show that our method achieves good accuracy and is efficient enough for practical applications.

Lighting constrained visible-light communications are expected as indoor communications of next generation. In lighting constrained visible-light communications, lighting devices are used not only for illuminating rooms but also for optical wireless communications. For lighting constrained visible-light communications, we have been proposed a variable N-parallel code-shift-keying (VN-CSK) using a modified prime sequence code (MPSC). The VN-CSK system using MPSC has not only a suppression function for reducing co-channel interference from neighboring lighting devices, but also a function for keeping constant data transmission regardless of dimming control. In this paper, the bit error rate (BER) of the VN-CSK system using MPSC is derived under an indoor visible-light communication channel by theoretical analysis. Moreover, we evaluate the BER performance for the brightness level (dimming control stage).

Spatially “Mt. Fuji” coupled (SFC) low density parity check (LDPC) codes are constructed as a chain of block LDPC codes. A difference between the SFC-LDPC codes and the original spatially coupled (SC) LDPC codes is code lengths of the underlying block LDPC codes. The code length of the block LDPC code at the middle of the chain is larger than that at the end of the chain. It is experimentally confirmed that the bit error probability in the error floor region of the SFC-LDPC code is lower than that of the SC-LDPC code whose code length and design rate are the same as those of the SFC-LDPC code. In this letter, we calculate the weight distribution of the SFC-LDPC code and try to explain causes of the low bit error rates of the SFC-LDPC code.

We propose an approach to allocate bandwidth for a satellite communications (SATCOM) system that includes the recent high-throughput satellite (HTS) with frequency flexibility. To efficiently operate the system, we manage the limited bandwidth resources available for SATCOM by employing a control method that allows the allocated bandwidths to exceed the communication demand of user terminals per HTS beam. To this end, we consider bandwidth allocation for SATCOM as an optimal control problem. Then, assuming that the model of communication requests is available, we propose an optimal control method by combining model predictive control and sparse optimization. The resulting control method enables the efficient use of the limited bandwidth and reduces the bandwidth loss and number of control actions for the HTS compared to a setup with conventional frequency allocation and no frequency flexibility. Furthermore, the proposed method allows to allocate bandwidth depending on various control objectives and beam priorities by tuning the corresponding weighting matrices. These findings were verified through numerical simulations by using a simple time variation model of the communication requests and predicted aircraft communication demand obtained from the analysis of actual flight tracking data.

Efficiency and flexibility of collections have a significant impact on the overall performance of applications. The current approaches to implement collections have two main drawbacks: (i) they limit the efficiency of collections and (ii) they have not adequate support for collection composition. So, when the efficiency and flexibility of collections is important, the programmer needs to implement them himself, which leads to the loss of reusability. This article presents neoCollection, a novel approach to encapsulate collections. neoCollection has several distinguishing features: (i) it can be applied on data elements efficiently and flexibly (ii) composition of collections can be made efficiently and flexibly, a feature that does not exist in the current approaches. In order to demonstrate its effectiveness, neoCollection is implemented as an extension to Java and C++.

Zero-difference balanced (ZDB) functions, which have many applications in coding theory and sequence design, have received a lot of attention in recent years. In this letter, based on two known classes of ZDB functions, a new class of ZDB functions, which is defined on the group (Z2e-1×Zn,+) is presented, where e is a prime and n=p1m1p2m2…pkmk, pi is odd prime satisfying that e|(pi-1) for any 1≤i≤k . In the case of gcd(2e-1,n)=1, the new constructed ZDB functions are cyclic.

Location information is essential to varieties of applications. It is one of the most important context to be detected by wireless distributed sensors, which is a key technology in Internet-of-Things. Fingerprint-based methods, which compare location unique fingerprints collected beforehand with the fingerprint measured from the target, have attracted much attention recently in both of academia and industry. They have been successfully used for many location-based applications. From the viewpoint of practical applications, in this paper, four different typical approaches of fingerprint-based radio emitter localization system are introduced with four different representative applications: localization of LTE smart phone used for anti-cheating in exams, indoor localization of Wi-Fi terminals, localized light control in BEMS using location information of occupants, and illegal radio localization in outdoor environments. Based on the different practical application scenarios, different solutions, which are designed to enhance the localization performance, are discussed in detail. To the best of the authors' knowledge, this is the first paper to give a guideline for readers about fingerprint-based localization system in terms of fingerprint selection, hardware architecture design and algorithm enhancement.

Card-based cryptographic protocols provide secure multi-party computations using a deck of physical cards. The most important primitive of those protocols is the shuffling operation, and most of the existing protocols rely on uniform cyclic shuffles (such as the random cut and random bisection cut) in which each possible outcome is equally likely and all possible outcomes constitute a cyclic subgroup. However, a couple of protocols with non-uniform and/or non-cyclic shuffles were proposed by Koch, Walzer, and Härtel at Asiacrypt 2015. Compared to the previous protocols, their protocols require fewer cards to securely produce a hidden AND value, although to implement of such unconventional shuffles appearing in their protocols remains an open problem. This paper introduces “pile-shifting scramble,” which can be a secure implementation of those shuffles. To implement such unconventional shuffles, we utilize physical cases that can store piles of cards, such as boxes and envelopes. Therefore, humans are able to perform the shuffles using these everyday objects. Furthermore, we show that a certain class of non-uniform and/or non-cyclic shuffles having two possible outcomes can be implemented by the pile-shifting scramble. This also implies that we can improve upon the known COPY protocol using three card cases so that the number of cases required can be reduced to two.

We consider a device-to-device (D2D) underlaid cellular network where D2D communications are allowed to share the same radio spectrum with cellular uplink communications for improving spectral efficiency. However, to protect the cellular uplink communications, the interference level received at a base station (BS) from the D2D communications needs to be carefully maintained below a certain threshold, and thus the BS coordinates the transmit power of the D2D links. In this paper, we investigate on-off power control for the D2D links, which is known as a simple but effective technique due to its low signaling overhead. We first investigate the optimal on-off power control algorithm to maximize the sum-rate of the D2D links, while satisfying the interference constraint imposed by the BS. The computational complexity of the optimal algorithm drastically increases with D2D link number. Thus, we also propose an on-off power control algorithm to significantly reduce the computational complexity, compared to the optimal on-off power control algorithm. Extensive simulations validate that the proposed algorithm significantly reduces the computational complexity with a marginal sum-rate offset from the optimal algorithm.

We present an explicit construction of a MAJn-2 °MAJn-2 circuit computing MAJn for every odd n≥7. This gives a partial solution to an open problem by Kulikov and Podolskii (Proc. of STACS 2017, Article No.49).

In historical learning, to grasp the causal relationship between historical events and to understand factors that bring about important events are significant for fostering the historical thinking. However, some students are not able to find historical events that have causal relationships. The view of observing the historical events is different among individuals, so it is not appropriate to define the historical events that have causal relationships and impose students to remember them. The students need to understand the definition of the causal relationships and find the historical events that satisfy the definition according to their viewpoints. The objective of this paper is to develop a support system for understanding the meaning of a causal relationship and creating causal relation graphs that represent the causal relationships between historical events. When historical events have a causal relationship, a state change caused by one event becomes the cause of the other event. To consider these state changes is critically important to connect historical events. This paper proposes steps for considering causal relationships between historical events by arranging the state changes of historical people along with them. It also develops the system that supports students to create the causal relation graph according to the state changes. In our system, firstly, the interface for arranging state changes of historical people according to the historical events is given. Then, the interface for drawing the causal relation graph of historical events is provided in which state changes are automatically indicated on the created links in the causal relation graph. By observing the indicated state changes on the links, students are able to check by themselves whether their causal relation graphs correctly represent the causal relationships between historical events.

In this paper, we posit that, in future mobile network, network softwarization will be prevalent, and it becomes important to utilize deep machine learning within network to classify mobile traffic into fine grained slices, by identifying application types and devices so that we can apply Quality-of-Service (QoS) control, mobile edge/multi-access computing, and various network function per application and per device. This paper reports our initial attempt to apply deep machine learning for identifying application types from actual mobile network traffic captured from an MVNO, mobile virtual network operator and to design the system for classifying it to application specific slices.

Non-volatile memories are a promising alternative to memory design but data stored in them still may be destructed due to crosstalk and radiation. The data stored in them can be restored by using error-correcting codes but they require extra bits to correct bit errors. One of the largest problems in non-volatile memories is that they consume ten to hundred times more energy than normal memories in bit-writing. It is quite necessary to reduce writing bits. Recently, a REC code (bit-write-reducing and error-correcting code) is proposed for non-volatile memories which can reduce writing bits and has a capability of error correction. The REC code is generated from a linear systematic error-correcting code but it must include the codeword of all 1's, i.e., 11…1. The codeword bit length must be longer in order to satisfy this condition. In this letter, we propose a method to generate a relaxed REC code which is generated from a relaxed error-correcting code, which does not necessarily include the codeword of all 1's and thus its codeword bit length can be shorter. We prove that the maximum flipping bits of the relaxed REC code is still limited theoretically. Experimental results show that the relaxed REC code efficiently reduce the number of writing bits.

We discuss our recent progress in photonic crystal nanocavity quantum dot lasers. We show how enhanced light matter interactions in the nanocavity lead to diverse and fascinating lasing phenomena that are in general inaccessible by conventional bulky semiconductor lasers. First, we demonstrate thresholdless lasing, in which any clear kink in the output laser curve does not appear. This is a result of near unity coupling of spontaneous emission into the lasing cavity mode, enabled by the strong Purcell effect supported in the nanocavity. Then, we discuss self-frequency conversion nanolasers, in which both near infrared lasing oscillation and nonlinear optical frequency conversion to visible light are simultaneously supported in the individual nanocavity. Owing to the tight optical confinement both in time and space, a high normalized conversion efficiency over a few hundred %/W is demonstrated. We also show that the intracavity nonlinear frequency conversion can be utilized to measure the statistics of the intracavity photons. These novel phenomena will be useful for developing various nano-optoelectronic devices with advanced functionalities.

The impedance expansion method (IEM), which has been previously proposed by the authors, is a circuit-modeling technique for electrically-very-small devices. This paper provides a new idea on the principle of undesired radiation in wireless power transfer systems by employing IEM. In particular, it is shown that the undesired radiation is due to equivalent infinitesimal dipoles and loops of the currents on the coils.