Browsing 01 Mathematical Sciences by Title

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Browsing 01 Mathematical Sciences by Title

Sort by: Order: Results:

  • Enhancing learning using generic and specific aspects of knowledge formation 
    Petocz Peter; Reid Anna (University of Western Australia, 2002)
    Recognising and understanding the diverse ways that students learn is an important step in setting up effective environments for learning. A traditional way of getting this information is to observe the quality of assessed ...
  • Entanglement Between Two Uses Of A Noisy Multipartite Quantum Channel Enables Perfect Transmission Of Classical Information 
    Duan Runyao; Shi Yaoyun (Amer Physical Soc, 2008)
    Suppose that m senders want to transmit classical information to n receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, ...
  • Entanglement Is Not Necessary For Perfect Discrimination Between Unitary Operations 
    Duan Runyao; Feng Yuan; Ying Mingsheng (American Physical Soc, 2007)
    We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No ...
  • Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme 
    Thomas A; Green Peter (Elsevier Science Bv, 2009)
    Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of these results to Markov ...
  • Enumerating The Junction Trees Of A Decomposable Graph 
    Thomas A; Green Peter (Amer Statistical Assoc, 2009)
    We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and ...
  • Equivalence of velocity-level and acceleration-level redundancy-resolution of manipulators 
    Cai Binghuang; Zhang Yunong (Elsevier, 2009)
    The equivalence of velocity-level and acceleration-level redundancy resolution of robot manipulators is investigated in this Letter. Theoretical analysis based on gradient-descent method and computer simulations based on ...
  • Estimation for discretely observed diffusions using transform functions 
    Platen Eckhard; Sorensen Michael; Kelly Leah (Australasian Medical Publishing Company, 2003)
    This paper introduces a new estimation technique for discretely observed diffusion processes. Transform functions are applied to transform the data to obtain good and easily calculated estimators of both the drift and ...
  • Evaluation of a self-organization scheme with topology control in mesh networks 
    Mirchandani, V. R; Prodan, A. (The Institute of Electrical and Electronic Engineers Inc (IEEE), 2007)
    Mesh networks with an autonomous channel assignment can be used as a viable cost-effective alternative for a last mile broadband access. The channel assignment algorithm in mesh networks should be capable of reducing ...
  • Exact likelihood ratio tests for penalised splines 
    Crainiceanu Ciprian; Ruppert David; Claeskens Gerda; Wand Matt (Oxford University Press, 2005)
    Penalised-spline-based additive models allow a simple mixed model representation where the variance components control departures from linear models. The smoothing parameter is the ratio of the random-coefficient and error ...
  • Exchange Options Under Jump-Diffusion Dynamics 
    Cheang Gerald; Chiarella Carl (Routledge, 2011)
    This article extends the exchange option model of Margrabe, where the distributions of both stock prices are log-normal with correlated Wiener components, to allow the underlying assets to be driven by jump-diffusion ...
  • Existence Of Universal Entangler 
    Chen J; Duan Runyao; Ji Zhengfeng; Ying Mingsheng; Yu Jeffrey (Amer Inst Physics, 2008)
    A gate is called an entangler if it transforms some (pure) product states to entangled states. A universal entangler is a gate which transforms all product states to entangled states. In practice, a universal entangler is ...
  • Explaining variational approximations 
    Ormerod J.; Wand Matt (American Statistical Association, 2010)
    Variational approximations facilitate approximate inference for the parameters in complex statistical models and provide fast, deterministic alternatives to Monte Carlo methods. However, much of the contemporary literature ...
  • Explicit analytical solutions for trhe average run length of CUSUM and EWMA charts 
    Mititelu Gabriel; Areepong Y; Sukparungsee S; Novikov Alex (Chiang Mai University, 2010)
    NA
  • Explicit bounds for approximation rates of boundary crossing probabilities for the Wiener process 
    Borovkov Kostya; Novikov Alex (Applied Probability Trust, 2005)
    We give explicit upper bounds for convergence rates when approximating both one- and two-sided general curvilinear boundary crossing probabilities for the Wiener process by similar probabilities for close boundaries of ...
  • Explicit connections between longitudinal data analysis and kernel machines 
    Pearce N.; Wand Matt (Institute of Mathematical Statistics, 2009)
    Two areas of research ¿ longitudinal data analysis and kernel machines ¿ have large, but mostly distinct, literatures. This article shows explicitly that both fields have much in common with each other. In particular, many ...
  • An extended branch and bound algorithm for linear bilevel programming 
    Lu Jie; Shi Chenggen; Zhou Hong; Zhang Guangquan (Elsevier, 2007)
    For linear bilevel programming, the branch and bound algorithm is the most successful algorithm to deal with the complementary constraints arising from Kuhn-Tucker conditions. However, one principle challenge is that it ...
  • The extended exponential power distribution and Bayesian robustness 
    Walker, S. G; Choy, S. (Elsevier Science, 2006)
    In this paper, it is demonstrated that an extension to the exponential power family allows for robustness characteristics for the normal location parameter problem, previously thought to be restricted to the Student-t and ...
  • An extended Kth-best approach for fuzzy linear bilevel problems 
    Zhang Guangquan; Lu Jie; Steele Robert; Shi Chenggen (Joint Conference On Information Sciences, 2005)
    Organizational bilevel decision-making often involves uncertain factors. The parameters shown in a bilevel programming model, either in the objective functions or constraints, are thus often imprecise, which is called the ...
  • An extended Kth-best approach for linear bilevel programming 
    Lu Jie; Shi Chenggen; Zhang Guangquan (Elsevier Science, 2006)
    Kth-best approach is one of the three popular and workable approaches for linear bilevel programming. However, it could not well deal with a linear bilevel programming problem when the constraint functions at the upper-level ...
  • An extended Kuhn-Tucker approach for linear bilevel programming 
    Lu Jie; Shi Chenggen; Zhang Guangquan (Elsevier Science, 2004)
    Kuhn-Tucker approach has been applied with remarkable success in linear bilevel programming (BLP). However, it still has some extent unsatisfactory and incomplete. One principle challenges is that it could not well handle ...