Browsing 08 Information and Computing Sciences by Title

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

  • >
  • >

Browsing 08 Information and Computing Sciences by Title

Sort by: Order: Results:

  • Al-Ani, Ban (CSREA Press (CD Rom), 2002)
  • Teague, Donna; Corney, Malcolm; Ahadi, Alireza; Lister, Raymond (Australian Computer Society Inc, 2013)
    Abstract: Recent research indicates that some of the difficulties faced by novice programmers are manifested very early in their learning. In this paper, we present data from think aloud studies that demonstrate the ...
  • Zhang, Wenjie; Lin, Xuemin; Cheema, Muhammad; Zhang, Ying; Wang, Wei (IEEE, 2010)
    K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over multi-valued objects. We aim to provide ...
  • Abreu, Fernando; Henderson-Sellers, Brian; Piattini, Mario; Poels, Geert; Sahraoui, Houari (Springer-verlag Berlin, 2002)
    This report summarizes the contributions and debates of the 5th International ECOOP Workshop on Quantitative Approaches in Object-Oriented Software Engineering (QAOOSE 2001), which was held in Budapest on 18-19 June, 2001. ...
  • Bernardo, Daniel; Chua, Bee Bee; Hoang, Doan (Research Publishing Services, 2009)
    This paper introduces a novel approach to a more practical Quantitative SRA. The approach formalized in this paper is based on the methods described in various risk assessment frameworks that were described by existing ...
  • Ying, Mingsheng (Elsevier Science Bv, 2010)
    The main purpose of this paper is to examine some (potential) applications of quantum computation in AI and to review the interplay between quantum theory and AI. For the readers who are not familiar with quantum computation, ...
  • Ying, Mingsheng; Feng, Yuan; Yu, Nengkun (IEEE Computer Society, 2013)
    Quantum cryptography has been extensively studied in the last twenty years, but information-flow security of quantum computing and communication systems has been almost untouched in the previous research. Due to the essential ...
  • Sun, Zhiwei; Du, Rg; Long, Dong-Yang (World Scientific Publ Co Pte Ltd, 2013)
    Recently, quantum key distribution (QKD) with classical Bob has been suggested and proven completely robust by Boyer et al. [Phys. Rev. Lett.99 (2007) 140501] in which quantum Alice has a fully-fledged quantum power, while ...
  • Ying, Mingsheng (Elsevier, 2007)
    An axiomatization of a mathematical theory consists of a system of basic notions as well as a set of axioms about these notions. The mathematical theory is then the set of theorems which can be derived from the axioms. ...
  • Ying, Mingsheng; Feng, Yuan (Springer-Verlag, 2010)
    Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of ...
  • Ying, Mingsheng; Feng, Yuan; Duan, Runyao; Li, Yangjia; Yu, Nengkun (Science Press, 2012)
    This paper surveys the new field of programming methodology and techniques for future quantum computers, including design of sequential and concurrent quantum programming languages, their semantics and implementations. ...
  • Wilde, Mark; Datta, Nilanjana; Hsieh, Min-Hsiu; Winter, Andreas (IEEE-Inst Electrical Electronics Engineers Inc, 2013)
    We extend quantum rate-distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum ...
  • Datta, Nilanjana; Hsieh, Min-Hsiu; Wilde, Mark (IEEE-Inst Electrical Electronics Engineers Inc, 2013)
    We derive quantum counterparts of two key theorems of classical information theory, namely, the rate-distortion theorem and the source-channel separation theorem. The rate-distortion theorem gives the ultimate limits on ...
  • Shen, Jialie; Tao, Dacheng; Li, Xuelong (IEEE-Inst Electrical Electronics Engineers Inc, 2009)
    In this paper, we introduce a novel indexing scheme-QUery Context tree (QUC-tree) to facilitate efficient query sensitive music search under different query contexts. Distinguished from the previous approaches, QUC-tree ...
  • Li, Yangxi; Geng, Bo; Yang, Linjun; Xu, Chao; Bian, Wei (Elsevier Science Bv, 2012)
    Query difficulty estimation predicts the performance of the search result of the given query. It is a powerful tool for multimedia retrieval and receives increasing attention. It can guide the pseudo relevance feedback to ...
  • Qin, Lu; Yu, Jeffrey; Chang, Lijun; Tao, Yufei (IEEE, 2009)
    Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a set of l keywords, {k1, k2, middot ...
  • Yang, Chi; Liu, Chang; Zhang, Xuyun; Nepal, Surya; Chen, Jinjun (IEEE Computer Society, 2013)
    Nowadays, we enter a new era of data explosion which introduces the new problems for big data processing. Current methods for querying streaming XML big data are mostly based on events filtering techniques. It is ...
  • Chang, Lijun; Yu, Jeffrey; Qin, Lu (ACM, 2009)
    Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXML-RANK query, (Q, k), which is to rank top-k probabilities of the answers of a twig query Q in ...
  • Fan, Wenfei; Yu, Jeffrey; Li, Jianzhong; Ding, Bolin; Qin, Lu (Springer-Verlag, 2009)
    We study the problem of evaluating xpath queries over xml data that is stored in an rdbms via schema-based shredding. The interaction between recursion (descendants-axis) in xpath queries and recursion in dtds makes it ...
  • Serour, Magdy; Winder, Daryll (Polytechnic University of Valencia, Spain, 2007)
    While there has been significant discussion of the techniques of method engineering, the current literature gives little attention to the adoption and diffusion process, firstly, how the organizations get ready for the ...