Enhancement of superconductivity by frustrating the charge order

We study strong electron-phonon interacting systems where the geometry of the crystalline lattice frustrates the formation of charge order. Our results show that under such condition, high-Tc superconductivity can occur in a wide range of electron-phonon coupling strengths. This result is obtained by studying the Holstein model on triangular lattice using sign-problem-free quantum Monte Carlo method

Orbital fluctuations and strong correlations in quantum dots

In this lecture note we focus our attention to quantum dot systems where exotic strongly correlated behavior develops due to the presence of orbital or charge degrees of freedom. After giving a concise overview of the theory of transport and Kondo effect through a single electron transistor, we discuss how SU(4) Kondo effect develops in dots having orbitally degenerate states and in double dot systems, and then study the singlet-triplet transition in lateral quantum dots. Charge fluctuations and Matveev's mapping to the two-channel Kondo model in the vicinity of charge degeneracy point are also discussed.Comment: Lecture note to appear in Philosophical Magazin

Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex $v$ and a label $\lambda$, returns a $(1+\varepsilon)$-approximation of the distance from $v$ to the closest vertex with label $\lambda$ in $G$. Such an oracle is dynamic if it also supports label changes. In this paper we present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements

Modeling the optical constants of AlxGa1-xAs alloys

Extension of Adachi's model with a Gaussian-like broadening function instead of a Lorentzian one is used to model the optical dielectric function of the alloy AlxGa1-xAs. Gaussian-like broadening is accomplished by replacing the damping constant in the Lorentzian line shape with a frequency dependent expression. In such a manner, the comparative simplicity of analytic formulae of the model is preserved, while the accuracy becomes comparable to more intricate models, and/or models with a significantly greater number of parameters. The employed model describes accurately the optical dielectric function in the spectral range from 1.5 to 6.0 eV in the entire alloy composition range. Relative rms error obtained for the refractive index is below 2.2% for all compositionspublished_or_final_versio

Regulation of cell proliferation by large-conductance calcium-activated potassium and volume-sensitive chloride channels in human cardiac fibroblasts

Oral presentationpublished_or_final_versionThe 15th Annual Research Conference of the Department of Medicine, The University of Hong Kong, Hong Kong, 16 January 2010. In Hong Kong Medical Journal, 2010, v. 16, suppl. 1, p. 23, abstract no. 2

An Evolutionary Algorithm to Generate Real Urban Traffic Flows

In this article we present a strategy based on an evolutionary algorithm to calculate the real vehicle ows in cities according to data from sensors placed in the streets. We have worked with a map imported from OpenStreetMap into the SUMO traffic simulator so that the resulting scenarios can be used to perform different optimizations with the confidence of being able to work with a traffic distribution close to reality. We have compared the results of our algorithm to other competitors and achieved results that replicate the real traffic distribution with a precision higher than 90%.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This research has been partially funded by project number 8.06/5.47.4142 in collaboration with the VSB-Technical University of Ostrava and Universidad de Málaga UMA/FEDER FC14-TIC36, programa de fortalecimiento de las capacidades de I+D+i en las universidades 2014-2015, de la Consejería de Economía, Innovación, Ciencia y Empleo, cofinanciado por el fondo europeo de desarrollo regional (FEDER). Also, partially funded by the Spanish MINECO project TIN2014-57341-R (http://moveon.lcc.uma.es). The authors would like to thank the FEDER of European Union for financial support via project Movilidad Inteligente: Wi-Fi, Rutas y Contaminación (maxCT) of the "Programa Operativo FEDER de Andalucía 2014-2020. We also thank all Agency of Public Works of Andalusia Regional Government staff and researchers for their dedication and professionalism. Daniel H. Stolfi is supported by a FPU grant (FPU13/00954) from the Spanish Ministry of Education, Culture and Sports

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search

The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions that partition space. For a collection of $n$ points, after preprocessing, the query time is dominated by $O(n^{\rho} \log n)$ evaluations of hash functions from $\mathcal{H}$ and $O(n^{\rho})$ hash table lookups and distance computations where $\rho \in (0,1)$ is determined by the locality-sensitivity properties of $\mathcal{H}$. It follows from a recent result by Dahlgaard et al. (FOCS 2017) that the number of locality-sensitive hash functions can be reduced to $O(\log^2 n)$, leaving the query time to be dominated by $O(n^{\rho})$ distance computations and $O(n^{\rho} \log n)$ additional word-RAM operations. We state this result as a general framework and provide a simpler analysis showing that the number of lookups and distance computations closely match the Indyk-Motwani framework, making it a viable replacement in practice. Using ideas from another locality-sensitive hashing framework by Andoni and Indyk (SODA 2006) we are able to reduce the number of additional word-RAM operations to $O(n^\rho)$.Comment: 15 pages, 3 figure

Efficient notification of meeting points for moving groups via independent safe regions

In applications like social networking services and online games, multiple moving users form a group and wish to be continuously notified with the best meeting point from their locations. To reduce the communication frequency of the application server, a promising technique is to apply safe regions, which capture the validity of query results with respect to the users' locations. Unfortunately, the safe regions in our problem exhibit characteristics such as irregular shapes and dependency among multiple safe regions. These unique characteristics render existing safe region methods that focus on a single safe region inapplicable to our problem. To tackle these challenges, we first examine the shapes of safe regions in our problem context and propose feasible approximations for them. We design efficient algorithms for computing these safe regions, as well as develop compression techniques for representing safe regions in a compact manner. Experiments with both real and synthetic data demonstrate the efficiency of our proposal in terms of computation and communication costs. © 2013 IEEE.published_or_final_versio

Monoamine oxidase A upregulated by chronic intermittent hypoxia activates indoleamine 2,3-dioxygenase and neurodegeneration

published_or_final_versio

Exponential energy decay of solutions for a system of viscoelastic wave equations of Kirchhoff type with strong damping

The initial boundary value problem for a system of viscoelastic wave equations of Kirchhoff type with strong damping is considered. We prove that, under suitable assumptions on relaxation functions and certain initial data, the decay rate of the solutions energy is exponential