In this paper, the research advances in SIW-like (Substrate Integrated Waveguide-like) guided wave structures and their applications in the State Key Laboratory of Millimeter Waves of China is reviewed. Our work is concerned with the investigations on the propagation characteristics of SIW, half-mode SIW (HMSIW) and the folded HMSIW (FHMSIW) as well as their applications in microwave and millimeter wave filters, diplexers, directional couplers, power dividers, antennas, power combiners, phase shifters and mixers etc. Selected results are presented to show the interesting features and advantages of those new techniques.

Input/Output (I/O) automata and the Temporal Logic of Actions (TLA) are two well-known techniques for the specification and verification of concurrent systems. Over the past few years, they have been extended to the so-called dynamic I/O automata and, respectively, Mobile TLA (MTLA) in order to be more appropriate for mobile agent systems. Dynamic I/O automata is just a mathematical model, whereas MTLA is a logic with a formally defined language. In this paper, therefore, we investigate how MTLA could be used as a formal language for the specification of dynamic I/O automata. We do this by writing an MTLA specification of a travel agent system which has been specified semi-formally in the literature on that model. In this specification, we deal with always existing agents as well as with an initially unknown number of dynamically created agents, with mobile and non-mobile agents, with I/O-automata-style communication, and with the changing communication capabilities of mobile agents. We have previously written a TLA specification of this system. This paper shows that an MTLA specification of such a system can be more elegant and faithful to the dynamic I/O automata definition because the agent existence and location can be expressed directly by using agent and location names instead of special variables as in TLA. It also shows how the reuse of names for dynamically created and destroyed agents within the dynamic I/O automata framework can be specified in MTLA.

Transform each coordinate of the realizations of several random variables (RVs) by the distribution function of the corresponding RV and partition the range space into a uniform grid. The expected number of occupied grid-boxes will be greatest when these RVs are independent. Based on this fact, we propose a novel measure of independence named grid occupancy (GO). We also address the problem of how to make optimum selection of the parameters in GO, i.e., the number of observations and the number of quantization levels. In addition, we apply GO to independent component analysis (ICA). The GO based ICA algorithm can separate signals with arbitrary continuous distributions and favors digital hardware implementation.

The line-based method has been one of the most commonly-used methods of hardware implementation of two-dimensional (2D) discrete wavelet transform (DWT). However, data buffer is required between the row DWT processor and the column DWT processor to solve the data flow mismatch, which increases the on-chip memory size and the output latency. Since the incompatible data flow is induced from the intrinsic property of adopted lifting-based algorithm, a decomposed lifting algorithm (DLA) is presented by rearranging the data path of lifting steps to ensure that image data is processed in raster scan manner in row processor and column processor. Theoretical analysis indicates that the precision issue of DLA outperforms other lifting-based algorithms in terms of round-off noise and internal word-length. A memory-efficient and high-performance line-based architecture is proposed based on DLA without the implementation of data buffer. For an N M image, only 2N internal memory is required for 5/3 filter and 4N of that is required for 9/7 filter to perform 2D DWT, where N and M indicate the width and height of an image. Compared with related 2D DWT architectures, the size of on-chip memory is reduced significantly under the same arithmetic cost, memory bandwidth and timing constraint. This design was implemented in SMIC 0.18 µm CMOS logic fabrication with 32 kbits dual-port RAM and 20 K equivalent 2-input NAND gates in a 1.00 mm 1.00 mm die, which can process 512 512 image under 100 MHz.

In this paper, we study d-primitive words and D(1)-concatenated words. First we show that neither D(1), the set of all d-primitive words, nor D(1)D(1), the set of all D(1)-concatenated words, is regular. Next we show that for u, v, w ∈Σ+ with |u|=|w|, uvw ∈ D(1) if and only if uv+w ⊆ D(1). It is also shown that every d-primitive word, with the length of two or more, is D(1)-concatenated.

In this paper, a novel illumination invariant face recognition algorithm is proposed for face recognition. This algorithm is composed of two phases. In the first phase, we reduce the effect of illumination changes using a nonlinear mapping of image intensities. Then, we modify the distribution of the coefficients of wavelet transform in certain sub-bands. In this step, the recognition performance is more important than image quality. In the second phase, we used the unitary factor of polar decomposition of enhanced image as a feature vector. In the recognition phase, the correlation-based nearest neighbor rule is applied for the matching. We have performed some experiments on several databases and have evaluated the proposed method in different aspects. Experimental results in recognition show that this approach provides a suitable representation for overcoming illumination effects.

In this paper, we present a forecasting method for the view of Mt. Fuji as an application of Earth observation data (EOD) obtained by satellites. We defined the Mt. Fuji viewing index (FVI) that characterises how well the mountain looks on a given day, based on photo data produced by a fixed-point observation. A long-term predictor of FVI, ranging from 0 to 30 days, was constructed through support vector machine regression on climate and earth observation data. It was found that the aerosol mass concentration (AMC) improves prediction performance, and such performance is particularly significant in the long-term range.

In this paper, first, we propose a new recursive algorithm for evaluating generalized multi-state k-out-of-n:F systems. This recursive algorithm can be applied to the systems even though the states of all components in the system are assumed to be non-i.i.d. random variables. Our algorithm is useful for any multi-state k-out-of-n:F system, including the decreasing, increasing and constant multi-state k-out-of-n:F system. Furthermore, our algorithm can evaluate the state distributions of the other non-monotonic multi-state k-out-of-n:F systems. Next, we calculate the order of computing time and memory capacity of the proposed algorithm. We perform numerical experiments in the non-i.i.d. case. The results show that the proposed algorithm is efficient for evaluating the system state distribution of multi-state k-out-of-n:F system when n is large and kl are small.

We describe a co-channel interference rejection scheme that is suitable for QR-decomposition maximum likelihood detection (MLD) in multiple-input and multiple output (MIMO) systems. A pre-whitening matrix for interference rejection is decomposed into a triangular matrix and its Hermitian matrix by using a complex Gaxpy version of the Cholesky algorithm. The decomposed triangular matrix is used as a spatial pre-filter to whiten co-channel interference. Simulation results demonstrate that the proposed scheme can suppress co-channel interference streams at the cost of receive diversity order and achieves better transmission performance than QR-decomposition MLD itself in MIMO channels with co-channel interference.

In this paper the time-domain analysis of two parallel traces is investigated. First, the telegrapher's equations for transmission line are applied to the parallel traces on printed circuit board (PCB), and are solved by using the mode decomposition technique. The time-domain solutions are then obtained by using the inverse Laplace transform. Although the Fourier-transform technique is also applicable for this problem, the solution is given numerically. Contrarily, the inverse Laplace transform successfully leads to an analytical expression for the transmission characteristics. The analytical expression is represented by series, which clearly explains the coupling mechanism. The analytical expression for the fundamental section of a meander delay line is investigated in detail. The analytical solution is validated by measurements, and the characteristics of the distortions in the output waveforms of meander delay lines due to the crosstalk are also investigated.

This letter presents a new approach to provide inter-domain service compositions for OSGi environments. Our proposal of remote wire objects extends OSGi's wiring capability across the framework boundaries, so that even remote services can join in the composition. Hence, a better composition is made possible with a richer set of candidate services from foreign domains.

In this letter, we propose new digital audio watermarking methods using interval wavelet decomposition. We develop not only non-blind type method, but also blind one. Experimental results demonstrate that the proposed methods give a watermarked audio clip of better quality and are robust against some attacks.

This letter describes combining OSGi and Web Services in service composition. According to our approach, a composite service is described in WS-BPEL. Each component service in the description may be resolved to either an OSGi service or Web Service at runtime. The proposal can overcome current limitations with OSGi technology in terms of its geographical coverage and candidate service population available for service composition.

In this letter, we propose a novel signal detection method, reduced complexity QRM-MLD, which achieves almost identical error performance to that of the conventional QRM-MLD while significantly reducing the computational complexity.

A sound field reproduction method is proposed that uses blind source separation and a head-related transfer function. In the proposed system, multichannel acoustic signals captured at distant microphones are decomposed to a set of location/signal pairs of virtual sound sources based on frequency-domain independent component analysis. After estimating the locations and the signals of the virtual sources by convolving the controlled acoustic transfer functions with each signal, the spatial sound is constructed at the selected point. In experiments, a sound field made by six sound sources is captured using 48 distant microphones and decomposed into sets of virtual sound sources. Since subjective evaluation shows no significant difference between natural and reconstructed sound when six virtual sources and are used, the effectiveness of the decomposing algorithm as well as the virtual source representation are confirmed.

An algorithm for blind signal separation (BSS) of convolutive mixtures is presented. In this algorithm, the BSS problem is treated as multidimensional independent component analysis (ICA) by introducing an extended signal vector which is composed of current and previous samples of signals. It is empirically known that a number of conventional ICA algorithms solve the multidimensional ICA problem up to permutation and scaling of signals. In this paper, we give theoretical justification for using any conventional ICA algorithm. Then, we discuss the remaining problems, i.e., permutation and scaling of signals. To solve the permutation problem, we propose a simple algorithm which classifies the signals obtained by a conventional ICA algorithm into mutually independent subsets by utilizing temporal structure of the signals. For the scaling problem, we prove that the method proposed by Koldovský and Tichavský is theoretically proper in respect of estimating filtered versions of source signals which are observed at sensors.

It is a very important and intriguing problem in digital image-processing to decompose an input image into intuitively convincible image-components such as a structure component and a texture component, which is an inherently nonlinear problem. Recently, several numerical schemes to solve the nonlinear image-decomposition problem have been proposed. The use of the nonlinear image-decomposition as a pre-process of several image-processing tasks will possibly pave the way to solve difficult problems posed by the classic approach of digital image-processing. Since the new image-processing approach via the nonlinear image-decomposition treats each separated component with a processing method suitable to it, the approach will successfully attain target items seemingly contrary to each other, for instance invisibility of ringing artifacts and sharpness of edges and textures, which have not attained simultaneously by the classic image-processing approach. This paper reviews quite recently developed state-of-the-art schemes of the nonlinear image-decomposition, and introduces some examples of the decomposition-and-processing approach.

A desired property of large distributed systems is self adaptability against the faults that occur more frequently as the size of the distributed system grows. Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of faults (quick recovery and small effect) against small number of faults. However, existing composition techniques for self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing self-stabilizing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that provides a composition of multiple fault-containing self-stabilizing protocols while preserving the fault-containment property of the source protocols.

Eigen-beamforming (EB) transmission for multiple-input multiple-output (MIMO) systems is an effective means to maximize the receiver signal-to-noise ratio (SNR) in a noise-limited environment, but suffers a performance degradation when strong interference signals exist. In this letter, we propose an interference cancellation method for EB signals by constructing a new receive beamforming vector which jointly utilizes the EB matrix and minimum mean-square error (MMSE) spatial demultiplexing. The proposed method is shown to outperform the conventional EB receiver in the entire cell range, with a significant increase in the effective signal-to-interference plus noise ratio (SINR) near the cell boundary.

The deployment of historical trajectories of moving objects has greatly increased for various applications in road networks. For instance, similar patterns of moving-object trajectories are very useful for designing the transportation network of a new city. In this paper, we define a spatio-temporal similarity measure based on a road network distance, rather than a Euclidean distance. We also propose a new similar trajectory search algorithm based on the spatio-temporal measure by using an efficient pruning mechanism. Finally, we show the efficiency of our algorithm, both in terms of retrieval accuracy and retrieval efficiency.