Performance analysis of AF relaying based on water-filling power allocation over Nakagami-<Emphasis Type="Italic">m</Emphasis> fading

This paper investigates exact performance of an amplify-and-forward (AF) relay system based on water-filling power allocation in Nakagami-m fading environment, where m is a nonnegative integer plus one half. We first offer the cumulative distribution function (CDF) and probability density function (PDF) of the received signal-to-noise ratio (SNR) at a destination. Then outage probability, moments of SNR, higher-order statistics of the capacity are explicitly conducted. Especially, average symbol error rate (SER) under an additive white generalized Gaussian noise (AWGGN) is developed for water-filling power allocation scheme. While the average SER subjected by an additive white Gaussian noise (AWGN) can be regarded as a special case. Finally, all theoretical formulas are truly attested by various simulation results.     

A multiscale superpixel-level salient object detection model using local-global contrast cue

The goal of salient object detection is to estimate the regions which are most likely to attract human’s visual attention. As an important image preprocessing procedure to reduce the computational complexity, salient object detection is still a challenging problem in computer vision. In this paper, we proposed a salient object detection model by integrating local and global superpixel contrast at multiple scales. Three features are computed to estimate the saliency of superpixel. Two optimization measures are utilized to refine the resulting saliency map. Extensive experiments with the state-of-the-art saliency models on four public datasets demonstrate the effectiveness of the proposed model.     

Automatically finding the number of clusters based on simulated annealing

Based on simulated annealing (SA), automatically finding the number of clusters (AFNC) is proposed in this paper to determine the number of clusters and their initial centers. It is a simple and automatic method that combines local search with two widely-accepted global analysis techniques, namely careful-seeding (CS) and distance-histogram (DH). The procedure for finding a cluster is formulated as mountain-climbing, and the mountain is defined as the convergent domain of SA.When arriving at the peak of one mountain, AFNC has found one of the clusters in the dataset, and its initial center is the peak. Then, AFNC continues to climb up another mountain from a new starting point found by CS till the termination condition is satisfied. In the procedure of climbing-up mountain, the local dense region for searching the next state of SA is found by analyzing the distance histogram. Experimental results show that AFNC can achieve consistent performance for a wide range of datasets.     

Optimization of CMOS repeater driven interconnect RC line using genetic algorithm

In this work, optimization of complementary metal oxide semiconductor (CMOS) repeater driven interconnect resistive-capacitive (RC) line is carried out using genetic algorithm (GA). This work is aimed at powerdelay- product (PDP) minimization of RC interconnect at 180 nm technology node. The algorithm simultaneously optimizes the values of supply voltage, number of repeaters and repeater width for delay and PDP minimization. The accuracy of results obtained is verified by simulations from Cadence virtuoso tool. For delay minimization, comparison of GA results with previous results of the literature shows an improvement of 44.4% in the value of the optimal number of repeaters required. This improvement is obtained by increasing the repeater size, which also increases power dissipation, so a tradeoff has also been achieved in terms of PDP minimization. The comparison of PDP results obtained in this work, with the results at 70, 100, and 130 nm technologies from literature shows improvement in optimal number of repeaters required. The results of algorithm and simulations are in good agreement and demonstrate the validity of proposed algorithm.     

Numerical study on water depth effects on hydrodynamic forces acting on berthing ships

Due to the restrictions of ports, maneuverability of berthing ships will be affected significantly by water depth. In the present study, numerical simulation of the berthing maneuver of a ship with prescribed translational motion is performed by solving the Reynolds-averaged Navier-Stokes (RANS) equations based on overset grid, and the effects of the quaywall and freesurface are taken into consideration. To validate the present numerical method, comparison is performed between our results and the other results or measurements. It is found that the agreement is significantly better than that resulting from previous CFD-based approach. Subsequently, the effects of various water depths are investigated to evaluate their influences on hydrodynamic forces. The present results can provide helpful guidance on safe maneuvering for vessels’ berthing and fender system design in quays.     

Hierarchical control strategy of trajectory tracking for intelligent vehicle

In order to track the desired trajectory for intelligent vehicle, a new hierarchical control strategy is presented. The control structure consists of two layers. The high-level controller adopts the model predictive control (MPC) to calculate the steering angle tracking the desired yaw angle and the lateral position. The low-level controller is designed as a gain-scheduling controller based on linear matrix inequalities. The desired longitudinal velocity and the yaw rate are tracked by the adjustment of each wheel torque. The simulation results via the high-fidelity vehicle dynamics simulation software veDYNA show that the proposed strategy has a good tracking performance and can guarantee the yaw stability of intelligent vehicle.     

A generalized self-consistent model for interfacial debonding behavior of fiber reinforced rubber matrix sealing composites

This paper presents an experimental and numerical study of short-fiber-reinforced rubber matrix sealing composites(SFRC). The transverse tensile stress-strain curves of SFRC are obtained by experiments. Based on the generalized self-consistent method, a representative volume element(RVE) model is established, and the cohesive zone model is employed to investigate the interfacial failure behavior. The effect of interphase properties on the interfacial debonding behavior of SFRC is numerically investigated. The results indicate that an interphase thickness of 0.3 μm and an interphase elastic modulus of about 502 MPa are optimal to restrain the initiation of the interfacial debonding. The interfacial debonding of SFRC mainly occurs between the matrix/interphase interface,which agrees well with results by scanning electron microscope(SEM).     

Absolute quantum efficiency calibration of analog detectors with twin photon current

Correlated photon is exploited as a tool for absolute quantum efficiency calibration of photon detectors working in the photon-counting regime. We extend the method from photon-counting regime to the absolute calibration of analog regime photon detectors. A revised calibration module is proposed based on balance detection and fluctuation restrictions conditions applied to analog photon detectors. An absolute calibration experimental system is established. This method shows a relative standard uncertainty of 2.1% and a relative deviation of 1% compared with those of the typical photomultiplier quantum efficiency.     

Solving service selection problem based on a novel multi-objective artificial bees colony algorithm

Service computing is a new paradigm and has been widely used in many fields. The multi-objective service selection is a basic problem in service computing and it is non-deterministic polynomial (NP)-hard. This paper proposes a novel multi-objective artificial bees colony (n-MOABC) algorithm to solve service selection problem. A composite service instance is a food source in the algorithm. The fitness of a food source is related to the quality of service (QoS) attributes of a composite service instance. The search strategy of the bees are based on dominance. If a food source has not been updated in successive maximum trial (Max Trial) times, it will be abandoned. In experiment phase, a parallel approach is used based on map-reduce framework for n-MOABC algorithm. The performance of the algorithm has been tested on a variety of data sets. The computational results demonstrate the effectiveness of our approach in comparison to a novel bi-ant colony optimization (NBACO) algorithm and co-evolution algorithm.     

Methods for calculating intervals of reconstructed results in traffic accidents with different types of interval traces

In order to obtain more effective uncertainty analysis methods for analyzing uncertainty of a reconstructed result in a traffic accident with different types of interval traces, three new methods are proposed. The first method is named as sub-interval perturbed method, it is used for calculating the binary interval of the reconstructed result in an accident with binary interval traces, and it can overcome the interval extension problem well. The second method is based on interval arithmetic and the first method, it is used for calculating the ternary interval of the accident reconstruction result in an accident with ternary interval traces, and the most probable value of the reconstructed result is a number. The basic idea of the third method is the same as that of the second method, it is used for calculating the ternary interval of the accident reconstruction result in an accident with mixed interval traces, and the most probable value of the reconstructed result is an interval. All methods are demonstrated and validated by numerical cases. The results show that all methods are feasible and practical. Finally, a true vehicle-motorcycle accident is given, in which the braking distance of vehicle, and the throw distances of driver and motorcycle are all binary interval traces. The accident is reconstructed by the software PC-Crash, and the interval of impact velocity is analyzed. The interval of the velocity is [55.7, 64.3] km/h. This interval result is more objective than a single number.