Motional Averaging of Electric Field Gradients. Temperature Dependence of Nqr in Sodium Chlorate and Copper Chlorate

Es wird die Temperaturabhiingigkeit der CI35-Kernquadrupolresonanz in Natriumchlorat und Kupferchlorat im Temperature von 77 bis 300 °K untersucht. Es wird gezeigt, daß die Annahmen, die in der Theorie von Bayer gemacht werden, fur Chlorate gelten. Die Frequenz der Torsionsschwingungen der ClO3-Gruppe wird folglich mit dieser Theorie berechnet. Der berechnete Wert der Torsionsfrequenz stimmt gut mit vorhandenen Werten der Ramanspektroskopie überein.

Study of synchronously mode-locked and internally frequency-doubledcw dye laser

The analysis of the characteristics of a synchronously mode-locked and internally frequency-doubled dye laser is presented. Dependence of dye laser pulse characteristics on the cavity length mismatch of the pump laser and dye laser is studied. Variation of the minimum pulsewidth with intracavity bandwidth and the harmonic conversion efficiency is presented in the form of graphs.

Algorithms for Constructing Hierarchical Graphs

An algorithm is described for developing a hierarchy among a set of elements having certain precedence relations. This algorithm, which is based on tracing a path through the graph, is easily implemented by a computer.

Dependence Logic: Investigations into Higher-Order Semantics Defined on Teams

This thesis is a study of a rather new logic called dependence logic and its closure under classical negation, team logic. In this thesis, dependence logic is investigated from several aspects. Some rules are presented for quantifier swapping in dependence logic and team logic. Such rules are among the basic tools one must be familiar with in order to gain the required intuition for using the logic for practical purposes. The thesis compares Ehrenfeucht-Fraïssé (EF) games of first order logic and dependence logic and defines a third EF game that characterises a mixed case where first order formulas are measured in the formula rank of dependence logic. The thesis contains detailed proofs of several translations between dependence logic, team logic, second order logic and its existential fragment. Translations are useful for showing relationships between the expressive powers of logics. Also, by inspecting the form of the translated formulas, one can see how an aspect of one logic can be expressed in the other logic. The thesis makes preliminary investigations into proof theory of dependence logic. Attempts focus on finding a complete proof system for a modest yet nontrivial fragment of dependence logic. A key problem is identified and addressed in adapting a known proof system of classical propositional logic to become a proof system for the fragment, namely that the rule of contraction is needed but is unsound in its unrestricted form. A proof system is suggested for the fragment and its completeness conjectured. Finally, the thesis investigates the very foundation of dependence logic. An alternative semantics called 1-semantics is suggested for the syntax of dependence logic. There are several key differences between 1-semantics and other semantics of dependence logic. 1-semantics is derived from first order semantics by a natural type shift. Therefore 1-semantics reflects an established semantics in a coherent manner. Negation in 1-semantics is a semantic operation and satisfies the law of excluded middle. A translation is provided from unrestricted formulas of existential second order logic into 1-semantics. Also game theoretic semantics are considerd in the light of 1-semantics.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Nature of dependence of spin-orbit splittings on atomic number

It has been shown that Dirac equation employing a constant value of the screening constant Z0 does not explain the variation of spin-orbit splittings of 2p and 3p levels with atomic number Z. A model which takes into account the variation of Z0 withZ is shown to satisfactorily predict the dependence of spinorbit splittings onZ.

Temperature dependence of 35Cl NQR in 3,4-Dichlorophenol

NQR frequencies in 3,4-dichlorophenol are investigated in the temperature range 77 K to room temperature. Two resonances have been observed throughout the temperature range, corresponding to the two chemically inequivalent chlorine sites. Using Bayer's theory and Brown's method torsional frequencies and their temperature dependence in this range are estimated.

Temperature-dependence of 35Cl N.Q.R. in sodium chloroacetate

N.q.r. in sodium chloroacetate has been investigated at temperatures from 77 K to room temperature (c.300 K). A single line has been observed throughout this temperature range. Torsional frequencies of the molecule have been calculated in the above temperature range from Bayer's theory. Also the temperature coefficient of the torsional frequencies has been calculated by Brown's method.

Temperature dependence of chlorine NQR in 2-chloro 5-nitrobenzoic acid and 4-chloro 3-nitrobenzoic acid

Temperature dependence of chlorine nuclear quadrupole resonance in 2-chloro 5-nitrobenzoic acid and 4-chloro 3-nitrobenzoic acid has been investigated in the region 77° K to room temperature. No phase transition has been observed. The results are analysed to obtain the torsional frequencies and their temperature dependence. A nonlinear temperature dependence is obtained for the torsional frequencies.

Dependence of pH and surfactant effect in the synthesis of magnetite(Fe3O4) nanoparticles and its properties

Nanoparticles of Fe3O4 were synthesized by co-precipitation in an aqueous solution containing ferrous and ferric salts (1:2) at varying pH with ammonia as a base. It was found that the value of pH influences the reaction mechanism for the formation of Fe3O4. Furthermore, the addition of mercaptoethanol significantly reduced the crystalline size of Fe3O4 nanoparticles from 15.03 to 8.02 nm. X-ray diffraction (XRD) spectra revealed that the synthesized nanoparticles were epsilon-Fe2O3 or Fe3O4 phase. To further prove the composition of the product, as-prepared Fe3O4 were examined by X-rayphotoelectron spectroscopy (XPS). Magnetic properties of the obtained particles were determined by vibrating sample magnetometer (VSM). Further analysis of the X-ray studies shows that while maintaining a pH value of 6 and 9 in a solution containing iron salts II and III ions produces epsilon-Fe2O3. Whereas a pH value of 11 produces magnetite (Fe3O4) phase. All of these results show that the pH has a major role in the observed phase formation of (Fe3O4) nanoparticles.

Distance dependence of fluorescence resonance energy transfer

Deviations from the usual R (-6) dependence of the rate of fluorescence resonance energy transfer (FRET) on the distance between the donor and the acceptor have been a common scenario in the recent times. In this paper, we present a critical analysis of the distance dependence of FRET, and try to illustrate the non R (-6) type behaviour of the rate for the case of transfer from a localized electronic excitation on the donor, a dye molecule to three different energy acceptors with delocalized electronic excitations namely, graphene,two-dimensional semiconducting sheet and the case of such a semiconducting sheet rolled to obtain a nanotube. We use simple analytic models to understand the distance dependence in each case.

The composition dependence of electrical switching behavior of Ge7Se93-xSbx glasses

Bulk Ge7Se93-xSbx (21 <= x <= 32) glasses are prepared by melt quenching method and electrical switching studies have been undertaken on these samples to elucidate the type of switching and the composition and thickness dependence of switching voltages. On the basis of the compressibility and atomic radii, it has been previously observed that Se-based glasses exhibit memory switching behavior. However, the present results indicate that Ge7Se93-xSbx glasses exhibit threshold type electrical switching with high switching voltages. Further, these samples are found to show fluctuations in the current-voltage (I-V) characteristics. The observed threshold behavior of Ge7Se93-xSbx glasses has been understood on the basis of larger atomic radii and lesser compressibilities of Sb and Ge. Further. the high switching voltages and fluctuations in the I-V characteristics of Ge-Se-Sb samples can be attributed to the high resistance of the samples and the difference in thermal conductivities of different structural units constituting the local structure of these glasses. The switching voltages of Ge7Se93-xSbx glasses have been found to decrease with the increase in the Sb concentration. The observed composition dependence of switching voltages has been understood on the basis of higher metallicity of the Sb additive and also in the light of the Chemically Ordered Network (CON) model. Further, the thickness dependence of switching voltages has been studied to reassert the mechanism of switching.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.