A method for accurate scene segmentation using two kinds of directed graph obtained by object matching and audio features is proposed. Generally, in audiovisual materials, such as broadcast programs and movies, there are repeated appearances of similar shots that include frames of the same background, object or place, and such shots are included in a single scene. Many scene segmentation methods based on this idea have been proposed; however, since they use color information as visual features, they cannot provide accurate scene segmentation results if the color features change in different shots for which frames include the same object due to camera operations such as zooming and panning. In order to solve this problem, scene segmentation by the proposed method is realized by using two novel approaches. In the first approach, object matching is performed between two frames that are each included in different shots. By using these matching results, repeated appearances of shots for which frames include the same object can be successfully found and represented as a directed graph. The proposed method also generates another directed graph that represents the repeated appearances of shots with similar audio features in the second approach. By combined use of these two directed graphs, degradation of scene segmentation accuracy, which results from using only one kind of graph, can be avoided in the proposed method and thereby accurate scene segmentation can be realized. Experimental results performed by applying the proposed method to actual broadcast programs are shown to verify the effectiveness of the proposed method.

This paper introduces a multilayer traffic network model and traffic network clustering method for solving the route selection problem (RSP) in car navigation system (CNS). The purpose of the proposed method is to reduce the computation time of route selection substantially with acceptable loss of accuracy by preprocessing the large size traffic network into new network form. The proposed approach further preprocesses the traffic network than the traditional hierarchical network method by clustering method. The traffic network clustering considers two criteria. We specify a genetic clustering algorithm for traffic network clustering and use NSGA-II for calculating the multiple objective Pareto optimal set. The proposed method can overcome the size limitations when solving route selection in CNS. Solutions provided by the proposed algorithm are compared with the optimal solutions to analyze and quantify the loss of accuracy.

A new type of mode converter that converts TE30 to TE10 mode is proposed. As an example of the ease of fabrication, holes can be drilled at the top of a metallic waveguide and dielectric rods inserted. This converter is useful for application as a power divider or power combiner.

This letter presents an adaptive beamformer robust to random steering errors, based on the projection of received signals onto the orthogonal complement of the interference subspace. In the presence of random steering errors, to prevent the suppression of the desired signal, the proposed beamformer effectively finds basis vectors for the estimation of the interference subspace.

The rapid growth of the Internet provides people with tremendous opportunities for data collection, knowledge discovery and cooperative computation. However, it also brings the problem of sensitive information leakage. Both individuals and enterprises may suffer from the massive data collection and the information retrieval by distrusted parties. In this paper, we propose a privacy-preserving protocol for the distributed kernel density estimation-based clustering. Our scheme applies random data perturbation (RDP) technique and the verifiable secret sharing to solve the security problem of distributed kernel density estimation in [4] which assumed a mediate party to help in the computation.

By modifying the private key and the public key setting in Boneh-Lynn-Shacham's short signature shcheme, a variation of BLS' short signature scheme is proposed. Based on this variation, we present a very efficient threshold signature scheme where the number of pairing computation for the signaure share verification reduces to half.

We observe a natural generalisation of the ate and twisted ate pairings, which allow for performance improvements in non standard applications of pairings to cryptography like composite group orders. We also give a performance comparison of our pairings and the Tate, ate and twisted ate pairings for certain polynomial families based on operation count estimations and on an implementation, showing that our pairings can achieve a speedup of a factor of up to two over the other pairings.

In 2006, Chatterjee and Sarkar proposed a hierarchical identity-based encryption (HIBE) scheme which can support an unbounded number of identity levels. This property is particularly useful in providing forward secrecy by embedding time components within hierarchical identities. In this paper we show that their scheme does not provide the claimed property. Our analysis shows that if the number of identity levels becomes larger than the value of a fixed public parameter, an unintended receiver can reconstruct a new valid ciphertext and decrypt the ciphertext using his or her own private key. The analysis is similarly applied to a multi-receiver identity-based encryption scheme presented as an application of Chatterjee and Sarkar's HIBE scheme.

We present a real-time video-based rendering system using a network camera array. Our system consists of 64 commodity network cameras that are connected to a single PC through a gigabit Ethernet. To render a high-quality novel view, our system estimates a view-dependent per-pixel depth map in real time by using a layered representation. The rendering algorithm is fully implemented on the GPU, which allows our system to efficiently perform capturing and rendering processes as a pipeline by using the CPU and GPU independently. Using QVGA input video resolution, our system renders a free-viewpoint video at up to 30 frames per second, depending on the output video resolution and the number of depth layers. Experimental results show high-quality images synthesized from various scenes.

In this letter a new analytical method is presented for estimating the timing jitter of CMOS ring oscillators due to power supply noise. Predictive jitter equation is presented, and the proposed method is utilized to study the jitter induced by power supply noise in an inverter-based ring oscillator, which is designed and simulated in SMIC 0.13-µm standard CMOS process. A comparison between the results obtained by the proposed method and those obtained by HSPICE simulation proves the accuracy of the predictive equation. Most of the errors between the theoretic calculation and simulation results are less than 3 ps.

A guard trace placed near a signal line reduces common-mode radiation from a printed circuit board. The reduction effect is evaluated by the imbalance difference model, which was proposed by the authors, when the guard trace has exactly the same potential as the return plane. However, depending on interval of ground connection of the guard trace, the radiation can increase when the guard trace resonates. In this paper, the authors show that the increase of radiation is caused by the common mode, and extend the imbalance difference model to explain a mechanism of increase of common-mode radiation. Additionally, the effective via location of the guard trace is proposed to reduce the number of vias. The guard trace voltage due to the resonance excites the common mode at the interface where the cross-sectional structure of the transmission line changes since the common-mode excitation is expressed by the product of the voltage and the difference of current division factors. To suppress the common-mode excitation, the guard trace should be grounded at the point where the cross-sectional structure changes. As a result, the common-mode radiation decreases even when the guard trace resonates.

This article explains how to apply the deterministic annealing (DA) and simulated annealing (SA) methods to fuzzy entropy based fuzzy c-means clustering. By regularizing the fuzzy c-means method with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function, well known in statistical mechanics, is obtained, and, while optimizing its parameters by SA, the minimum of the Helmholtz free energy for fuzzy c-means clustering is searched by DA. Numerical experiments are performed and the obtained results indicate that this combinatorial algorithm of SA and DA can represent various cluster shapes and divide data more properly and stably than the standard single DA algorithm.

Intrusion detection system (IDS) has played an important role as a device to defend our networks from cyber attacks. However, since it is unable to detect unknown attacks, i.e., 0-day attacks, the ultimate challenge in intrusion detection field is how we can exactly identify such an attack by an automated manner. Over the past few years, several studies on solving these problems have been made on anomaly detection using unsupervised learning techniques such as clustering, one-class support vector machine (SVM), etc. Although they enable one to construct intrusion detection models at low cost and effort, and have capability to detect unforeseen attacks, they still have mainly two problems in intrusion detection: a low detection rate and a high false positive rate. In this paper, we propose a new anomaly detection method based on clustering and multiple one-class SVM in order to improve the detection rate while maintaining a low false positive rate. We evaluated our method using KDD Cup 1999 data set. Evaluation results show that our approach outperforms the existing algorithms reported in the literature; especially in detection of unknown attacks.

Printed circuit boards (PCBs) driven by a connected feed cable are considered to be one of the main sources of the electromagnetic interference (EMI) from electronic devices. In this paper, a method for predicting the electromagnetic (EM) radiation from a PCB driven by a connected feed cable at up to gigahertz frequencies is proposed and demonstrated. The predictive model is based on the transmission line theory and current- and voltage-driven CM generation mechanisms with consideration of antenna impedance. Frequency responses of differential-mode (DM) and common-mode (CM) currents and far-electric field were investigated experimentally and with finite-difference time-domain (FDTD) modeling. First, the dominant component in total EM radiation from the PCB was identified by using the Source-Path-Antenna model. Although CM can dominate the total radiation at lower frequencies, DM is the dominant component above 3 GHz. Second, the method for predicting CM component at lower frequencies is proposed. And its validity was discussed by comparing FDTD calculated and measured results. Specifically, the relationship between the CM current and the terminating resistor was focused as important consequence for the prediction. Good agreement between the measured and predicted results shows the validity of the predicted results. The proposed model can predict CM current with sufficient accuracy, and also identify the primary coupling-mechanism of CM generation. Then far-electric field was predicted by using the proposed method, and it was demonstrated that outline of the frequency response of the undesired EM radiation from the PCB driven by the connected feed cable can be predicted with engineering accuracy (within 6 dB) up to 18 GHz. Finally, as example of application of equivalent circuit model to EMC design, effect of the width of the ground plane was predicted and discussed. The equivalent circuit model provides enough flexibility for different geometrical parameters and increases our ability to provide insights and design guidelines.

We propose an interactive method for assisting the coloring process of 2D hand-drawn animated cartoons. It segments input frames (each hand-drawn drawing of the cartoon) into regions (areas surrounded by closed lines. E.g. the head, the hands) extracts their features, and then matches the regions between frames, allowing the user to fix coloring mistakes interactively. Its main contribution consists in storing matched regions in lists called "chains" for tracking how the region features vary along the animation. Consequently, the matching rate is improved and the matching mistakes are reduced, thus reducing the total effort needed until having a correctly colored cartoon.

The polarization dependence of the resonance wavelength of long period fiber gratings (LPFGs) that employ the photoelastic effect is investigated based on a simple model. The proposed model for estimating the birefringence of these LPFGs provides a good explanation of the experimental results.

An integral equation approach with a new solution procedure using moment method (MoM) is applied for the computation of coupled currents on the surface of a printed dipole antenna and inside its high-permittivity three-dimensional dielectric substrate. The main purpose of this study is to validate the accuracy and reliability of the previously proposed MoM procedure by authors for the solution of a coupled volume-surface integral equations system. In continuation of the recent works of authors, a mixed-domain MoM expansion using Legendre polynomial basis function and cubic geometric modeling are adopted to solve the tensor-volume integral equation. In mixed-domain MoM, a combination of entire-domain and sub-domain basis functions, including three-dimensional Legnedre polynomial basis functions with different degrees is utilized for field expansion inside dielectric substrate. In addition, the conventional Rao-Wilton-Glisson (RWG) basis function is employed for electric current expansion over the printed structure. The accuracy of the proposed approach is verified through a comparison with the MoM solutions based on the spectral domain Green's function for infinitely large substrate and the results of FDTD method.

In prior work, contact welding phenomena were observed in automotive relays during break of motor inrush current. The switching performance of the type of relay investigated could be correlated with the parameters: over-travel, coil suppression, and the break current. In the present work the author further explores the impact of both the contact material (silver tin oxide versus fine grain silver) and the contact surface topography (brand new and pre-aged contacts). He further assesses the robustness of the system "relay" with those parameters using the Taguchi methods for robust design. Furthermore, the robustness of two alternative automotive relay types will be discussed.

Given a sparse linear system, A x = b, we can solve the equivalent system P A PT y = P b, x = PT y, where P is a permutation matrix. It has been known that, for example, when P is the RCMK (Reverse Cuthill-Mckee) ordering permutation, the convergence rate of the Krylov subspace method combined with the ILU-type preconditioner is often enhanced, especially if the matrix A is highly nonsymmetric. In this paper we offer a reordering heuristic for accelerating the solution of large sparse linear systems by the Krylov subspace methods with the ILUT preconditioner. It is the LRB (Line Red/Black) ordering based on the well-known 2-point Red-Black ordering. We show that for some model-like PDE (partial differential equation)s the LRB ordered FDM (Finite Difference Method)/FEM (Finite Element Method) discretization matrices require much less fill-ins in the ILUT factorizations than those of the Natural ordering and the RCMK ordering and hence, produces a more accurate preconditioner, if a high level of fill-in is used. It implies that the LRB ordering could outperform the other two orderings combined with the ILUT preconditioned Krylov subspace method if the level of fill-in is high enough. We compare the performance of our heuristic with that of the RCMK (Reverse Cuthill-McKee) ordering. Our test matrices are obtained from various standard discretizations of two-dimensional and three-dimensional model-like PDEs on structured grids by the FDM or the FEM. We claim that for the resulting matrices the performance of our reordering strategy for the Krylov subspace method combined with the ILUT preconditioner is superior to that of RCMK ordering, when the proper number of fill-in was used for the ILUT. Also, while the RCMK ordering is known to have little advantage over the Natural ordering in the case of symmetric matrices, the LRB ordering still can improve the convergence rate, even if the matrices are symmetric.

In spectrum-sharing systems where the secondary user (SU) opportunistically accesses the primary user (PU)'s licensed channel, the SU should satisfy both the transmit power constraint of the SU transmitter and the received power constraint at the PU receiver. This letter studies the ergodic capacity of spectrum-sharing systems in fading channels. The ergodic capacity expression along with the optimal power allocation scheme is derived considering both the average transmit and received power constraints. The capacity function in terms of the two power constraints is found to be divided into transmit power limited region, received power limited region and dual limited region. Numerical results in Rayleigh fading channels are presented to verify our analysis.