SearcharxivSearch

arXiv subjects

David

Publications and source records attributed to David.

6 recordsLinked to original sources

MOPO-LSI: A User Guide

MOPO-LSI is an open-source Multi-Objective Portfolio Optimization Library for Sustainable Investments. This document provides a user guide for MOPO-LSI version 1.0, including problem setup, workflow and the hyper-parameters in configurations.

q-fin.PM

Thermal Transport in Twisted Bilayer Graphene: An Equilibrium Molecular Dynamics Study

Twisted bilayer graphene (tBLG) is two graphene layers placed on top of each other with a twist angle, making it has tunable thermal properties. In this paper, we report an analysis of thermal conductivity ($\kappa$), phonon density of states, and specific heat capacity of tBLG with various twist angles over a range of temperatures using equilibrium molecular dynamics simulations based on the Green-Kubo method. Simulation shows that stacking and twisting graphene layers lead to a decrease in the thermal conductivity, with the highest $\kappa$ at around room temperature owned by the tBLG with a twist angle of 3.89$^{\circ}$ followed by 16.43$^{\circ}$ and 4.41$^{\circ}$. We also perform quantum correction to the simulation results to show the process of increasing thermal conductivity at low temperatures.

cond-mat.mes-hall

Using Particle Swarm Optimization as Pathfinding Strategy in a Space with Obstacles

Particle swarm optimization (PSO) is a search algorithm based on stochastic and population-based adaptive optimization. In this paper, a pathfinding strategy is proposed to improve the efficiency of path planning for a broad range of applications. This study aims to investigate the effect of PSO parameters (numbers of particle, weight constant, particle constant, and global constant) on algorithm performance to give solution paths. Increasing the PSO parameters makes the swarm move faster to the target point but takes a long time to converge because of too many random movements, and vice versa. From a variety of simulations with different parameters, the PSO algorithm is proven to be able to provide a solution path in a space with obstacles.

cs.NE

Multi-Objective Recommendations: A Tutorial

Recommender systems (RecSys) have been well developed to assist user decision making. Traditional RecSys usually optimize a single objective (e.g., rating prediction errors or ranking quality) in the model. There is an emerging demand in multi-objective optimization recently in RecSys, especially in the area of multi-stakeholder and multi-task recommender systems. This article provides an overview of multi-objective recommendations, followed by the discussions with case studies. The document is considered as a supplementary material for our tutorial on multi-objective recommendations at ACM SIGKDD 2021.

cs.IR

RISMA: Reconfigurable Intelligent Surfaces Enabling Beamforming for IoT Massive Access

Massive access for Internet-of-Things (IoT) in beyond 5G networks represents a daunting challenge for conventional bandwidth-limited technologies. Millimeter-wave technologies (mmWave)---which provide large chunks of bandwidth at the cost of more complex wireless processors in harsher radio environments---is a promising alternative to accommodate massive IoT but its cost and power requirements are an obstacle for wide adoption in practice. In this context, meta-materials arise as a key innovation enabler to address this challenge by Re-configurable Intelligent Surfaces (RISs). In this paper we take on the challenge and study a beyond 5G scenario consisting of a multi-antenna base station (BS) serving a large set of single-antenna user equipments (UEs) with the aid of RISs to cope with non-line-of-sight paths. Specifically, we build a mathematical framework to jointly optimize the precoding strategy of the BS and the RIS parameters in order to minimize the system sum mean squared error (SMSE). This novel approach reveals convenient properties used to design two algorithms, RISMA and Lo-RISMA, which are able to either find simple and efficient solutions to our problem (the former) or accommodate practical constraints with low-resolution RISs (the latter). Numerical results show that our algorithms outperform conventional benchmarks that do not employ RIS (even with low-resolution meta-surfaces) with gains that span from 20% to 120% in sum rate performance.

cs.IT

Semiclassical approximation with zero velocity trajectories

We present a new semiclassical method that yields an approximation to the quantum mechanical wavefunction at a fixed, predetermined position. In the approach, a hierarchy of ODEs are solved along a trajectory with zero velocity. The new approximation is local, both literally and from a quantum mechanical point of view, in the sense that neighboring trajectories do not communicate with each other. The approach is readily extended to imaginary time propagation and is particularly useful for the calculation of quantities where only local information is required. We present two applications: the calculation of tunneling probabilities and the calculation of low energy eigenvalues. In both applications we obtain excellent agrement with the exact quantum mechanics, with a single trajectory propagation.

quant-ph