This paper constructs packet-oriented erasure correcting codes and their systematic forms for the distributed storage systems. The proposed codes are encoded by exclusive OR and bit-level shift operation. By the shift operation, the encoded packets are slightly longer than the source packets. This paper evaluates the extra length of the encoded packets, called overhead, and shows that the proposed codes have smaller overheads than the zigzag decodable codes, which are existing codes using bit-level shift operation and exclusive OR.
Tetsunao MATSUTA Tomohiko UYEMATSU
In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of possible delays is known to two encoders and the decoder, where we allow the maximum of delays to change by the block length. In this source coding, we give an inner bound and an outer bound on the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we clarify that the inner bound coincides with the outer bound when the maximum of delays for the block length converges to a constant.
Jun YOSHIZAWA Shota SAITO Toshiyasu MATSUSHIMA
This paper investigates the problem of variable-length intrinsic randomness for a general source. For this problem, we can consider two performance criteria based on the variational distance: the maximum and average variational distances. For the problem of variable-length intrinsic randomness with the maximum variational distance, we derive a general formula of the average length of uniform random numbers. Further, we derive the upper and lower bounds of the general formula and the formula for a stationary memoryless source. For the problem of variable-length intrinsic randomness with the average variational distance, we also derive a general formula of the average length of uniform random numbers.
Jin MITSUGI Yuki SATO Yuusuke KAWAKITA Haruhisa ICHIKAWA
Backscatter wireless communications offer advantages such as batteryless operations, small form factor, and radio regulatory exemption sensors. The major challenge ahead of backscatter wireless communications is synchronized multicarrier data collection, which can be realized by rejecting mutual harmonics among backscatters. This paper analyzes the mutual interferences of digitally modulated multicarrier backscatter to find interferences from higher frequency subcarriers to lower frequency subcarriers, which do not take place in analog modulated multicarrier backscatters, is harmful for densely populated subcarriers. This reverse interference distorts the harmonics replica, deteriorating the performance of the existing method, which rejects mutual interference among subcarriers by 5dB processing gain. To solve this problem, this paper analyzes the relationship between subcarrier spacing and reverse interference, and reveals that an alternate channel spacing, with channel separation twice the bandwidth of a subcarrier, can provide reasonably dense subcarrier allocation and can alleviate reverse interference. The idea is examined with prototype sensors in a wired experiment and in an indoor propagation experiment. The results reveal that with alternate channel spacing, the reverse interference practically becomes negligible, and the existing interference rejection method achieves the original processing gain of 5dB with one hundredth packet error rate reduction.
Yunjie GU Yuehang DING Yuxiang HU
A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.
This paper proposes a dual-band dual-rectangular-loop circular polarization antenna for Global Navigation Satellite Systems (GNSSs). The proposed antenna combines two large outer rectangular loops with two small inner loops. Each large outer loop is connected to its corresponding small inner rectangular loop. Each loop has gaps located symmetrically with respect to a feed point to produce Right Handed Circular Polarization (RHCP). The gap position and the shape of the rectangular loops are very important to adjust both the impedance matching and circular polarization characteristics. The proposed antenna offers dual-band Voltage Standing Wave Ratio (VSWR) and Axial Ratio (AR) frequency characteristics that include the L1 (1575.42 MHz) and L2 (1227.60 MHz) bands. The antenna gains exceed 8.7 dBi. Broad AR elevation patterns are obtained. These antenna characteristics are well suited to precise positioning.
In this letter, we propose a novel wireless power transfer (WPT) scheme in the radiative near-field (Fresnel) region, which based on machine vision and dynamically reconfigurable holographic metasurface aperture capable of focusing power to multiple spots simultaneously without any information feedback. The states of metamaterial elements, formed by tunable meander line resonators, is determined using holographic design principles, in which the interference pattern of reference mode and the desired radiated field pattern leads to the required phase distribution over the surface of the aperture. The three-dimensional position information of mobile point sources is determined by machine visual localization, which can be used to obtain the aperture field. In contrast to the existing research studies, the proposed scheme is not only designed to achieve free multi-focuses, but also with machine vision, low-dimensionality, high transmission efficiency, real-time continuous reconfigurability and so on. The accuracy of the analysis is confirmed using numerical simulation.
A one-dimensional lattice of tunnel-diode oscillators is investigated for potential high-speed frequency divider. In the evolution of the investigated lattice, the high-frequency oscillation dominates over the low-frequency oscillation. When a base oscillator is connected at the end, and generates oscillatory signals with a frequency higher than that of the synchronous lattice oscillation, the oscillator output begins to move in the lattice. This one-way property guarantees that the oscillation dynamics of the lattice have only slight influence on the oscillator motion. Moreover, counter-moving pulses in the lattice exhibit pair annihilation through head-on collisions. These lattice properties enable an efficient frequency division method. Herein, the operating principles of the frequency divider are described, along with a numerical validation.
Marcus WALLDEN Stefano MARKIDIS Masao OKITA Fumihiko INO
We propose a novel compositing pipeline and a dynamic load balancing technique for volume rendering which utilizes a two-layered group structure to achieve effective and scalable load balancing. The technique enables each process to render data from non-contiguous regions of the volume with minimal impact on the total render time. We demonstrate the effectiveness of the proposed technique by performing a set of experiments on a modern GPU cluster. The experiments show that using the technique results in up to a 35.7% lower worst-case memory usage as compared to a dynamic k-d tree load balancing technique, whilst simultaneously achieving similar or higher render performance. The proposed technique was also able to lower the amount of transferred data during the load balancing stage by up to 72.2%. The technique has the potential to be used in many scenarios where other dynamic load balancing techniques have proved to be inadequate, such as during large-scale visualization.
Linear Prediction (LP) analysis is commonly used in speech processing. LP is based on Auto-Regressive (AR) model and it estimates the AR model parameter from signals with l2-norm optimization. Recently, sparse estimation is paid attention since it can extract significant features from big data. The sparse estimation is realized by l1 or l0-norm optimization or regularization. Sparse LP analysis methods based on l1-norm optimization have been proposed. Since excitation of speech is not white Gaussian, a sparse LP estimation can estimate more accurate parameter than the conventional l2-norm based LP. These are time-invariant and real-valued analysis. We have been studied Time-Varying Complex AR (TV-CAR) analysis for an analytic signal and have evaluated the performance on speech processing. The TV-CAR methods are l2-norm methods. In this paper, we propose the sparse TV-CAR analysis based on adaptive LASSO (Least absolute shrinkage and selection operator) that is l1-norm regularization and evaluate the performance on F0 estimation of speech using IRAPT (Instantaneous RAPT). The experimental results show that the sparse TV-CAR methods perform better for a high level of additive Pink noise.
Baojun ZHAO Boya ZHAO Linbo TANG Baoxian WANG
Towards involving the convolutional neural networks into the object detection field, many computer vision tasks have achieved favorable successes. In order to adapt targets with various scales, deep feature pyramid is widely used, since the traditional object detection methods detect different objects in Gaussian image pyramid. However, due to the mismatching between the anchors and the feature distributions of targets, the accurate detection for targets with various scales is still a challenge. Considering the differences between the theoretical receptive field and effective receptive field, we propose a novel anchor generation method, which takes the effective receptive field as the standard. The proposed method is evaluated on the PASCAL VOC dataset and shows the favorable results.
We have proposed a generic architecture that can integrate the aspects of confidentiality and integrity into the A/D conversion framework. A conceptual account of the development of the proposed architecture is presented. Using the principle of this architecture we have presented a CMOS circuit design to facilitate a fully integrated Authenticated-Encrypted ADC (AE-ADC). We have implemented and demonstrated a partial 8-bit ADC Analog Front End of this proposed circuit in 0.18µm CMOS with an ENOB of 7.64 bits.
Tomoyuki SASAKI Hidehiro NAKANO
Particle swarm optimization (PSO) is a swarm intelligence algorithm and has good search performance and simplicity in implementation. Because of its properties, PSO has been applied to various optimization problems. However, the search performance of the classical PSO (CPSO) depends on reference frame of solution spaces for each objective function. CPSO is an invariant algorithm through translation and scale changes to reference frame of solution spaces but is a rotationally variant algorithm. As such, the search performance of CPSO is worse in solving rotated problems than in solving non-rotated problems. In the reference frame invariance, the search performance of an optimization algorithm is independent on rotation, translation, or scale changes to reference frame of solution spaces, which is a property of preferred optimization algorithms. In our previous study, piecewise-linear particle swarm optimizer (PPSO) has been proposed, which is effective in solving rotated problems. Because PPSO particles can move in solution spaces freely without depending on the coordinate systems, PPSO algorithm may have rotational invariance. However, theoretical analysis of reference frame invariance of PPSO has not been done. In addition, although behavior of each particle depends on PPSO parameters, good parameter conditions in solving various optimization problems have not been sufficiently clarified. In this paper, we analyze the reference frame invariance of PPSO theoretically, and investigated whether or not PPSO is invariant under reference frame alteration. We clarify that control parameters of PPSO which affect movement of each particle and performance of PPSO through numerical simulations.
Zuopeng ZHAO Hongda ZHANG Yi LIU Nana ZHOU Han ZHENG Shanyi SUN Xiaoman LI Sili XIA
Although correlation filter-based trackers have demonstrated excellent performance for visual object tracking, there remain several challenges to be addressed. In this work, we propose a novel tracker based on the correlation filter framework. Traditional trackers face difficulty in accurately adapting to changes in the scale of the target when the target moves quickly. To address this, we suggest a scale adaptive scheme based on prediction scales. We also incorporate a speed-based adaptive model update method to further improve overall tracking performance. Experiments with samples from the OTB100 and KITTI datasets demonstrate that our method outperforms existing state-of-the-art tracking algorithms in fast motion scenes.
Fill-a-Pix is a pencil-and-paper puzzle, which is popular worldwide since announced by Conceptis in 2003. It provides a rectangular grid of squares that must be filled in to create a picture. Precisely, we are given a rectangular grid of squares some of which has an integer from 0 to 9 in it, and our task is to paint some squares black so that every square with an integer has the same number of painted squares around it including the square itself. Despite its popularity, computational complexity of Fill-a-Pix has not been known. We in this paper show that the puzzle is NP-complete, ASP-complete, and #P-complete via a parsimonious reduction from the Boolean satisfiability problem. We also consider the fewest clues problem of Fill-a-Pix, where the fewest clues problem is recently introduced by Demaine et al. for analyzing computational complexity of designing “good” puzzles. We show that the fewest clues problem of Fill-a-Pix is Σ2P-complete.
Tomoya KAGEYAMA Osamu MUTA Haris GACANIN
In this paper, we propose an enhanced selected mapping (e-SLM) technique to improve the performance of OFDM-PLC systems under impulsive noise. At the transmitter, the best transmit sequence is selected from among possible candidates so as to minimize the weighted sum of transmit signal peak power and the estimated receive one, where the received signal peak power is estimated at the transmitter using channel state information (CSI). At the receiver, a nonlinear blanking is applied to hold the impulsive noise under a given threshold, where impulsive noise detection accuracy is improved by the proposed e-SLM. We evaluate the probability of false alarms raised by impulsive noise detection and bit error rate (BER) of OFDM-PLC system using the proposed e-SLM. The results show the effectiveness of the proposed method in OFDM-PLC system compared with the conventional blanking technique.
Xinbo REN Haiyuan WU Qian CHEN Toshiyuki IMAI Takashi KUBO Takashi AKASAKA
Clinical researches show that the morbidity of coronary artery disease (CAD) is gradually increasing in many countries every year, and it causes hundreds of thousands of people all over the world dying for each year. As the optical coherence tomography with high resolution and better contrast applied to the lesion tissue investigation of human vessel, many more micro-structures of the vessel could be easily and clearly visible to doctors, which help to improve the CAD treatment effect. Manual qualitative analysis and classification of vessel lesion tissue are time-consuming to doctors because a single-time intravascular optical coherence (IVOCT) data set of a patient usually contains hundreds of in-vivo vessel images. To overcome this problem, we focus on the investigation of the superficial layer of the lesion region and propose a model based on local multi-layer region for vessel lesion components (lipid, fibrous and calcified plaque) features characterization and extraction. At the pre-processing stage, we applied two novel automatic methods to remove the catheter and guide-wire respectively. Based on the detected lumen boundary, the multi-layer model in the proximity lumen boundary region (PLBR) was built. In the multi-layer model, features extracted from the A-line sub-region (ALSR) of each layer was employed to characterize the type of the tissue existing in the ALSR. We used 7 human datasets containing total 490 OCT images to assess our tissue classification method. Validation was obtained by comparing the manual assessment with the automatic results derived by our method. The proposed automatic tissue classification method achieved an average accuracy of 89.53%, 93.81% and 91.78% for fibrous, calcified and lipid plaque respectively.
Yubo LI Kangquan LI Longjiang QU Chao LI
MDS transformation plays an important role in resisting against differential cryptanalysis (DC) and linear cryptanalysis (LC). Recently, M. Sajadieh, et al.[15] designed an efficient recursive diffusion layer with Feistel-like structures. Moreover, they obtained an MDS transformation which is related to a linear function and the inverse is as lightweight as itself. Based on this work, we consider one specific form of linear functions to get the diffusion layer with low XOR gates for the hardware implementation by using temporary registers. We give two criteria to reduce the construction space and obtain six new classes of lightweight MDS transformations. Some of our constructions with one bundle-based LFSRs have as low XOR gates as previous best known results. We expect that these results may supply more choices for the design of MDS transformations in the (lightweight) block cipher algorithm.
Liquid crystal director distributions between strong and weak polar anchoring surfaces in hybrid aligned cells are numerically analyzed. When the anchoring is a critical one, homogeneously or homeotropicly liquid crystal alignment can be obtained. Such cells have no threshold voltage and a driving voltage can be reduced less than 0.5 volt.
Kotchakorn PITUSO Chanon WARISARN Damrongsak TONGSOMPORN
When the track density of two-dimensional magnetic recording (TDMR) systems is increased, intertrack interference (ITI) inevitably grows, resulting in the extreme degradation of an overall system performance. In this work, we present coding, writing, and reading techniques which allow TDMR systems with multi-readers to overcome severe ITI. A rate-5/6 two-dimensional (2D) modulation code is adopted to protect middle-track data from ITI based on cross-track data dependence. Since the rate-5/6 2D modulation code greatly improves the reliability of the middle-track, there is a bit-error rate gap between middle-track and sidetracks. Therefore, we propose the different track width writing technique to optimize the reliability of all three data tracks. In addition, we also evaluate the TDMR system performance using an user areal density capability (UADC) as a main key parameter. Here, an areal density capability (ADC) can be measured by finding the bit-error rate of the system with sweeping track and linear densities. The UADC is then obtained by removing redundancy from the ADC. Simulation results show that a system with our proposed techniques gains the UADC of about 4.66% over the conventional TDMR systems.