Dynamical Casimir effect and the structure of vacuum in quantum field theory

Some of the most interesting phenomena that arise from the developments of the modern physics are surely vacuum fluctuations. They appear in different branches of physics, such as Quantum Field Theory, Cosmology, Condensed Matter Physics, Atomic and Molecular Physics, and also in Mathematical Physics. One of the most important of these vacuum fluctuations, sometimes called "zero-point energy", as well as one of the easiest quantum effect to detect, is the so-called Casimir effect. The purposes of this thesis are: - To propose a simple retarded approach for dynamical Casimir effect, thus a description of this vacuum effect when we have moving boundaries. - To describe the behaviour of the force acting on a boundary, due to its self-interaction with the vacuum.

A Mathematical Representation of "Excitement" in Games: A Contribution to the Theory of Game Systems

Researchers have long believed the concept of "excitement" in games to be subjective and difficult to measure. This paper presents the development of a mathematically computable index that measures the concept from the viewpoint of an audience and from that of a player. One of the key aspects of the index is the differential of the probability of "winning" before and after one specific "play" in a given game. The index makes a large contribution to the study of games and enables researchers to compare and analyze the “excitement” of various games. It may be applied in many fields, especially the area of welfare economics, and applications may range from those related to allocative efficiency to axioms of justice and equity.

Student identities in a mathematical community of practice : radical visible pedagogy and the teacher collective

This study investigated the practices of two teachers in a school that was successful in enabling the mathematical learning of students in Years 1 and 2, including those from backgrounds associated with low mathematical achievement. The study explained how the practices of the teachers constituted a radical visible pedagogy that enabled equitable outcomes. The study also showed that teachers’ practices have collective power to shape students’ mathematical identities. The role of the principal in the school was pivotal because she structured curriculum delivery so that students experienced the distinct practices of both teachers.

Aspects of tautomerism 12-Some causes and consequences of participation in the solvolysis of acid chlorides

Solvolysis of nine representative half ester acid chlorides in aqueous acetone have been studied. Isomers solvolyse at distinctly different rates and furnish the original acids. Contrary to the well accepted views, no evidence for tautomerism or isomerism between the isomeric pairs of acid chlorides could be detected. In a number of cases alkoxy group participates in the solvolysis of neighbouring acid chlorides. This results in (a) rate enhancement and (b) partial or total shift of the reaction pattern from SN2 to SN1. Isomeric half ester acid chlorides, in the presence of a sufficiently strong Lewis acid, could give the same oxonium salt. Rearrangements observed in the reactions of unsymmetrical 1,2- and 1,3-dicarboxylic acid derivatives could be ascribed to the prior formation of common oxonium salt intermediates in the presence of Lewis acids.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Eyes on their fingertips: some aspects of the arts, science, technology and culture of the fisherfolk of Trivandrum, India

Eyes on Their Finger Tips deals with the traditional marine wisdom of a set of people and the rarest of rare experiences they have had at sea. Through these numerous chapters he takes us into the seas of the fishers. It is a voyage which we cannot make in reality. But through the heroic deeds of his father, the riddles of oldman Sebesti, the shark story of brother Kamalappan, and the rituals of his mother, we get a fascinating peep into the wisdom of the watery world of the small-scale fishers of Trivandrum, Kerala, India.

Aspects of the in vitro bioactivity and antimicrobial properties of Ag+- and Zn2+-exchanged 11 Å tobermorites

11 Å tobermorite, Ca5Si6O16(OH)2 · 4H2O, is a layer lattice ion exchange mineral whose potential as a carrier for Ag+ and Zn2+ ions in antimicrobial, bioactive formulations has not yet been explored. In view of this, the in vitro bioactivity of Ag+- and Zn2+-exchanged 11 Å tobermorites and their bactericidal action against S. aureus and P.aeruginosa are reported. The in vitro bioactivity of the synthetic unsubstituted tobermorite phase was confirmed by the formation of bone-like hydroxycarbonate apatite (HCA) on its surface within 48 h of contact with simulated body fluid. The substitution of labile Ag+ ions into the tobermorite lattice delayed the onset of HCA-formation to 72 h; whereas, the Zn2+-substituted phase failed to elicit an HCA-layer within 14 days. Both Ag+- and Zn2+-exchanged tobermorite phases were found to exhibit marked antimicrobial action against S. aureus and P.aeruginosa, two common pathogens in biomaterial-centred infections.

Analysis of multiple aspects of a repeated signal: power and rate of rapping during shell fights in hermit crabs

Repeated activities used by animals during contests are assumed to act as signals advertising the quality of the sender. However, their exact functions are not well understood and observations fit only a limited set of the predictions made by models of signaling systems. Experimental studies of contest behavior tend to focus on analysis of the rate of signaling, but individual performances may also vary in magnitude. Both of these features can vary between outcomes and within contests. We examined changes in the rate and power of shell rapping during shell fights in hermit crabs. We show that both rate and power decline during the course of the encounter and that the duration of pauses between bouts of shell rapping increases with an index of the total effort put into each bout. This supports the idea that the vigor of shell rapping is regulated by fatigue and could therefore act as a signal of stamina. By examining different interacting components of this complex activity, we gain greater insight into its function than would be achieved by investigating a single aspect in isolation.

The decoupling approach to quantum information theory

La théorie de l'information quantique étudie les limites fondamentales qu'imposent les lois de la physique sur les tâches de traitement de données comme la compression et la transmission de données sur un canal bruité. Cette thèse présente des techniques générales permettant de résoudre plusieurs problèmes fondamentaux de la théorie de l'information quantique dans un seul et même cadre. Le théorème central de cette thèse énonce l'existence d'un protocole permettant de transmettre des données quantiques que le receveur connaît déjà partiellement à l'aide d'une seule utilisation d'un canal quantique bruité. Ce théorème a de plus comme corollaires immédiats plusieurs théorèmes centraux de la théorie de l'information quantique. Les chapitres suivants utilisent ce théorème pour prouver l'existence de nouveaux protocoles pour deux autres types de canaux quantiques, soit les canaux de diffusion quantiques et les canaux quantiques avec information supplémentaire fournie au transmetteur. Ces protocoles traitent aussi de la transmission de données quantiques partiellement connues du receveur à l'aide d'une seule utilisation du canal, et ont comme corollaires des versions asymptotiques avec et sans intrication auxiliaire. Les versions asymptotiques avec intrication auxiliaire peuvent, dans les deux cas, être considérées comme des versions quantiques des meilleurs théorèmes de codage connus pour les versions classiques de ces problèmes. Le dernier chapitre traite d'un phénomène purement quantique appelé verrouillage: il est possible d'encoder un message classique dans un état quantique de sorte qu'en lui enlevant un sous-système de taille logarithmique par rapport à sa taille totale, on puisse s'assurer qu'aucune mesure ne puisse avoir de corrélation significative avec le message. Le message se trouve donc «verrouillé» par une clé de taille logarithmique. Cette thèse présente le premier protocole de verrouillage dont le critère de succès est que la distance trace entre la distribution jointe du message et du résultat de la mesure et le produit de leur marginales soit suffisamment petite.