Fanxin ZENG Xiping HE Guixin XUAN Zhenyu ZHANG Yanni PENG Li YAN
In an OFDM communication system using quadrature amplitude modulation (QAM) signals, peak envelope powers (PEPs) of the transmitted signals can be well controlled by using QAM Golay complementary sequence pairs (CSPs). In this letter, by making use of a new construction, a family of new 16-QAM Golay CSPs of length N=2m (integer m≥2) with binary inputs is presented, and all the resultant pairs have the PEP upper bound 2N. However, in the existing such pairs from other references their PEP upper bounds can arrive at 3.6N when the worst case happens. In this sense, novel pairs are good candidates for OFDM applications.
Guizhong ZHANG Baoxian WANG Zhaobo YAN Yiqiang LI Huaizhi YANG
In this work, we present one novel rust detection method based upon one-class classification and L2 sparse representation (SR) with decision fusion. Firstly, a new color contrast descriptor is proposed for extracting the rust features of steel structure images. Considering that the patterns of rust features are more simplified than those of non-rust ones, one-class support vector machine (SVM) classifier and L2 SR classifier are designed with these rust image features, respectively. After that, a multiplicative fusion rule is advocated for combining the one-class SVM and L2 SR modules, thereby achieving more accurate rust detecting results. In the experiments, we conduct numerous experiments, and when compared with other developed rust detectors, the presented method can offer better rust detecting performances.
We consider a property about a result of non-negative matrix factorization under a parallel moving of data points. The shape of a cloud of original data points and that of data points moving parallel to a vector are identical. Thus it is sometimes required that the coefficients to basis vectors of both data points are also identical from the viewpoint of classification. We show a necessary and sufficient condition for such an invariance property under a translation of the data points.
Yongzheng ZHAN Qingsheng HU Yinhang ZHANG
This paper analyzes the effect of error propagation of decision feedback equalizer (DFE) for PAM4 based 400Gb/s Ethernet. First, an analytic model for the error propagation is proposed to estimate the probability of different burst error length due to error propagation for PAM4 link system with multi-tap TX FFE (Feed Forward Equalizer) + RX DFE architecture. After calculating the symbol error rate (SER) and bit error rate (BER) based on the probability model, the theoretical analysis about the impact of different equalizer configurations on BER is compared with the simulation results, and then BER performance with FEC (Forward Error Correction) is analyzed to evaluate the effect of DFE error propagation on PAM4 link. Finally, two FEC interleaving schemes, symbol and bit interleaving, are employed in order to reduce BER further and then the theoretical analysis and the simulation result of their performance improvement are also evaluated. Simulation results show that at most 0.52dB interleaving gain can be achieved compared with non-interleaving scheme just at a little cost in storing memory and latency. And between the two interleaving methods, symbol interleaving performs better compared with the other one from the view of tradeoff between the interleaving gain and the cost and can be applied for 400Gb/s Ethernet.
Yusaku ITO Yojiro MORI Hiroshi HASEGAWA Ken-ichi SATO
A novel coarse and fine hybrid granular routing network architecture is proposed. Virtual direct links (VDLs) defined by the coarse granular routing to bridge distant node pairs, and routing via VDL mitigate the spectrum narrowing caused by optical filtering at wavelength-selective switches in ROADM (Reconfigurable Optical Add/Drop Multiplexing) nodes. The impairment mitigation yields denser channel accommodation in the frequency domain, which substantially increases fiber spectral efficiency. The proposed network simultaneously utilizes fine granular optical path level routing so that optical paths can be effectively accommodated in VDLs. The newly developed network design algorithm presented in this paper effectively implements routing and spectrum assignment to paths in addition to optimizing VDL establishment and path accommodation to VDLs. The effectiveness of the proposed architecture is demonstrated through both numerical and experimental evaluations; the number of fibers necessary in a network, and the spectrum bandwidth and hop count product are, respectively, reduced by up to 18% and increased by up to 111%.
Jun-ichiro SUGISAKA Takashi YASUI Koichi HIRAYAMA
A method to reconstruct the surface shape of a scatterer from the relative intensity of the scattered field is proposed. Reconstruction of the scatterer shape has been studied as an inverse problem. An approach that employs boundary-integral equations can determine the scatterer shape with low computation resources and high accuracy. In this method, the reconstruction process is performed so that the error between the measured far field of the sample and the computed far field of the estimated scatterer shape is minimized. The amplitude of the incident wave at the sample is required to compute the scattered field of the estimated shape. However, measurement of the incident wave at the sample (measurement without the sample) is inconvenient, particularly when the output power of the wave source is temporally unstable. In this study, we improve the reconstruction method with boundary-integral equations for practical use and expandability to various types of samples. First, we propose new boundary-integral equations that can reconstruct the sample shape from the relative intensity at a finite distance. The relative intensity is independent from the amplitude of the incident wave, and the reconstruction process can be performed without measuring the incident field. Second, the boundary integral equation for reconstruction is discretized with boundary elements. The boundary elements can flexibly discretize various shapes of samples, and this approach can be applied to various inverse scattering problems. In this paper, we present a few reconstruction processes in numerical simulations. Then, we discuss the reason for slow-convergence conditions and introduce a weighting coefficient to accelerate the convergence. The weighting coefficient depends on the distance between the sample and the observation points. Finally, we derive a formula to obtain an optimum weighting coefficient so that we can reconstruct the surface shape of a scatterer at various distances of the observation points.
Vasileios KOULIARIDIS Konstantia BARMPATSALOU Georgios KAMBOURAKIS Shuhong CHEN
Modern mobile devices are equipped with a variety of tools and services, and handle increasing amounts of sensitive information. In the same trend, the number of vulnerabilities exploiting mobile devices are also augmented on a daily basis and, undoubtedly, popular mobile platforms, such as Android and iOS, represent an alluring target for malware writers. While researchers strive to find alternative detection approaches to fight against mobile malware, recent reports exhibit an alarming increase in mobile malware exploiting victims to create revenues, climbing towards a billion-dollar industry. Current approaches to mobile malware analysis and detection cannot always keep up with future malware sophistication [2],[4]. The aim of this work is to provide a structured and comprehensive overview of the latest research on mobile malware detection techniques and pinpoint their benefits and limitations.
Andros TJANDRA Sakriani SAKTI Satoshi NAKAMURA
Recurrent Neural Network (RNN) has achieved many state-of-the-art performances on various complex tasks related to the temporal and sequential data. But most of these RNNs require much computational power and a huge number of parameters for both training and inference stage. Several tensor decomposition methods are included such as CANDECOMP/PARAFAC (CP), Tucker decomposition and Tensor Train (TT) to re-parameterize the Gated Recurrent Unit (GRU) RNN. First, we evaluate all tensor-based RNNs performance on sequence modeling tasks with a various number of parameters. Based on our experiment results, TT-GRU achieved the best results in a various number of parameters compared to other decomposition methods. Later, we evaluate our proposed TT-GRU with speech recognition task. We compressed the bidirectional GRU layers inside DeepSpeech2 architecture. Based on our experiment result, our proposed TT-format GRU are able to preserve the performance while reducing the number of GRU parameters significantly compared to the uncompressed GRU.
Yuta HASEGAWA Takafumi KANAZAWA
The demand response is attracting attention to perform electric power load leveling. In this paper, we consider a power consumption reduction problem with an aggregator that requests electric power consumption reduction to consumers by allocating a part of its profit to them as an incentive. We formulate interactions among consumers as a game, where the incentive to each consumer is determined by his/her contribution to the total power consumption reduction, and the consumer determines his/her own reduction amount selfishly to maximize his/her payoff. The uniqueness of best responses of each consumer and an equilibrium condition of the game are also derived. By using numerical simulations, we show relationship among incentive allocation rate, realized total reduction amount through the game, and the aggregator's payoff for the cases with the for-profit and the nonprofit aggregator.
Possible functional roles of the phase resetting control during rhythmic movements have been attracting much attention in the field of robotics. The phase resetting control is a control mechanism in which the phase shift of periodic motion is induced depending on the timing of a given perturbation, leading to dynamical stability such as a rapid transition from an unstable state to a stable state in rhythmic movements. A phase response curve (PRC) is used to quantitatively evaluate the phase shift in the phase resetting control. It has been demonstrated that an optimal PRC for bipedal walking becomes bimodal. The PRCs acquired by reinforcement learning in simulated biped walking are qualitatively consistent with measured results obtained from experiments. In this study, we considered how such characteristics are obtained from a mathematical point of view. First, we assumed a symmetric Bonhoeffer-Van der Pol oscillator and phase excitable element known as an active rotator as a model of the central pattern generator for controlling rhythmic movements. Second, we constructed feedback control systems by combining them with manipulators. Next, we numerically computed the PRCs of such systems and compared the resulting PRCs. Furthermore, we approximately calculated analytical solutions of the PRCs. Based on the results, we systematically investigated the parameter dependence of the analytical PRCs. Finally, we investigated the requirements for realizing an optimal PRC for the phase resetting control during rhythmic movements.
Naoki HAYASHI Yuichi KAJIYAMA Shigemasa TAKAI
This paper proposes a distributed algorithm over quantized communication networks for unconstrained optimization with smooth cost functions. We consider a multi-agent system whose local communication is represented by a fixed and connected graph. Each agent updates a state and an auxiliary variable for the estimates of the optimal solution and the average gradient of the entire cost function by a consensus-based optimization algorithm. The state and the auxiliary variable are sent to neighbor agents through a uniform quantizer. We show a convergence rate of the proposed algorithm with respect to the errors between the cost at the time-averaged state and the optimal cost. Numerical examples show that the estimated solution by the proposed quantized algorithm converges to the optimal solution.
Shun ANDOH Koichi KOBAYASHI Yuh YAMASHITA
Pinning control of multi-agent systems is a method that the external control input is added to some agents (pinning nodes), e.g., leaders. By the external control input, consensus to a certain target value and faster consensus are achieved. In this paper, we propose a new method of self-triggered predictive pinning control for the consensus problem. Self-triggered control is a method that both the control input and the next update time are calculated. Using self-triggered control, it is expected that the communication cost can be reduced. First, a new finite-time optimal control problem used in self-triggered control is formulated, and its solution method is derived. Next, as an on-line algorithm, two methods, i.e., the multi-hop communication-based method and the observer-based method are proposed. Finally, numerical examples are presented.
Yuma ABE Masaki OGURA Hiroyuki TSUJI Amane MIURA Shuichi ADACHI
Satellite communications (SATCOM) systems play important roles in wireless communication systems. In the future, they will be required to accommodate rapidly increasing communication requests from various types of users. Therefore, we propose a framework for efficient resource management in large-scale SATCOM systems that integrate multiple satellites. Such systems contain hundreds of thousands of communication satellites, user terminals, and gateway stations; thus, our proposed framework enables simpler and more reliable communication between users and satellites. To manage and control this system efficiently, we formulate an optimization problem that designs the network structure and allocates communication resources for a large-scale SATCOM system. In this mixed integer programming problem, we allow the cost function to be a combination of various factors so that SATCOM operators can design the network according to their individual management strategies. These factors include the total allocated bandwidth to users, the number of satellites and gateway stations to be used, and the number of total satellite handovers. Our numerical simulations show that the proposed management strategy outperforms a conventional strategy in which a user can connect to only one specific satellite determined in advance. Furthermore, we determine the effect of the number of satellites in the system on overall system performance.
Kenya KONDO Hiroki TAMURA Koichi TANNO
In this paper, we propose the low voltage CMOS current mode reference circuit using self-regulator with adaptive biasing technique. It drastically reduces the line sensitivity (LS) of the output voltage and the power supply voltage dependence of the temperature coefficient (TC). The self-regulator used in the proposed circuit adaptively generates the minimum voltage required the reference core circuit following the PVT (process, voltage and temperature) conditions. It makes possible to improve circuit performances instead of slightly increasing minimum power supply voltage. This proposed circuit has been designed and evaluated by SPICE simulation using TSMC 65nm CMOS process with 3.3V (2.5V over-drive) transistor option. From simulation results, LS is reduced to 0.0065%/V under 0.8V < VDD < 3.0V. TC is 67.6ppm/°C under the condition that the temperature range is from -40°C to 125°C and VDD range is from 0.8V to 3.0V. The power supply rejection ratio (PSRR) is less than -80.4dB when VDD is higher than 0.8V and the noise frequency is 100Hz. According to the simulation results, we could confirm that the performances of the proposed circuit are improved compared with the conventional circuit.
Hau Sim CHOO Chia Yee OOI Michiko INOUE Nordinah ISMAIL Mehrdad MOGHBEL Chee Hoo KOK
Register-transfer-level (RTL) information is hardly available for hardware Trojan detection. In this paper, four RTL Trojan features related to branching statement are proposed. The Minimum Redundancy Maximum Relevance (mRMR) feature selection is applied to the proposed Trojan features to determine the recommended feature combinations. The feature combinations are then tested using different machine learning concepts in order to determine the best approach for classifying Trojan and normal branches. The result shows that a Decision Tree classification algorithm with all the four proposed Trojan features can achieve an average true positive detection rate of 93.72% on unseen test data.
Satoshi MIZUTANI Xufeng ZHAO Toshio NAKAGAWA
When a unit repeats some works over again and undergoes minimal repairs at failures, it is more practical to replace it preventively at the end of working cycles or at its failure times. In this case, it would be an interesting problem to know which is better to replace the unit at a number of working cycles or at random failures from the point of cost. For this purpose, we give models of the expected cost rates for the following replacement policies: (1) The unit is replaced at a working cycle N and at a failure number K, respectively; (2) Replacement first and last policies with working cycle N and failure number K, respectively; (3) Replacement overtime policies with working cycle N and failure number K, respectively. Optimizations and comparisons of the policies for N and K are made analytically and numerically.
S-shaped nonlinearity is found in the electrical resistance-length relationship in an electroactive supercoiled polymer artificial muscle. The modulation of the electrical resistance is mainly caused by the change in the contact condition of coils in the artificial muscle upon deformation. A mathematical model based on logistic function fairly reproduces the experimental data of electrical resistance-length relationship.
You Zhu LI Yong Qiang JIA Hong Shu LIAO
Radio signals show small characteristic differences between radio transmitters resulted from their idiosyncratic hardware properties. Based on the parameters estimation of transmitter imperfections, a novel radiometric identification method is presented in this letter. The fingerprint features of the radio are extracted from the mismatches of the modulator and the nonlinearity of the power amplifier, and used to train a support vector machine classifier to identify the class label of a new data. Experiments on real data sets demonstrate the validation of this method.
Yoshinao MIZUGAKI Makoto MORIBAYASHI Tomoki YAGAI Masataka MORIYA Hiroshi SHIMADA Ayumi HIRANO-IWATA Fumihiko HIROSE
Gold nanoparticles (GNPs) are often used as island electrodes of single-electron (SE) devices. One of technical challenges in fabrication of SE devices with GNPs is the placement of GNPs in a nanogap between two lead electrodes. Utilization of dielectrophoresis (DEP) phenomena is one of possible solutions for this challenge, whereas the fabrication process with DEP includes stochastic aspects. In this brief paper, we present our experimental results on electric resistance of GNP arrays assembled by DEP. More than 300 pairs of electrodes were investigated under various DEP conditions by trial and error approach. We evaluated the relationship between the DEP conditions and the electric resistance of assembled GNP arrays, which would indicate possible DEP conditions for fabrication of SE devices.
Yudi ZHANG Debiao HE Xinyi HUANG Ding WANG Kim-Kwang Raymond CHOO Jing WANG
Unlike black-box cryptography, an adversary in a white-box security model has full access to the implementation of the cryptographic algorithm. Thus, white-box implementation of cryptographic algorithms is more practical. Nevertheless, in recent years, there is no white-box implementation for public key cryptography. In this paper, we propose the first white-box implementation of the identity-based signature scheme in the IEEE P1363 standard. Our main idea is to hide the private key to multiple lookup tables, so that the private key cannot be leaked during the algorithm executed in the untrusted environment. We prove its security in both black-box and white-box models. We also evaluate the performance of our white-box implementations, in order to demonstrate utility for real-world applications.