Related papers: A note on linear fractional set packing problem
We count the number of independent solutions to crossing constraints of four point functions involving charged scalars and charged fermions in a CFT with large gap in the spectrum. To find the CFT data we employ recently developed…
In this paper, we solve in the convergence set, the fractional logistic equation making use of Euler's numbers. To our knowledge, the answer is still an open question. The key point is that the coefficients can be connected with Euler's…
The paper discusses the summability of formal solutions of some linear q-difference-differential equations, and improves the previous result in [Tahara-Yamazawa, Opsucula Math. 35 (2015), 713-738].
An error analysis is presented for explicit partitioned Runge-Kutta methods and multirate methods applied to conservation laws. The interfaces, across which different methods or time steps are used, lead to order reduction of the schemes.…
We present an algorithmic contribution to improve the efficiency of robust trim-fitting in outlier affected geometric regression problems. The method heavily relies on the quick sort algorithm, and we present two important insights. First,…
This paper presents a distributed algorithm in the CONGEST model that achieves a $(1+\epsilon)$-approximation for row-sparse fractional covering problems (RS-FCP) and the dual column-sparse fraction packing problems (CS-FPP). Compared with…
Modern generations of field-programmable gate arrays (FPGAs) allow for partial reconfiguration. In an online context, where the sequence of modules to be loaded on the FPGA is unknown beforehand, repeated insertion and deletion of modules…
In this paper, an exact method is proposed to optimize two fractional linear functions over the efficient set of a fractional multiobjective linear problem (MOILFP). This type of problems is encountered when there are two decision makers…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
In this small note we correct an error made by Mohammadi et al. in their paper entitled "On Skew Cyclic Codes Over A Finite Ring" ( Iranian Jl. Math. Sci. Inform. Vol 14 (1) (2019), 135-145).
We decompose the energy error of any variational DFT calculation into a contribution due to the approximate functional and that due to the approximate density. Typically, the functional error dominates, but in many interesting situations,…
In this paper, based on Newton interpolation we have proposed a numerical scheme of predictor-corrector type in order to solve fractional differential equations with the fractional derivative involving the Mittag-Leffler function. We have…
This is a note on logistic regression models and logistic kernel machine models. It contains derivations to some of the expressions in a paper -- SNP Set Analysis for Detecting Disease Association Using Exon Sequence Data -- submitted to…
In the current paper we provide a proof of NP-completeness for the CFP problem with the fractional grouping efficacy objective. For this purpose we first consider the CFP with the linear objective minimizing the total number of exceptions…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
In this paper, we propose a two-steps approach to partition instances of the Conjunctive Normal Form (CNF) Syntactic Formula Isomorphism problem (CSFI) into groups of different complexity. First, we build a model, based on the Transformer…
An error occurred in the computation of a gradient in our paper entitled "Blind maximum likelihood separation of a linear-quadratic mixture", presented in ICA'2004. The equations (20) in Appendix and (17) in the text were not correct. The…
In this short commentary we provide our comment on the article "Explicit Analytical Solution for Random Close Packing in $d=2$ and $d=3$" and its subsequent Erratum that are recently published in Physical Review Letters. In that Letter, the…
In [1] we highlighted the fact that the log polynomial expansion employed in Nature Astron. 3, no.3, 272-277 (2019) [2] is a poor approximation to flat $\Lambda$CDM, so using it to infer deviations from flat $\Lambda$CDM is not…
The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems…