COVID-19 contact tracing is a preventive solution to slow the spread of virus. Several countries have implemented manual as well digital tracking using smartphone applications. A proximity-based system device BLE (Bluetooth Low Energy) technology focuses on and controlling virus in local communities. The devices consist signal sending (tag) receiving (scanner). Suppose factory. tag will be used...

The permutation based algorithm has been proved unbeatable in high dimensional spaces, requiring O(|P|) distance evaluations when solving similarity queries (where P is the set of permutants); but needs n evaluations of the permutant distance to compute the order to review the metric dataset, requires O(n|P|) space, and does not take much benefit from low dimensionality. There have been several...

So far, methods for ellipsis and anaphor resolution have been developed and the effects of anaphor resolution have been analyzed in the context of statistical information retrieval (IR) of scientific abstracts. No significant improvement has been observed. In this study, the effects of ellipsis and anaphor resolution on proximity searching in a full text database are analyzed. Anaphora and elli...

We integrate insights from the social embeddedness perspective with research on immigrant entrepreneurship to theorize on how family resources influence exit from entrepreneurship among previously unemployed immigrant entrepreneurs. Results from a cohort study of immigrant entrepreneurs in Sweden reveal that family resources are important for immigrants to integrate economically into a country....

The nearest point problem (NPP), i.e., finding the closest points between two disjoint convex hulls, has two classical solutions, the Gilbert–Schlesinger–Kozinec (GSK) and Mitchell–Dem’yanov–Malozemov (MDM) algorithms. When the convex hulls do intersect, NPP has to be stated in terms of reduced convex hulls (RCHs), made up of convex pattern combinations whose coefficients are bound by a mo1 val...

The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

Aggregative data infrastructures (ADIs) are information systems where organizations can find the tools to integrate their data sources to form uniform and richer information spaces of object metadata descriptions. Novel sustainable approaches for the realization of ADIs are based on the adoption of ADI enabling technologies which support the realization, maintenance and upgrade of ADIs and prom...

In this paper, we investigate the L-fuzzy proximities and the relationships betweenL-fuzzy topologies, L-fuzzy topogenous order and L-fuzzy uniformity. First, we show that the category of-fuzzy topological spaces can be embedded in the category of L-fuzzy quasi-proximity spaces as a coreective full subcategory. Second, we show that the category of L -fuzzy proximity spaces is isomorphic to the ...

We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...