A Theory of the Lifted Temperature Minimum on Calm Clear Nights

Numerous reports from several parts of the world have confirmed that on calm clear nights a minimum in air temperature can occur just above ground, at heights of the order of $\frac{1}{2}$ m or less. This phenomenon, first observed by Ramdas & Atmanathan (1932), carries the associated paradox of an apparently unstable layer that sustains itself for several hours, and has not so far been satisfactorily explained. We formulate here a theory that considers energy balance between radiation, conduction and free or forced convection in humid air, with surface temperature, humidity and wind incorporated into an appropriate mathematical model as parameters. A complete numerical solution of the coupled air-soil problem is used to validate an approach that specifies the surface temperature boundary condition through a cooling rate parameter. Utilizing a flux-emissivity scheme for computing radiative transfer, the model is numerically solved for various values of turbulent friction velocity. It is shown that a lifted minimum is predicted by the model for values of ground emissivity not too close to unity, and for sufficiently low surface cooling rates and eddy transport. Agreement with observation for reasonable values of the parameters is demonstrated. A heuristic argument is offered to show that radiation substantially increases the critical Rayleigh number for convection, thus circumventing or weakening Rayleigh-Benard instability. The model highlights the key role played by two parameters generally ignored in explanations of the phenomenon, namely surface emissivity and soil thermal conductivity, and shows that it is unnecessary to invoke the presence of such particulate constituents as haze to produce a lifted minimum.

Paradox between democracy and security- case study on Pakistan

Pro gradu-tutkielma tutkii demokratian ja turvallisuuden paradoksia Pakistanissa esitellen kuusi tekijää, jotka vaikuttavat kyseiseen paradoksiin. Näitä tekijöitä ovat historiallinen kehitys; eliittihallinto; taloudellinen kehitys; Pakistanin poliittisten tekijöiden demokratian eri määritelmät; opetuksen puuttuminen; ja valtataistelu hallituksen, armeijan, tiedustelupalvelun, oikeusjärjestelmän, poliittisten puolueiden sekä eri heimojen, uskonnollisten ja etnisten ryhmien välillä. Tutkimus tarkastelee myös sitä miten nämä tekijät vaikuttavat demokratian kehitykseen Pakistanissa. Keskeinen argumentti on, että länsimainen demokratia ei esiinny eikä toimi Pakistanissa vallitsevissa oloissa, etenkin historiallisen kehityksen ja ulkoisen turvallisuuden takia. Pro gradu-tutkielma käyttää sekundäärisiä lähteitä, kuten kirjoja, artikkeleita, maaraportteja, kommentaareja sekä omiin kokemuksiin perustuvia havaintoja Pakistanin matkalta 2010-2011. Keskeiset teoriat gradussa ovat Guillermo O’ Donnelin delegaattidemokratia sekä Duncan McCargon eliittihallintoteoria, jotka yhdessä selittävät historiallista kehitystä ja eliittihallinnon dynamiikkaa, mitkä johtavat paradoksiin. Kautta historian armeija on hallinnut Pakistania, ja siviilihallinto on ainoastaan neljä kertaa onnistunut olemaan vallassa, mutta silloinkin siviilihallinto päättyi korruptioväitteisiin tai armeijan vallankaappaukseen. Armeijahallinnoille on luonteenomaista hyvät suhteet USA:n, positiivinen taloudellinen kehitys ja vakaus, kun taas siviilihallinnot ovat epävakaita ja korruptoituneita. Tämä kehitys on paradoksin tausta, joka rakentuu turvallisuuspoliittisen tilanteen pohjalle eli hallitusten ja muiden tekijöiden yritykseen löytää vastapaino Intian uhalle. Tämä on ollut keskeinen huoli kelle tahansa poliittiselle päättäjälle itsenäisyydestä lähtien. Loputon valtataistelu eri poliittisten tekijöiden kesken sekä eliittihallinto pitävät yllä paradoksia, koska eliitit ovat kiinnostuneempia oman valtansa säilyttämisestä kuin kansan tahdon huomioonottamisesta. Koska valtaosa ihmisistä ei ole koulutettuja, he ovat paljolti kiinnostuneita omasta selviytymisestään, ja tämän takia sekä kansa että eliitit suosivat armeijahallintoa, koska se tuo vakautta ja taloudellista kehitystä. Sen vuoksi vallitsevissa oloissa demokratian tulevaisuus Pakistanissa näyttää huonolta, koska liberaalidemokratian vaatimukset eivät täyty puoliksi vapaan oikeussysteemin, puoliksi vapaan lehdistön, valtavan korruption ja monien ihmisoikeusloukkauksien takia unohtamatta armeijan ja tiedustelupalvelun sekaantumista siviilihallintoon.

Misalignment as a Therapeutic Resource

The article reports conversation analysis of a single cognitive psychotherapy session in which an interactional misalignment between the therapist and the patient emerges, culminates, and is mitigated. Through this case study, the interactional practices lead- ing to a rupture in therapeutic alliance and the practices leading to its mending are explored. In the session the therapist pursues investigative orientation in relation to the patient’s experience under discussion, whereas the patient maintains orientation to “troubles-telling.” The diverging projects of the participants amount to overt misalign- ment. Eventually, the therapist brings the relationship of the patient and herself as a topic of conversation in ways which turn the misalignment into a resource of therapeu- tic work. The microanalysis of actual interactional patterns in this single case is linked to discussions of therapeutic alliance in psychotherapeutic literature.

Solvation dynamics, energy distribution and trapping of a light solute ion

In the theoretical treatments of the dynamics of solvation of a newly created ion in a dipolar solvent, the self-motion of the solute is usually ignored. Recently, it has been shown that for a light ion the translational motion of the ion can significantly enhance its own rate of solvation. Therefore, solvation itself may not be the rate determining step in the equilibration. Instead, the rate determining step is the search of the low energy configuration which serves to localize the light ion. In this article a microscopic calculation of the probability distribution of the interaction energy of the nascent charge with the dipolar solvent molecules is presented in order to address this problem of solute trapping. It is found that to a good approximation, this distribution is Gaussian and the second moment of this distribution is exactly equal to the half of its own solvation energy. It is shown that this is in excellent agreement with the simulation results that are available for the model Brownian dipolar lattice and for liquid acetonitrile. If the distortion of the solvent by the ion is negligible then the same relation gives the energy distribution for the solvated ion, with the average centered at the final equilibrium solvation energy. These results are expected to be useful in understanding various chemical processes in dipolar liquids. Another interesting outcome of the present study is a simple dynamic argument that supports Onsager's ''inverse snow-ball'' conjecture of solvation of a light ion. A simple derivation of the semi-phenomenological relation between the solvation time correlation function and the single particle orientation, reported recently by Maroncelli et al. (J. Phys. Chem. 97 (1993) 13), is also presented.

Geographic Resources Decision Support System – an Open Source GIS

Fully structured and matured open source spatial and temporal analysis technology seems to be the official carrier of the future for planning of the natural resources especially in the developing nations. This technology has gained enormous momentum because of technical superiority, affordability and ability to join expertise from all sections of the society. Sustainable development of a region depends on the integrated planning approaches adopted in decision making which requires timely and accurate spatial data. With the increased developmental programmes, the need for appropriate decision support system has increased in order to analyse and visualise the decisions associated with spatial and temporal aspects of natural resources. In this regard Geographic Information System (GIS) along with remote sensing data support the applications that involve spatial and temporal analysis on digital thematic maps and the remotely sensed images. Open source GIS would help in wide scale applications involving decisions at various hierarchical levels (for example from village panchayat to planning commission) on economic viability, social acceptance apart from technical feasibility. GRASS (Geographic Resources Analysis Support System, http://wgbis.ces.iisc.ernet.in/grass) is an open source GIS that works on Linux platform (freeware), but most of the applications are in command line argument, necessitating a user friendly and cost effective graphical user interface (GUI). Keeping these aspects in mind, Geographic Resources Decision Support System (GRDSS) has been developed with functionality such as raster, topological vector, image processing, statistical analysis, geographical analysis, graphics production, etc. This operates through a GUI developed in Tcltk (Tool command language / Tool kit) under Linux as well as with a shell in X-Windows. GRDSS include options such as Import /Export of different data formats, Display, Digital Image processing, Map editing, Raster Analysis, Vector Analysis, Point Analysis, Spatial Query, which are required for regional planning such as watershed Analysis, Landscape Analysis etc. This is customised to Indian context with an option to extract individual band from the IRS (Indian Remote Sensing Satellites) data, which is in BIL (Band Interleaved by Lines) format. The integration of PostgreSQL (a freeware) in GRDSS aids as an efficient database management system.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

A dynamic topology management in a hybrid wireless superstore network

with the development of large scale wireless networks, there has been short comings and limitations in traditional network topology management systems. In this paper, an adaptive algorithm is proposed to maintain topology of hybrid wireless superstore network by considering the transactions and individual network load. The adaptations include to choose the best network connection for the response, and to perform network Connection switching when network situation changes. At the same time, in terms of the design for topology management systems, aiming at intelligence, real-time, the study makes a step-by-step argument and research on the overall topology management scheme. Architecture for the adaptive topology management of hybrid wireless networking resources is available to user’s mobile device. Simulation results describes that the new scheme has outperformed the original topology management and it is simpler than the original rate borrowing scheme.

Yielding and large deviations in micellar gels: a model

We present a simple model that can be used to account for the rheological behaviour observed in recent experiments on micellar gels. The model combines attachment detachment kinetics with stretching due to shear, and shows well-defined jammed and flowing states. The large-deviation function (LDF) for the coarse-grained velocity becomes increasingly non-quadratic as the applied force F is increased, in a range near the yield threshold. The power fluctuations are found to obey a steady-state fluctuation relation (FR) at small F. However, the FR is violated when F is near the transition from the flowing to the jammed state although the LDF still exists; the antisymmetric part of the LDF is found to be nonlinear in its argument. Our approach suggests that large fluctuations and motion in a direction opposite to an imposed force are likely to occur in a wider class of systems near yielding.

A Nearly Exact Reformulation of the Girsanov Linearization for Stochastically Driven Nonlinear Oscillators

The Girsanov linearization method (GLM), proposed earlier in Saha, N., and Roy, D., 2007, ``The Girsanov Linearisation Method for Stochastically Driven Nonlinear Oscillators,'' J. Appl. Mech., 74, pp. 885-897, is reformulated to arrive at a nearly exact, semianalytical, weak and explicit scheme for nonlinear mechanical oscillators under additive stochastic excitations. At the heart of the reformulated linearization is a temporally localized rejection sampling strategy that, combined with a resampling scheme, enables selecting from and appropriately modifying an ensemble of locally linearized trajectories while weakly applying the Girsanov correction (the Radon-Nikodym derivative) for the linearization errors. The semianalyticity is due to an explicit linearization of the nonlinear drift terms and it plays a crucial role in keeping the Radon-Nikodym derivative ``nearly bounded'' above by the inverse of the linearization time step (which means that only a subset of linearized trajectories with low, yet finite, probability exceeds this bound). Drift linearization is conveniently accomplished via the first few (lower order) terms in the associated stochastic (Ito) Taylor expansion to exclude (multiple) stochastic integrals from the numerical treatment. Similarly, the Radon-Nikodym derivative, which is a strictly positive, exponential (super-) martingale, is converted to a canonical form and evaluated over each time step without directly computing the stochastic integrals appearing in its argument. Through their numeric implementations for a few low-dimensional nonlinear oscillators, the proposed variants of the scheme, presently referred to as the Girsanov corrected linearization method (GCLM), are shown to exhibit remarkably higher numerical accuracy over a much larger range of the time step size than is possible with the local drift-linearization schemes on their own.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

PROPER HOLOMORPHIC MAPS BETWEEN BOUNDED SYMMETRIC DOMAINS REVISITED

We prove that a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the various special cases in which this result is known. We discuss an application of these methods to domains having noncompact automorphism groups that are not assumed to act transitively.

Reply to ``Comment on `Strongly magnetized cold degenerate electron gas: Mass-radius relation of the magnetized white dwarf'''

We show that the upper bound for the central magnetic field of a super-Chandrasekhar white dwarf calculated by Nityananda and Konar Phys. Rev. D 89, 103017 (2014)] and in the concerned comment, by the same authors, against our work U. Das and B. Mukhopadhyay, Phys. Rev. D 86, 042001 (2012)] is erroneous. This in turn strengthens the argument in favor of the stability of the recently proposed magnetized super-Chandrasekhar white dwarfs. We also point out several other numerical errors in their work. Overall we conclude that the arguments put forth by Nityananda and Konar are misleading.

Anomalous transport at weak coupling

We evaluate the contribution of chiral fermions in d = 2, 4, 6, chiral bosons, a chiral gravitino like theory in d = 2 and chiral gravitinos in d = 6 to all the leading parity odd transport coefficients at one loop. This is done by using finite temperature field theory to evaluate the relevant Kubo formulae. For chiral fermions and chiral bosons the relation between the parity odd transport coefficient and the microscopic anomalies including gravitational anomalies agree with that found by using the general methods of hydrodynamics and the argument involving the consistency of the Euclidean vacuum. For the gravitino like theory in d = 2 and chiral gravitinos in d = 6, we show that relation between the pure gravitational anomaly and parity odd transport breaks down. From the perturbative calculation we clearly identify the terms that contribute to the anomaly polynomial, but not to the transport coefficient for gravitinos. We also develop a simple method for evaluating the angular integrals in the one loop diagrams involved in the Kubo formulae. Finally we show that charge diffusion mode of an ideal 2 dimensional Weyl gas in the presence of a finite chemical potential acquires a speed, which is equal to half the speed of light.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.