A novel bimodal method for face recognition under low-level lighting conditions is proposed. It fuses an enhanced gray level image and an illumination-invariant geometric image at the feature-level. To further improve the recognition performance under large variations in attributions such as poses and expressions, discriminant features are extracted from source images using the wavelet transform-based method. Features are adaptively fused to reconstruct the final face sample. Then FLD is used to generate a supervised discriminant space for the classification task. Experiments show that the bimodal method outperforms conventional methods under complex conditions.

We study the high-frequency asymptotic analysis methods for the scattered fields by a cylindrically curved conducting surface excited by the incident wave on the curved surface from the convex side. We first derive the novel hybrid ray-mode solution for the scattered fields near the concave surface by solving a canonical problem formulated under the assumption that the cylindrically curved conducting surface possesses only one edge. Then by applying the ray tracing technique and the idea of Keller's GTD (Geometrical Theory of Diffraction), the solutions derived for the canonical problem are extended to account for the problem of the radiation from and the scattering by the other edge of the cylindrically curved surface. We confirm the validity of the novel asymptotic representations proposed in the present study by comparing both with the numerical results obtained from the method of moment and the experimental results performed in the anechoic chamber.

A numerical scheme for the analytic continuation of radiation patterns of the azimuthal coordinate θ into the whole space over the complex plane is given. The scattering data given over the real space [0, 2π] are extended into the complex plane by using the recurrence formulas. An example shows the validity of mathematically exact evaluation for the scattering from polygonal cylinders.

Bolstering survivable backbone networks against multiple failures is becoming a common concern among telecom companies that need to continue services even when disasters occur. This paper presents a multiple-failure recovery scheme that considers the operation and management of optical paths. The presented scheme employs scheme escalation from pre-planned restoration to full rerouting. First, the survivability of this scheme against multiple failures is evaluated considering operational constraints such as route selection, resource allocation, and the recovery order of failed paths. The evaluation results show that scheme escalation provides a high level of survivability even under operational constraints, and this paper quantitatively clarifies the impact of these various operational constraints. In addition, the fundamental functions of the scheme escalation are implemented in the Generalized Multi-Protocol Label Switching control plane and verified in an optical-cross-connect-based network.

This paper addresses the problem of joint transceiver design for Tomlinson-Harashima Precoding (THP) in the multiuser multiple-input-multiple-output (MIMO) downlink under both perfect and imperfect channel state information at the transmitter (CSIT). For the case of perfect CSIT, we differ from the previous work by performing stream-wise (both inter-user and intra-user) interference pre-cancelation at the transmitter. A minimum total mean square error (MT-MSE) criterion is used to formulate our optimization problem. By some convex analysis of the problem, we obtain the necessary conditions for the optimal solution. An iterative algorithm is proposed to handle this problem and its convergence is proved. Then we extend our designed algorithm to the robust version by minimizing the conditional expectation of the T-MSE under imperfect CSIT. Simulation results are given to verify the efficacy of our proposed schemes and to show their superiorities over existing MMSE-based THP schemes.

This paper deals with a new formulation for the diffraction of a plane wave by a periodic grating. As a simple example, the diffraction of a transverse magnetic wave by a perfectly conductive periodic array of rectangular grooves is discussed. On the basis of a shadow hypothesis such that no diffraction takes place and only the reflection occurs with the reflection coefficient -1 at a low grazing limit of incident angle, this paper proposes the scattering factor as a new concept. In terms of the scattering factor, several new formulas on the diffraction amplitude, the diffraction efficiency and the optical theorem are obtained. It is newly found that the scattering factor is an even function due to the reciprocity. The diffraction efficiency is defined for a propagating incident wave as well as an evanescent incident wave. Then, it is theoretically found that the 0th order diffraction efficiency becomes unity and any other order diffraction efficiencies vanish when a real angle of incidence becomes low grazing. Numerical examples of the scattering factor and diffraction efficiency are illustrated in figures.

In this letter we provide a steering law for redundant single-gimbal control moment gyros. The proposed steering law is an extended version of the singular direction avoidance (SDA) steering law based on the singular value decomposition (SVD). All internal singularities are escapable for any non-zero constant torque command using the proposed steering law.

An inverse scattering problem of estimating the reflection coefficient and the surface impedance from two sets of absolute values of the near field with periodic change is investigated. The problem is formulated in terms of a nonlinear simultaneous equations which is derived from the relation between the two sets of absolute values and the field defined by a finite summation of the modal functions by applying the Fourier analysis. The reflection coefficient is estimated by solving the equations by Newton's method through the successive algorithm with the increment of the number of truncation in the summation one after another. Numerical examples are given and the accuracy of the estimation is discussed.

This paper deals with the scattering of a transverse magnetic (TM) plane wave from a perfectly conductive surface with a finite periodic array of rectangular grooves. By use of the method in a previous paper [IEICE TRANS. ELECTRON. VOL.E90-C, no.4, pp.903-906, APRIL 2007], the total scattering cross section is numerically calculated for several different numbers of grooves at a low grazing angle of incidence. It is newly found that, when the corrugation width becomes thousands times of wavelength, the total scattering cross section slightly depends on the groove depth and the period, and becomes almost proportional to square root of the corrugation width with a small correction.

To address the low performance for channel scanning in the DVB-T system, we propose an enhanced front-end algorithm in this paper. The proposed algorithm consists of Auto Scan and Normal Scan, which is a part of the tuning algorithm for front-end (tuner) drivers in the DVB-T receiver. The key idea is that the frequency offset is saved when performing Auto Scan in order to reduce the channel change time for Normal Scan. In addition, the results of a performance evaluation demonstrate that our enhanced front-end algorithm improves the performance of channel scanning significantly, as compared to the generic front-end algorithm.

For ID-based cryptography, not only pairing but also scalar multiplication must be efficiently computable. In this paper, we propose a scalar multiplication method on the circumstances that we work at Ate pairing with Barreto-Naehrig (BN) curve. Note that the parameters of BN curve are given by a certain integer, namely mother parameter. Adhering the authors' previous policy that we execute scalar multiplication on subfield-twisted curve (Fp2) instead of doing on the original curve E(Fp12), we at first show sextic twisted subfield Frobenius mapping (ST-SFM) in (Fp2). On BN curves, note is identified with the scalar multiplication by p. However a scalar is always smaller than the order r of BN curve for Ate pairing, so ST-SFM does not directly applicable to the above circumstances. We then exploit the expressions of the curve order r and the characteristic p by the mother parameter to derive some radices such that they are expressed as a polynomial of p. Thus, a scalar multiplication [s] can be written by the series of ST-SFMs . In combination with the binary method or multi-exponentiation technique, this paper shows that the proposed method runs about twice or more faster than plain binary method.

In this paper, we investigate the transitional dynamics and quasi-periodic solution appearing after the Saddle-Node (SN) bifurcation of a periodic solution in an inductor-coupled asymmetrical van der Pol oscillators with hard-type nonlinearity. In particular, we elucidate, by investigating global bifurcation of unstable manifold (UM) of saddles, that transitional dynamics and quasi-periodic solution after the SN bifurcation appear based on different structure of UM.

In this paper, we suggest a method of analyzing the post-wall waveguide (PWW) or the substrate integrated waveguide (SIW) by applying the analytical technique of the H-plane waveguide discontinuities based on the planar circuit approach. The analytical procedure consists of the derivation of the mode impedance matrices for regular-shaped circuits and the short-circuiting operation on fictitious ports arranged at the peripheries of the metallic posts. First, a straight section of the PWW is treated as an example and the analytical method for the calculation of the S-parameters is described in detail. Then the attenuation and phase constants of the PWW are computed with the aid of the Thru-Reflect Line (TRL) calibration technique. Next, the analytical method is applied to the design of two types of right-angled corners. The analysis and the design results are verified using an em-simulator (HFSS).

GPS is an efficient identification (ID) scheme based on Schnorr ID scheme designed for applications where low cost devices with limited resources are used and a very-short authentication time is required. Let P and V be a prover and a verifier in GPS and < g > be a multiplicative group. P holds a secret key S∈[0,S) and publishes I=g-s. In each elementary round: (1) P sends to Vx=gr where r is chosen randomly from [0,A), (2) V sends to P a random C∈[0,B), and (3) P sends y=r+cs (no modulus computation). Since there is no modular reduction on y, a key issue is whether GPS leaks information about s. It has been proved that GPS is statistical zero-knowledge, if in asymptotic sense, BS/A is negligible, where is the number of elementary rounds in one complete identification trial. In this paper, first we will show the followings. (1) We can construct a concrete attack procedure which reveals one bit of secret key s from the specified value range of y unless BS/A is negligible. We reconfirm that we must set A extremely large compared to BS. (2) This drawback can be avoided by modifying GPS into a new scheme, GPS+, in which P does not send the value of y in the specified range where y reveals some information about s. GPS+ ensures perfect ZK only by requiring both A > BS and A being a multiple of the order of g, while it allows an honest P to be rejected with probability at most BS/(2A) in one elementary round. Under the standard recommended parameters for 80-bit security where =1, |S|=160, and |B|=35, |A|=275 is recommended for GPS in GPS' paper. On the other hand, GPS+ can guarantee 80-bit security and less than one false rejection on average in 100 identifications with only |A|=210 with the same parameters as above. In practice, this implies 275-210=65 bits (≈24%) reductions on storage requirement. We have confirmed that the reduce of A also reduces approximately 4% of running time for online response using a certain implementation technique for GPS+ by machine experiment.

Orthogonal Frequency Division Multiple Access (OFDMA) is the technique for the next generation wireless networks, whose enhanced capacity is to serve a combination of traffic with diverse QoS requirements. To realize this, the resource allocation scheme has to be carefully designed so that the instantaneous channel condition, QoS provision, and the network utilization are integrated. In this paper, we propose the resource allocation scheme for downlink traffic of 2 classes; guaranteed and non-guaranteed, having different traffic contracts. We provide guaranteed throughput for the guaranteed class by considering the cost incurred from serving this class. Then, we formulate the assignment problem with the objective of minimizing this cost. For the non-guaranteed class, we aim to maximize network utilization and to maintain throughput fairness, by employing Proportional Fairness (PF) utility function and emphasizing on the portion of network resource that the user received and the individual user's queue length. We use a heuristic approach to schedule users' data into the downlink subframe by exploiting multi-user multi-channel diversity to utilize system's bandwidth efficiently. Intensive simulation shows that our scheme differentiates classes of traffic and provides satisfied throughput, lower packet drop rate, and lower queuing delay to the guaranteed class, comparing with those of the non-guaranteed class. Furthermore, the results also show that the scheme is fair to users in the same class in both throughput and service time.

This paper reexamines reflection and transmission of a TE plane wave from a two-dimensional random slab discussed in the previous paper [IEICE Trans. Electron., Vol.E79-C, no.10, pp.1327-1333, October 1996] by means of the stochastic functional approach with the multiply renormalizing approximation. A random wavefield representation is explicitly shown in terms of a Wiener-Hermite expansion. The first-order incoherent scattering cross section and the optical theorem are numerically calculated. Enhanced scattering as gentle peaks or dips on the angular distribution of the incoherent scattering is reconfirmed in the directions of reflection and backscattering, and is newly found in the directions of forward scattering and 'symmetrical forward scattering.' The mechanism of enhanced scattering is deeply discussed.

This paper develops a methodology for resizing image resolutions in an arbitrary orthogonal block transform domain. To accomplish this, we represent the procedures resizing images in an orthogonal transform domain in the form of matrix multiplications from which the matrix scaling the image resolutions is produce. The experiments showed that the proposed method produces reliable performance without increasing the computational complexity, compared to conventional methods when applied to various transforms.

Many content distribution systems such as CDN and P2P file sharing have been developed. In these systems, file-type contents require downloads to be completed before they can be played and they have no value before the download finishes. Therefore, a user's satisfaction depends on the length of the service latency. That is, the length of time from when the user issued a request until the user received an entire file. Reducing the sum of that time is necessary for the whole delivery system to satisfy users and maintain dependability on system performance. We discuss a hop-by-hop file delivery system suitable for delivering file contents whereby the sum of service latency is reduced by using the request conditions. Moreover, we propose a file delivery scheduling algorithm for a one-link model given that the content request frequency is unknown. The algorithm is based on a local optimal strategy. We performed a characteristic analysis by computer simulation. The results showed that our algorithm performs at nearly the theoretical efficiency limit of the hop-by-hop system when the request frequency distribution of each content has a deviation.

In situ observation of electrochemical activity and time dependent characteristics of cytochrome c (cyt c) was carried out in 0.01 M phosphate buffered saline (PBS, pH 7.4) containing 20 µM cyt c solutions at bare indium-tin-oxide (ITO) electrodes by using a cyclic voltammetry (CV) and a slab optical waveguide (SOWG) spectroscopy. The bare ITO electrodes could retain the electrochemical activity of cyt c in the PBS solutions, indicating the great advantage of using ITO electrodes against other electrode materials, such as gold (Au). The CV curves and simultaneously observed the time-resolved SOWG absorption spectra in the consecutive cycles implied that the cyt c molecules could retain its own electrochemical function for a long time.

An algorithm for clock scheduling of concurrent-flow clocking rapid single-flux-quantum (RSFQ) digital circuits is proposed. RSFQ circuit technology is an emerging technology of digital circuits. In concurrent-flow clocking RSFQ digital circuits, all logic gates are driven by clock pulses. Appropriate clock scheduling makes clock frequency of the circuits higher. Given a clock period, the proposed algorithm determines the arrival time of clock pulses and the delay that should be inserted. Experimental results show that inserted delay elements by the proposed algorithm are 59.0% fewer and the height of clock trees are 40.4% shorter on average than those by a straightforward algorithm. The proposed algorithm can also be used to minimize the clock period, thus obtaining 19.0% shorter clock periods on average.