We study the post-main sequence evolution of products of collisions between main sequence stars (blue stragglers), with particular interest paid to the horizontal branch and asymptotic giant branch phases. We found that the blue straggler progeny populate the colour-magnitude diagram slightly blueward of the red giant branch and between 0.2 and 1 magnitudes brighter than the horizontal branch. ...

We study the Bose-Einstein condensation for a cloud of Li atoms with attractive nonlocal (finiterange) interaction in a harmonic trap. In addition to the low-density metastable branch, that is present also in the case of local interaction, a new stable branch appears at higher densities. For a large number of atoms, the size of the cloud in the stable high-density branch is independent of the t...

The probability of error for NFSK with square law combining for diversity correlated Nakagami channels is analyzed. The closed for of expression using characteristic function is derived. The average SNR per branch is considered to be distinct. The effect of different noise powers for various diversity orders and fading channel parameters on probability of error and unequal SNR distribution is b...

This paper proposes two compiler-assisted techniques to improve thread level control speculation in speculative multithreading execution. The first technique is to identify threads which have exactly one successor and the successor’s address is statically known (we call these threads fixed-successor threads), and use a small full associative buffer to predict the successors. This technique redu...

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques....

Average-case complexity of a branch-and-bound algorithm for max independent set, under the G(n, p) random model Abstract We study average-case complexity of branch-and-bound for max independent set in random graphs under the G(n, p) distribution. In this model every pair (u, v) of vertices belongs to E with probability p independently on the existence of any other edge. We make a precise case a...

Modern embedded processors use small and simple branch predictors to improve performance. Using complex and accurate branch predictors, while desirable, is not possible as such predictors impose high power and area overhead which is not affordable in an embedded processor. As a result, for some applications, misprediction rate can be high. Such mispredictions result in energy wasted down the mi...

Branch prediction accuracies determined using tracedriven simulation do not include the eflects of executing branches along a mispredicted path. However, branches along a mispredicted path will pollute the branch prediction structures i f no recovery mechanisms are provided. Without recovery mechanisms, prediction rates will suger. In this paper, we determine the appropriateness of recovery mec...

The average fade duration (AFD) finds diverse applications in evaluation and design of wireless communication systems. This quantity provides a dynamic representation of the channel and presents the average period of time for which signal stays below a predetermined threshold level. In this paper, an infinite-series expression of AFD for dual selection combining (SC) diversity receiver, operati...

In this paper, a controllable reflection type Phase Shifter (PS) is designed, simulated and implemented. The structure of the 2-bits PS consists of branch line coupler, delay lines and six GaAs FET switches controlled in pair. The phase shifting is achieved by turning ON one pair of switches. The circuit design is fabricated using FR4 substrate with dielectric constant equal to 4.7. The size of...