This paper proposes a new method to improve cooperation in concurrent systems within the framework of Multi-Agent Systems (MAS). Since subsystems work concurrently, achieving appropriate cooperation among them is important to improve the effectiveness of the overall system. When subsystems are modeled as agents, it is easy to explicitly deal with the interactions among them since they can be modeled naturally as communication among agents with intended information. Contrary to previous approaches which provided the syntax of communication protocols without semantics, we focus on the semantics of cooperation in MAS and aim at allowing agents to exploit the communicated information for cooperation. This is attempted by utilizing more coarse-grained communication based on the different perspective for the balance between formality and richness of communication contents so that each piece of communication contents can convey more meaningful information in application domains. In our approach agents cooperate each other by giving feedbacks based on the metaphor of explanation which is widely used in human interactions, in contrast to previous approaches which use direct orders given by the leader based on the pre-defined cooperation strategies. Agents show the difference between the proposal and counter-proposals for it, which are constructed with respect to the former and given as the feedbacks in the easily understandable terms for the receiver. From the comparison of proposals agents retrieve the information on which parts are agreed and disagreed by the relevant agents, and reflect the analysis in their following behavior. Furthermore, communication contents are annotated by agents to indicate the degree of importance in decision making for them, which contributes to making explanations or feedbacks more understandable. Our cooperation method was examined through experiments on the design of micro satellites and the result showed that it was effective to some extent to facilitate cooperation among agents.

It is well known that PZT material properties are strongly dependent on the Zr/Ti ratio. The reliability characteristics, such as the retention and imprint properties, of PZT thin film correlate with the reliability of FRAM(R). PZT films with various Zr/Ti ratios, 60/40, 52/48, 45/55, 40/60 and 30/70 were prepared on Pt/IrO2 and Pt/Ti electrodes by a sol-gel process. With lower Zr/Ti ratio, the grain size becomes smaller and the film was highly oriented to (111) crystallographic plane. But, pyrochlore phase in the PZT films on Pt/IrO2 electrode was detected by SEM and XRD. Hysteresis and pulse responses were measured on the capacitors. With lower Zr/Ti ratio, Pr and Vc become larger. It was found that the preferential (111) orientation played an important role in determining Pr. Voltage shifts which are related to imprint are dependent on the Zr/Ti compositional ratio. Increasing the Ti concentration causes the voltage shift to increase due to more oxygen vacancies. But, this tendency was not in accordance with the results of Qos which were measured by capacitor test simulation of imprint properties for FRAM operation, because the results of Qos did not change monotonically with Ti concentration. However, the capacitor for 45/55 film grown on Pt/IrO2 had good imprint property, similar to the capacitor for sputtered PLZT. In addition, H2 degradation of PZT capacitor with Pt/IrO2 was studied. It was found that H2 annealing degraded the PZT capacitors even at temperatures as low as 150. Thus, imprint and H2 degradation are serious problems for PZT capacitors and these will be a key issue in the reliability of FRAM.

In a distributed concurrent system such as a computer communication network, the system components communicate with each other via communication links in order to accomplish a desired distributed application. If the links are dynamically established among the components, the system configuration as well as its behavior becomes complex. In this paper, we give formal specification of such a dynamically reconfigurable system in which the components are modeled by communicating finite state machines executed concurrently with the communication links which are dynamically established and disconnected. We also present an algorithm to validate the safety and link-related properties in the specified behavior. Finally, we design and implement a simulator and a validator that enables execution and validation of the given specification, respectively.

Unfolding originally introduced by McMillan is gaining ground as a partial-order based method for the verification of concurrent systems without state space explosion. However, it can be exposed to redundancy which may increase its size exponentially. So far, there have been trials to reduce such redundancy resulting from conflicts by improving McMillan's cut-off criterion. In this paper, we show that concurrency is also another cause of redundancy in unfolding, and present an algorithm to reduce such redundancy in live, bounded and reversible Petri nets which is independent of any cut-off algorithm.

Basic structural characteristics, which are useful in modular synthesis based on strongly connected state machines, of SMA/LBFC nets are discussed in this paper. A more convincing and direct proof of the equivalence of two structural characterization of the class of Petri nets is given. This proof will give clearer view of the structural characteristics of LBFC/SMA nets. On the other hand, however, the structural characteristics are not practically amenable in application to modular synthesis of SMA nets from a given set of SCSM's since all possible SCSM's should be examined for the verification of the given conditions. The later half of this paper is devoted into strengthening the results, i. e. , in composition of an SMA net from a given set of SCSM's the condition is also satisfied in any SCSM generated by composition.

In this work, a new algorithm for tracking the directions-of-arrival (DOA's) of moving targets by introducing a linear approximation is proposed. The targets are assumed to move with constant angular velocities within a short time and emitting continuously narrow-band signals that impinge on an array of sensors. Therefore the trajectories of targets can be approximated by linear functions of time, which consist of the DOA's and the angular velocities, within the short time. In the condition that the number of targets is known and the outputs vector of the sensors including the additive white complex Gaussian noises is observed continuously, a cost function which consists of the squared residual error vectors is defined. The estimation of the DOA's and the angular velocities of targets is performed by minimizing this cost function. By estimating both the DOA's and the angular velocities at the same time, the proposed algorithm is able to improve the tracking performance for rapidly moving targets. In computer simulations, the performance of the proposed algorithm is compared with the ESPRIT method, which is one of the typical subspace methods with super resolution.

In this paper, we propose a simple and accurate method to derive the dwell time distribution of a mobile in a cell by a numerical integration approach. In practical applications, only a few traffic models have a known closed-form solution, most of the models can not be solved in closed form. Therefore a simulation or approximating method has to be used to solve the problems. To validate the accuracy of the proposed method, we apply it to a typical hard handoff traffic model with known closed-form solution and the goodness-of-fit is measured. We also apply this method to a soft handoff traffic model, which does not have a closed-form solution. Computer simulations show promising results based on the non-closed-form application.

Using transmission electron microscopy (TEM), we studied structural defects in a Sr0. 7Bi2. 3Ta2O9 (SBT) thin film to be used for ferroelectric memory devices. We examined the effects of the substrate, crystal continuity, and dislocations in crystals as major causes of defects. For this study, we used an SBT thin film grown from an alkoxide solution. Since crystal growth was hardly influenced by the substrate, the substrate had little influence on the occurrence of defects resulted in misfit of lattice constant. Regions of partially low crystal continuity were observed in the SBT thin film. In these regions, the orientation was still uniform, but the continuity of the crystal grain was low because of the defects. In addition, variation in contrast was observed in the crystals, however, no obvious variation in chemical composition was found in this region of varying contrast. Therefore, the contrast variation is considered to be attributed to the dislocation. Such a dislocation was found to be occurred in the direction of the (2010) plane in many instances. The defects in the SBT film were also confirmed by the TEM observation.

We have constructed Bi based layer structured ferroelectric films and their superlattices by a pulsed laser deposition technique. The dielectric constants along c-axis increase with increasing of the number of pseudo-perovskite layers between double Bi2O2 layers. Ferroelectricity appears along the c-axis direction only for the odd number of the perovskite layers owing to the mirror symmetry in a crystal structure. Especially, the Bi2VO5. 5 film shows an atomically flat surface, low dielectric constant of 30 and ferroelectricity of Pr=3 µC/cm2 and Ec=16 kV/cm, respectively. This material is expected to the application for FRAMs.

Segmenting the images obtained from magnetic resonance imaging (MRI) is an important process for visualization of the human soft tissues. For the application of MR, we often have to introduce a reasonable segmentation technique. Neural networks may provide us with superior solutions for the pattern classification of medical images than the conventional methods. For image segmentation with the aid of neural networks of a reasonable size, it is important to select the most effective combination of secondary indices to be used for the classification. In this paper, we introduce a vector quantized class entropy (VQCCE) criterion to evaluate which indices are effective for pattern classification, without testing on the actual classifiers. We have exploited a newly developed neural tree classifier for accomplishing the segmentation task. This network effectively partitions the feature space into subregions and each final subregion is assigned a class label according to the data routed to it. As the tree grows on, the number of training data for each node decreases, which results in less weight update epochs and decreases the time consumption. The partitioning of the feature space at each node is done by a simple neural network; the appropriateness of which is measured by newly proposed estimation criterion, i. e. the measure for assessment of neuron (MAN). It facilitates the obtaining of a neuron with maximum correlation between a unit's value and the residual error at a given output. The application of this criterion guarantees adopting the best-fit neuron to split the feature space. The proposed neural classifier has achieved 95% correct classification rate on average for the white/gray matter segmentation problem. The performance of the proposed method is compared to that of a multilayered perceptron (MLP), the latter being widely exploited network in the field of image processing and pattern recognition. The experiments show the superiority of the introduced method in terms of less iterations and weight up dates necessary to train the neural network, i. e. lower computational complexity; as well as higher correct classification rate.

In many applications, information retrieval is a very important research field. In several key strategies, the binary trie is famous as a fast access method able to retrieve keys in order. Especially, a Patricia trie gives the shallowest trie by eliminating all nodes which have only one arc, and it requires the smallest storage among the other trie structures. If trie structures are implemented, however, the greater the number of the registered keys, the larger storage is required. In order to solve this problem, Jonge et al. proposed a method to change the normal binary trie into a compact bit stream. This paper proposes the improved trie representation for the Patricia trie, as well as the methods for searching and inserting the key on it. The theoretical and experimental results, using 50,000 Japanese nouns and 50,000 English words, show that this method generates 25-39 percent shorter bit streams than the traditional method. This method, thus, enables us to provide more compact storage and faster access than the traditional method.

Handprinted Chinese character recognition (HCCR) can be classified into two major approaches: statistical and structural. While neither of these two approaches can lead to a total and practical solution for HCCR, integrating them to take advantages of both seems to be a promising and obviously feasible approach. But, how to integrate them would be a big issue. In this paper, we propose an integrated HCCR system. The system starts from a statistical phase. This phase uses line-density-distribution-based features extracted after nonlinear normalization to guarantee that different writing variations of the same character have similar feature vectors. It removes accurately and efficiently the impossible candidates and results in a final candidate set. Then follows the structural phase, which inherits the line segments used in the statistical phase and extracts a set of stroke substructures as features. These features are used to discriminate the similar characters in the final candidate set and hence improve the recognition rate. Tested by using a large set of characters in a handprinted Chinese character database, the proposed HCCR system is robust and can achieve 96 percent accuracy for characters in the first 100 variations of the database.

In this paper, Wavelength Division Multiple access (WDM) ring is proposed for interconnection in workstation clusters or parallel machines. This network consists of ring connected routers each of which selectively passes signals addressed in some particular wavelengths. Other wavelengths are once converted to electric signals, and re-transmitted being addressed in different wavelengths. Wavelengths are assigned to divisors of the number of nodes in the system. Using the regular WDM ring with imaginary nodes, the diameter and average distance are reduced even if the number of nodes has few divisors. It provides better diameter and average distance than that of the uni-directional torus. Although the diameter and average distance is worse than that of ShuffleNet, the physical structure of the WDM ring is simple and the available number of nodes is flexible.

A computational model for security verification of cryptographic protocols is proposed. Until most recently, security verification of cryptographic protocols was left to the protocol designers' experience and heuristics. Though some formal verification methods have been proposed for this purpose, they are still insufficient for the verification of practical real-time cryptographic protocols. In this paper we propose a new formalism based on a term rewriting system approach that we have developed. In this model, what and when the saboteur can obtain is expressed by a first-order term of a special form, and time-related concepts such as the passage of time and the causality relation are specified by conditional term rewriting systems. By using our model, a cryptographic protocol which was shown to be secure by the BAN-logic is shown to be insecure.

This paper describes an automatic region segmentation method which is detectable nuclei regions from hematoxylin and eosin (HE)-stained breast tumor images using artificial organisms. In this model, the stained images are treated as virtual environments which consist of nuclei, interstitial tissue and background regions. The movement characteristics of each organism are controlled by the gene and the adaptive behavior of each organism is evaluated by calculating the similarities of the texture features before and after the movement. In the nuclei regions, the artificial organisms can survive, obtain energy and produce offspring. Organisms in other regions lose energy by the movement and die during searching. As a result, nuclei regions are detected by the collective behavior of artificial organisms. The method developed was applied to 9 cases of breast tumor images and detection of nuclei regions by the artificial organisms was successful in all cases. The proposed method has the following advantages: (1) the criteria of each organism's texture feature values (supervised values) for the evaluation of nuclei regions are decided automatically at the learning stage in every input image; (2) the proposed algorithm requires only the similarity ratio as the threshold value when each organism evaluates the environment; (3) this model can successfully detect the nuclei regions without affecting the variance of color tones in stained images which depends on the tissue condition and the degree of malignancy in each breast tumor case.

In indoor optical channels, intersymbol interference (ISI) due to multipath propagation prevents high data rate transmission. In this paper, a new Optical Multi-Wavelength Modulation technique has been investigated for improving the quality of transmission. In this technique, parallel transmission is used, which lowers the data rate per channel and thus reduces the effects of ISI. Furthermore, parallel coding is used in predetermined parallel branches, so that coding can correct errors without changing the system data rate. Simulation results show that a combination of these methods can achieve high quality transmission without reduction of the total data rate.

Two types of hetero-epitaxial PbZr0. 48Ti0. 52O3 (PZT) capacitors were fabricated by pulsed laser deposition (PLD). One has an Au/PZT/SrRuO3(SRO)/SrTiO3(STO) structure with remanent polarization (Pr) of 32. 1 µC/cm2. The other has an Au/PZT/La-doped STO (La: STO) structure with Pr of 9. 6 to 13. 5 µC/cm2. X-ray diffraction patterns show that only the (00l) planes of the PZT and SRO are parallel to the substrate surface for the PZT/SRO/STO structure, however, a (111) plane of the PZT is observed, in addition to the (00l) planes, for the PZT/La: STO structure. High resolution-transmission electron microscope (HR-TEM) images show that the PZT/SRO interface is clean and coherent. However, spherical shape contrast with radius about 5 nm is observed at the PZT/La: STO interface. Diffusion of La and/or the contaminated surface of the La: STO substrate is thought to cause the differences in the PZT orientations and the interfaces, affecting the electrical characteristics of the capacitors.

A new type of fiber Fabry-Perot interferometer buried in a fiber connector housing was proposed. The transmission spectra revealed double peaks due to birefringence in the fiber and the peak separation showed a temperature dependence as large as -7. 7 MHz/deg, which was 2 orders of magnitude larger than that estimated from the thermal characteristics of its component materials.

In this paper, we propose a new structure of the frequency domain adaptive filter (FDAF). The proposed structure is based on the modified DFT pair which consists of the FIR filters, so that un-delayed output signal can be obtained with stable convergence and without accumulated error which are problems for the conventional FDAFs. The convergence performance of the proposed FDAF is examined through the computer simulations in the adaptive line enhancer (ALE) comparing with the conventional FDAF and the DCT domain adaptive filter. Furthermore, in order to improve the error performance of the FDAF, we propose a composite algorithm which consists of the normalized step size algorithm for fast convergence and the variable step size one for small estimation error. The advantage of the proposed algorithm is also confirmed through simulations in the ALE. Finally, we propose a reduction method of the computational complexity of the proposed FDAF. The proposed method is to utilize a part of the FFT flow-graph, so that the computational complexity is reduced to O(N log N).

In scheduling problem for automatic assembly, planning of task sequence is closely related with resource allocation. However, they have been separately carried out with little interaction in previous work. In assembly planning problem, there are many feasible sequences for one mechanical product. In order to find the best assembly sequence, we have to decide the cost function for each task a priori and make decision based on summation of costs in sequence. But the cost of each task depends on the machine which executes the allocated task and it becomes difficult to estimate an exact cost of each task at planning stage. Moreover, no concurrent operation is taken into account at planning stage. Therefore, we must consider the sequence planning and the machine allocation simultaneously. In this paper, we propose a new scheduling method in which sequence planning and machine allocation are considered simultaneously. First of all, we propose a modeling method for an assembly sequence including a manufacturing environment. Secondly, we show a guideline in order to determine the estimate function in A* algorithm for assembly scheduling. Thirdly, a new search method based on combination of A* algorithm and supervisor is proposed. Fourthly, we propose a new technique which can take into consider the repetitive process in manufacturing system so as to improve the calculation time. Finally, numerical experiments of proposed scheduling algorithm are shown and effectiveness of proposed algorithm is verified.