Management and Performance of APPLE Battery in High Temperature Environment

India's first experimental communication satellite, APPLE, carried a 12 AH Ni-Cd battery for supplying power during eclipse. Failure to deploy one of the two solar panels resulted in the battery operating in a high temperature environment, around 40 C. This also resulted in the battery being used in diurnal cycles rather than just half yearly eclipse seasons. The management and performance of the battery during its life of two years are described. An attempt to identify the probable degradation mechanisms is also made

Novel magnetic properties of graphene: Presence of both ferromagnetic and antiferromagnetic features and other aspects

Investigations of the magnetic properties of graphenes prepared by different methods reveal that dominant ferromagnetic interactions coexist along with antiferromagnetic interactions in all the samples. Thus, all the graphene samples exhibit room-temperature magnetic hysteresis. The magnetic properties depend on the number of layers and the sample area, small values of both favoring larger magnetization. Molecular charge-transfer affects the magnetic properties of graphene, interaction with a donor molecule such as tetrathiafulvalene having greater effect than an electron-withdrawing molecule such as tetracyanoethyleneComment: 16 pges, 5 figure

A New Theory of Lapse-Rate

A new type of vertical motion of air different from penetrative convection is discussed. For small vertical displacements the motion is assumed to be similar to that in long gravitational waves, the volume of an element remaining constant during the displacement. Vertical motion of this type is the result of differences of pressure set up in the vertical direction and the pressures on an element in the other principal directions do not alter during the process of small displacement. As a result of the change in pressure, the molecular energy of the element is altered which results in a change of temperature, and consequently in a lapse-rate

Formation of quasi-free and bubble positronium states in water and aqueous solutions

It is shown that in aqueous solutions a positronium atom is first formed in the quasi-free state, and, after 50-100 ps, becomes localized in a nanobubble. Analysis of the annihilation spectra of NaNO3 aqueous solutions shows that the hydrated electron is not involved in the positronium (Ps) formation

An algebraic formulation of seitz's weak conditions for self timed circuits

technical reportTwo fairly intuitive conditions are given that serve to algebraically characterize Seitz's "weak conditions" for self timed circuits. It is shown that these two conditions embody the 12 temporal logic conditions (developed b y Owicki and Malachi) which are intended to express both the weak conditions as well as certain liveness properties that self timed circuits need to satisfy

Modeling of call - by - need and stream primitives using CCS

technical reportThe semantics of an applicative language are presented using the algebraic primitives introduced in CCS. In particular, the language constructs modeled allow for nondeterminism, stream processing and demand driven (call by need) evaluation

Domain wall dynamics of the Ising chains in a transverse field

We show that the dynamics of an Ising spin chain in a transverse field conserves the number of domains (strings of down spins in an up-spin background) at discrete times. This enables the determination of the eigenfunctions of the time-evolution operator, and the dynamics of initial states with domains. The transverse magnetization is shown to be identically zero in all sectors with a fixed number of domains. For an initial state with a single string of down spins, the local magnetization, the equal-time and double-time spin-spin correlation functions, are calculated analytically as functions of time and the initial string size. The domain size distribution function can be expressed as a simple integral involving Bessel functions.Comment: 4 pages with three figure

Parameterized Algorithms for Graph Partitioning Problems

In parameterized complexity, a problem instance (I, k) consists of an input I and an extra parameter k. The parameter k usually a positive integer indicating the size of the solution or the structure of the input. A computational problem is called fixed-parameter tractable (FPT) if there is an algorithm for the problem with time complexity O(f(k).nc ), where f(k) is a function dependent only on the input parameter k, n is the size of the input and c is a constant. The existence of such an algorithm means that the problem is tractable for fixed values of the parameter. In this thesis, we provide parameterized algorithms for the following NP-hard graph partitioning problems: (i) Matching Cut Problem: In an undirected graph, a matching cut is a partition of vertices into two non-empty sets such that the edges across the sets induce a matching. The matching cut problem is the problem of deciding whether a given graph has a matching cut. The Matching Cut problem is expressible in monadic second-order logic (MSOL). The MSOL formulation, together with Courcelle’s theorem implies linear time solvability on graphs with bounded tree-width. However, this approach leads to a running time of f(||ϕ||, t) · n, where ||ϕ|| is the length of the MSOL formula, t is the tree-width of the graph and n is the number of vertices of the graph. The dependency of f(||ϕ||, t) on ||ϕ|| can be as bad as a tower of exponentials. In this thesis we give a single exponential algorithm for the Matching Cut problem with tree-width alone as the parameter. The running time of the algorithm is 2O(t) · n. This answers an open question posed by Kratsch and Le [Theoretical Computer Science, 2016]. We also show the fixed parameter tractability of the Matching Cut problem when parameterized by neighborhood diversity or other structural parameters. (ii) H-Free Coloring Problems: In an undirected graph G for a fixed graph H, the H-Free q-Coloring problem asks to color the vertices of the graph G using at most q colors such that none of the color classes contain H as an induced subgraph. That is every color class is H-free. This is a generalization of the classical q-Coloring problem, which is to color the vertices of the graph using at most q colors such that no pair of adjacent vertices are of the same color. The H-Free Chromatic Number is the minimum number of colors required to H-free color the graph. For a fixed q, the H-Free q-Coloring problem is expressible in monadic secondorder logic (MSOL). The MSOL formulation leads to an algorithm with time complexity f(||ϕ||, t) · n, where ||ϕ|| is the length of the MSOL formula, t is the tree-width of the graph and n is the number of vertices of the graph. In this thesis we present the following explicit combinatorial algorithms for H-Free Coloring problems: • An O(q O(t r ) · n) time algorithm for the general H-Free q-Coloring problem, where r = |V (H)|. • An O(2t+r log t · n) time algorithm for Kr-Free 2-Coloring problem, where Kr is a complete graph on r vertices. The above implies an O(t O(t r ) · n log t) time algorithm to compute the H-Free Chromatic Number for graphs with tree-width at most t. Therefore H-Free Chromatic Number is FPT with respect to tree-width. We also address a variant of H-Free q-Coloring problem which we call H-(Subgraph)Free q-Coloring problem, which is to color the vertices of the graph such that none of the color classes contain H as a subgraph (need not be induced). We present the following algorithms for H-(Subgraph)Free q-Coloring problems. • An O(q O(t r ) · n) time algorithm for the general H-(Subgraph)Free q-Coloring problem, which leads to an O(t O(t r ) · n log t) time algorithm to compute the H- (Subgraph)Free Chromatic Number for graphs with tree-width at most t. • An O(2O(t 2 ) · n) time algorithm for C4-(Subgraph)Free 2-Coloring, where C4 is a cycle on 4 vertices. • An O(2O(t r−2 ) · n) time algorithm for {Kr\e}-(Subgraph)Free 2-Coloring, where Kr\e is a graph obtained by removing an edge from Kr. • An O(2O((tr2 ) r−2 ) · n) time algorithm for Cr-(Subgraph)Free 2-Coloring problem, where Cr is a cycle of length r. (iii) Happy Coloring Problems: In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. we consider the algorithmic aspects of the following Maximum Happy Edges (k-MHE) problem: given a partially k-colored graph G, find an extended full k-coloring of G such that the number of happy edges are maximized. When we want to maximize the number of happy vertices, the problem is known as Maximum Happy Vertices (k-MHV). We show that both k-MHE and k-MHV admit polynomial-time algorithms for trees. We show that k-MHE admits a kernel of size k + `, where ` is the natural parameter, the number of happy edges. We show the hardness of k-MHE and k-MHV for some special graphs such as split graphs and bipartite graphs. We show that both k-MHE and k-MHV are tractable for graphs with bounded tree-width and graphs with bounded neighborhood diversity. vii In the last part of the thesis we present an algorithm for the Replacement Paths Problem which is defined as follows: Let G (|V (G)| = n and |E(G)| = m) be an undirected graph with positive edge weights. Let PG(s, t) be a shortest s − t path in G. Let l be the number of edges in PG(s, t). The Edge Replacement Path problem is to compute a shortest s − t path in G\{e}, for every edge e in PG(s, t). The Node Replacement Path problem is to compute a shortest s−t path in G\{v}, for every vertex v in PG(s, t). We present an O(TSP T (G) + m + l 2 ) time and O(m + l 2 ) space algorithm for both the problems, where TSP T (G) is the asymptotic time to compute a single source shortest path tree in G. The proposed algorithm is simple and easy to implement