In W-CDMA systems, distributions of the interference power and the total transmit power both measured at base stations are respectively used for capacity analysis in the uplink and downlink. For accurate capacity analysis, these quantities must be in proportion to the traffic amount. However, these quantities are no longer in proportion to the traffic amount since the transmit power control maintains the signal to interference power ratio at a constant level. Although the relationship between these measurements and the traffic amount has been investigated, there are still challenges to calculate the statistics such as the blocking probability or the outage probability accurately. This paper proposes a method to calculate the blocking probability by transforming the distributions of these measurements into distributions that are referred to as "traffic equivalent distributions," where the distributions are automatically adjusted according to the traffic amount. The calculated results show good agreement with the results obtained by dynamic computer simulations in the uplink, and show good agreement in the downlink as well when the traffic load is light. Accurate calculation of the blocking probability using a feedback loop and the observation of the traffic equivalents is also reported.

We show that the necessary and sufficient condition for the existence of a balanced quatrefoil decomposition of the complete multigraph λKn is n 9 and λ(n - 1) 0 (mod 24). Decomposition algorithms are also given.

In MC-CDMA, the data rate can be increased by reducing the spreading factor SF or by allowing multicode transmission. In this paper, we examine by computer simulations which gives a better bit error rate (BER) performance--lower SF or multicode operation--when high level modulation is used in addition to error control coding. For a coded system in a frequency selective channel, there is a trade-off among frequency diversity gain due to spreading, improved coding gain due to better frequency interleaving effect and orthogonality distortion. It is found that for QPSK, the performance of OFDM (MC-CDMA with SF = 1) is almost the same as that of a fully spread MC-CDMA system. However, for 16QAM and 64QAM, the BER performance is better for lower SF unlike the uncoded system, wherein higher SF gives a better BER.

We evaluate the exact number of gates for circuits of Shor's factoring algorithm. We estimate the running time for factoring a large composite such as 576 and 1024 bit numbers by appropriately setting gate operation time. For example, we show that on the condition that each elementary gate is operated within 50 µsec, the running time for factoring 576 bit number is 1 month even if the most effective circuit is adopted. Consequently, we find that if we adopt the long gate operation-time devices or qubit-saving circuits, factorization will not be completed within feasible time on the condition that a new efficient modular exponentiation algorithm will not be proposed. Furthermore, we point out that long gate operation time may become a new problem preventing a realization of quantum computers.

In this study, we construct balanced Boolean functions with a high nonlinearity and an optimum algebraic degree for both odd and even dimensions. Our approach is based on modifying functions from the Maiorana-McFarland's superclass, which has been introduced by Carlet. A drawback of Maiorana-McFarland's function is that their restrictions obtained by fixing some variables in their input are affine. Affine functions are cryptographically weak functions, so there is a risk that this property will be exploited in attacks. Due to the contribution of Carlet, our constructions do not have the potential weakness that is shared by the Maiorana-McFarland construction or its modifications.

Extensive studies have been made of the public key cryptosystems based on multivariate polynomials over F2. However most of the proposed public key cryptosystems based on multivariate polynomials, are proved not secure. In this paper, we propose several types of new constructions of public key cryptosystems based on randomly generated singular simultaneous equations. One of the features of the proposed cryptosystems is that the sets of random singular simultaneous equations significantly enlarges the size of the transformation.

For fixed initial and destination states (i.e., markings), M0 and Md, there exist generally infinite firing count vectors in a Petri net. In this letter, it is shown that all fundamental particular solutions as well as all minimal T-invariants w.r.t. firing count vectors are needed to express an arbitrary firing count vector for the fixed M0 and Md. An algorithm for finding a special firing count vector which is expressed by using the only one specified fundamental particular solution is also given.

One of Kaliski and Robshaw's algorithms, which is used for the linear attack on block ciphers with multiple linear approximations and introduced as Algorithm 2M in this paper, looks efficient but lacks any theoretical and mathematical description. It means there exists no way to estimate the data complexity required for the attack by the algorithm except experiments of the reduced variants. In this paper we propose a new algorithm using multiple linear approximation. We achieve the theoretical and mathematical analysis of its success probability. The new algorithm needs about 240.6 plaintexts to find 12 bits of secret key of 16-round DES with a success probability of about 86%.

In this work we give an extension of Kauffman's NK-Landscapes to multiobjective MNK-Landscapes in order to study the effects of epistasis on the performance of multiobjective evolutionary algorithms (MOEAs). This paper focuses on the development of multiobjective random one-bit climbers (moRBCs). We incrementally build several moRBCs and analyze basic working principles of state of the art MOEAs on landscapes of increased epistatic complexity and number of objectives. We specially study the effects of Pareto dominance, non-dominance, and the use of memory and a population to influence the search. We choose an elitist non-dominated sorting multiobjective genetic algorithm (NSGA-II) as a representative of the latest generation of MOEAs and include its results for comparison. We detail the behavior of the climbers and show that population based moRBCs outperform NSGA-II for all values of M and K.

A detailed investigation of the electromagnetic field distributions in high frequency printed circuits and high-speed interconnects is very useful for physical understanding, studies of electromagnetic coupling effects for EMC and EMI and for optimization of electromagnetic circuit designs. The aim of this paper is to show how to measure the electric field distributions in electromagnetic circuits. An electromagnetic analysis for microstrip-line circuits is carried out by using a finite-difference time domain technique and its measurement is carried out by using a small probe antenna. The measurement results are in fairly good agreement with those of the numerical analysis using the FDTD method. Thus, the measurement system offers a valid means for predictions in the theoretical analysis of more complicated discontinuity problems.

In this letter we first introduce a new generalized cyclotomic sequence of order four with respect to pq, then we calculate the linear complexity and minimal polynomial of this sequence. Our results show that the new binary sequence is quite good from the linear complexity viewpoint.

This paper reports the strength of a pseudorandom number generator MUGI, which was published as a stream cipher by Hitachi, Ltd. in 2001, against linear cryptanalysis. MUGI is one of the recommended ciphers of CRYPTREC, which is a project for the e-Government in Japan. It has two internal states called state and buffer, which are updated by a linear function λ and a non-linear function ρ. The non-linear function ρ and the linear function λ have already been analyzed, independently. In this paper, whole MUGI is analyzed by truncated linear cryptanalysis. The analysis of λ function is based on the state variables method. The result is combined to the result of the analysis of ρ function to make a trellis diagram. Viterbi search is conducted on the diagram to find the best possible linear path under 64-bit truncated linear cryptanalysis. As the result, the upper bound of the maximum linear characteristic probability is estimated as less than 2-138. Therefore, MUGI is secure against linear cryptanalysis.

This paper focuses on the characteristics of tunable half-wavelength resonators and their applications to bandpass filters (BPFs). First, the resonance characteristics of various tunable half-wavelength resonators are examined for the tunabilities of transmission zeros and the center frequency of the proposed BPFs. We examine four types of tunable half-wavelength resonators, namely, an end-coupling resonator and three types of tap-coupling resonators. Secondly, the proposition and design of two types of BPFs using acquired resonators are carried out. The fabrication and experimental application of the resonators and designed BPFs are also performed based on coplanar waveguide (CPW) technologies. Their calculated and measured results are compared with each other. The results show that tunabilities of the transmission zero and the center frequency of the proposed BPF are obtained as expected.

We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar's construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup's sequential algorithm. But it is not too large as in all practical situations we need just two more masks than Shoup's. Our second algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result, we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its parallelizability performance is less efficient than complete tree based constructions. However if l is getting larger, then the parallelizability of the construction is also getting near to that of complete tree based constructions. We also give a sufficient condition for valid domain extension in sequential domain extension.

A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, called subdivisions of planar triconnected cubic graphs, and give a linear-time algorithm to examine whether such a planar graph G has a no-bend orthogonal drawing and to find one if G has.

A new design concept for a common-mode signal suppression circuit for a balanced-type filter has been investigated. The degradation mechanism of the balance characteristics was studied. The degradation is caused by the common-mode signals combined with the differential-mode signals in the balanced terminals. The concept employed is the reduction of the common-mode signal using a common-mode signal suppression circuit, connected to the balanced terminals. A serial resonance circuit is formed, in which the common-mode signals are shorted to ground. The circuit was applied to the balanced-type Surface Acoustic Wave (SAW) filter. The improvement in balance characteristics, without increasing in the insertion loss, was confirmed by experiments for Global System Mobile (GSM) applications.

Microwave circuits embedded in a multi-layer resin PCB are demonstrated using low loss resin materials. Resin materials for microwave frequencies were compared with conventional FR-4 with respect to dielectric and conductor loss factors, which proved that losses could be reduced drastically with the low loss material and design optimizations. Baluns, switches and BPFs were designed and fabricated to estimate microwave performances. Measured and simulated insertion losses of the circuits for 2.5 GHz band, were 0.3 dB for a switch, 0.4 dB for a balun and 2.0 dB for a 3-stage Chebyshev BPF. An integration of a switch, a BPF and two baluns was successfully implemented in a multi-layer PCB. Insertion losses of the fabricated integrated circuit were less than 3 dB with 0.1 dB additional loss compared with a sum of individual circuit losses. With estimated results of temperature characteristics and reliability as well as low loss performances, microwave circuits in resin PCBs can be considered as a viable candidate for microwave equipments.

Analysis of speech acts and discourse structures is essential to a dialogue understanding system because speech acts and discourse structures are closely tied with the speaker's intention. However, it has been difficult to infer a speech act and a discourse structure from a surface utterance because they highly depend on the context of the utterance. We propose a statistical dialogue analysis model to determine discourse structures as well as speech acts using a maximum entropy model. The model can automatically acquire probabilistic discourse knowledge from an annotated dialogue corpus. Moreover, the model can analyze speech acts and discourse structures in one framework. In the experiment, the model showed better performance than other previous works.

The comparative analysis of the well known Double Drift Region (DDR) IMPATT diode structure and the n+pvnp+ structure for the avalanche diode has been realized on the basis of the drift-diffusion nonlinear model. The last type of the diode was named as Double Avalanche Region (DAR) IMPATT diode. This structure includes two avalanche regions inside the diode. The phase delay which was produced by means of the two avalanche zones and the drift zone v is sufficient for the negative resistance obtained for the wide frequency region. The numerical model that is used for the analysis of the various diode structures includes all principal features of the physical phenomena inside the semiconductor structure. The admittance characteristics of both types of the diodes were analyzed in very wide frequency region.

The paper reports a compact and high performance dual-band bandpass filter (BPF) using two types of dual-mode resonators. The dual mode cross shaped resonator and the three dual mode ring resonators in the designed dual-band BPF are excited to control the first and second passband, respectively. It is shown that the designed and fabricated dual-band BPF has narrow bandwidths and very sharp attenuation rate due to the existence of the transmission zeros. The frequency response of the designed dual-band BPF shows good agreement between the simulations and experiments.