If you have good software skills and are still looking for a summer internship, check out the 2014 Google Summer of Code program. You can earn $5500 by coding for an open source software project this summer. You will probably work remotely, but in close collaboration with a mentor at one of over 100 participating organizations. To maximize your chances, explore the organizations and find one that needs your skills. Details here; apply by Friday, March 21.

If you have good software skills and are still looking for a summer internship, check out the 2014 Google Summer of Code program. You can earn $5500 by coding for an open source software project this summer. You will probably work remotely, but in close collaboration with a mentor at one of over 100 participating organizations. To maximize your chances, explore the organizations and find one that needs your skills. Details here; apply by Friday, March 21.

New cars will soon come with high-bandwidth connections and app stores.

Starting next month, many car buyers will be getting a novel feature: Internet connections with speeds similar to those on the fastest smartphones—and even a few early dashboard-based apps, engineered to be as dumbed-down as possible.

In this article we're going to have a look at Moboom, a platform for creating responsive web designs for desktop, tablet and mobile devices.

Jasmine 2.0's new done() method replaces the runs() and waitsFor() methods of earlier versions to make it more similar to other testing frameworks. Rob Gravelle shows how to use Jasmine 2.0's done() method to test DOM events without polluting the test subject page with test code.

In an earlier article we looked at setting up the Genesis framework and the Genesis sample. In this article we delve deeper into the process by using the Generate theme.

PhD Dissertation Defense

Amplified Quantum Transforms

David J. Cornwell

10:00am-12:00pm, 26 March 2014, ITE346

In this work we investigate a new quantum algorithm called the Amplified Quantum Fourier Transform (Amplified-QFT) to solve the Local Period Problem where there is an Oracle with a periodic subset and we wish to recover its period. This algorithm uses parts of the famous Grover’s quantum search algorithm to amplify the amplitudes on the subset, followed by the equally famous Shor’s quantum algorithm for recovering the period. We compare the Amplified-QFT algorithm against the Quantum Fourier Transform (QFT) and Quantum Hidden Subgroup (QHS) algorithms and calculate the probabilities of success for all three algorithms. We show that the Amplified-QFT algorithm is on average, quadratically faster than either the QFT or QHS algorithms. We also investigate two more general settings: a) where the QFT is replaced by a general unitary operator U in the Amplified-QFT algorithm and b) where Grover’s algorithm is replaced by a general amplification procedure in the Amplified-QFT algorithm.

We also investigate this algorithm when a random Error Stream affects the Oracle, which involves calculating expectations and variances over a random set. We calculate the probabilities of success in this case. Further, we find an Uncertainty Principle for the Amplified-QFT algorithm. We also identify a decision problem, the Constant or Balanced Signal Decision Problem, which can be solved by using the one dimensional Amplified Haar Wavelet Transform. This decision problem is a generalization of the Deutsch-Josza problem.

Committee: Drs. S. Lomonaco (CSEE), Chair and advisor; T. Armstrong (Math), Co-advisor and Reader; Dr. Y. Shih (Physics), Reader; Dr. F. Potra (Math) and Dr. M. Gowda (Math)

PhD Dissertation Defense

Amplified Quantum Transforms

David J. Cornwell

10:00am-12:00pm, 26 March 2014, ITE346

In this work we investigate a new quantum algorithm called the Amplified Quantum Fourier Transform (Amplified-QFT) to solve the Local Period Problem where there is an Oracle with a periodic subset and we wish to recover its period. This algorithm uses parts of the famous Grover’s quantum search algorithm to amplify the amplitudes on the subset, followed by the equally famous Shor’s quantum algorithm for recovering the period. We compare the Amplified-QFT algorithm against the Quantum Fourier Transform (QFT) and Quantum Hidden Subgroup (QHS) algorithms and calculate the probabilities of success for all three algorithms. We show that the Amplified-QFT algorithm is on average, quadratically faster than either the QFT or QHS algorithms. We also investigate two more general settings: a) where the QFT is replaced by a general unitary operator U in the Amplified-QFT algorithm and b) where Grover’s algorithm is replaced by a general amplification procedure in the Amplified-QFT algorithm.

We also investigate this algorithm when a random Error Stream affects the Oracle, which involves calculating expectations and variances over a random set. We calculate the probabilities of success in this case. Further, we find an Uncertainty Principle for the Amplified-QFT algorithm. We also identify a decision problem, the Constant or Balanced Signal Decision Problem, which can be solved by using the one dimensional Amplified Haar Wavelet Transform. This decision problem is a generalization of the Deutsch-Josza problem.

Committee: Drs. S. Lomonaco (CSEE), Chair and advisor; T. Armstrong (Math), Co-advisor and Reader; Dr. Y. Shih (Physics), Reader; Dr. F. Potra (Math) and Dr. M. Gowda (Math)