Mooij correlation in disordered metals

We point out that the Mooij correlation follows naturally from a dynamically disordered tight-binding Hamiltonian with random modulations of both the diagonal and the off-diagonal matrix elements which are known to act in opposition. The dynamic disorder is treated exactly while the static disorder is incorporated approximately as an effective additional time-dependent disorder affecting the diffusive electron. Such a time translation of static disorder is known to manifest itself in certain limits as a renormalization of the diffusion coefficient. The calculated conductivity exhibits the Mooij correlation at high temperatures, where quantum coherence associated with the static disorder can be ignored.

“Aivan sama vaikkei ne olis edes pelannut” – Jalkapallo elämyskulutuksen kohteena

Tutkielmassa tarkastellaan jalkapallon seuraamista elämyskuluttamisen näkökulmasta. Elämyskulutuksella tarkoitetaan tässä yhteydessä tapahtumia ja hetkiä, jolloin ihminen kokee tavallisuudesta poikkeavan ja mieleenpainuvan tunnetilan. Elämyksiä tarjoavat palvelut ovat lisänneet jatkuvasti suosiotaan, kun arjessa rationaalisuus ylikorostuu ja sille halutaan vastapainoa. Aihetta taustoitetaan elämysyhteiskunnan, yhteisöllisyyden ja kuluttajaheimojen käsitteiden avulla. Erityishuomion saavat kulttuuritapahtumat elämystuotteina, penkkiurheilu yhteiskunnallisena ilmiönä sekä erilaiset jalkapalloon liittyvät kulutustavat. Tutkielma on luonteeltaan fenomenologis-etnografinen kuvaileva tutkimus. Tutkimusmenetelminä on käytetty osallistuvaa havainnointia ja haastatteluita. Tutkimusperinteen mukaisesti ilmiön ymmärtäminen, kuvaaminen ja kirjoittaminen ovat tärkeässä osassa. Havainnointiaineisto on kerätty kolmessa eri tapahtumassa seuraamalla katsojien käyttäytymistä ja tunnelman syntymiseen vaikuttavia tekijöitä. Haastateltavat on valittu harkinnanvaraisesti jalkapalloa aktiivisesti seuraavista henkilöistä ja menetelmänä on käytetty avoimia teemahaastatteluita. Urheilun vetovoima ajanvietteenä perustuu vahvojen tunteiden herättämiseen, joten penkkiurheilu on elämyskulutusta puhtaimmillaan. Urheilu elämystuotteena on oivallinen, sillä sen lukuisten kulutustapojen lisäksi tapahtumat muodostavat päättymättömän jatkumon. Myös oman aineistoni perusteella osoittautui, että menneiden tapahtumien avulla ankkuroidutaan yhteisöön ja tulevien tapahtumien avulla pidetään innostusta yllä. Pettymysten hetkelläkään koukusta ei haluta irti, sillä jokainen kokemus lisää tunteita omaa urheilulajia ja yhteisöä kohtaan. Urheilutapahtumissa katsojan elämys syntyy subjektiivisen kokemuksen kautta, mutta yhteisö luo elämyksen toteutumisen välttämättömät edellytykset. Jalkapalloyleisöön kuuluvissa henkilöissä yhdistyvät halu kuulua ryhmään ja olla samaan aikaan sen ulkopuolella. Peliä voidaan tarkkailla itsekseen ja keskittyneesti suuren joukon keskellä tai hurrata muiden mukana. Aineistoni perusteella jalkapallofanin innostus pulppuaa kahdesta lähteestä: yhteisöllisyydestä ja kiinnostuksesta lajiin. Yhteisöllisyyden tunne syntyy kuulumisesta globaaliin jalkapalloyhteisöön, oman suosikkijoukkueen kannattajiin ja samaa lajia seuraavien kaverien muodostamaan lähipiiriin. Urheilullinen puoli innostuksesta syntyy kiinnostuksesta jalkapalloa kohtaan lajina, aktiivisesti seuratuista säännöllisistä tapahtumista ja oman joukkueen kannattamisesta. Jalkapallon seuraajiin teoria jatkuvasti muuttuvista uusyhteisöistä pätee melko huonosti, sillä lajille ja seuralle ollaan hyvin uskollisia. Faneille on tärkeää sitoutua pieneen lähiyhteisöön, jonka kanssa heillä on yhteinen historia ja mahdollisuus jakaa kokemuksia keskustelemalla ja muistelemalla.

Nonadiabatic charge pumping by oscillating potentials in one dimension: Results for infinite system and finite ring

We study charge pumping when a combination of static potentials and potentials oscillating with a time period T is applied in a one-dimensional system of noninteracting electrons. We consider both an infinite system using the Dirac equation in the continuum approximation and a periodic ring with a finite number of sites using the tight-binding model. The infinite system is taken to be coupled to reservoirs on the two sides which are at the same chemical potential and temperature. We consider a model in which oscillating potentials help the electrons to access a transmission resonance produced by the static potentials and show that nonadiabatic pumping violates the simple sin phi rule which is obeyed by adiabatic two-site pumping. For the ring, we do not introduce any reservoirs, and we present a method for calculating the current averaged over an infinite time using the time evolution operator U(T) assuming a purely Hamiltonian evolution. We analytically show that the averaged current is zero if the Hamiltonian is real and time-reversal invariant. Numerical studies indicate another interesting result, namely, that the integrated current is zero for any time dependence of the potential if it is applied to only one site. Finally we study the effects of pumping at two sites on a ring at resonant and nonresonant frequencies, and show that the pumped current has different dependences on the pumping amplitude in the two cases.

Cyclin dependent protein kinases as drug targets – potential in cardiovascular diseases

Complications of atherosclerosis such as myocardial infarction and stroke are the primary cause of death in Western societies. The development of atherosclerotic lesions is a complex process, including endothelial cell dysfunction, inflammation, extracellular matrix alteration and vascular smooth muscle cell (VSMC) proliferation and migration. Various cell cycle regulatory proteins control VSMC proliferation. Protein kinases called cyclin dependent kinases (CDKs) play a major role in regulation of cell cycle progression. At specific phases of the cell cycle, CDKs pair with cyclins to become catalytically active and phosphorylate numerous substrates contributing to cell cycle progression. CDKs are also regulated by cyclin dependent kinase inhibitors, activating and inhibitory phosphorylation, proteolysis and transcription factors. This tight regulation of cell cycle is essential; thus its deregulation is connected to the development of cancer and other proliferative disorders such as atherosclerosis and restenosis as well as neurodegenerative diseases. Proteins of the cell cycle provide potential and attractive targets for drug development. Consequently, various low molecular weight CDK inhibitors have been identified and are in clinical development. Tylophorine is a phenanthroindolizidine alkaloid, which has been shown to inhibit the growth of several human cancer cell lines. It was used in Ayurvedic medicine to treat inflammatory disorders. The aim of this study was to investigate the effect of tylophorine on human umbilical vein smooth muscle cell (HUVSMC) proliferation, cell cycle progression and the expression of various cell cycle regulatory proteins in order to confirm the findings made with tylophorine in rat cells. We used several methods to determine our hypothesis, including cell proliferation assay, western blot and flow cytometric cell cycle distribution analysis. We demonstrated by cell proliferation assay that tylophorine inhibits HUVSMC proliferation dose-dependently with an IC50 value of 164 nM ± 50. Western blot analysis was used to determine the effect of tylophorine on expression of cell cycle regulatory proteins. Tylophorine downregulates cyclin D1 and p21 expression levels. The results of tylophorine’s effect on phosphorylation sites of p53 were not consistent. More sensitive methods are required in order to completely determine this effect. We used flow cytometric cell cycle analysis to investigate whether tylophorine interferes with cell cycle progression and arrests cells in a specific cell cycle phase. Tylophorine was shown to induce the accumulation of asynchronized HUVSMCs in S phase. Tylophorine has a significant effect on cell cycle, but its role as cell cycle regulator in treatment of vascular proliferative diseases and cancer requires more experiments in vitro and in vivo.

Weber-Fechner type nonlinear behavior in zigzag edge graphene nanoribbons

Using a continuum Dirac theory, we study the density and spin response of zigzag edge-terminated graphene ribbons subjected to edge potentials and Zeeman fields. Our analytical calculations of the density and spin responses of the closed system (fixed particle number) to the static edge fields, show a highly nonlinear Weber-Fechner type behavior where the response depends logarithmically on the edge potential. The dependence of the response on the size of the system (e.g., width of a nanoribbon) is also uncovered. Zigzag edge graphene nanoribbons, therefore, provide a realization of response of organs such as the eye and ear that obey Weber-Fechner law. We validate our analytical results with tight-binding calculations. These results are crucial in understanding important effects of electron-electron interactions in graphene nanoribbons such as edge magnetism, etc., and also suggest possibilities for device applications of graphene nanoribbons.

Functions of human papillomavirus E5 oncogene in epithelial cells and in the onset of cervical cancer

Human papillomaviruses (HPVs) are the causal agents of cervical cancer, which is the second most common cancer among women worldwide. Cellular transformation and carcinogenesis depend on the activities of viral E5, E6 and E7 proteins. Alterations in cell-cell contacts and in communication between epithelial cells take place during cervical carcinogenesis, leading to changes in cell morphology, increased cell motility and finally invasion. The aim of this thesis was to study genome-wide effects of the HPV type 16 (HPV-16) E5 protein on the expression of host cell messenger RNAs (mRNAs) and microRNAs by applying microarray technology. The results showed that the HPV-16 E5 protein alters several cellular pathways involved in cellular adhesion, motility and proliferation as well as in the extracellular matrix. The E5 protein was observed to enhance wound healing of epithelial cell monolayers by increasing cell motility in vivo. HPV-16 E5-induced alterations in the expression of cellular microRNAs and their target genes seem to favour increased proliferation and tumorigenesis. E5 was also shown to affect the expression of adherens junction proteins in HaCaT epithelial keratinocytes. In addition, a study of a membrane cytoskeletal cross-linker protein, ezrin, revealed that when activated, it localizes to adherens junctions. The results suggest that ezrin distribution to forming adherens junctions is due to Rac1 activity in epithelial cells. These studies reveal for the first time the holistic effects of HPV-16 E5 protein in promoting precancerous events in epithelial cells. The results contribute to identifyinging novel markers for cervical precancerous stages and to predicting disease behaviour.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

Optimisation problems in wireless sensor networks

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.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Effect of wall thickness on the end corrections of the extended inlet and outlet of a double-tuned expansion chamber

Simple expansion chambers, the simplest of the muffler configurations, have very limited practical application due to the presence of periodic troughs in the transmission loss spectrum which drastically lower the overall transmission loss of the muffler. Tuned extended inlet and outlet can be designed to nullify three-fourths of these troughs, making use of the plane wave theory. These cancellations would not occur unless one altered the geometric lengths for the extended tube in order to incorporate the effect of evanescent higher-order modes (multidimensional effect) through end corrections or lumped inertance approximation at the area discontinuities or junctions. End corrections of the extended inlet and outlet have been studied by several researchers. However the effect of wall thickness of the inlet/outlet duct on end correction has not been studied explicitly. This has significant effect on the tuning of an extended inlet/outlet expansion chamber. It is investigated here experimentally as well as numerically (through use of 3-D FEM software) for stationary medium. Crown Copyright (C) 2010 Published by Elsevier Ltd. All rights reserved.

Locally checkable proofs

This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2-colouring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(log n) bits per node. In this work we classify graph problems according to their local proof complexity, i.e., how many bits per node are needed in a locally checkable proof. We establish tight or near-tight results for classical graph properties such as the chromatic number. We show that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, Θ(1), Θ(log n), or poly(n) bits per node. Among the most difficult graph properties are symmetric graphs, which require Ω(n2) bits per node, and non-3-colourable graphs, which require Ω(n2/log n) bits per node—any pure graph property admits a trivial proof of size O(n2).

CA/TG sequence at the 5' end of oligo(A)-tracts strongly modulates DNA curvature

An analysis of the base pair doublet geometries in available crystal structures indicates that the often reported intrinsic curvature of DNA containing oligo-(d(A).d(T)) tracts may also depend on the nature of the flanking sequences. The presence of CA/TG doublet in particular at the 5' end of these tracts is expected to enhance their intrinsic bending property. To test this proposition, three oligonucleotides, d(GAAAAACCCCCC), d(CCCCCCAAAAAG), d(GAAAAATTTTTC), and their complementary sequences were synthesized to study the effect of various flanking sequences, at the 5' and 3' ends of the A-tracts, on the curvature of DNA in solution. An analysis of the polyacrylamide gel electrophoretic mobilities of these sequences under different conditions of salts and temperatures (below their melting points) clearly showed that the oligomer with CA/TG sequence in the center was always more retarded than the oligomer with AC/GT sequence, as well as the oligomer with AT/AT sequence. Hydroxyl radical probing of the sequences with AC/GT and CA/TG doublet junctions gives a similar cutting pattern in the A-tracts, which is quite different from that in the C-tracts, indicating that the oligo(A)-tracts have similar structures in the two oligomers. KMnO4 probing shows that the oligomer with a CA/TG doublet junction forms a kink that is responsible for its inherent curvature and unusual electrophoretic mobility. UV melting shows a reduced thermal stability of the duplex with CA/TG doublet junction, and circular dichroism (CD) studies indicate that a premelting transition occurs in the oligomer with CA/TG doublet step before global melting but not in the oligomer with AC/GT doublet step, which may correspond to thermally induced unbending of the oligomer. These observations indicate that the CA/TG doublet junction at the 5' end of the oligo(A)-tract has a crucial role in modulating the overall curvature in DNA.

CA\TG Sequence at the 5'end of Oligo(A)-tracts Strongly Modulates DNA Curvature

An analysis of the base pair doublet geometries in available crystal structures indicates that the often reported intrinsic curvature of DNA containing oligo-(d(A).d(T)) tracts may also depend on the nature of the flanking sequences. The presence of CA/TG doublet in particular at the 5' end of these tracts is expected to enhance their intrinsic bending property. To test this proposition, three oligonucleotides, d(GAAAAACCCCCC), d(CCCCCCAAAAAG), d(GAAAAATTTTTC), and their complementary sequences were synthesized to study the effect of various flanking sequences, at the 5' and 3' ends of the A-tracts, on the curvature of DNA in solution. An analysis of the polyacrylamide gel electrophoretic mobilities of these sequences under different conditions of salts and temperatures (below their melting points) clearly showed that the oligomer with CA/TG sequence in the center was always more retarded than the oligomer with AC/GT sequence, as well as the oligomer with AT/AT sequence. Hydroxyl radical probing of the sequences with AC/GT and CA/TG doublet junctions gives a similar cutting pattern in the A-tracts, which is quite different from that in the C-tracts, indicating that the oligo(A)-tracts have similar structures in the two oligomers. KMnO4 probing shows that the oligomer with a CA/TG doublet junction forms a kink that is responsible for its inherent curvature and unusual electrophoretic mobility. UV melting shows a reduced thermal stability of the duplex with CA/TG doublet junction, and circular dichroism (CD) studies indicate that a premelting transition occurs in the oligomer with CA/TG doublet step before global melting but not in the oligomer with AC/GT doublet step, which may correspond to thermally induced unbending of the oligomer. These observations indicate that the CA/TG doublet junction at the 5' end of the oligo(A)-tract has a crucial role in modulating the overall curvature in DNA.