One of the patterns that the design of parallel file systems has to solve stems from the difficulty of handling the metadata-intensive I/O generated by parallel applications accessing a single large directory. We demonstrate a middleware design called SFS to support existing parallel file systems for distributed and scalable directory service. SFS distributes directory entries over data servers instead of metadata servers to offer increased scalability and performance. Firstly, SFS exploits an adaptive directory partitioning based on extendible hashing to support concurrent and unsynchronized partition splitting. Secondly, SFS describes an optimization based on recursive split-ordering that emphasizes speeding up the splitting process. Thirdly, SFS applies a write-optimized index structure to convert slow, small, random metadata updates into fast, large, sequential writes. Finally, SFS gracefully tolerates stale mapping at the clients while maintaining the correctness and consistency of the system. Our performance results on a cluster of 32-servers show our implementation can deliver more than 250,000 file creations per second on average.

This paper proposes a novel image integral equation of the first type (IIE-1) for a TE plane wave scattering from periodic rough surfaces with perfect conductivity by means of the method of image Green's function. Since such an IIE-1 is valid for any incident wavenumbers including the critical wavenumbers, the analytical properties of the scattered wavefield can be generally and rigorously discussed. This paper firstly points out that the branch point singularity of the bare propagator inevitably appears on the incident wavenumber characteristics of the scattered wavefield and its related quantities just at the critical wavenumbers. By applying a quadrature method, the IIE-1 becomes a matrix equation to be numerically solved. For a periodic rough surface, several properties of the scattering are shown in figures as functions of the incident wavenumbers. It is then confirmed that the branch point singularity clearly appears in the numerical solution. Moreover, it is shown that the proposed IIE-1 gives a numerical solution satisfying sufficiently the optical theorem even for the critical wavenumbers.

This paper describes recent progress of photonically-enabled systems for millimeter-wave and terahertz measurement applications. After briefly explaining signal generation schemes as a foundation of photonics-based approach, system configurations for specific applications are discussed. Then, practical demonstrations are presented, which include frequency-domain spectroscopy, phase-sensitive measurement, electric-field measurement, and 2D/3D imaging.

A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has one due date per time slot and has to be completed just-in-time on one of its due dates. Moreover, each job has a certain weight per time slot. We would like to find a just-in-time schedule that maximizes the total weight under multi-slot conditions. In this paper, we prove that this problem is NP-hard.

This paper proposes an efficient video object segmentation approach that is tolerant to complex scene dynamics. Unlike existing approaches that rely on estimating object-like proposals on an intra-frame basis, the proposed approach employs temporally consistent foreground hypothesis using nonlinear regression of saliency guided proposals across a video sequence. For this purpose, we first generate salient foreground proposals at superpixel level by leveraging a saliency signature in the discrete cosine transform domain. We propose to use a random forest based nonlinear regression scheme to learn both appearance and shape features from salient foreground regions in all frames of a sequence. Availability of such features can help rank every foreground proposals of a sequence, and we show that the regions with high ranking scores are well correlated with semantic foreground objects in dynamic scenes. Subsequently, we utilize a Markov Random Field to integrate both appearance and motion coherence of the top-ranked object proposals. A temporal nonlinear regressor for generating salient object support regions significantly improves the segmentation performance compared to using only per-frame objectness cues. Extensive experiments on challenging real-world video sequences are performed to validate the feasibility and superiority of the proposed approach for addressing dynamic scene segmentation.

In this paper, an electromagnetic plane wave diffraction by finite number of loaded thick slits on infinitely long perfectly electric conductor (PEC) screen is analyzed. Here we formulate the problem by utilizing the Kobayashi Potential (KP) method, which is a kind of eigenfunction expansion method in terns of Weber-Schafheitlin discontinuous integrals. The multiple scattering contributions between the slits are analytically included in the formulation. The solution derived here may provide us with precise numerical result, so it may be considered as a reference solution to other numerical and approximate analyses.

We herein describe an autonomous peer discovery scheme for Device-to-Device (D2D) communications. With the increasing popularity of D2D communications, an efficient means of finding the neighboring node, i.e., peer discovery, is required. To this end, we propose a new autonomous peer discovery scheme that uses azimuth spread (AS), delay spread (DS), and shadow fading of the uplink pilot from each mobile station (MS). Given that AS, DS, and shadow fading are spatially correlated, nodes that have similar values must be neighbors. The proposed scheme filters out the MSs that are unlikely to be neighbors and uses the Kolmogorov-Smirnov (K-S) test to improve the accuracy of neighbor discovery. Unlike previous peer discovery schemes that incur additional signaling overheads, our proposal finds neighboring nodes by using the existing uplink pilot transmission from MSs such that neighboring peers can be found autonomously. Through analysis and simulation, we show that neighboring MSs can be found accurately with low latency.

A frequency-domain (FD) uniform asymptotic solution (FD-UAS) which is useful for engineering applications is newly derived for the two-dimensional scattered magnetic field by a coated conducting cylinder covered with a thin lossy medium. The FD-UAS is uniform in the sense that it remains valid within the transition region adjacent to the shadow boundary, and it smoothly connects a geometric optical ray (GO) solution and a geometrical theory of diffraction (GTD) solution exterior to the transition region, respectively. We assume that the thickness of a coating medium is thin as compared with one wavelength of a cylindrical wave radiated from a magnetic line source. This uniform asymptotic solution is represented by a combination of scattered field component solutions, namely, the GO solution composed of a direct GO (DGO) and a reflected GO, the extended uniform GTD (extended UTD) solution made up of a DGO and a pseudo surface diffracted ray (pseudo SD), the modified UTD solution representing SD series, and the GTD solution for a lowest order SD. The FD-UAS is valid for a source point and/or an observation point located either near the coating surface or in the far-zone. The effectiveness and usefulness of the FD-UAS presented here are confirmed by comparing with both the exact solution and the conventional UTD shadow region solution.

We propose a new swept-frequency measurement method for the electromagnetic characterization of materials. The material is a multilayer cylinder that pierces a rectangular waveguide through two holes in the narrow waveguide walls. The complex permittivity and permeability of the material are calculated from measured S-parameters as an inverse problem. To this aim, the paper develops a complete electromagnetic formulation of the problem, where the effects of material insertion holes are taken into consideration. The formulation is validated through the measurement of ferrite and water samples in the S-band.

We propose an algorithm for the scattering analyses of gratings with various local defects based on the difference-field boundary-element method (DFBEM). In the algorithm, the defect in the grating is partitioned, and the DFBEM is sequentially applied for each defect section. We validate the proposed algorithm by demonstrating its flexibility for various defect topologies for a locally deformed grating.

Unsupervised spoken unit discovery or zero-source speech recognition is an emerging research topic which is important for spoken document analysis of languages or dialects with little human annotation. In this paper, we extend our earlier joint training framework for unsupervised learning of discrete density HMM to continuous density HMM (CDHMM) and apply it to spoken unit discovery. In the proposed recipe, we first cluster a group of Gaussians which then act as initializations to the joint training framework of nonnegative matrix factorization and semi-continuous density HMM (SCDHMM). In SCDHMM, all the hidden states share the same group of Gaussians but with different mixture weights. A CDHMM is subsequently constructed by tying the top-N activated Gaussians to each hidden state. Baum-Welch training is finally conducted to update the parameters of the Gaussians, mixture weights and HMM transition probabilities. Experiments were conducted on word discovery from TIDIGITS and phone discovery from TIMIT. For TIDIGITS, units were modeled by 10 states which turn out to be strongly related to words; while for TIMIT, units were modeled by 3 states which are likely to be phonemes.

We deal with the scattering of a plane wave by the end-face of a waveguide system by the numerical method based on the sinc function and calculate the electric field on the end-face. It is shown that the results obtained analytically by the perturbation method are in relatively good agreement with the numerical results.

This work presents an approximate global optimization method for image halftone by fusing multi-scale information of the tree model. We employ Gaussian mixture model and hidden Markov tree to characterized the intra-scale clustering and inter-scale persistence properties of the detailed coefficients, respectively. The model of multiscale perceived error metric and the theory of scale-related perceived error metric are used to fuse the statistical distribution of the error metric of the scale of clustering and cross-scale persistence. An Energy function is then generated. Through energy minimization via graph cuts, we gain the halftone image. In the related experiment, we demonstrate the superior performance of this new algorithm when compared with several algorithms and quantitative evaluation.

A high frequency approximation method is proposed to obtain the scattering from rectangular dielectric cuboids. Our formulation is based on a Kirchhoff type aperture integration of the equivalent current sources over the surface of the scattering bodies. The derived formulae have been used to get the radar cross section of cuboids, and the results are compared with those by other methods, such as physical optics, geometrical theory of diffraction, the HFSS simulation and measurements. Good agreement has been observed to confirm the validity of our method.

This paper describes a hierarchical and cooperative transport system with demand responsive buses to improve service quality of public transport system in city area and its suburbs. To provide the demand responsive buses generally requires planning route and schedule called dial-a-ride problem. However, the problem complexity increases with the increasing of the number of requests. Therefore, we propose the hierarchical and cooperative transport system. Framework of the system can reduce scale of the problem by grouping customers. We have evaluated the proposed system on a static simulation and a dynamic microscopic simulation. The simulation result has shown the system could improve service quality by reducing customer's load. Moreover, the result of the dynamic simulation have provided the detailed features of the system.

To investigate electrostatic discharge (ESD) immunity testing for wearable electronic devices, the worst scenario i.e., an ESD event occurs when the body-mounted device approaches a grounded conductor is focused in this paper. Discharge currents caused by air discharges from a charged human through a hand-held metal bar or through a semi-sphere metal attached to the head, arm or waist in lieu of actual wearable devices are measured. As a result, it is found that at a human charge voltage of 1kV, the peak current from the semi-sphere metal is large in order of the attachment of the waist (15.4A), arm (12.8A) and head (12.2A), whereas the peak current (10.0A) from the hand-held metal bar is the smallest. It is also found that the discharge currents through the semi-sphere metals decrease to zero at around 50ns regardless of the attachment positions, although the current through the hand-held metal bar continues to flow at over 90ns. These discharge currents are further characterized by the discharge resistance, the charge storage capacitance and the discharge time constant newly derived from the waveform energy, which are validated from the body impedance measured through the hand-held and body-mounted metals. The above finding suggests that ESD immunity test methods for wearable devices require test specifications entirely different from the conventional ESD immunity testing.

In PQCrypto 2013, Yasuda, Takagi and Sakurai proposed a new signature scheme as one of multivariate public key cryptosystems (MPKCs). This scheme (called YTS) is based on the fact that there are two isometry classes of non-degenerate quadratic forms on a vector space with a prescribed dimension. The advantage of YTS is its efficiency. In fact, its signature generation is eight or nine times faster than Rainbow of similar size. For the security, it is known that the direct attack, the IP attack and the min-rank attack are applicable on YTS, and the running times are exponential time for the first and the second attacks and sub-exponential time for the third attack. In the present paper, we give a new attack on YTS whose approach is to use the diagonalization of matrices. Our attack works in polynomial time and it actually recovers equivalent secret keys of YTS having 140-bits security against min-rank attack in around fifteen seconds.

This paper proposes a practical throughput upper bound that considers physical layer techniques using adaptive modulation and coding (AMC) for orthogonal frequency division multiplexing (OFDM) multiple-input multiple-output (MIMO) multiplexing. The proposed upper bound is computed from the modulation and coding scheme (MCS) that provides the maximum throughput considering the required block error rate (BLER) at the respective received signal-to-noise power ratios as a constraint. Then, based on the practical throughput upper bound, we present the causes of impairment for selecting the best MCS based on the computed mutual information for OFDM MIMO multiplexing. More specifically, through the evaluations, we investigate the effect of MCS selection error on an increasing maximum Doppler frequency due to the round trip delay time and the effect of channel estimation error of maximum likelihood detection associated with reference signal based channel estimation.

In this paper, we propose SimCS (similarity based on contribution scores) to compute the similarity of scientific papers. For similarity computation, we exploit a notion of a contribution score that indicates how much a paper contributes to another paper citing it. Also, we consider the author dominance of papers in computing contribution scores. We perform extensive experiments with a real-world dataset to show the superiority of SimCS. In comparison with SimCC, the-state-of-the-art method, SimCS not only requires no extra parameter tuning but also shows higher accuracy in similarity computation.

The authors proposed an algorithm for calculation of new lower bound (rank bounded distance) using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm with moving the row or column. In this paper, we discuss the calculation method of the rank bounded distance by conjugate elements for cyclic codes.