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:

  • 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 ...
  • Families of rational numbers with predictable Engle product expansions`` 
    Melham Ray (University of Waterloo, Ontario, Canada, 2009)
    In 1987 Knopfmacher and Knopfmacher published new infinite product expansions for real numbers 0 < A < 1 and A > 1. They called these expansions Engel product expansions. At that time they had difficulty finding rational ...
  • Feasible Prediction In S-System Models Of Genetic Networks 
    Yeh Wei-Chang; Lin Wen-Ben; Hsieh Tsung-Jung; Liu Sin-Long (Pergamon-Elsevier Science Ltd, 2011)
    To construct the model of gene expression using microarray techniques can reveal the regulation rules from the gene expression profiles. From S-system model, it is able to analyze the regulatory system dynamics. However, ...
  • Feature Selection With Intelligent Dynamic Swarm And Rough Set 
    Bae Changseok; Yeh Wei-Chang; Chung Yuk; Liu Sin-Long (Pergamon-Elsevier Science Ltd, 2010)
    Data mining is the most commonly used name to solve problems by analyzing data already present in databases. Feature selection is an important problem in the emerging field of data mining which is aimed at finding a small ...
  • Feature significance in generalized additive models 
    Ganguli Bhaswati; Wand Matt (Springer New York LLC, 2007)
    This paper develops inference for the significance of features such as peaks and valleys observed in additive modeling through an extension of the SiZer-type methodology of Chaudhuri and Marron (1999) and Godtliebsen et ...
  • Feature subset selection using differential evolution and a statistical repair mechanism 
    Khushaba Rami N; Al-Ani Ahmed; Al-Jumaily Adel (Pergamon - Elsevier Ltd., 2011)
    One of the fundamental motivations for feature selection is to overcome the curse of dimensionality problem. This paper presents a novel feature selection method utilizing a combination of differential evolution (DE) ...
  • The financial instability hypothesis: A stochastic microfoundation framework 
    Chiarella Carl; Di Guilmi Corrado (Elsevier Inc, 2011)
    This paperexaminesthedynamicsoffinancialdistressandinparticularthemechanism of transmissionofshocksfromthefinancialsectortotherealeconomy.Theanalysisis performedbyrepresentingthelinkagesbetweenmicroeconomicfinancialvariablesand ...
  • Finding the Population variance of Costs over the Solution Space of the TSP in Polynomial Time 
    Sutcliffe Paul; Solomon Andrew; Edwards Jennifer (WSEAS, 2007)
    We give a polynomial time algorithm to find the population variance of tour costs over the solution space of the symmetric Traveling Salesman Problem (TSP). In practical terms the algorithm provides a linear time method, ...
  • Finite-dimensional realizations of regime-switching HJM models 
    Elhouar Mikael (Routledge, 2008)
    This paper studies Heath-Jarrow-Morton-type models with regime-switching stochastic volatility. In this setting the forward rate volatility is allowed to depend on the current forward rate curve as well as on a continuous ...
  • Finite mixture and genetic algorithm segmentation in partial least aquares path modeling: Identification of multiple segments in complex path models 
    Ringle Christian; Sarstedt Marko; Schlittgen Rainer (Springer, 2010)
    When applying structural equation modeling methods, such as partial least squares (PLS) path modeling, in empirical studies, the assumption that the data have been collected from a single homogeneous population is often ...
  • First order strong approximations of jump diffusions 
    Nikitopoulos Sklibosios Christina; Bruti Liberati Nicola; Platen Eckhard (Trans Tech Publications Ltd, 2007)
    This paper presents new results on strong numerical schemes, which are appropriate for scenario analysis, filtering and hedge simulation, for stochastic differential equations (SDEs) of jump-diffusion type. It provides ...