53 resultados para Half-bound
em Queensland University of Technology - ePrints Archive
Resumo:
In cooperative communication systems, several wireless communication terminals collaborate to form a virtual-multiple antenna array system and exploit the spatial diversity to achieve a better performance. This thesis proposes a practical slotted protocol for cooperative communication systems with half-duplex single antennas. The performance of the proposed slotted cooperative communication protocol is evaluated in terms of the pairwise error probability and the bit error rate. The proposed protocol achieves the multiple-input single-output performance bound with a novel relay ordering and scheduling strategy.
Resumo:
Until recently, the low-abundance (LA) range of the serum proteome was an unexplored reservoir of diagnostic information. Today it is increasingly appreciated that a diagnostic goldmine of LA biomarkers resides in the blood stream in complexed association with more abundant higher molecular weight carrier proteins such as albumin and immunoglobulins. As we now look to the possibility of harvesting these LA biomarkers more efficiently through engineered nano-scale particles, mathematical approaches are needed in order to reveal the mechanisms by which blood carrier proteins act as molecular 'mops' for LA diagnostic cargo, and the functional relationships between bound LA biomarker concentrations and other variables of interest such as biomarker intravasation and clearance rates and protein half-lives in the bloodstream. Here we show, by simple mathematical modeling, how the relative abundance of large carrier proteins and their longer half-lives in the bloodstream work together to amplify the total blood concentration of these tiny biomarkers. The analysis further suggests that alterations in the production of biomarkers lead to gradual rather than immediate changes in biomarker levels in the blood circulation. The model analysis also points to the characteristics of artificial nano-particles that would render them more efficient harvesters of tumor biomarkers in the circulation, opening up possibilities for the early detection of curable disease, rather than simply better detection of advanced disease.
Resumo:
We surveyed 506 Australian high school students on career development (exploration, planning, job-knowledge, decision-making, indecision), personal functioning (well-being, self-esteem, life satisfaction, school satisfaction) and control variables (parents’ education, school achievement), and tested differences among work-bound, college-bound and university-bound students. The work-bound students had the poorest career development and personal functioning, the university-bound students the highest, with the college-bound students falling in-between the other two groups. Work-bound students did poorest, even after controlling for parental education and school achievement. The results suggest a relationship between career development and personal functioning in high school students.
Resumo:
This paper addresses the tradeoff between energy consumption and localization performance in a mobile sensor network application. The focus is on augmenting GPS location with more energy-efficient location sensors to bound position estimate uncertainty in order to prolong node lifetime. We use empirical GPS and radio contact data from a largescale animal tracking deployment to model node mobility, GPS and radio performance. These models are used to explore duty cycling strategies for maintaining position uncertainty within specified bounds. We then explore the benefits of using short-range radio contact logging alongside GPS as an energy-inexpensive means of lowering uncertainty while the GPS is off, and we propose a versatile contact logging strategy that relies on RSSI ranging and GPS lock back-offs for reducing the node energy consumption relative to GPS duty cycling. Results show that our strategy can cut the node energy consumption by half while meeting application specific positioning criteria.
Resumo:
We demonstrate a modification of the algorithm of Dani et al for the online linear optimization problem in the bandit setting, which allows us to achieve an O( \sqrt{T ln T} ) regret bound in high probability against an adaptive adversary, as opposed to the in expectation result against an oblivious adversary of Dani et al. We obtain the same dependence on the dimension as that exhibited by Dani et al. The results of this paper rest firmly on those of Dani et al and the remarkable technique of Auer et al for obtaining high-probability bounds via optimistic estimates. This paper answers an open question: it eliminates the gap between the high-probability bounds obtained in the full-information vs bandit settings.