We investigate whether in the setting of approach spaces there exist measures of relative compactness, (relative) sequential compactness and (relative) countable compactness in the same vein as Kuratowski’s measure of compactness. The answer is yes. Not only can we prove that such measures exist, but we can give usable formulas for them and we can prove that they behave nicely with respect to e...

Compactness is introduced as a new method to search for the onset of the quark matter transition in relativistic heavy ion collisions. That transition supposedly leads to stronger compression and higher compactness of the source in coordinate space. That effect could be observed via pion interferometry. We propose to measure the compactness of the source in the appropriate principal axis frame ...

applying 2d algorithms for inverting the potential field data is more useful and efficient than their 3d counterparts, whenever the geologic situation permits. this is because the computation time is less and modeling the subsurface is easier. in this paper we present a 2d inversion algorithm for interpreting gravity data by employing a set of constraints including minimum distance, smoothness,...

The notion of near S *-compactness is introduced in L-topological spaces based on S *-compactness. Its properties are researched and the relations between it and other near compactness are obtained. Moreover many characterizations of near S *-compactness are presented. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, dist...

China is in the process of rapid urbanization, and wise land use is critical to the longterm sustainability of Chinese cities. Promotion of a compact city is typically believed to be a helpful for sustainable land use management. However, given the fact that Chinese cities are characterized by high population densities, the applicability of a more compact solution to expanding cities in China r...

Abst rac t : We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for cert~n multiprocessor interconnection networks and give their analysis in terms of the compactness and the size (the maximum number of buffers per node (per link)). The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate an...