Now showing items 460-479 of 988

    • K-means for massive data 

      Capo M. (2019-04-30)
      The $K$-means algorithm is undoubtedly one of the most popular clustering analysis techniques, due to its easiness in the implementation, straightforward parallelizability and competitive computational complexity, when ...
    • KETpic-Matlab Toolbox for LaTeX High-Quality Graphical Artwork in Educational Materials on Bézier Curve Algorithms at a Master Level 

      Gálvez A.; Takato S.; Kaneko M.; Del Ser J.; Iglesias A. (Lecture Notes in Computer Science, 2017-07)
      This paper introduces a new toolbox to generate high-quality graphical artwork about the main algorithms for Bézier curves and related topics. The package has been implemented by the authors as a supporting middleware tool ...
    • Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction 

      Bach V.; Breteaux S.; Petrat S.; Pickl P.; Tzaneteas T. (Journal des Mathematiques Pures et Appliquees, 2016-01-01)
      We study the time evolution of a system of $N$ spinless fermions in $\mathbb{R}^3$ which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation ...
    • Klein's Paradox and the Relativistic $\delta$-shell Interaction in $\mathbb{R}^3$ 

      Mas A; Pizzichillo F. (Analysis & PDE, 2017-11)
      Under certain hypothesis of smallness of the regular potential $\mathbf{V}$, we prove that the Dirac operator in $\mathbb{R}^3$ coupled with a suitable re-scaling of $\mathbf{V}$, converges in the strong resolvent sense ...
    • L ∞ variational problems for maps and the Aronsson PDE system 

      Katzourakis N.I. (Journal of Differential Equations, 2012-12-31)
      By employing Aronsson's absolute minimizers of L ∞ functionals, we prove that absolutely minimizing maps u:Rn→RN solve a "tangential" Aronsson PDE system. By following Sheffield and Smart (2012) [24], we derive δ ∞ with ...
    • Lagged and instantaneous dynamical influences related to brain structural connectivity 

      Alonso C.; Diez I.; Remaki L.; Escudero I.; Mateos B.; Rosseel Y.; Marinazzo D.; Stramaglia S.; Cortes J.M. (Frontiers in Psychology, 2015-12-31)
      Contemporary neuroimaging methods can shed light on the basis of human neural and cognitive specializations, with important implications for neuroscience and medicine. Indeed, different MRI acquisitions provide different ...
    • Langevin equation in complex media and anomalous diffusion 

      Vitali S.; Sposini V.; Sliusarenko O.; Paradisi P.; Castellani G.; Pagnini G. (Journal of the Royal Society Interface, 2018-07-30)
      The problem of biological motion is a very intriguing and topical issue. Many efforts are being focused on the development of novel modelling approaches for the description of anomalous diffusion in biological systems, such ...
    • Large Time Asymptotics for Partially Dissipative Hyperbolic Systems 

      Beauchard K.; Zuazua E. (Archive for Rational Mechanics and Analysis, 2011-12-31)
      This work is concerned with (n-component) hyperbolic systems of balance laws in m space dimensions. First, we consider linear systems with constant coefficients and analyze the possible behavior of solutions as t → ∞. Using ...
    • Large-scale simulations of synthetic markets 

      Gerardo-Giorda L.; Germano G.; Scalas E. (Communications in Applied and Industrial Mathematics, 2015-10-08)
      High-frequency trading has been experiencing an increase of interest both for practical purposes within nancial institutions and within academic research; recently, the UK Government O ce for Science reviewed the state ...
    • Large-time asymptotics, vanishing viscosity and numerics for 1-D scalar conservation laws 

      Ignat L.I.; Pozo A.; Zuazua E. (Mathematics of Computation, 2014-12-31)
      In this paper we analyze the large time asymptotic behavior of the discrete solutions of numerical approximation schemes for scalar hyperbolic conservation laws. We consider three monotone conservative schemes that are ...
    • Large-time behavior of some numerical schemes: application to the sonic-boom phenomenon 

      Pozo A. (2014-12-10)
      In this thesis we highlight the necessity of employing numerical schemes that preserve the large-time dynamical properties of the continuous system. We focus on Burgers- like equations, which are well known to develop ...
    • Layout Optimisation of Wave Energy Converter Arrays 

      Mercadé Ruiz P.; Nava V.; Topper M. B. R.; Ruiz Minguela P.; Ferri F.; Kofoed J. P. (Energies, 2017-08-24)
      This paper proposes an optimisation strategy for the layout design of wave energy converter (WEC) arrays. Optimal layouts are sought so as to maximise the absorbed power given a minimum q-factor, the minimum distance between ...
    • LBM-HPC - An open-source tool for fluid simulations. Case study: Unified parallel C (UPC-PGAS) 

      Valero-Lara P.; Jansson J. (Proceedings - IEEE International Conference on Cluster Computing, ICCC, 2015-12-31)
      The main motivation of this work is the evaluation of the Unified Parallel C (UPC) model, for Boltzmann-fluid simulations. UPC is one of the current models in the so-called Partitioned Global Address Space paradigm. This ...
    • Learning to classify software defects from crowds: a novel approach 

      Hernández-González J.; Rodríguez D.; Inza I.; Rachel H.; Lozano J.A. (Applied Soft Computing, 2017-11-01)
      In software engineering, associating each reported defect with a cate- gory allows, among many other things, for the appropriate allocation of resources. Although this classification task can be automated using stan- dard ...
    • A least-squares implicit RBF-FD closest point method and applications to PDEs on moving surfaces 

      Petras A.; Ling L.; Piret C.; Ruuth S.J. (Journal of Computational Physics, 2018-10)
      The closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is an embedding method developed to solve a variety of partial differential equations (PDEs) on smooth surfaces, using a closest point ...
    • Lessons from Two Design–Build–Test–Learn Cycles of Dodecanol Production in Escherichia coli Aided by Machine Learning 

      Opgenorth P.; Costello Z.; Okada T.; Goyal G.; Chen Y.; Gin J.; Benites V.; de Raad M.; Northen TR.; Deng K.; Deutsch S.; Baidoo E.E.K.; Petzold CJ.; Hillson NJ.; Garcia-Martin H.; Beller HR. (ACS Synthetic Biology, 2019-01-01)
      The Design–Build–Test–Learn (DBTL) cycle, facilitated by exponentially improving capabilities in synthetic biology, is an increasingly adopted metabolic engineering framework that represents a more systematic and efficient ...
    • Leveraging the Performance of LBM-HPC for Large Sizes on GPUs using Ghost Cells 

      Valero-Lara P. (ICA3PP: 15th International Conference on Algorithms and Architectures for Parallel Processing, 2016-11-10)
      Today, we are living a growing demand of larger and more efficient computational resources from the scienti c community. On the other hand, the appearance of GPUs for general purpose computing supposed an important advance ...
    • Leveraging the performance of LBM-HPC for large sizes on GPUs using ghost cells 

      Valero-Lara P. (Algorithms and Architectures for Parallel Processing, 2016-11-25)
      Today, we are living a growing demand of larger and more efficient computational resources from the scientific community. On the other hand, the appearance of GPUs for general purpose computing supposed an important advance ...
    • A Lê-Greuel type formula for the image Milnor number 

      Nuño-Ballesteros J.J.; Pallarés Torres I. (Hokkaido Mathematical Journal, 2019-02)
      Let $f\colon (\mathbb{C}^n,0)\to (\mathbb{C}^{n+1},0)$ be a corank 1 finitely determined map germ. For a generic linear form $p\colon (\mathbb{C}^{n+1},0)\to(\mathbb{C},0)$ we denote by $g\colon (\mathbb{C}^{n-1},0)\to ...
    • Lieb–Robinson Bounds for Multi–Commutators and Applications to Response Theory 

      Bru J.-B.; de Siqueira Pedra W. (2016-01-01)
      We generalize to multi–commutators the usual Lieb–Robinson bounds for commutators. In the spirit of constructive QFT, this is done so as to allow the use of combinatorics of minimally connected graphs (tree expan- sions) ...