Book Chapters
http://hdl.handle.net/10453/17
20150529T07:31:04Z

SIESTA: Properties and Applications
http://hdl.handle.net/10453/30787
SIESTA: Properties and Applications
Ford, MJ
In this chapter a number of these properties are discussed through examples relevant to nanoscience and technology. The SIESTA methodology in detail in Chapter 2; the present chapter is intended as an accompaniment. The first three examples illustrate the general capabilities of the SIESTA code for problems containing relatively small numbers of atoms and that are amenable to standard diagonalization to solve the selfconsistent problem. The last example illustrates the divideandconquer linearscaling capabilities to tackle problems containing large numbers of atoms. © 2011 John Wiley & Sons, Inc.
20110705T00:00:00Z

Chapter 20 NFMIC Simulator
http://hdl.handle.net/10453/17734
Chapter 20 NFMIC Simulator
Masihpour, M; Agbinya, JI
Agbinya, J
Since simulating the wireless networks, using codes and socalled computer language is a challenging task and requires a lot of time and effort, a graphical user interface is developed by the authors, which enables the user to simulate different scenarios for an NFMIC system. This program evaluates NFMIClink budget, based on AgbinyaMasiilpour channel model, using MATLAB software.
20110101T00:00:00Z

Chapter 16 Magneto  Inductive Waveguide Devices
http://hdl.handle.net/10453/17735
Chapter 16 Magneto  Inductive Waveguide Devices
Masihpour, M; Agbinya, JI
Agbinya, J
the previous chapters we have introduced the concepts of magnetoinductive waves and showed that unless they are terminated properly, there will be signal reflections in the waveguide. In this chapter, we show how the presence the power reflections is used to advantage in creating MI devices.
20110101T00:00:00Z

Predicate transformer semantics of quantum programs
http://hdl.handle.net/10453/12965
Predicate transformer semantics of quantum programs
Ying, M; Duan, R; Feng, Y
This chapter presents a systematic exposition of predicate transformer semantics for quantum programs. It is divided into two parts: The first part reviews the state transformer (forward) semantics of quantum programs according to Selinger’s suggestion of representing quantum programs by superoperators and elucidates D’HondtPanangaden’s theory of quantum weakest preconditions in detail. In the second part, we develop a quite complete predicate transformer semantics of quantum programs based on Birkhoff–von Neumann quantum logic by considering only quantum predicates expressed by projection operators. In particular, the universal conjunctivity and termination law of quantum programs are proved, and Hoare’s induction rule is established in the quantum setting.
20130101T00:00:00Z