An efficient clustering strategy for estimation of distribution algorithms (EDAs) is presented. It is used for properly fitting probabilistic models that play an important role in guiding search direction. To this end, a fitness-aided ordering scheme is devised for deciding the input sequence of samples (i.e., individuals) for clustering. It can effectively categorise the individuals by using the (available) information about fitness landscape. Moreover, a virtual leader is introduced for providing a reliable reference for measuring the distance from samples to its own cluster. The proposed algorithm incorporates them within the framework of random the leader algorithm (RLA). Experimental results demonstrate that the proposed approach is more effective than the existing ones with regard to probabilistic model fitting.

In this paper the problem of determining optimal workload for a load sharing system is considered. The system is composed of total n components and it functions until (n-k+1) components are failed. The works that should be performed by the system arrive at the system according to a homogeneous Poisson process and it is assumed that the system can perform sufficiently large number of works simultaneously. The system is subject to a workload which can be expressed in terms of the arrival rate of the work and the workload is equally shared by surviving components in the system. We assume that an increased workload induces a higher failure rate of each remaining component. The time consumed for the completion of each work is assumed to be a constant or a random quantity following an Exponential distribution. Under this model, as a measure for system performance, we derive the long-run average number of works performed per unit time and consider optimal workload which maximizes the system performance.

As digital television transmission is becoming ubiquitous, a method that can remotely monitor the quality of the final and intermediate pictures is urgently needed. In particular, the case where standards conversion is included in the transmission chain is a serious issue as the input and output cannot simply be compared. This letter proposes a novel method to solve this issue. The combination of skipping fields/pixels and the previously proposed SSSWHT-RR method, using the information of correlation coefficients and variance of the picture, achieves accurate detection of picture failure.

Recently, the radix-3 representation of integers is used for the efficient implementation of pairing based cryptosystems. In this paper, we propose non-adjacent form of radix-r representation (rNAF) and efficient algorithms for generating rNAF. The number of non-trivial digits is (r-2)(r+1)/2 and its average density of non-zero digit is asymptotically (r-1)/(2r-1). For r=3, the non-trivial digits are {2, 4} and the non-zero density is 0.4. We then investigate the width-w version of rNAF for the general radix-r representation, which is a natural extension of the width-w NAF. Finally we compare the proposed algorithms with the generalized NAF (gNAF) discussed by Joye and Yen. The proposed scheme requires a larger table but its non-zero density is smaller even for large radix. We explain that gNAF is a simple degeneration of rNAF--we can consider that rNAF is a canonical form for the radix-r representation. Therefore, rNAF is a good alternative to gNAF.

Bluetooth is reputed as a wireless networking technology capable of forming ad-hoc networks between digital devices. In particular, the Bluetooth scatternet will be an essential part of the fully distributed ad-hoc networks. However, scatternet is not fully described in the Bluetooth specification. This has been the topic of discussion among researches in relation to the formation algorithm, scheduling scheme, etc. Most of the proposed algorithms reported in past researches on scatternet formation are too large and complex to be implemented in a real commercial Bluetooth hardware. Therefore, the verifications of the proposed algorithms reported in past researches were done through only simulations. In addition, the formation process takes too long and these past researches had been conducted only in static environment where no node enters or leaves the scatternet. In this paper, therefore, we propose a new scatternet formation algorithm called Node Ring Scatternet (NRS), emphasizing on two aspects, i.e. implementation and dynamic property of the algorithm. The algorithm is very simple and compact and is verified to be easily implementable in a real commercial Bluetooth device. For the dynamic properties, the NRS entails relatively short formation delay and a reformation algorithm in a dynamic environment was designed. Therefore, the network of the NRS can be scalable and flexible. In addition, a new protocol called SFMP (Scatternet Formation & Management Protocol) was designed and is presented herein. Using this protocol, the NRS algorithm was implemented in a real Bluetooth device, and the performance was verified through hardware experiments. Based on the experimental results, it was found that the NRS composed of up to 20 nodes is formed and the proposed algorithm has shown improvement in terms of formation delay, formation probability and reformation.

Target reconstruction algorithm from its monostatic radar cross section (RCS) has been proposed for polygonal cylinders with curved surfaces. This algorithm is based on our previous finding that the main contribution to the back scattering is due to edge diffracted fields excited at a facet of nearly specular reflection direction. Dimension of this constitutive facet of the target is estimated from the local maxima and its lobe width in the angular RCS variation. Half and quarter circular cylinders are used as canonical scattering objects, and their measured and numerically simulated monostatic RCS values have been studied extensively to find scattering pattern characteristic difference between flat and circularly curved surfaces. Thus estimated constitutive facets are connected in order, and this procedure will be continued until the distance between the first and the final edges would be minimized. Our algorithm has been tested for other targets, and it is found that it works well for predicting metal convex targets with flat and curved facets.

An inverse scattering problem of estimating the surface impedance for an inhomogeneous half-space is investigated. By virtue of the fact that the far field representation contains the spectral function of the scattered field, complex values of the function are estimated from a set of absolute values of the far field. An approximate function for the spectral function is reconstructed from the estimated complex values by the least-squares sense. The surface impedance is estimated through calculating the field on the surface of the half-space expressed by the inverse Fourier transform. Numerical examples are given and the accuracy of the estimation is discussed.

Mobile agent technology is applied to enhance the remote network management of large-scale networks, and real-world oriented entertainment systems, and so forth. In order to communicate, the agents exchange messages mutually and migrate repeatedly among terminals. Although these systems efficiently accomplish the tasks by using a large quantity of mobile agents, they have a serious problem in that the number of messages between agents increases in proportion to the square of the number of agents. These systems have to reduce the communication costs, such as the number of hosts relaying messages; however, the conventional message-delivering schemes alone cannot keep the communication costs to a minimum under all conditions. To minimize the communication costs, we propose a hybrid message-delivering scheme which dynamically selects the optimal message-delivering schemes. Firstly, we evaluate the communication costs of conventional schemes, and we design the hybrid message-delivering scheme. Then we perform simulation evaluations to derive the threshold value for switching a scheme to minimize the communication costs.

This paper proposes a genetically inspired adaptive clustering algorithm for numerical and categorical data sets. To this end, unique encoding method and fitness functions are developed. The algorithm automatically discovers the actual number of clusters and efficiently performs clustering without unduly compromising cluster-purity. Moreover, it outperforms existing clustering algorithms.

This paper discusses clock skew due to manufacturing variability and environmental change. In clock tree design, transition time constraint is an important design parameter that controls clock skew and power dissipation. In this paper, we evaluate clock skew under several variability models, and demonstrate relationship among clock skew, transition time constraint and power dissipation. Experimental results show that constraint of small transition time reduces clock skew under manufacturing and supply voltage variabilities, whereas there is an optimum constraint value for temperature gradient. Our experiments in a 0.18 µm technology indicate that clock skew is minimized when clock buffer is sized such that the ratio of output and input capacitance is four.

In this paper, a new method based on the mode-matching method in the sense of least squares is presented for analyzing the two dimensional scattering problem of TE plane wave incidence to the infinite plane surface with an arbitrary imperfection of finite extent. The semi-infinite upper and lower regions of that surface are a vacuum and a perfect conductor, respectively. Therefore the discussion of this paper is developed about the Dirichlet boundary value problem. In this method, the approximate scattered wave is represented by the integral transform with band-limited spectrum of plane waves. The boundary values of those scattered waves are described by only abscissa z and Fourier spectra are obtained by applying the ordinary Fourier transform. Moreover, new approximate functions are made by inverse Fourier transform of band-limited those spectra. Consequently, the integral equations of Fredholm type of second kind for spectra of approximate scattered wave functions are derived by matching those new functions to exact boundary value in the sense of least squares. Then it is shown analytically and numerically that the sequence of boundary values of approximate wave functions converges to the exact boundary value, namely, the boundary value of the exact scattered wave in the sense of least squares when the profile of imperfection part is described by continuous and piecewise smooth function at least. Moreover, it is shown that this sequence uniformly converges to exact boundary value in arbitrary finite region of the boundary and the sequence of approximate wave functions uniformly converges to the exact scattered field in arbitrary subdomain in the upper vacuum domain of the boundary in wider sense when the uniqueness of the solution of the Helmholtz equation is satisfied with regard to the profile of the imperfection parts of the boundary.

In this paper, we are concerned with a structural ambiguity problem of tree adjoining grammars (TAGs), which is an essential problem when we try to model consensus structures of given set of ribonucleic acid (RNA) secondary structures by TAGs. RNA secondary structures can be represented as strings with structural information, and TAGs have a descriptive capability of this kind of strings, what we call structure-annotated strings. Thus, we can model RNA secondary structures by TAGs. It is sufficient to use existing alignment methods for just computing the optimal alignment between RNA secondary structures. However, when we also want to model the resulting alignment by grammars, if we adopt these existing methods, then we may fail in modeling the alignment result by grammars. Therefore, it is important to introduce a new alignment method whose alignment results can be appropriately modeled by grammars. In this paper, we will propose an alignment method based on TAG's derivations each corresponding to a given RNA secondary structure. For an RNA secondary structure, there exist a number of derivations of TAGs which correspond to the structure. From the grammatical point of view, the property of TAGs drives us to the question how we should choose a derivation from these candidates in order to obtain an optimal alignment. This is the structural ambiguity problem of TAGs, which will be mainly discussed in this paper. For dealing with this problem appropriately, we will propose an edit distance between two structure-annotated strings, and then present an algorithm which computes an optimal alignment based on the edit distance.

In the letter we extend our previous work, which applies genetic programming to passive filter synthesis tasks. The extended method deals with the tolerance design considerations. Experimental results show that our method can effectively generate filters which outperform those generated by traditional methods. In addition, it provides filter designers with an effective CAD tool to manage the trade-off between manufacturing yield and circuit cost.

This paper discusses multicast routing in ad hoc networks. In multicast routing, a node delivers the same message to the other nodes within a multicast group along with a multicast tree. Since nodes are moving around in ad hoc networks, the links between the nodes change frequently. However, the multicast tree must be maintained to deliver the messages regardless of the link changes. This paper gives a description of an autonomous clustering-based hierarchical multicast routing protocol in ad hoc networks. Since the autonomous clustering scheme is adaptive to the node movement, the proposed multicast routing can maintain the multicast tree in despite of link changes. This paper shows the effectiveness of autonomous clustering-based hierarchical multicast routing from the point of view of adaptability to link changes and scalability to multicast members.

Although the multiuser detection scheme based on Kalman filtering (K-MUD) proposed by Zhang and Wei, is referred to as a "blind" algorithm, in fact it is not really blind because it is conditioned on perfect knowledge of system parameter, power of the desired user. This paper derives an algorithm to estimate the power of the user of interest, and proposes a completely blind multiuser detection. Computer simulations show that the proposed parameter estimation scheme obtains excellent effect, and that the new detection scheme has nearly the same performance as the K-MUD, there is only slight degradation at very low input signal-to-interference ratios (SIR).

The authors propose the simple and efficient method based on the shooting and bouncing rays (SBR) method in order to evaluate multi-reflection effects inside a radome. In this paper, we show the analysis procedure of the proposed method. Next, we compare calculated data with some measured data in order to verify the proposed method. We confirmed that the proposed method is effective for the objects with radome except the areas where strong edge diffraction appears.

This paper describes a novel engineering change order (ECO) design method for large-scale, high performance LSIs, based on a patchwork-like partitioning technique. In conventional design methods, even when only small changes are made to the design after the placement and routing process, a whole re-layout must be done, and this is very time consuming. Using the proposed method, we can partition the design into several parts after logic synthesis. When design changes occur in HDL, only the parts related to the changes need to be redesigned. The netlist for the changed design remains almost the same as the original, except for the small changed parts. For partitioning, we used multiple-fan-out-points as partition borders. An experimental evaluation of our method showed that when a small change was made in the RTL description, the revised circuit part had only about 87 gates on average. This greatly reduces the re-layout time required for implementing an ECO. In actual commercial designs in which several design changes are required, it takes only one day to redesign.

This paper presents a fuzzy optimization based scheduling method for the manufacturing systems with uncertain production capacities. To address the uncertainties efficiently, the fuzzy optimization technique is used in defining the scheduling problem. Based on the symmetric approach of fuzzy optimization and Lagrangian relaxation technique, a practical fuzzy-optimization based algorithm is developed. The computational experiments based on the real factory data demonstrate that the proposed method provides robust scheduling to hedge against uncertainties.

Pattern extraction is an indispensable step in bare printed circuit board (PCB) inspection and plays an important role in automatic inspection system design. A good approach for pattern definition and extraction will make the following PCB diagnosis easy and efficient. The window-based technique has great potential in PCB patterns extraction due to its simplicity. The conventional window-based pattern extraction methods, such as Small Seeds Window Extraction method (SSWE) and Large Seeds Window Extraction method (LSWE), have the problems of losing some useful copper traces and splitting slanted-lines into too many small similar windows. These methods introduce the difficulty and computation intensive in automatic inspection. In this paper, a novel method called Contour Based Window Extraction (CBWE) algorithm is proposed for improvement. In comparison with both SSWE and LSWE methods, the CBWE algorithm has several advantages in application. Firstly, all traces can be segmented and enclosed by a valid window. Secondly, the type of the entire horizontal or vertical line of copper trace is preserved. Thirdly, the number of the valid windows is less than that extracted by SSWE and LSWE. From the experimental results, the proposed CBWE algorithm is demonstrated to be very effective in basic pattern extraction from bare PCB image analysis.

We propose a method of dimensioning and managing the bandwidth of a link on which flows with heterogeneous access-link bandwidths are aggregated. We use a processor-sharing queue model to develop a formula approximating the mean TCP file-transfer time of flows on an access link in such a situation. This only requires the bandwidth of the access link carrying the flows on which we are focusing and the bandwidth and utilization of the aggregation link, each of which is easy to set or measure. We then extend the approximation to handle various factors affecting actual TCP behavior, such as the round-trip time and restrictions other than the access-link bandwidth and the congestion of the aggregation link. To do this, we define the virtual access-link bandwidth as the file-transfer speed of a flow when the utilization of the aggregation link is negligibly small. We apply the virtual access-link bandwidth in our approximation to estimate the TCP performance of a flow with increasing utilization of the aggregation link. This method of estimation is used as the basis for a method of dimensioning the bandwidth of a link such that the TCP performance is maintained, and for a method of managing the bandwidth by comparing the measured link utilization with an estimated threshold indicating degradation of the TCP performance. The accuracy of the estimates produced by our method is estimated through both computer simulation and actual measurement.