Robert Chen-Hao CHANG Wei-Chih CHEN Shao-Che SU
A switching-based Li-ion battery charger without any additional compensation circuit is proposed. The proposed charger adopts a dual-current sensor and a current window control to ensure system stability in different charge modes: trickle current, constant current, and constant voltage. The proposed Li-ion battery charger has less chip area and a simpler structure to design than a conventional Li-ion battery charger with pulse width modulation. Simulation with a 1000µF capacitor as the battery equivalent, a 5V input, and a 1A charge current resulted in a charging time of 1.47ms and a 91% power efficiency.
Takashi IMAMURA Yukitoshi SANADA
In this paper, the application of minimum mean square error (MMSE) pre-cancellation prior to belief propagation (BP) is proposed as a detection scheme for overloaded multiple-input multiple-output (MIMO) systems. In overloaded MIMO systems, the loops in the factor graph degrade the demodulation performance of BP. Therefore, the proposed scheme applies MMSE pre-cancellation prior to BP and reduces the number of loops. Furthermore, it is applied to the selected transmit and receive nodes so that the condition number of an inverse matrix in the MMSE weight matrix is minimized to suppress the residual interference and the noise after MMSE pre-cancellation. Numerical results obtained through computer simulation show that the proposed scheme achieves better bit error rate (BER) performance than BP without MMSE pre-cancellation. The proposed scheme improves the BER performance by 2.9-5.6dB at a BER of 5.0×10-3 compared with conventional BP. Numerical results also show that MMSE pre-cancellation reduces the complexity of BP by a factor of 896 in terms of the number of multiplication operations.
The pervasive application of Small Private Online Course (SPOC) provides a powerful impetus for the reform of higher education. During the teaching process, a teacher needs to understand the difficulty of SPOC videos for students in real time to be more focused on the difficulties and key points of the course in a flipped classroom. However, existing educational data mining techniques pay little attention to the SPOC video difficulty clustering or classification. In this paper, we propose an approach to cluster SPOC videos based on the difficulty using video-watching data in a SPOC. Specifically, a bipartite graph that expresses the learning relationship between students and videos is constructed based on the number of video-watching times. Then, the SimRank++ algorithm is used to measure the similarity of the difficulty between any two videos. Finally, the spectral clustering algorithm is used to implement the video clustering based on the obtained similarity of difficulty. Experiments on a real data set in a SPOC show that the proposed approach has better clustering accuracy than other existing ones. This approach facilitates teachers learn about the overall difficulty of a SPOC video for students in real time, and therefore knowledge points can be explained more effectively in a flipped classroom.
Narihiro NAKAMOTO Toru TAKAHASHI Toru FUKASAWA Naofumi YONEDA Hiroaki MIYASHITA
This paper proposes a dual linear-polarized open-ended waveguide subarray designed for use in phased array antennas. The proposed subarray is a one-dimensional linear array that consists of open-ended waveguide antenna elements and suspended stripline feed networks to realize vertical and horizontal polarizations. The antenna includes a novel suspended stripline-to-waveguide transition that combines double- and quad-ridge waveguides to minimize the size of the transition and enhance the port isolation. Metal posts are installed on the waveguide apertures to eliminate scan-blindness. Prototype subarrays are fabricated and tested in an array of 16 subarrays. The experimental tests and numerical simulations indicate that the prototype subarray offers a low reflection coefficient of less than -11.4dB, low cross-polarization of less than -26dB, and antenna efficiency above 69% in the frequency bandwidth of 14%.
Akihito AIBA Minoru YOSHIDA Daichi KITAMURA Shinnosuke TAKAMICHI Hiroshi SARUWATARI
We studied an acoustic anomaly detection system for equipments, where the outlier detection method based on recorded sounds is used. In a real environment, the SNR of the target sound against background noise is low, and there is the problem that it is necessary to catch slight changes in sound buried in noise. In this paper, we propose a system in which a sound source extraction process is provided at the preliminary stage of the outlier detection process. In the proposed system, nonnegative matrix factorization based on generalized Gaussian distribution (GGD-NMF) is used as a sound source extraction process. We evaluated the improvement of the anomaly detection performance in a low-SNR environment. In this experiment, SNR capable of detecting an anomaly was greatly improved by providing GGD-NMF for preprocessing.
Yuanbo FANG Hongliang FU Huawei TAO Ruiyu LIANG Li ZHAO
Speech based deception detection using deep learning is one of the technologies to realize a deception detection system with high recognition rate in the future. Multi-network feature extraction technology can effectively improve the recognition performance of the system, but due to the limited labeled data and the lack of effective feature fusion methods, the performance of the network is limited. Based on this, a novel hybrid network model based on attentional multi-feature fusion (HN-AMFF) is proposed. Firstly, the static features of large amounts of unlabeled speech data are input into DAE for unsupervised training. Secondly, the frame-level features and static features of a small amount of labeled speech data are simultaneously input into the LSTM network and the encoded output part of DAE for joint supervised training. Finally, a feature fusion algorithm based on attention mechanism is proposed, which can get the optimal feature set in the training process. Simulation results show that the proposed feature fusion method is significantly better than traditional feature fusion methods, and the model can achieve advanced performance with only a small amount of labeled data.
Ke WANG Wei HENG Xiang LI Jing WU
Cognitive radio network (CRN) provides an effective way of improving efficiency and flexibility in spectrum usage. Due to the coexistence of secondary user (SU) and primary user (PU), managing interference is a critical issue to be addressed if we are to reap the full benefits. In this paper, we consider the problem of joint interference management and resource allocation in a multi-channel ad hoc CRN. We formulate the problem as an overlapping coalition formation game to maximize the sum rate of SU links while guaranteeing the quality of service (QoS) of PU links. In the game, each SU link can make an autonomous decision and is allowed to participate in one or more cooperative coalitions simultaneously to maximize its payoff. To obtain the solution of the formulated game, a distributed, self-organizing algorithm is proposed for performing coalition formation. We analyze the properties of the algorithm and show that SU links can cooperate to reach a final stable coalition structure. Compared with existing approaches, the proposed scheme achieves appreciable performance improvement in terms of the sum rate of SU links, which is demonstrated by simulation results.
Yuh YAMASHITA Haruka SUMITA Ryosuke ADACHI Koichi KOBAYASHI
This paper proposes a distributed observer on a sensor network, where communication on the network is randomly performed. This work is a natural extension of Kalman consensus filter approach to the cases involving random communication. In both bidirectional and unidirectional communication cases, gain conditions that guarantee improvement of estimation error convergence compared to the case with no communication are obtained. The obtained conditions are more practical than those of previous studies and give appropriate cooperative gains for a given communication probability. The effectiveness of the proposed method is confirmed by computer simulations.
Lin DU Chang TIAN Mingyong ZENG Jiabao WANG Shanshan JIAO Qing SHEN Wei BAI Aihong LU
Part based models have been proved to be beneficial for person re-identification (Re-ID) in recent years. Existing models usually use fixed horizontal stripes or rely on human keypoints to get each part, which is not consistent with the human visual mechanism. In this paper, we propose a Self-Channel Attention Weighted Part model (SCAWP) for Re-ID. In SCAWP, we first learn a feature map from ResNet50 and use 1x1 convolution to reduce the dimension of this feature map, which could aggregate the channel information. Then, we learn the weight map of attention within each channel and multiply it with the feature map to get each part. Finally, each part is used for a special identification task to build the whole model. To verify the performance of SCAWP, we conduct experiment on three benchmark datasets, including CUHK03-NP, Market-1501 and DukeMTMC-ReID. SCAWP achieves rank-1/mAP accuracy of 70.4%/68.3%, 94.6%/86.4% and 87.6%/76.8% on three datasets respectively.
Krittin INTHARAWIJITR Katsuyoshi IIDA Hiroyuki KOGA Katsunori YAMAOKA
The Internet of Things (IoT) with its support for cyber-physical systems (CPS) will provide many latency-sensitive services that require very fast responses from network services. Mobile edge computing (MEC), one of the distributed computing models, is a promising component of the low-latency network architecture. In network architectures with MEC, mobile devices will offload heavy computing tasks to edge servers. There exist numbers of researches about low-latency network architecture with MEC. However, none of the existing researches simultaneously satisfy the followings: (1) guarantee the latency of computing tasks and (2) implement a real system. In this paper, we designed and implemented an MEC based network architecture that guarantees the latency of offloading tasks. More specifically, we first estimate the total latency including computing and communication ones at the centralized node called orchestrator. If the estimated value exceeds the latency requirement, the task will be rejected. We then evaluated its performance in terms of the blocking probability of the tasks. To analyze the results, we compared the performance between obtained from experiments and simulations. Based on the comparisons, we clarified that the computing latency estimation accuracy is a significant factor for this system.
Mikio HASEGAWA Hirotake ITO Hiroki TAKESUE Kazuyuki AIHARA
Recently, new optimization machines based on non-silicon physical systems, such as quantum annealing machines, have been developed, and their commercialization has been started. These machines solve the problems by searching the state of the Ising spins, which minimizes the Ising Hamiltonian. Such a property of minimization of the Ising Hamiltonian can be applied to various combinatorial optimization problems. In this paper, we introduce the coherent Ising machine (CIM), which can solve the problems in a milli-second order, and has higher performance than the quantum annealing machines especially on the problems with dense mutual connections in the corresponding Ising model. We explain how a target problem can be implemented on the CIM, based on the optimization scheme using the mutually connected neural networks. We apply the CIM to traveling salesman problems as an example benchmark, and show experimental results of the real machine of the CIM. We also apply the CIM to several combinatorial optimization problems in wireless communication systems, such as channel assignment problems. The CIM's ultra-fast optimization may enable a real-time optimization of various communication systems even in a dynamic communication environment.
Offset quadrature amplitude modulation based orthogonal frequency division multiplexing (OFDM/OQAM) is a promising multi-carrier modulation technique to achieve a low-sidelobe spectrum while maintaining orthogonality among subcarriers. However, a major shortcoming of OFDM/OQAM systems is the high peak-to-average power ratio (PAPR) of the transmit signal. To resolve the high-PAPR issue of traditional OFDM, a self-synchronized-scrambler-based selected-mapping has been investigated, where the transmit sequence is scrambled to reduce PAPR. In this method, the receiver must use a descrambler to recover the original data. However, the descrambling process leads to error propagation, which degrades the bit error rate (BER). As described herein, a partial scrambling overlapped selected mapping (PS-OSLM) scheme is proposed for PAPR reduction of OFDM/OQAM signals, where candidate sequences are generated using partial scrambling of original data. The best candidate, the one that minimizes the peak amplitude within multiple OFDM/OQAM symbols, is selected. In the proposed method, an overlap search algorithm for SLM is applied to reduce the PAPR of OFDM/OQAM signals. Numerical results demonstrate that our PS-OSLM proposal achieves better BER than full-scrambling overlapped SLM (FS-OSLM) in OFDM/OQAM systems while maintaining almost equivalent PAPR reduction capability as FS-OSLM and better PAPR than SLM without overlap search. Additionally, we derive a theoretical lower bound expression for OFDM/OQAM with PS-OSLM, and clarify the effectiveness of the proposed scheme.
To reduce peak-to-average power ratio, we propose a method of choosing suitable vectors in a partial transmit sequence technique. Conventional approaches require that a suitable vector be selected from a large number of candidates. By contrast, our method does not include such a selecting procedure, and instead generates random vectors from the Gaussian distribution whose covariance matrix is a solution of a relaxed problem. The suitable vector is chosen from the random vectors. This yields lower peak-to-average power ratio than a conventional method.
Koichiro ITAKURA Akihiko HIRATA Masato SONODA Taiki HIGASHIMOTO Tadao NAGATSUMA Takashi TOMURA Jiro HIROKAWA Norihiko SEKINE Issei WATANABE Akifumi KASAMATSU
This paper presents a 120-GHz-band split ring resonator (SRR) bandstop filter whose insertion loss can be controlled by coupling another lattice pattern substrate. The SRR bandstop filter and lattice pattern substrate is composed of 200-µm-thick quartz substrate and 5-µm-thick gold patterns. S21 of the SRR bandstop filter is -37.8 dB, and its -10-dB bandwidth is 115-130 GHz. S21 of the SRR bandstop filter changes to -4.1 dB at 125 GHz by arranging the lattice pattern substrate in close proximity to the SRR stopband filter, because coupling between the SRR and the lattice pattern occurs when the SRR and lattice pattern are opposed in close proximity. It was found that 10 Gbit/s data transmission can be achieved by setting the lattice pattern substrate just above the SRR bandstop filter with a spacer thickness of 50 µm, even though data transmission is impossible when only the SRR bandstop filter is inserted between the transmitter and the receiver.
Yanyan LUO Guoping WANG Ming CAI Le ZHANG Zhaopan ZHANG
Electrical connectors are the basic components of the electric system in automobiles, aircrafts and ships to realize the current and electrical signal transmission. In the aviation electrical system, the electrical connectors are indispensable supporting devices accessories, which play important roles in connecting electrical system, monitoring and controlling equipment, and provide a guarantee for the reliable transmission of electrical signals between the aviation equipment and system. Whether aviation electrical connectors work reliably directly affects the safety and reliability of the entire aircraft aviation system. The random vibration of aircraft caused by turbulence during flight is one of the main factors affecting the contact performance of the electrical connectors. In this paper, the contacts of the circular four-slot three-pin electrical connectors were chosen as the research specimens. The theoretical model of the contact force for contacts of electrical connectors was established. The test method for contact force measurement was determined. According to the test scheme, the detecting device for the contact force and contact resistance of the electrical connectors was designed, and the turbulence test of the electrical connectors was carried out. Through the analysis of the test data, the influence rule of the turbulence degree, flight speed and flight height on the contact force and contact resistance of the aviation electrical connectors was obtained.
Ryoma SENDA Yoshiaki TAKATA Hiroyuki SEKI
It is well-known that pushdown systems (PDS) effectively preserve regularity. This property implies the decidability of the reachability problem for PDS and has been applied to automatic program verification. The backward regularity preservation property was also shown for an extension of PDS by adding registers. This paper aims to show the forward regularity preservation property. First, we provide a concise definition of the register model called register pushdown systems (RPDS). Second, we show the forward regularity preservation property of RPDS by providing a saturation algorithm that constructs a register automaton (RA) recognizing $post^{ast}_calP(L(calA))$ where $calA$ and $calP$ are a given RA and an RPDS, respectively, and $post^{ast}_calP$ is the forward image of the mapping induced by $calP$. We also give an example of applying the proposed algorithm to malware detection.
Hiroaki YAMAMOTO Hiroshi FUJIWARA
This paper presents a new method to translate a regular expression into a nondeterministic finite automaton (an NFA for short). Let r be a regular expression and let M be a Thompson automaton for r. We first introduce a labeled Thompson automaton defined by assigning two types of expressions which denote prefixes and suffixes of words in L(r) to each state of M. Then we give new ϵ-free NFAs constructed from a labeled Thompson automaton. These NFAs are called a prefix equation automaton and a suffix equation automaton. We show that a suffix equation automaton is isomorphic to an equation automaton defined by Antimirov. Furthermore we give an NFA called a unified equation automaton by joining two NFAs. Thus the number of states of a unified equation automaton can be smaller than that of an equation automaton.
Haichuan YANG Shangce GAO Rong-Long WANG Yuki TODO
In 2019, a completely new algorithm, spherical evolution (SE), was proposed. The brand new search style in SE has been proved to have a strong search capability. In order to take advantage of SE, we propose a novel method called the ladder descent (LD) method to improve the SE' population update strategy and thereafter propose a ladder spherical evolution search (LSE) algorithm. With the number of iterations increasing, the range of parent individuals eligible to produce offspring gradually changes from the entire population to the current optimal individual, thereby enhancing the convergence ability of the algorithm. Experiment results on IEEE CEC2017 benchmark functions indicate the effectiveness of LSE.
Muhammad MUDASIR QAZI Rana ASIF REHMAN Asadullah TARIQ Byung-Seo KIM
Information-centric networking (ICN) provides an alternative to the traditional end-to-end communication model of the current Internet architecture by focusing on information dissemination and information retrieval. Named Data Networking (NDN) is one of the candidates that implements the idea of ICN on a practical level. Implementing NDN in wireless sensor networks (WSNs) will bring all the benefits of NDN to WSNs, making them more efficient. By applying the NDN paradigm directly to wireless multi-hop ad-hoc networks, various drawbacks are observed, such as packet flooding due to the broadcast nature of the wireless channel. To cope with these problems, in this paper, we propose an Interest called the accumulation-based forwarding scheme, as well as a novel content store architecture to increase its efficiency in terms of storing and searching data packets. We have performed extensive simulations using the ndnSIM simulator. Experimental results showed that the proposed scheme performs better when compared to another scheme in terms of the total number of Interests, the content store search time, and the network lifetime.
Shuoyan LIU Enze YANG Kai FANG
Abnormal behavior detection is now a widely concerned research field, especially for crowded scenes. However, most traditional unsupervised approaches often suffered from the problem when the normal events in the scenario with large visual variety. This paper proposes a self-learning probabilistic Latent Semantic Analysis, which aims at taking full advantage of the high-level abnormal information to solve problems. We select the informative observations to construct the “reference events” from the training sets as a high-level guidance cue. Specifically, the training set is randomly divided into two separate subsets. One is used to learn this model, which is defined as the initialization sequence of “reference events”. The other aims to update this model and the the infrequent samples are chosen into the “reference events”. Finally, we define anomalies using events that are least similar to “reference events”. The experimental result demonstrates that the proposed model can detect anomalies accurately and robustly in the real-world crowd environment.