scispace - formally typeset
Search or ask a question
Topic

Approx

About: Approx is a research topic. Over the lifetime, 27 publications have been published within this topic receiving 156 citations.


Papers
More filters
Journal ArticleDOI
Xiao-Ming Zeng1
TL;DR: The Szasz–Bezier operatorSn, αwhich is the modified form of the SzasZ–Mirakyan operator, is introduced and the rate of convergence of Sn, αfor functions of bounded variation is obtained.

35 citations

Proceedings ArticleDOI
01 Jan 2020
TL;DR: This paper formally model this Robustness-oriented k Edge Server Placement (RkESP) problem, and proves that finding the optimal solution to this problem is $\mathcal{N}$-hard", and proposes an integer programming based optimal approach, namely Opt, to find optimal solutions to small-scale RKESP problems.
Abstract: Mobile Edge Computing (MEC) is an emerging and prospective computing paradigm that supports low-latency content delivery. In a MEC environment, edge servers are attached to base stations or access points in closer proximity to end-users to reduce the end-to-end latency in their access to online content. From an edge infrastructure provider’s perspective, a cost-effective k edge server placement (kESP) places k edge servers within a particular geographic area to maximize their coverage. However, in the distributed MEC environment, edge servers are often subject to failures due to various reasons, e.g., software exceptions, hardware faults, cyberattacks, etc. End-users connected to a failed edge server have to access online content from the remote cloud if they are not covered by any other edge servers. This significantly jeopardizes end-users’ quality of experience. Thus, the robustness of an edge server network must be considered in edge server placement. In this paper, we formally model this Robustness-oriented k Edge Server Placement (RkESP) problem, and prove that finding the optimal solution to this problem is $\mathcal{N}\mathcal{P}$-hard. Thus, we firstly propose an integer programming based optimal approach, namely Opt, to find optimal solutions to small-scale RkESP problems. Then, we propose an approximate approach, namely Approx, for solving large-scale RkESP problems efficiently with an O(k)-approximation ratio. Finally, the performance of the two approaches is experimentally evaluated against five state-of-the-art approaches on a real-world dataset and a large-scale synthesized dataset.

27 citations

Journal ArticleDOI
TL;DR: In this article, the authors considered agravity as a dimensionless quantum gravity theory finding a multi-field inflation that converges towards an attractor trajectory that predicts $n_s \approx 0.96$ and $0.13$ for the tensor-to-scalar ratio.
Abstract: Theories where the Planck scale is dynamically generated from dimensionless interactions provide predictive inflationary potentials and super-Planckian field variations. We first study the minimal single-field realisation in the low-energy effective field theory limit, finding the predictions $n_s \approx 0.96$ for the spectral index and $r \approx 0.13$ for the tensor-to-scalar ratio, which can be reduced down to $\approx 0.04$ in presence of large couplings. Next we consider agravity as a dimensionless quantum gravity theory finding a multi-field inflation that converges towards an attractor trajectory that predicts $n_s\approx 0.96$ and $0.003

24 citations

Journal ArticleDOI
TL;DR: An updating procedure with 2+1 light flavors, where the targeted s quark mass is at its physical value while the u and d quarks should produce pions lighter than 300 MeV is constructed, coded, and tested.
Abstract: Because of its complex structure the parametrized fixed point action can not be simulated with the available local updating algorithms. We constructed, coded, and tested an updating procedure with 2+1 light flavors, where the targeted s quark mass is at its physical value while the u and d quarks should produce pions lighter than 300 MeV. In the algorithm a partially global gauge update is followed by several accept/reject steps, where parts of the determinant are switched on gradually in the order of their costs. The trial configuration that is offered in the last, most expensive, stochastic accept/reject step differs from the original configuration by a Metropolis + over-relaxation gauge update over a subvolume of {approx}(1.3 fm){sup 4}. The acceptance rate in this accept/reject step is {approx}0.4. The code is optimized on different architectures and is running on lattices with L{sub s}{approx_equal}1.2 fm and 1.8 fm at a resolution of a{approx_equal}0.15 fm.

21 citations

Journal ArticleDOI
TL;DR: In this paper, a modified gravity model without any initial matter fields was proposed in terms of several alternative non-Riemannian spacetime volume elements within the metric (second order) formalism.
Abstract: We propose a simple modified gravity model without any initial matter fields in terms of several alternative non-Riemannian spacetime volume elements within the metric (second order) formalism. We show how the non-Riemannian volume-elements, when passing to the physical Einstein frame, create a canonical scalar field and produce dynamically a non-trivial inflationary-type potential for the latter with a large flat region and a stable low-lying minimum. We study the evolution of the cosmological solutions from the point of view of theory of dynamical systems. The theory predicts the spectral index $$n_s \approx 0.96$$ and the tensor-to-scalar ratio $$r \approx 0.002$$ for 60 e-folds, which is in accordance with the observational data. In the future Euclid and SPHEREx missions or the BICEP3 experiment are expected to provide experimental evidence to test those predictions.

16 citations

Network Information
Related Topics (5)
Matrix (mathematics)
105.5K papers, 1.9M citations
81% related
Scattering
152.3K papers, 3M citations
80% related
Magnetic field
167.5K papers, 2.3M citations
79% related
Ground state
70K papers, 1.5M citations
78% related
Differential equation
88K papers, 2M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202361
2022135
20214
20204
20195
20182