Sirikarn PUKKAWANNA Hiroaki HAZEYAMA Youki KADOBAYASHI Suguru YAMAGUCHI
Detecting traffic anomalies is an indispensable component of overall security architecture. As Internet and traffic data with more sophisticated attacks grow exponentially, preserving security with signature-based traffic analyzers or analyzers that do not support massive traffic are not sufficient. In this paper, we propose a novel method based on combined sketch technique and S-transform analysis for detecting anomalies in massive traffic streams. The method does not require any prior knowledge such as attack patterns and models representing normal traffic behavior. To detect anomalies, we summarize the entropy of traffic data over time and maintain the summarized data in sketches. The entropy fluctuation of the traffic data aggregated to the same bucket is observed by S-transform to detect spectral changes referred to as anomalies in this work. We evaluated the performance of the method with real-world backbone traffic collected at the United States and Japan transit link in terms of both accuracy and false positive rates. We also explored the method parameters' influence on detection performance. Furthermore, we compared the performance of our method to S-transform-based and Wavelet-based methods. The results demonstrated that our method was capable of detecting anomalies and overcame both methods. We also found that our method was not sensitive to its parameter settings.
Ann-Chen CHANG Chih-Chang SHEN
This letter deals with the carrier frequency offsets (CFO) estimation problem for orthogonal frequency division multiple access (OFDMA) uplink systems. Combined with centro-symmetric (CS) trimmed autocorrelation matrix and weighting subspace projection, the proposed estimator has better estimate performance than MVDR, MUSIC, CS-MUSIC, and ESPRIT estimators, especially in relatively less of OFDMA blocks and low SNR situations. Simulation results are presented to verify the efficiency of the proposed estimator.
A new trigger circuit based on up/down counter is proposed. This trigger circuit consists of a up/down counter and a pulse conversion circuit. Compared with a trigger circuit based on 32-bit counter, the proposed trigger circuit occupies less circuit area and consumes less power consumption, while the trigger process can be inversed, increasing the controllability of the Trojan.
Andreas CHWALA Ronny STOLZ Matthias SCHMELZ Vyacheslav ZAKOSARENKO Matthias MEYER Hans-Georg MEYER
Forty years after the first application of Superconducting Quantum Interference Devices (SQUIDs) [1], [2] for geophysical purposes, they have recently become a valued tool for mineral exploration. One of the most common applications is time domain (or transient) electromagnetics (TEM), an active method, where the inductive response from the ground to a changing current (mostly rectangular) in a loop on the surface is measured. After the current in the transmitter coil is switched, eddy currents are excited in the ground, which decay in a manner dependent on the conductivity of the underlying geologic structure. The resulting secondary magnetic field at the surface is measured during the off-time by a receiver coil (induced voltage) or by a magnetometer (e.g. SQUID or fluxgate). The recorded transient signal quality is improved by stacking positive and negative decays. Alternatively, the TEM results can be inverted and give the electric conductivity of the ground over depth. Since SQUIDs measure the magnetic field with high sensitivity and a constant frequency transfer function, they show a superior performance compared to conventional induction coils, especially in the presence of strong conductors. As the primary field, and especially its slew rate, are quite large, SQUID systems need to have a large slew rate and dynamic range. Any flux jump would make the use of standard stacking algorithms impossible. IPHT and Supracon are developing and producing SQUID systems based on low temperature superconductors (LTS, in our case niobium), which are now state-of-the-art. Due to the large demand, we are additionally supplying systems with high temperature superconductors (HTS, in our case YBCO). While the low temperature SQUID systems have a better performance (noise and slew rate), the high temperature SQUID systems are easier to handle in the field. The superior performance of SQUIDs compared to induction coils is the most important factor for the detection of good conductors at large depth or ore bodies underneath conductive overburden.
Yuichi SUDO Toshimitsu MASUZAWA Gen MOTOYOSHI Tutomu MURASE
Users of wireless mobile devices need Internet access not only when they stay at home or office, but also when they travel. It may be desirable for such users to select a "longcut route" from their current location to his/her destination that has longer travel time than the shortest route, but provides a better mobile wireless environment. In this paper, we formulate the above situation as the optimization problem of “optimal longcut route selection”, which requires us to find the best route concerning the wireless environment subject to a travel time constraint. For this new problem, we show NP-hardness, propose two pseudo-polynomial time algorithms, and experimental evaluation of the algorithms.
Changqing XU Fan YANG Jin TENG Sumxin JIANG
In this paper, we design a stealthy GSM phone identity catcher. As the GSM protocols do not mandate the authentication of BSes (Base Stations) to MSes (Mobile Stations), fake BSes can be implemented to lure victims to register with and thereby intercept crucial information of the user, including their identities. However, the straightforward implementation of GSM phone identity catcher can be easily perceived by users employing detection software due to such phenomena as phone interface changes and service interruptions. In this paper, we propose several effective mechanisms, such as smart configuration of the fake BSes, quick attachment/detachment and service relay, to make the catching process invisible to users and software. Real world experiments have been conducted and the results prove the efficiency and stealth of our proposed GSM phone identity catcher. We hope our work could help to enhance the effectiveness of IMSI catching attack and thereby alert the industry to design stronger authentication protocol in communication systems.
One of the fast approximate similarity search techniques is a binary hashing method that transforms a real-valued vector into a binary code. The similarity between two binary codes is measured by their Hamming distance. In this method, a hash table is often used when undertaking a constant-time similarity search. The number of accesses to the hash table, however, increases when the number of bits lengthens. In this paper, we consider a method that does not access data with a long Hamming radius by using multiple binary codes. Further, we attempt to integrate the proposed approach and the existing multi-index hashing (MIH) method to accelerate the performance of the similarity search in the Hamming space. Then, we propose a learning method of the binary hash functions for multiple binary codes. We conduct an experiment on similarity search utilizing a dataset of up to 50 million items and show that our proposed method achieves a faster similarity search than that possible with the conventional linear scan and hash table search.
In this letter, we propose a novel Uniformity-Approximated Histogram Equalization (UAHE) algorithm to enhance the image as well as to preserve the image features. First, the UAHE algorithm generates the image histogram and computes the average value of all bins as the histogram threshold. In order to approximate the uniform histogram, the bins of image histograms greater than the above threshold are clipped, and the subtracted counts are averaged and uniformly assigned to the remaining bins lower than the threshold. The approximated uniform histogram is then applied to generate the intensity transformation function for image contrast enhancement. Experimental results show that our algorithm achieves the maximum entropy as well as the feature similarity values for image contrast enhancement.
Naoki HARADA Shintaro SATO Naoki YOKOYAMA
The short-channel effect (SCE) in a MOSFET with an atomically thin MoS$_{2}$ channel was studied using a TCAD simulator. We derived the surface potential roll-up, drain-induced barrier lowering (DIBL), threshold voltage, and subthreshold swing (SS) as indexes of the SCE and analyzed their dependency on the channel thickness (number of atomic layers) and channel length. The minimum scalable channel length for a one-atomic-layer-thick MoS$_{2}$ MOSFET was determined from the threshold voltage roll-off to be 7.6,nm. The one-layer-thick device showed a small DIBL of 87,mV/V at a 20 nm gate length. By using high-k gate insulator, an SS lower than 70,mV/dec is achievable in sub-10-nm-scale devices.
Hiroshi SHIMIZU Hitoshi ASAEDA Masahiro JIBIKI Nozomu NISHINAGA
How to retrieve the closest content from an in-network cache is one of the most important issues in Information-Centric Networking (ICN). This paper proposes a novel content discovery scheme called Local Tree Hunting (LTH). By adding branch-cast functionality to a local tree for content requests to a Content-Centric Network (CCN) response node, the discovery area for caching nodes expands. Since the location of such a branch-casting node moves closer to the request node when the content is more widely cached, the discovery range, i.e. the branch size of the local tree, becomes smaller. Thus, the discovery area is autonomously adjusted depending on the content dissemination. With this feature, LTH is able to find the “almost true closest” caching node without checking all the caching nodes in the in-network cache. The performance analysis employed in Zipf's law content distribution model and which uses the Least Recently Used eviction rule shows the superiority of LTH with respect to identifying the almost exact closest cache.
Keisuke MAEHATA Makoto MAEDA Naoko IYOMOTO Kenji ISHIBASHI Keisuke NAKAMURA Katsunori AOKI Koji TAKASAKI Kazuhisa MITSUDA Keiichi TANAKA
A four-pixel-array superconducting transition-edge sensor (TES) microcalorimeter with a mushroom-shaped absorber was fabricated for the energy dispersive spectroscopy performed on a transmission electron microscope. The TES consists of a bilayer of Au/Ti with either a 50-nm or 120-nm thickness. The absorber of 5.0,$mu$m thick is made from a Au layer and its stem is deposited in the center of the TES surface. A Ta$_{2}$O$_{5}$ insulating layer of 100-nm thickness is inserted between the overhang region of the absorber and the TES surface. A selected pixel of the TES microcalorimeter was operated for the detection of Np L X-rays emitted from an $^{241}$Am source. A response of the TES microcalorimeter to L X-rays was obtained by analyzing detection signal pulses with using the optimal filter method. An energy resolution was obtained to be 33,eV of the full width at half maximum value at 17.751,keV of Np L$_{eta 1}$ considering its natural width of 13.4,eV. Response to L X-rays emitted from a mixture source of $^{238}$Pu, $^{239}$Pu and $^{241}$Am was obtained by operating the selected pixel of the TES microcalorimeter. Major L X-ray peaks of progeny elements of $alpha$ decay of Pu and Am isotopes were clearly identified in the obtained energy spectrum. The experimental results demonstrated the separation of $^{241}$Am and plutonium isotopes by L X-ray spectroscopy.
This paper considers the problem of enumerating all maximal cliques in unit disk graphs, which is a plausible setting for applications of finding similar data groups. Our primary interest is to develop a faster algorithm using the geometric structure about the metric space where the input unit disk graph is embedded. Assuming that the distance between any two vertices is available, we propose a new algorithm based on two well-known algorithms called Bron-Kerbosch and Tomita-Tanaka-Takahashi. The key idea of our algorithm is to find a good pivot quickly using geometric proximity. We validate the practical impact of our algorithm via experimental evaluations.
Kei SAKAGUCHI Gia Khanh TRAN Hidekazu SHIMODAIRA Shinobu NANBA Toshiaki SAKURAI Koji TAKINAMI Isabelle SIAUD Emilio Calvanese STRINATI Antonio CAPONE Ingolf KARLS Reza AREFI Thomas HAUSTEIN
Triggered by the explosion of mobile traffic, 5G (5th Generation) cellular network requires evolution to increase the system rate 1000 times higher than the current systems in 10 years. Motivated by this common problem, there are several studies to integrate mm-wave access into current cellular networks as multi-band heterogeneous networks to exploit the ultra-wideband aspect of the mm-wave band. The authors of this paper have proposed comprehensive architecture of cellular networks with mm-wave access, where mm-wave small cell basestations and a conventional macro basestation are connected to Centralized-RAN (C-RAN) to effectively operate the system by enabling power efficient seamless handover as well as centralized resource control including dynamic cell structuring to match the limited coverage of mm-wave access with high traffic user locations via user-plane/control-plane splitting. In this paper, to prove the effectiveness of the proposed 5G cellular networks with mm-wave access, system level simulation is conducted by introducing an expected future traffic model, a measurement based mm-wave propagation model, and a centralized cell association algorithm by exploiting the C-RAN architecture. The numerical results show the effectiveness of the proposed network to realize 1000 times higher system rate than the current network in 10 years which is not achieved by the small cells using commonly considered 3.5GHz band. Furthermore, the paper also gives latest status of mm-wave devices and regulations to show the feasibility of using mm-wave in the 5G systems.
Koichi KOBAYASHI Takuro NAGAMI Kunihiko HIRAISHI
In this paper, optimal control of multi-vehicle systems is studied. In the case where collision avoidance between vehicles and obstacle avoidance are imposed, state discretization is effective as one of the simplified approaches. Furthermore, using state discretization, cooperative actions such as rendezvous can be easily specified by linear temporal logic (LTL) formulas. However, it is not necessary to discretize all states, and partial states (e.g., the position of vehicles) should be discretized. From this viewpoint, a new control method for multi-vehicle systems is proposed in this paper. First, the system in which partial states are discretized is formulated. Next, the optimal control problem with constraints described by LTL formulas is formulated, and its solution method is proposed. Finally, numerical simulations are presented. The proposed method provides us a useful method in control of multi-vehicle systems.
The fast multipole method (FMM) for N-body simulations is attracting much attention since it requires minimal communication between computing nodes. We implemented hardware pipelines specialized for the FMM on an FPGA device, the GRAPE-9. An N-body simulation with 1.6×107 particles ran 16 times faster than that on a CPU. Moreover the particle-to-particle stage of the FMM on the GRAPE-9 executed 2.5 times faster than on a GPU in a limited case.
Hideaki WAKABAYASHI Masamitsu ASAI Jiro YAMAKITA
In the scattering problem of dielectric gratings in conical mounting, we have considered and formulated scattering fields using transverse electric (TE) and transverse magnetic (TM) waves. This paper formulates scattering fields by superpositions of right-circularly (RC) and left-circularly (LC) polarized waves through the matrix eigenvalue method.
Inseong HWANG Seungwoo JEON Beobkeun CHO Yoonsik CHOE
This paper proposes a novel image classification scheme for cloth pattern recognition. The rotation and scale invariant delta-HOG (DHOG)-based descriptor and the entire recognition process using random ferns with this descriptor are proposed independent from pose and scale changes. These methods consider maximun orientation and various radii of a circular patch window for fast and efficient classification even when cloth patches are rotated and the scale is changed. It exhibits good performance in cloth pattern recognition experiments. It found a greater number of similar cloth patches than dense-SIFT in 20 tests out of a total of 36 query tests. In addition, the proposed method is much faster than dense-SIFT in both training and testing; its time consumption is decreased by 57.7% in training and 41.4% in testing. The proposed method, therefore, is expected to contribute to real-time cloth searching service applications that update vast numbers of cloth images posted on the Internet.
Keisuke KAWACHI Kazunari SHINBO Yasuo OHDAIRA Akira BABA Keizo KATO Futao KANEKO
A quartz-crystal-microbalance (QCM) and surface-plasmon-resonance (SPR) hybrid sensor was prepared, and the depositions of polymer electrolytes layer-by-layer (LbL) films were observed in situ. The estimated thicknesses obtained from the QCM method were different from those obtained from the SPR method. This was estimated to be caused by film swelling and water contained in the film.
This paper proposes a novel scheme for sequential orthogonal frequency division multiplexing channel estimation on the receiver side.The scheme comprises two methods: one improves estimation accuracy and the other reduces computational complexity. Based on a state-space model, the first method appropriately considers frequency correlation in an approach that derives a narrow-band channel gain for multiple pilot subcarriers; such consideration of frequency correlation leads to an averaging effect in the frequency domain. The second method is based on the first one and forces the observation matrix into a sparse bidiagonal matrix in order to decrease the number of mathematical processes. The proposed scheme is verified by numerical analysis.
Yan Shen DU Ping WEI Hua Guo ZHANG Hong Shu LIAO
In this work, the differential received signal strength based localization problem is addressed. Based on the measurement model, we present the constrained weighted least squares (CWLS) approach, which is difficult to be solved directly due to its nonconvex nature. However, by performing the semidefinite relaxation (SDR) technique, the CWLS problem can be relaxed into a semidefinite programming problem (SDP), which can be efficiently solved using modern convex optimization algorithms. Moreover, the SDR is proved to be tight, and hence ensures the corresponding SDP find the optimal solution of the original CWLS problem. Numerical simulations are included to corroborate the theoretical results and promising performance.