Biao WANG Xiaopeng JIAO Jianjun MU Zhongfei WANG
By tracking the changing rate of hard decisions during every two consecutive iterations of the alternating direction method of multipliers (ADMM) penalized decoding, an efficient early termination (ET) criterion is proposed to improve the convergence rate of ADMM penalized decoder for low-density parity-check (LDPC) codes. Compared to the existing ET criterion for ADMM penalized decoding, the proposed method can reduce the average number of iterations significantly at low signal-to-noise ratios with negligible performance degradation.
A convenient formula for the estimation of the clutter rank of the diving platform radar is derived. Brennan's rule provides a general formula to estimate the clutter rank for the side looking radar with a linear array, which is normally called one-dimensional (1D) estimation problem. With the help of the clutter wavenumber spectrum, the traditional estimation of the clutter rank is extended to the diving scenario and the estimation problem is two-dimensional (2D). The proposed rule is verified by the numerical simulations.
Haiyang LIU Yan LI Lianrong MA
The separating redundancy is an important concept in the analysis of the error-and-erasure decoding of a linear block code using a parity-check matrix of the code. In this letter, we derive new constructive upper bounds on the second separating redundancies of low-density parity-check (LDPC) codes constructed from projective and Euclidean planes over the field Fq with q even.
Tatsuhiko IWAKUNI Kazuki MARUTA Atsushi OHTA Yushi SHIRATO Masataka IIZUKA
This paper presents experimental results of our proposed null-space expansion scheme for multiuser massive multiple-input multiple-output (MIMO) in time varying channels. Multiuser MIMO transmission with the proposed scheme can suppress the inter-user interference (IUI) caused by outdated channel state information (CSI). The excess degrees of freedom (DoFs) of massive MIMO is exploited to perform additional null-steering using past estimated CSI. The signal-to-interference power ratio (SIR) and spectral efficiency performances achieved by the proposed scheme that uses measured CSI is experimentally evaluated. It is confirmed that the proposed scheme shows performance superior to the conventional channel prediction scheme. In addition, IUI can be stably suppressed even in high mobility environments by further increasing the null-space dimension.
Cognitive radio (CR) is considered as the most promising solution to the so-called spectrum scarcity problem, in which channel sensing is an important problem. In this paper, the problem of determining the period of medium access control (MAC)-layer channel sensing in cognitive radio networks (CRNs) is studied. In our study, the channel state is statistically modeled as a continuous-time alternating renewal process (ARP) alternating between the OFF and ON states for the primary user (PU)'s communication activity. Based on the statistical ARP model, we analyze the CRNs with different SU MAC protocols, taking into consideration the effects of practical issues of imperfect channel sensing and non-negligible channel sensing time. Based on the analysis results, a constrained optimization problem to find the optimal sensing period is formulated and the feasibility of this problem is studied for systems with different OFF/ON channel state length distributions. Numerical results are presented to show the performance of the proposed sensing period optimization scheme. The effects of practical system parameters, including channel sensing errors and channel sensing time, on the performance and the computational complexity of the proposed sensing period optimization scheme are also investigated.
This paper proposes a sequentially iterative equalizer based on Kalman filtering and smoothing (SIEKFS) for multiple-input multiple-output (MIMO) systems under frequency selective fading channels. In the proposed SIEKFS, an iteration consists of sequentially executed subiterations, and each subiteration performs equalization and detection procedures of the symbols transmitted from a specific transmit antenna. During this subiteration, all available observations for the transmission block are utilized in the equalization procedures. Furthermore, the entire soft estimate of the desired symbols to be detected does not participate in the equalization procedures of the desired symbols, i.e., the proposed SIEKFS performs input-by-input equalization procedures for a priori information nulling. Therefore, compared with the original iterative equalizer based on Kalman filtering and smoothing, which performs symbol-by-symbol equalization procedures, the proposed SIEKFS can also perform iterative equalization based on the Kalman framework and turbo principle, with a significant reduction in computation complexity. Simulation results verify that the proposed SIEKFS achieves suboptimum error performance as the size of the antenna configuration and the number of iterations increase.
Ryoya FURUKAWA Ryoichi ISAWA Masakatu MORII Daisuke INOUE Koji NAKAO
Malicious software (malware) poses various significant challenges. One is the need to retrieve plain-text messages transmitted between malware and herders through an encrypted network channel. Those messages (e.g., commands for malware) can be a useful hint to reveal their malicious activities. However, the retrieving is challenging even if the malware is executed on an analysis computer. To assist analysts in retrieving the plain-text from the memory, this paper presents FCReducer(Function Candidate Reducer), which provides a small candidate set of cryptographic functions called by malware. Given this set, an analyst checks candidates to locate cryptographic functions. If the decryption function is found, she then obtains its output as the plain-text. Although existing systems such as CipherXRay have been proposed to locate cryptographic functions, they heavily rely on fine-grained dynamic taint analysis (DTA). This makes them weak against under-tainting, which means failure of tracking data propagation. To overcome under-tainting, FCReducer conducts coarse-grained DTA and generates a typical data dependency graph of functions in which the root function accesses an encrypted message. This does not require fine-grained DTA. FCReducer then applies a community detection method such as InfoMap to the graph for detecting a community of functions that plays a role in decryption or encryption. The functions in this community are provided as candidates. With experiments using 12 samples including four malware specimens, we confirmed that FCReducer reduced, for example, 4830 functions called by Zeus malware to 0.87% as candidates. We also propose a heuristic to reduce candidates more greatly.
Daiki SUEHIRO Kohei HATANO Eiji TAKIMOTO
Finding linear functions that maximize AUC scores is important in ranking research. A typical approach to the ranking problem is to reduce it to a binary classification problem over a new instance space, consisting of all pairs of positive and negative instances. Specifically, this approach is formulated as hard or soft margin optimization problems over pn pairs of p positive and n negative instances. Solving the optimization problems directly is impractical since we have to deal with a sample of size pn, which is quadratically larger than the original sample size p+n. In this paper, we reformulate the ranking problem as variants of hard and soft margin optimization problems over p+n instances. The resulting classifiers of our methods are guaranteed to have a certain amount of AUC scores.
Razvan BEURAN Cuong PHAM Dat TANG Ken-ichi CHINEN Yasuo TAN Yoichi SHINODA
Given the worldwide proliferation of cyberattacks, it is imperative that cybersecurity education and training are addressed in a timely manner. These activities typically require trainees to do hands-on practice in order to consolidate and improve their skills, for which purpose training environments called cyber ranges are used. In this paper we present an open-source system named CyRIS (Cyber Range Instantiation System) that supports this endeavor by fully automating the training environment setup, thus making it possible for any organization to conduct more numerous and variate training activities. CyRIS uses a text-based representation in YAML format to describe the characteristics of the training environment, including both environment setup and security content generation. Based on this description, CyRIS automatically creates the corresponding cyber range instances on a computer and network infrastructure, for simultaneous use by multiple trainees. We have evaluated CyRIS in various realistic scenarios, and our results demonstrate its suitability for cybersecurity education and training, both in terms of features and performance, including for large-scale training sessions with hundreds of participants.
Ming-Shing CHEN Wen-Ding LI Bo-Yuan PENG Bo-Yin YANG Chen-Mou CHENG
Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. In 2009, it was shown that hardware advances do not favor just “traditional” alternatives such as ECC and RSA, but also makes MPKCs faster and keeps them competitive at 80-bit security when properly implemented. These techniques became outdated due to emergence of new instruction sets and higher requirements on security. In this paper, we review how MPKC signatures changes from 2009 including new parameters (from a newer security level at 128-bit), crypto-safe implementations, and the impact of new AVX2 and AESNI instructions. We also present new techniques on evaluating multivariate polynomials, multiplications of large finite fields by additive Fast Fourier Transforms, and constant time linear solvers.
Asif AWALUDIN Josaphat TETUKO SRI SUMANTYO Koichi ITO Steven GAO Achmad MUNIR Mohd ZAFRI BAHARUDDIN Cahya EDI SANTOSA
Two wideband circularly polarized (CP) equilateral triangular slot (ETS) antennas are proposed for communication system and the Global Navigation Satellite System (GNSS) Radio Occultation (RO) sensor of the GAIA-I microsatellite. These wide slot antennas use the ring slot antenna CP generation method due to their shape. The compact antennas employ truncated corners, grounded equilateral triangular perturbation patch and branched feed line to create CP radiation. A 3-dB axial ratio bandwidth (ARBW) enhancement is achieved by inserting a pair of slits into the ETS. A parametric study on the influence of those shape modifications in reflection coefficient and axial ratio is presented. An ETS antenna for communication system of the GAIA-I is fabricated and measured, which is shown to agree well with its simulated performance by providing CP fractional bandwidth of 52%. An ETS antenna designed for the GNSS RO sensor of GAIA-I delivers 3-dB ARBW of 41.6%. The ETS antenna offers uni-directional radiation by mounting a 3D printed truncated cone reflector underneath which also enhances antenna gain.
Abu Hena Al MUKTADIR Ved P. KAFLE Pedro MARTINEZ-JULIA Hiroaki HARAI
Network virtualization and slicing technologies create opportunity for infrastructure-less virtual network operators (VNOs) to enter the market anytime and provide diverse services. Multiple VNOs compete to provide the same kinds of services to end users (EUs). VNOs lease virtual resources from the infrastructure provider (InP) and sell services to the EUs by using the leased resources. The difference between the selling and leasing is the gross profit for the VNOs. A VNO that leases resources without precise knowledge of future demand, may not consume all the leased resources through service offers to EUs. Consequently, the VNO experiences loss and resources remain unused. In order to improve resource utilization and ensure that new entrant VNOs do not face losses, proper estimation of initial resource demand is important. In this paper, we propose a Bayesian game with Cournot oligopoly model to properly estimate the optimal initial resource demands for multiple entrant competing VNOs (players) with the objective of maximizing the expected profit for each VNO. The VNOs offer the same kinds of services to EUs with different qualities (player's type), which are public information. The exact service quality with which a VNO competes in the market is private information. Therefore, a VNO assumes the type of its opponent VNOs with certain probability. We derive the Bayesian Nash equilibrium (BNE) of the presented game and evaluate numerically the effect of service qualities and prices on the expected profit and market share of the VNOs.
Yang LI Zhuang MIAO Ming HE Yafei ZHANG Hang LI
How to represent images into highly compact binary codes is a critical issue in many computer vision tasks. Existing deep hashing methods typically focus on designing loss function by using pairwise or triplet labels. However, these methods ignore the attention mechanism in the human visual system. In this letter, we propose a novel Deep Attention Residual Hashing (DARH) method, which directly learns hash codes based on a simple pointwise classification loss function. Compared to previous methods, our method does not need to generate all possible pairwise or triplet labels from the training dataset. Specifically, we develop a new type of attention layer which can learn human eye fixation and significantly improves the representation ability of hash codes. In addition, we embedded the attention layer into the residual network to simultaneously learn discriminative image features and hash codes in an end-to-end manner. Extensive experiments on standard benchmarks demonstrate that our method preserves the instance-level similarity and outperforms state-of-the-art deep hashing methods in the image retrieval application.
Takayoshi SHOUDAI Yuta YOSHIMURA Yusuke SUZUKI Tomoyuki UCHIDA Tetsuhiro MIYAHARA
A cograph (complement reducible graph) is a graph which can be generated by disjoint union and complement operations on graphs, starting with a single vertex graph. Cographs arise in many areas of computer science and are studied extensively. With the goal of developing an effective data mining method for graph structured data, in this paper we introduce a graph pattern expression, called a cograph pattern, which is a special type of cograph having structured variables. Firstly, we show that a problem whether or not a given cograph pattern g matches a given cograph G is NP-complete. From this result, we consider the polynomial time learnability of cograph pattern languages defined by cograph patterns having variables labeled with mutually different labels, called linear cograph patterns. Secondly, we present a polynomial time matching algorithm for linear cograph patterns. Next, we give a polynomial time algorithm for obtaining a minimally generalized linear cograph pattern which explains given positive data. Finally, we show that the class of linear cograph pattern languages is polynomial time inductively inferable from positive data.
Hao ZHENG Xingan XU Changwei LV Yuanfang SHANG Guodong WANG Chunlin JI
Concatenated zigzag (CZ) codes are classified as one kind of parallel-concatenated codes with powerful performance and low complexity. This kind of codes has flexible implementation methods and a good application prospect. We propose a modified turbo-type decoder and adaptive extrinsic information scaling method based on the Max-Log-APP (MLA) algorithm, which can provide a performance improvement also under the relatively low decoding complexity. Simulation results show that the proposed method can effectively help the sub-optimal MLA algorithm to approach the optimal performance. Some contrasts with low-density parity-check (LDPC) codes are also presented in this paper.
Hiroki ASANO Tetsuya HIROSE Taro MIYOSHI Keishi TSUBAKI Toshihiro OZAKI Nobutaka KUROKI Masahiro NUMA
This paper presents a fully integrated 32-MHz relaxation oscillator (ROSC) capable of sub-1-µs start-up time operation for low-power intermittent VLSI systems. The proposed ROSC employs current mode architecture that is different from conventional voltage mode architecture. This enables compact and fast switching speed to be achieved. By designing transistor sizes equally between one in a bias circuit and another in a voltage to current converter, the effect of process variation can be minimized. A prototype chip in a 0.18-µm CMOS demonstrated that the ROSC generates a stable clock frequency of 32.6 MHz within 1-µs start-up time. Measured line regulation and temperature coefficient were ±0.69% and ±0.38%, respectively.
Reiko KUWA Tsuneo KATO Seiichi YAMAMOTO
This paper proposes a classification method of second-language-learner utterances for interactive computer-assisted language learning systems. This classification method uses three types of bilingual evaluation understudy (BLEU) scores as features for a classifier. The three BLEU scores are calculated in accordance with three subsets of a learner corpus divided according to the quality of utterances. For the purpose of overcoming the data-sparseness problem, this classification method uses the BLEU scores calculated using a mixture of word and part-of-speech (POS)-tag sequences converted from word sequences based on a POS-replacement rule according to which words are replaced with POS tags in n-grams. Experiments of classifying English utterances by Japanese demonstrated that the proposed classification method achieved classification accuracy of 78.2% which was 12.3 points higher than a baseline with one BLEU score.
Wei HAN Baosheng WANG Zhenqian FENG Baokang ZHAO Wanrong YU Zhu TANG
Comparing with that of terrestrial networks, the location management in satellite networks is mainly restricted by three factors, i.e., the limited on-board processing (OBP), insufficient link resources and long propagation delay. Under these restrictions, the limited OBP can be smoothened by terrestrial gateway-based location management, the constraint from link resources demands the bandwidth-efficient management scheme and long propagation delay potentially lowers the management efficiency. Currently, the reduction of the management cost has always been the main direction in existing work which is based on the centralized management architecture. This centralized management has many defects, such as the non-optimal routing, scalability problem and single point of failure. To address these problems, this paper explores gateway-based distributed location management schemes for Low Earth Orbit (LEO) satellite networks. Three management schemes based on terrestrial gateways are proposed and analyzed: loose location management, precise location management, and the grouping location management. The analyses specifically analyze the cost of location queries and show their significant influence on the total cost which includes the location management and query. Starting from the above analysis, we speculate and prove the existence of the optimum scheme in grouping location management, which has the lowest total cost for the query frequency within given range. Simulation results validate the theoretical analysis on the cost and show the feature of latency in location queries, which provide a valuable insight into the design of the distributed location management scheme in satellite networks.
This paper presents a computationally efficient cyclostationarity detection based spectrum sensing technique in cognitive radio. Traditionally, several cyclostationarity detection based spectrum sensing techniques with a low computational complexity have been presented, e.g., peak detector (PD), maximum cyclic autocorrelation selection (MCAS), and so on. PD can be affected by noise uncertainty because it requires a noise floor estimation, whereas MCAS does not require the estimation. Furthermore, the computational complexity of MCAS is greater than that of PD because MCAS must compute some statistics for signal detection instead of the estimation unnecessary whereas PD must compute only one statistic. In the presented MCAS based techniques, only one statistic must be computed. The presented technique obtains other necessary statistics from the procedure that computes the statistic. Therefore, the computational complexity of the presented is almost the same as that of PD, and it does not require the noise floor estimation for threshold. Numerical examples are shown to validate the effectiveness of the presented technique.
Shujiao LIAO Qingxin ZHU Rui LIANG
Rough set theory is an important branch of data mining and granular computing, among which neighborhood rough set is presented to deal with numerical data and hybrid data. In this paper, we propose a new concept called inconsistent neighborhood, which extracts inconsistent objects from a traditional neighborhood. Firstly, a series of interesting properties are obtained for inconsistent neighborhoods. Specially, some properties generate new solutions to compute the quantities in neighborhood rough set. Then, a fast forward attribute reduction algorithm is proposed by applying the obtained properties. Experiments undertaken on twelve UCI datasets show that the proposed algorithm can get the same attribute reduction results as the existing algorithms in neighborhood rough set domain, and it runs much faster than the existing ones. This validates that employing inconsistent neighborhoods is advantageous in the applications of neighborhood rough set. The study would provide a new insight into neighborhood rough set theory.