This letter presents a new transformation technique of series solution to asymptotic solution for a perfectly conducting wedge illuminated by E-polarized plane wave. This transformation gives an analytic manipulation example of the Weber-Schafheitlin integral for diffraction problem.

VCSEL output light polarization was controlled by fabricating devices on (311) substrate. Stability was improved by introducing compressive strain to the quantum wells in the active layer. In experiments, the power penalty due to polarization-dependent loss in the transmission line was negligible for both VCSELs with unstrained and strained quantum well active layers on (311)B substrate. The sensitivity at 2.5 Gbps was improved in a device with a strained active layer because the intensity noise due to the polarization instability was reduced. These characteristics are discussed and compared to calculated results.

This paper describes an improved multiresolution telescopic search algorithm (MRTlcSA) for block-matching motion estimation. The algorithm uses images with full and reduced bit resolution, and uses motion-track and adaptive-search-window strategies. Simulation results show that the proposed algorithm has low computational complexity and achieves good image quality. We have developed a systolic-architecture-based search engine that has split data paths. In the case of low bit-resolution, the throughput is increased by enhancing the operating parallelism. The new motion estimator works at a low clock frequency and a low supply voltage, and therefore has low power consumption.

An electrophysiological experiment showed that spike timing was precise to less than one millisecond. This result indicates the possibility in the precise time codings. For a high accurate time coding, reconsideration of a neural mechanism which decides firing time is required. From such viewpoint, we quantitatively examined change in firing time with interference between two synaptic inputs through Hodgkin-Huxley (HH) and integrate-and-fire (IF) model neurons. The precise firing times in the HH model neuron were extremely different from those in the IF model neuron. In this paper, the relations of input intensity to firing time are investigated in the other more two pulse generation models: Morris-Lecar (ML) and FitzHugh-Nagumo (FN) model. The result of the ML model in a certain parameter set (type-I) exhibited monotone decreasing like that of the IF model while the result of the ML model in the otter parameter set (type-II) exhibited non-monotone decreasing like that of the HH model. The result of the FN model exhibited non-monotone decreasing like the HH model despite its qualitativeness. Next the firing patterns in the four model neurons on a model of V1 (primary visual area) and LGN (lateral geniculate nucleus) with circular and mutual excitatory connections are investigated to show how dependent on model neurons the firing patterns are. The spikes in the HH, the ML type-II, and the FN model neurons elicited synchronous oscillations while the spikes in the IF and the ML type-I model neurons did not; the firing patterns dramatically changed with the dependence on the model neurons.

The ring-like systolic array architecture described in this paper, based on a conventional one-dimensional systolic array architecture, was created through operator rescheduling based on the symmetry of data flow. This eliminated high-latency delay due to the stuffing of the array pipeline in the conventional architecture. The new architecture requires a memory bandwidth no greater than the conventional architecture does, but increases throughput and processor utilization while reducing power consumption.

Digital watermarking schemes have been discussed to solve the problem associated with copyright enforcement. Previously, we proposed a method using inter-block correlation of DCT coefficients. It has the features that the embedded watermark can be extracted without the original image nor the parameters used in embedding process and that the amount of modification, the strength of embedded watermark, depends on the local feature of an image. This feature makes it difficult for pirate to predict the position in which the watermark signal is embedded. In this paper, we propose a method which can embed/extract watermark with high speed by utilizing this watermarking method for JPEG file format.

The performance of conventional error concealment (EC) is significantly affected by the method of selecting candidate motion vectors (MVs). In order to obtain more robust EC results, this letter proposes a new and efficient way to choose candidate MVs. The proposed approach systematically utilizes available neighboring MVs by exploiting a well-known spatiotemporal correlation of block MVs. Through extensive simulations with H.263, this letter demonstrates that the proposed candidate MVs provide superior concealed video quality in comparison to the best results of other existing techniques.

If there exist any two vertices in G whose distance becomes longer when a vertex u is removed, then u is defined as a hinge vertex. Finding the set of hinge vertices in a graph can be used to identify critical nodes in an actual network. A number of studies concerning hinge vertices have been made in recent years. In general, it is known that more efficient sequential or parallel algorithms can be developed by restricting classes of graphs. For instance, Chang et al. presented an O(n+m) time algorithm for finding all hinge vertices of a strongly chordal graph. Ho et al. presented a linear time algorithm for all hinge vertices of a permutation graph. In this paper, we shall propose a parallel algorithm which runs in O(log n) time with O(n) processors on CREW PRAM for finding all hinge vertices of an interval graph.

Since the traffic of NetNews is increasing, keeping all articles becomes serious problem from a viewpoint of waste of network bandwidth and the amount of disk usage. In addition, users read not all incoming articles. We have proposed several caching algorithms to overcome this problem and shown that a selective prefetch scheme gives the best system performance among the proposed ones. However, since the selective prefetch scheme employed a simple selecting policy, the scheme gave low hit ratio in some cases. Therefore, this paper intends to improve the selective prefetch scheme from a viewpoint of the amount of disk usage as well as hit ratio. In this paper, we divide the scheme into three factors: reference span, criterion, and threshold in criterion. Through simulation experiments using actual NetNews logs, we investigate the influence of the factors of the reference span and the threshold to system performance. As a result, it is shown that the reference span is more significant factor than the threshold, the selective prefetch scheme with a value around the seven days reference span keeps high hit ratio and reduces the amount of disk usage.

This paper describes a unique motion estimation and compensation (ME/MC) hardware architecture for a scene-adaptive algorithm. By statistically analyzing the characteristics of the scene being encoded and controlling the encoding parameters according to the scene, the quality of the decoded image can be enhanced. The most significant feature of the architecture is that the two modules for ME/MC can work independently. Since a time interval can be inserted between the operations of the two modules, a scene-adaptive algorithm can be implemented in the architecture. The ME/MC architecture is loaded on a single-chip MPEG-2 video encoder.

Message Sequence Chart (MSC) standardized by International Telecommunication Union is a graphical and textual language for specification of concurrent systems. It has been used formally as well as informally to specify behavior of real-time systems, in particular telecommunication switching systems. Formal verification of a system specification is crucial to ensure that implementation of the system works correctly. In particular, verification methods based on finite states have been widely used in telecommunication systems design. The methods determine global system states and transitions between them (i. e. , build a global state transition graph (GSTG)), and verify the system's desired properties, such as safety and liveness, on the GSTG. In this paper, we focus on construction of GSTGs from MSC specifications. We propose action dependency graph as an intuitive description of semantics of MSC specifications and present an algorithm to translate MSC specifications to action dependency graphs as well as an algorithm to construct a global state transition graph from an action dependency graph.

2.4-GHz-band mid-speed (1- to 2-Mbit/sec) wireless LAN systems are being widely used in offices and factories. Electromagnetic interference can occur between these systems because they use the same frequency range. In this paper, we investigate the characteristics of the interference between wireless LAN systems that use direct-sequence (DS) systems and frequency-hopping (FH) systems. The interference characteristics were measured for three DS systems and one FH system that meet the IEEE 802.11 and RCR standards and that use different modulation methods. Our results indicate that throughput depends on the system and the modulation method. We have also developed a model that can be used to calculate the interference characteristics between DS and FH systems by considering the bandwidth of their transmission signals, the dwell time of the FH system, and the time that the DS system needs to transmit a data frame. We used this model to calculate the bit error rate (BER) characteristics of the systems used in our experiment, and the results indicate that BER characteristics depend on the modulation method. The throughput characteristics of the systems used in our experiment were also calculated, and agreed with the experiment results within +/- 5 dB. The throughput characteristics of wireless LAN systems based on IEEE 802.11 were also calculated when the signal level was higher than the receiver noise level. The results show that FH systems require a D/U ratio about 7 or 8 dB higher than the ratio required in DS systems because the parameters in the standard differ between FH and DS systems.

This paper proposes a method of supporting behavioral decision-making with a rule-based system to be used for the design stage of service specifications or service scenarios based on a state transition model. We consider telecommunication services as service scenarios of state transitions. A state transition can be described as a transition rule that is represented as the notation of an IF-THEN rule : "if < condition > then < action >. " Thus, behaviors or service scenarios are assumed to be treated as a set of IF-THEN rules in this paper. In general, an "if < condition > then < action >" rule is called a production rule, and production rules are often used to represent knowledge in expert systems. Thus, rules treated in this paper are a kind of production rule. It is still difficult to decide if behaviors are concurrent, cooperative, or exclusive as a whole system when many service scenarios are combined, even if each rule is clearly described and easy to understand. When several service scenarios are combined, it is necessary for the sub-elements of each state transition to cooperate. The method proposed in this paper consists of the following techniques: (1) decompositions of a state transition to sub-elements, (2) rule descriptions for the decomposed sub-elements and the application of rules, (3) use of conflict and cooperation strategies, and (4) support for behavioral decision-making by showing recommendations for cooperative, exclusive, or concurrent behavior. We provide examples of telecommunication services to show the effectiveness of the proposed method in an easy-to-understand manner. We also show cooperative resolution in the interactions among several services.

Using decision trees to fill the missing values in data has been shown experimentally to be useful in some domains. However, this is not the general case. In other domains, using decision trees for imputing missing attribute values does not outperform other methods. Trying to identify the reasons behind the success or failure of the various methods for filling missing values on different domains can be useful for deciding the technique to be used when learning concepts from a new domain with missing values. This paper presents a technique by which to approach to previous goal and presents the results of applying the technique on predicting the success or failure of a method that uses decision trees to fill the missing values in an ordered manner. Results are encouraging because the obtained decision tree is simple and it can even provide hints for further improvement on the use of decision trees to impute missing attribute values.

In this paper, a novel cumulant-based adaptive notch filtering technique for the enhancement and tracking of a single sinusoid in additive noise is presented. In this technique, the enhanced signal is obtained as the output of a narrow bandpass filter implemented using a second-order pole-zero constraint IIR adaptive notch filter, which needs only one coefficient to be updated. The filter coefficient, which leads to identifying and tracking the sinusoidal frequency, is updated using a suggested adaptive algorithm employing a recursive estimate of the kurtosis and only one-sample-lag point of a selected one-dimensional fourth-order cumulant slice of the input signal. Therefore, the proposed technique provides automatically resistance to additive Gaussian noise. It is also shown that the presented technique outperforms the correlation-based counterpart in handling additive non-Gaussian noise. Simulation results are provided to show the effectiveness of the proposed algorithm in comparison with the correlation-based lattice algorithm.

The authors propose and experimentally demonstrate an all-optical exclusive OR (XOR) logic gate based on self-phase modulation (SPM) of a semiconductor optical amplifier (SOA). The scheme is insensitive to the polarization of the input signal and requires no additional synchronized clock. The output of the XOR gate showed the contrast ratio of more than 17 dB for the input signal at 2.5 GHz.

This paper presents a method of determining a fitness function in a genetic algorithm for routing the shortest route via several designated points. We can search for the optimum route efficiently by using the proposed fitness function and its validity is verified by applying it to the actual map data.

This paper presents adaptive image enhancement algorithms which enhance hidden signals in the pictures and describes their implementation for real-time video signals. An image enhancement algorithm proposed by T. Peli and J. S. Lim is extended for application to video signals. A fast implementation algorithm is provided with parallel implementation. The proposed algorithms are shown to be realized in real-time on 200 MHz microprocessors with multimedia extensions for 720 480 (pixels) 30 frames/sec video signals.

Recently, in the modem, the spread spectrum communication system and the software radio, Digital Signal Processor type Squaring Loop (DSP-squaring-loop) is employed in the demodulation of Binary Phase Shift Keying (BPSK) signal. The DSP-squaring-loop extracts the carrier signal that is used for the coherent detection. However, in case the Signal to Noise Ratio (SNR) is low, the DSP-Phase Locked Loop (DSP-PLL) can not pull in the frequency offset and the phase offset. In this paper, we propose a DSP-squaring-loop that is robust against noise and which uses the adaptive notch filter type frequency estimator and the adaptive Band Pass Filter (BPF). The proposed method can extract the carrier signal in the low SNR environment. The effectiveness of the proposed method is confirmed by the computer simulation results.

We propose the analytical calculation method of average packet success probability of CDMA Slotted ALOHA systems, which derives accurate probability, and that is applicable to the system with any spreading codes and any amplitude distributions. In the method, we consider the bit-to-bit dependence of amplitude of signals, used spreading sequences, relative timing delays, and relative carrier phases. This bit-to-bit dependence is the case that the parameters above mentioned are constant for a slot time. By using the method to obtain the average packet success probability, we derive useful throughput performance of CDMA Slotted ALOHA systems on fading channel, and show that the normalized throughput becomes worse in the case of larger spreading factor.