DOCSLIB.ORG

Two Important Problems on Quantum Coherence

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Two Important Problems on Quantum Coherence Two Important Problems on Quantum Coherence Thesis submitted in partial fulfillment of the requirements for the degree of B. Tech and Master of Science by Research in Computer Science and Engineering by Udit Kamal Sharma 201202094 [email protected] Center for Security, Theory and Algorithmic Research (CSTAR) International Institute of Information Technology Hyderabad - 500 032, INDIA December 2017 Copyright © Udit Kamal Sharma, 2017 All Rights Reserved International Institute of Information Technology Hyderabad, India CERTIFICATE OF AUTHORSHIP I, Udit Kamal Sharma, declare that the thesis, titled “Two Important Problems on Quantum Coher- ence”, and the work presented herein are my own. I confirm that this work was done wholly or mainly while in candidature for a research degree at IIIT-Hyderabad. Date Signature of the Candidate International Institute of Information Technology Hyderabad, India CERTIFICATE It is certified that the work contained in this thesis, titled “Two Important Problems on Quantum Coherence ” by Udit Kamal Sharma, has been carried out under my supervision and is not submitted elsewhere for a degree. Date Adviser: Dr. Indranil Chakrabarty Acknowledgments I would like to thank my supervisor Dr. Indranil Chakrabarty, for his immense guidance, patience and helpful suggestions, without which, my journey in the uncharted waters of research would have been impossible. I would like to thank him for first introducing me to this field of quantum information theory and motivating me thereafter to pursue research in this direction. I would like to thank all the faculty and non-teaching staff at CSTAR for providing me an excellent convivial environment to pursue my research. I would like to express my gratitude to the members of my research group - Sourav Chatterjee, Palash Pandya, Maharshi Ray, Gaurav Singh, Manish Shukla, Aditya Jain, Luv Agarwal and Dhrumil Patel. The weekly group discussions were extremely helpful in clarifying my doubts during my incipient days of being a neophyte in this field and further provided me insight every time I found myself in a fix. Furthermore, I would also like to thank Prof. G.P. Kar and his amazing research group at ISI Kolkata for the enlightening and untiring discussions in the summer of 2015. I am grateful to all my wing-mates, especially Aabhas Majumdar, Yogesh Maheshwari, Mihir Wad- wekar, Vrushank Vyas and Gaurav Mishra, for having lots of discussions on a plethora of topics and for motivating me throughout, even in the moments when I felt most dejected. Finally, I would like to thank my family, for their unconditional and unending love, support and encouragement. v Abstract Quantum information theory has emerged as one of the new frontiers of science and technology over the last few decades. Unlike classical information theory that deals with the classical bit, quantum information theory is centred around the concept of a qubit. In contrast to the classical bit that can either be a 0 or 1, the qubit exists in a superposition of both states at the same time. The importance of quantum resources is evident from the fact that are certain information processing tasks like telepor- tation which cannot be accomplished with only classical resources and even though there are certain tasks like secret sharing which have classical counterparts, their outputs are greatly enhance when the classical resources are combined with quantum resources. While quantum superposition and entan- glement are well-established quantum resources, recently, significant research has been carried out to explore the possibility of quantum coherence as a resource for information processing applications. This thesis is divided into four chapters. While the first two chapters deal with the fundamentals of quantum information theory and quantum coherence, the last two chapters primarily deal with the two research problems on quantum coherence. The first chapter serves as a revision of the important introductory concepts of quantum information theory, starting with the significance of the famous Stern-Gerlach experiment and the rise of ran- domness to mathematical formalism and postulates of quantum mechanics. Then, we explore the connection between randomness and lack of information and further explore how classical informa- tion is different from quantum information alongwith a brief overview of its corresponding measures. Finally, the chapter ends with a layout of widely-used quantum resources alongwith its utility in some of the famous information processing tasks. The second chapter mainly deals with a brief synopsis on quantum coherence. At first, it discusses the formulation of resource theory of quantum coherence, which is followed by an introduction to the widely accepted framework of quantifying coherence and some of the popularly used coherence quantifiers. Finally, the chapter concludes with the application of coherence in the fields of quantum thermodynamics, quantum algorithms, interference phenomena and phase discrimination. The third chapter addresses the first research topic of the thesis : broadcasting of quantum coher- ence. As quantum coherence has recently emerged as a key candidate for use as a resource in various vi vii quantum information processing tasks, hence, it is of utmost importance to explore the possibility of creating a greater number of coherent states from an existing coherent pair. This process is known as broadcasting of coherence. This chapter starts with a brief discussion on the famous no-cloning theorem, followed by an overview of approximate cloning transformations. After that, the motivation behind broadcasting of coherence is explored along with an introduction to the definitions of optimal and non-optimal broadcasting. In both these definitions, the most general two-qubit state is taken as the input to the cloner, while the most incoherent states are used as blank states of the cloner. This chapter leads to two important results. Firstly, it has been proved that while optimal broadcasting is not possible (for both local and non-local cloners), non-optimal broadcasting cannot be ruled out. Secondly, in case of non-optimal broadcasting, the coherence introduced in the output states of the cloner will always be lesser than the initial coherence of the input state. Finally, three classes of mixed states, namely, the statistical mixture of the most coherent state (MCS) and the most incoher- ent state (MIS), the Werner-like states (WLS) and the Bell-diagonal states (BDS), are taken up for obtaining their respective ranges of non-optimal broadcasting in terms of their corresponding input state parameters. The fourth and final chapter deals with the second research topic of the thesis : some peculiar prop- erties of robustness of coherence (ROC). Here, it has been shown that robustness of coherence, in contrast to many popular quantitative measures of quantum coherence derived from the resource the- oretic framework of coherence, may be sub-additive for a specific class of multi-partite quantum states. Furthermore, this chapter also highlights how the sub-additivity is affected by admixture with other classes of states for which ROC is super-additive. Moreover, it has been shown that pairs of quantum states may have different orderings with respect to relative entropy of coherence, l1-norm of coherence and ROC and the difference in ordering for coherence measures chosen pairwise has been numerically studied. Contents Chapter Page 1 Introduction to Quantum Information Theory ::::::::::::::::::::::: 1 1.1 Stern Gerlach experiment . 1 1.2 Rise of randomness . 3 1.3 Mathematical formalism of quantum mechanics . 6 1.3.1 Hilbert space . 6 1.3.2 Linear operators . 8 1.3.3 Dirac notation . 9 1.3.4 Outer product notation . 9 1.3.5 Tensor products . 9 1.4 Postulates of quantum mechanics . 10 1.5 Preliminaries of quantum information theory . 12 1.5.1 Density matrix representation of a quantum state . 12 1.5.2 Bloch sphere representaion of a general state in C2 . 15 1.5.3 Quantum measurements . 17 1.6 Quantifying information . 18 1.6.1 Classical information . 19 1.6.2 Quantum information . 21 1.7 Quantum information processing . 23 1.7.1 Resources . 23 1.7.2 Applications . 25 2 Quantum Coherence : A Brief Outlook :::::::::::::::::::::::::: 28 2.1 Resource Theory of quantum coherence . 28 2.1.1 Constraints and operations . 29 2.1.2 Coherence as a resource . 31 2.1.3 Coherence in distributed scenarios . 32 2.2 Framework for quantifying quantum coherence . 33 2.2.1 Distance-based quantifiers of coherence . 34 2.2.2 Distillable coherence and coherence cost . 37 2.2.3 Convex roof quantifiers of coherence . 38 2.2.4 Robustness of coherence . 38 2.2.5 Measuring Quantum Coherence with Entanglement . 39 2.3 Applications of quantum coherence . 40 2.3.1 Quantum thermodynamics . 41 viii CONTENTS ix 2.3.2 Quantum algorithms . 43 2.3.3 Interference phenomena . 45 2.3.4 Quantum phase discrimination . 45 3 Broadcasting of Quantum Coherence via Cloning ::::::::::::::::::::: 47 3.1 No-cloning theorem . 47 3.2 Approximate cloning transformations beyond the No-cloning theorem . 49 3.2.1 State independent cloning transformations . 49 3.2.1.1 Local state independent cloning machine . 50 3.2.1.2 Non local state independent cloning machine . 50 3.3 Broadcasting of entanglement and correlations . 50 3.4 Broadcasting of coherence . 52 3.4.1 Motivation behind broadcasting of coherence . 52 3.4.2 Optimal broadcasting of coherence . 53 3.4.2.1 Local optimal broadcasting . 53 3.4.2.2 Non-local optimal broadcasting . 54 3.4.3 Impossibility of optimal broadcasting . 55 3.4.4 Non-optimal broadcasting of coherence . 58 3.4.4.1 Local non-optimal broadcasting . 58 3.4.4.2 Non-local non-optimal broadcasting . 58 3.4.5 Theorems in non-optimal broadcasting . 58 3.5 Non-optimal broadcasting for particular mixed states . 62 3.5.1 Mixture of MIS and MCS . 62 3.5.2 Werner-like states (WLS) .
Load more

Recommended publications
  • Web Development and Perl 6 Talk
    Click to add Title 1 “Even though I am in the thralls of Perl 6, I still do all my web development in Perl 5 because the ecology of modules is so mature.” http://blogs.perl.org/users/ken_youens-clark/2016/10/web-development-with-perl-5.html Web development and Perl 6 Bailador BreakDancer Crust Web Web::App::Ballet Web::App::MVC Web::RF Bailador Nov 2016 BreakDancer Mar 2014 Crust Jan 2016 Web May 2016 Web::App::Ballet Jun 2015 Web::App::MVC Mar 2013 Web::RF Nov 2015 “Even though I am in the thralls of Perl 6, I still do all my web development in Perl 5 because the ecology of modules is so mature.” http://blogs.perl.org/users/ken_youens-clark/2016/10/web-development-with-perl-5.html Crust Web Bailador to the rescue Bailador config my %settings; multi sub setting(Str $name) { %settings{$name} } multi sub setting(Pair $pair) { %settings{$pair.key} = $pair.value } setting 'database' => $*TMPDIR.child('dancr.db'); # webscale authentication method setting 'username' => 'admin'; setting 'password' => 'password'; setting 'layout' => 'main'; Bailador DB sub connect_db() { my $dbh = DBIish.connect( 'SQLite', :database(setting('database').Str) ); return $dbh; } sub init_db() { my $db = connect_db; my $schema = slurp 'schema.sql'; $db.do($schema); } Bailador handler get '/' => { my $db = connect_db(); my $sth = $db.prepare( 'select id, title, text from entries order by id desc' ); $sth.execute; layout template 'show_entries.tt', { msg => get_flash(), add_entry_url => uri_for('/add'), entries => $sth.allrows(:array-of-hash) .map({$_<id> => $_}).hash,
    [Show full text]
  • Algorithmic Reflections on Choreography
    ISSN: 1795-6889 www.humantechnology.jyu.fi Volume 12(2), November 2016, 252–288 ALGORITHMIC REFLECTIONS ON CHOREOGRAPHY Pablo Ventura Daniel Bisig Ventura Dance Company Zurich University of the Arts Switzerland Switzerland Abstract: In 1996, Pablo Ventura turned his attention to the choreography software Life Forms to find out whether the then-revolutionary new tool could lead to new possibilities of expression in contemporary dance. During the next 2 decades, he devised choreographic techniques and custom software to create dance works that highlight the operational logic of computers, accompanied by computer-generated dance and media elements. This article provides a firsthand account of how Ventura’s engagement with algorithmic concepts guided and transformed his choreographic practice. The text describes the methods that were developed to create computer-aided dance choreographies. Furthermore, the text illustrates how choreography techniques can be applied to correlate formal and aesthetic aspects of movement, music, and video. Finally, the text emphasizes how Ventura’s interest in the wider conceptual context has led him to explore with choreographic means fundamental issues concerning the characteristics of humans and machines and their increasingly profound interdependencies. Keywords: computer-aided choreography, breaking of aesthetic and bodily habits, human– machine relationships, computer-generated and interactive media. © 2016 Pablo Ventura & Daniel Bisig, and the Agora Center, University of Jyväskylä DOI: http://dx.doi.org/10.17011/ht/urn.201611174656 This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 International License. 252 Algorithmic Reflections on Choreography INTRODUCTION The purpose of this article is to provide a first-hand account of how a thorough artistic engagement with functional and conceptual aspects of software can guide and transform choreographic practice.
    [Show full text]
  • Final CATALYST Framework Architecture
    D2.3 F in al CATALYST Framework Architect ure WORKPACKAGE PROGRAMME IDENTIFIER WP2 H2020-EE-2016-2017 DOCUMENT PROJECT NUMBER D2.3 768739 VERSION START DATE OF THE PROJECT 1.0 01/10/2017 PUBLISH DATE DURATION 03/06/2019 36 months DOCUMENT REFERENCE CATALYST.D2.3.PARTNER.WP2.v1.0 PROGRAMME NAME ENERGY EFFICIENCY CALL 2016-2017 PROGRAMME IDENTIFIER H2020-EE-2016-2017 TOPIC Bringing to market more energy efficient and integrated data centres TOPIC IDENTIFIER EE-20-2017 TYPE OF ACTION IA Innovation action PROJECT NUMBER 768739 PROJECT TITLE CATALYST COORDINATOR ENGINEERING INGEGNERIA INFORMATICA S.p.A. (ENG) PRINCIPAL CONTRACTORS SINGULARLOGIC ANONYMI ETAIREIA PLIROFORIAKON SYSTIMATON KAI EFARMOGON PLIROFORIKIS (SiLO), ENEL.SI S.r.l (ENEL), ALLIANDER NV (ALD), STICHTING GREEN IT CONSORTIUM REGIO AMSTERDAM (GIT), SCHUBERG PHILIS BV (SBP), QARNOT COMPUTING (QRN), POWER OPERATIONS LIMITED (POPs), INSTYTUT CHEMII BIOORGANICZNEJ POLSKIEJ AKADEMII NAUK (PSNC), UNIVERSITATEA TEHNICA CLUJ-NAPOCA (TUC) DOCUMENT REFERENCE CATALYST.D2.3.PARTNER.WP2.v1.0 WORKPACKAGE: WP2 DELIVERABLE TYPE R (report) AVAILABILITY PU (Public) DELIVERABLE STATE Final CONTRACTUAL DATE OF DELIVERY 31/05/2019 ACTUAL DATE OF DELIVERY 03/06/2019 DOCUMENT TITLE Final CATALYST Framework Architecture AUTHOR(S) Marzia Mammina (ENG), Terpsi Velivassaki (SiLO), Tudor Cioara (TUC), Nicolas Sainthérant (QRN), Artemis Voulkidis (POPs), John Booth (GIT) REVIEWER(S) Artemis Voulkidis (POPs) Terpsi Velivassaki (SILO) SUMMARY (See the Executive Summary) HISTORY (See the Change History Table)
    [Show full text]
  • Development of a Novel Combined Catalyst and Sorbent for Hydrocarbon Reforming Justinus A
    Chemical and Biological Engineering Publications Chemical and Biological Engineering 2005 Development of a novel combined catalyst and sorbent for hydrocarbon reforming Justinus A. Satrio Iowa State University Brent H. Shanks Iowa State University, [email protected] Thomas D. Wheelock Iowa State University, [email protected] Follow this and additional works at: http://lib.dr.iastate.edu/cbe_pubs Part of the Chemical Engineering Commons The ompc lete bibliographic information for this item can be found at http://lib.dr.iastate.edu/ cbe_pubs/220. For information on how to cite this item, please visit http://lib.dr.iastate.edu/ howtocite.html. This Article is brought to you for free and open access by the Chemical and Biological Engineering at Iowa State University Digital Repository. It has been accepted for inclusion in Chemical and Biological Engineering Publications by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Development of a novel combined catalyst and sorbent for hydrocarbon reforming Abstract A combined catalyst and sorbent was prepared and utilized for steam reforming methane and propane in laboratory-scale systems. The am terial was prepared in the form of small spherical pellets having a layered structure such that each pellet consisted of a highly reactive lime or dolime core enclosed within a porous but strong protective shell made of alumina in which a nickel catalyst was loaded. The am terial served two functions by catalyzing the reaction of hydrocarbons with steam to produce hydrogen while simultaneously absorbing carbon dioxide formed by the reaction. The in situ er moval of CO 2 shifted the reaction equilibrium toward increased H 2 concentration and production.
    [Show full text]
  • The Lift Approach
    Science of Computer Programming 102 (2015) 1–19 Contents lists available at ScienceDirect Science of Computer Programming www.elsevier.com/locate/scico Analyzing best practices on Web development frameworks: The lift approach ∗ María del Pilar Salas-Zárate a, Giner Alor-Hernández b, , Rafael Valencia-García a, Lisbeth Rodríguez-Mazahua b, Alejandro Rodríguez-González c,e, José Luis López Cuadrado d a Departamento de Informática y Sistemas, Universidad de Murcia, Campus de Espinardo, 30100 Murcia, Spain b Division of Research and Postgraduate Studies, Instituto Tecnológico de Orizaba, Mexico c Bioinformatics at Centre for Plant Biotechnology and Genomics, Polytechnic University of Madrid, Spain d Computer Science Department, Universidad Carlos III de Madrid, Spain e Department of Engineering, School of Engineering, Universidad Internacional de La Rioja, Spain a r t i c l e i n f oa b s t r a c t Article history: Choosing the Web framework that best fits the requirements is not an easy task for Received 1 October 2013 developers. Several frameworks now exist to develop Web applications, such as Struts, Received in revised form 18 December 2014 JSF, Ruby on Rails, Grails, CakePHP, Django, and Catalyst. However, Lift is a relatively new Accepted 19 December 2014 framework that emerged in 2007 for the Scala programming language and which promises Available online 5 January 2015 a great number of advantages and additional features. Companies such as Siemens© and Keywords: IBM®, as well as social networks such as Twitter® and Foursquare®, have now begun to Best practices develop their applications by using Scala and Lift. Best practices are activities, technical Lift or important issues identified by users in a specific context, and which have rendered Scala excellent service and are expected to achieve similar results in similar situations.
    [Show full text]
  • 2Nd USENIX Conference on Web Application Development (Webapps ’11)
    conference proceedings Proceedings of the 2nd USENIX Conference Application on Web Development 2nd USENIX Conference on Web Application Development (WebApps ’11) Portland, OR, USA Portland, OR, USA June 15–16, 2011 Sponsored by June 15–16, 2011 © 2011 by The USENIX Association All Rights Reserved This volume is published as a collective work. Rights to individual papers remain with the author or the author’s employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. Permission is granted to print, primarily for one person’s exclusive use, a single copy of these Proceedings. USENIX acknowledges all trademarks herein. ISBN 978-931971-86-7 USENIX Association Proceedings of the 2nd USENIX Conference on Web Application Development June 15–16, 2011 Portland, OR, USA Conference Organizers Program Chair Armando Fox, University of California, Berkeley Program Committee Adam Barth, Google Inc. Abdur Chowdhury, Twitter Jon Howell, Microsoft Research Collin Jackson, Carnegie Mellon University Bobby Johnson, Facebook Emre Kıcıman, Microsoft Research Michael E. Maximilien, IBM Research Owen O’Malley, Yahoo! Research John Ousterhout, Stanford University Swami Sivasubramanian, Amazon Web Services Geoffrey M. Voelker, University of California, San Diego Nickolai Zeldovich, Massachusetts Institute of Technology The USENIX Association Staff WebApps ’11: 2nd USENIX Conference on Web Application Development June 15–16, 2011 Portland, OR, USA Message from the Program Chair . v Wednesday, June 15 10:30–Noon GuardRails: A Data-Centric Web Application Security Framework . 1 Jonathan Burket, Patrick Mutchler, Michael Weaver, Muzzammil Zaveri, and David Evans, University of Virginia PHP Aspis: Using Partial Taint Tracking to Protect Against Injection Attacks .
    [Show full text]
  • James Reynolds What Is a Ruby on Rails Why Is It So Cool Major Rails Features Web Framework
    Ruby On Rails James Reynolds What is a Ruby on Rails Why is it so cool Major Rails features Web framework Code and tools for web development A webapp skeleton Developers plug in their unique code Platforms Windows Mac OS X Linux Installation Mac OS X 10.5 will include Rails Mac OS X 10.4 includes Ruby Most people reinstall it anyway From scratch Drag and drop Locomotive Databases Mysql Oracle SQLite Firebird PostgreSQL SQL Server DB2 more Webservers Apache w/ FastCGI or Mongrel LightTPD WEBrick "IDE's" TextMate and Terminal (preferred) RadRails jEdit Komodo Arachno Ruby Has "inspired" Grails CakePHP Trails PHP on TRAX Sails MonoRail Catalyst TrimPath Junction Pylons WASP ColdFusion on Wheels And perhaps more... Why is it so cool? Using the right tool for the job y = x^2 vs y = x^0.5 Right tool Rails is the most well thought-out web development framework I've ever used. And that's in a decade of doing web applications for a living. I've built my own frameworks, helped develop the Servlet API, and have created more than a few web servers from scratch. Nobody has done it like this before. James Duncan Davidson, Creator of Tomcat and Ant y = x ^ 2 vs y = x ^ 0.5 Features Features Work Work Typical Rare y = x ^ 2 vs y = x ^ 0.5 Feature ceiling Features Features Work Work This is a no-brainer... Ruby on Rails is a breakthrough in lowering the barriers of entry to programming. Powerful web applications that formerly might have taken weeks or months to develop can be produced in a matter of days.
    [Show full text]
  • Compiling Your Own Perl
    APPENDIX A Compiling Your Own Perl Compiling Perl on a Unix-like system is simple. First, obtain the source for Perl from CPAN (dppl6++_l]j*lanh*knc+on_+NA=@IA*dpih). Then input the following sequence of commands: p]nvtrblanh)1*4*4*p]n*cv _`lanh)1*4*4 od?kjbecqna)`ao i]ga i]gapaop oq`ki]gaejop]hh On most Unix systems, this code will result in your lanh being installed into the +qon+ hk_]h+ directory tree. If you want it installed elsewhere—for example, in the local directory in your home directory—then replace od?kjbecqna)`a with the following: od?kjbecqna)`ao)@lnabet9z+hk_]h+ which should enable you to install Perl on your computer without root access. Note that the )`ao flag uses all the default options for compiling Perl. If you know that you want nonstandard configuration, just use the flag )`a instead to be prompted for your requirements. Be aware that the source for Perl 5.10.0 requires a patch to work properly with Catalyst. This is fixed in subsequent versions of Perl 5.10. If you need to test code guaranteed to run on a wide range of systems, you should con- sider using Perl version 5.8.7. Perl versions greater than 5.8.7 contain features that were not available in earlier versions of Perl, so Perl 5.8.7 is feature complete for all versions of Perl that Catalyst will run on (version 5.8.1 and later). Put another way, versions 5.8.8 and later have new features that you can’t rely on in earlier releases.
    [Show full text]
  • Open Abrown Thesis May2012.Pdf
    The Pennsylvania State University The Graduate School Department of Computer Science and Engineering AN ENGINEERING APPROACH TO PERL AND RUBY OBJECT ORIENTED PROGRAMMING LANGUAGES A Thesis in Computer Science and Engineering by Angeline Brown © 2012 Angeline Brown Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science May 2012 ii The thesis of Angeline Brown was reviewed and approved* by the following: Mahmut Kandemir Professor of Computer Science and Engineering Thesis Advisor Yuan Xie Associate Professor of Computer Science and Engineering Raj Acharya Professor of Computer Science and Engineering Head of the Department of Computer Science and Engineering *Signatures are on file in the Graduate School iii ABSTRACT This study compares two object oriented programming languages, Perl and Ruby. Perl and Ruby are both extensively used scripting languages that are applied in a wide scope of modern software applications. Applications that use Perl are Amazon.com, TicketMaster.com, and Priceline.com. Applications that use Ruby are Twitter.com, YellowPages.com, and LivingSocial.com. The purpose of discussing these languages is two-fold. First, the available quantitative comparison of these languages is limited. This paper provides essential quantitative as well as qualitative analysis that can be used as a tool for future references. Secondly, this work was performed as a trade study for the implementation of a real world database application known as PennData SpecEd Application. PennData SpecEd is used to collect records of special education students from the Commonwealth of Pennsylvania student census. This comparative study focuses first on the performance and ease of programming software components using object oriented features of both Perl and Ruby.
    [Show full text]
  • A Presentation Service for Rapidly Building Interactive Collaborative Web Applications
    A Presentation Service for Rapidly Building Interactive Collaborative Web Applications SCIENTIA MANU E T MENTE A thesis submitted to the School of Computer Science University College University of New South Wales Australian Defence Force Academy for the degree of Doctor of Philosophy By Michael Joseph Sweeney 31 March 2008 c Copyright 2008 by Michael Joseph Sweeney i Certi¯cate of Originality I hereby declare that this submission is my own work and that, to the best of my knowledge and belief, it contains no material previously published or written by another person, nor material which to a substantial extent has been accepted for the award of any other degree or diploma at UNSW or any other educational institution, except where due acknowledgement is made in the thesis. Any contribution made to the research by colleagues, with whom I have worked at UNSW or elsewhere, during my candidature, is fully acknowledged. I also declare that the intellectual content of this thesis is the product of my own work, except to the extent that assistance from others in the project's design and conception or in style, presentation and linguistic expression is acknowledged. Michael Joseph Sweeney ii Abstract Web applications have become a large segment of the software development domain but their rapid rise in popularity has far exceeded the support in software engineer- ing. There are many tools and techniques for web application development, but the developer must still learn and use many complex protocols and languages. Products still closely bind data operations, business logic, and the user interface, limiting integration and interoperability.
    [Show full text]
  • Algorithmic Reflections on Choreography
    ISSN: 1795-6889 www.humantechnology.jyu.fi Volume 12(2), November 2016, 252–288 ALGORITHMIC REFLECTIONS ON CHOREOGRAPHY Pablo Ventura Daniel Bisig Ventura Dance Company Zurich University of the Arts Switzerland Switzerland Abstract: In 1996, Pablo Ventura turned his attention to the choreography software Life Forms to find out whether the then-revolutionary new tool could lead to new possibilities of expression in contemporary dance. During the next 2 decades, he devised choreographic techniques and custom software to create dance works that highlight the operational logic of computers, accompanied by computer-generated dance and media elements. This article provides a firsthand account of how Ventura’s engagement with algorithmic concepts guided and transformed his choreographic practice. The text describes the methods that were developed to create computer-aided dance choreographies. Furthermore, the text illustrates how choreography techniques can be applied to correlate formal and aesthetic aspects of movement, music, and video. Finally, the text emphasizes how Ventura’s interest in the wider conceptual context has led him to explore with choreographic means fundamental issues concerning the characteristics of humans and machines and their increasingly profound interdependencies. Keywords: computer-aided choreography, breaking of aesthetic and bodily habits, human– machine relationships, computer-generated and interactive media. © 2016 Pablo Ventura & Daniel Bisig, and the Agora Center, University of Jyväskylä DOI: http://dx.doi.org/10.17011/ht/urn.201611174656 This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 International License. 252 Algorithmic Reflections on Choreography INTRODUCTION The purpose of this article is to provide a first-hand account of how a thorough artistic engagement with functional and conceptual aspects of software can guide and transform choreographic practice.
    [Show full text]
  • Development of a Competition Web Service for Attitude Estimation Algorithms
    Development of a Competition Web Service for Attitude Estimation Algorithms Sam Osenieks u4677151 Supervised by Dr. Jochen Trumpf November 2013 A thesis submitted in part fulfilment of the degree of Bachelor of Engineering Department of Engineering Australian National University This thesis contains no material which has been accepted for the award of any other degree or diploma in any university. To the best of the author’s knowledge, it contains no material previously published or written by another person, except where due reference is made in the text. Sam Osenieks 1 November 2013 © Sam Osenieks ABSTRACT Attitude estimation algorithms can vary greatly, being based around various sensor measurements which relate to the intended application of an algorithm. As such, it can be difficult to find relevant attitude estimation algorithms to benchmark newly developed methods against, or to find an ideal existing solution for a given application. The goal of this work was to develop a competition web service which would allow researchers and engineers to more easily compare attitude estimation solutions. The system was designed to be robust and secure. It aims to supply a variety of functions and features to aid comparisons, all of which will be built about the concept of a leaderboard where attitude estimation algorithms are ranked against each other for given datasets and quality measures. This paper focuses on the design of such a system, along with a web proof of concept for some important features. i CONTENTS List of Figures ......................................................................................................................................................
    [Show full text]