Forming High-Availability Cloud Mechanism for Secure Peer-Servicing Networks

Wireless Personal Communications - Currently, websites provide web services to people for expressing their feelings and promoting their relationship with friends. The web service allows people to...     

Algorithm for a class of constrained weight least square problems and applications

An algorithm, based on ordinal optimisation (OO) and sensitive theories, is presented to solve a class of constrained weight least square problems with continuous and discrete variables. the proposed algorithm can cope with an enormous amount of computational complexity problems and has a high probability of obtaining a good enough solution according to the oo theory. this method has some advantages, such as computational efficiency, numerical stability and the superiority of the good enough solution. the proposed algorithm is explicit, compact and easy to program. test results demonstrate that the proposed approach is more computational-efficient than other existing approaches for solving constrained-state estimation problems with continuous and discrete variables on the ieee 30-bus and the ieee 118-bus systems.     

Spatially dispersive displacement sensor utilizing a semiconductor gain chip

We demonstrate the development of a simply equipped displacement sensor utilizing spatially dispersive confocal technology. It feeds the amplified spontaneous emission (ASE) of a laser diode to a wavelength-selective feedback structure that corresponds to the position of a measured surface. The displacement sensor has a detecting range of 4 microm and precision of less than 2 nm, as proven by the analysis of the spectral shifts of the multipassed amplified output ASE. As compared with traditional sensors, the displacement sensor presented in our study requires fewer components and has as high precision as complex systems and a higher measurement rate due to the simpler strategy of displacement determination.     

Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

Thedistance transform(DT) is an image computation tool which can be used to extract the information about the shape and the position of the foreground pixels relative to each other. It converts a binary image into a grey-level image, where each pixel has a value corresponding to the distance to the nearest foreground pixel. The time complexity for computing the distance transform is fully dependent on the different distance metrics. Especially, the more exact the distance transform is, the worse execution time reached will be. Nowadays, quite often thousands of images are processed in a limited time. It seems quite impossible for a sequential computer to do such a computation for the distance transform in real time. In order to provide efficient distance transform computation, it is considerably desirable to develop a parallel algorithm for this operation. In this paper, based on the diagonal propagation approach, we first provide anO(N²) time sequential algorithm to compute thechessboard distance transform(CDT) of anN×Nimage, which is a DT using the chessboard distance metrics. Based on the proposed sequential algorithm, the CDT of a 2D binary image array of sizeN×Ncan be computed inO(logN) time on the EREW PRAM model usingO(N²/logN) processors,O(log logN) time on the CRCW PRAM model usingO(N²/log logN) processors, andO(logN) time on the hypercube computer usingO(N²/logN) processors. Following the mapping as proposed by Lee and Horng, the algorithm for the medial axis transform is also efficiently derived. The medial axis transform of a 2D binary image array of sizeN×Ncan be computed inO(logN) time on the EREW PRAM model usingO(N²/logN) processors,O(log logN) time on the CRCW PRAM model usingO(N²/log logN) processors, andO(logN) time on the hypercube computer usingO(N²/logN) processors. The proposed parallel algorithms are composed of a set of prefix operations. In each prefix operation phase, only increase (add-one) operation and minimum operation are employed. So, the algorithms are especially efficient in practical applications.     

Robust observer-based OMF vibration control of flexible linkage mechanisms using piezoelectric films

Based on the state-space model of the flexible linkage mechanism equipped with piezoelectric films, a robust control methodology for actively suppressing the elastodynamic responses of the high-speed flexible linkage mechanism with linear structured time-varying parameter perturbations by employing an observer-based optimal model-following (OMF) controller is presented. The advantage of the proposed robust observer-based OMF control methodology is that it not only can avoid the problem of how to choose the appropriate weighting matrices in the quadratic cost function of the linear-quadratic/linear-quadratic-Gaussian (LQ/LQG) control method but also can make the controlled closed-loop system to have the specified system response characteristics. Besides, in order to guarantee that the designed observer-based OMF controller can make the controlled flexible linkage mechanism system to avoid the possibilities of both spillover-induced instability and time-varying-parameter-perturbation-induced instability, a robust stability criterion is also presented in this paper. The control method, presented in this paper, can not only make the controlled closed-loop system to have the specified system response characteristics, but also guarantee the controlled closed-loop system to have robust stability properties by using the proposed robust stability criterion; while those control methods reported recently do not have these above-mentioned merits. Finally, an active robust vibration control problem of a slider-crank mechanism is provided for illustrating the applicability of the proposed method.     

Effects of irradiation and drying on volatile components of fresh shiitake (Lentinus edodesSing)

Fresh shiitake (Lentinus edodes Sing) was irradiated with doses of 0·5, 1 and 2 kGy using ⁶⁰Co. Effects of γ-irradiation and drying on the volatile composition of shiitake were studied by gas chromatography (GC) and GC–mass spectrometry. Irradiation above 1·0 kGy could inhibit the growth and mould decay of fresh shiitakes after harvesting. Irradiation with 2 kGy increased the eight-carbon volatile components of fresh shiitake. Treatment at 1 kGy irradiation of fresh shiitake produced some new volatile compounds in the dry product, such as methylethyl disulphide, sulphinylbis methane, methyl(methylthio)ethyl disulphide and N-(3-methylbutyl) acetamide. The eight-carbon compounds mostly disappeared after drying. The amount of sulphur-containing volatile compounds in dried shiitake became lower during irradiation. Irradiation with doses of 1 or 2 kGy of fresh shiitake did not increase the volatile content of shiitake after drying. © 1998 SCI.     

A Bayesian procedure for process capability assessment

The usual practice of judging process capability by evaluating point estimates of some process capability indices has a flaw that there is no assessment on the error distributions of these estimates. However, the distributions of these estimates are usually so complicated that it is very difficult to obtain good interval estimates. In this paper we adopt a Bayesian approach to obtain an interval estimation, particularly for the index C_pm. The posterior probability p that the process under investigation is capable is derived; then the credible interval, a Bayesian analogue of the classical confidence interval, can be obtained. We claim that the process is capable if all the points in the credible interval are greater than the pre‐specified capability level ω, say 1.33. To make this Bayesian procedure very easy for practitioners to implement on manufacturing floors, we tabulate the minimum values of Ĉ_pm/ω, for which the posterior probability p reaches the desirable level, say 95%. For the special cases where the process mean equals the target value for C_pm and equals the midpoint of the two specification limits for C_pk, the procedure is even simpler; only chi‐square tables are needed. Copyright © 1999 John Wiley & Sons, Ltd.