15,858 research outputs found
On Searching a Table Consistent with Division Poset
Suppose is a partially ordered set with the partial order
defined by divisibility, that is, for any two distinct elements
satisfying divides , . A table of
distinct real numbers is said to be \emph{consistent} with , provided for
any two distinct elements satisfying divides ,
. Given an real number , we want to determine whether ,
by comparing with as few entries of as possible. In this paper we
investigate the complexity , measured in the number of comparisons, of
the above search problem. We present a search
algorithm for and prove a lower bound on
by using an adversary argument.Comment: 16 pages, no figure; same results, representation improved, add
reference
Visualizing the impact of Covid-19 vaccine passports on pedestrian access to metro stations in Hong Kong
Pedestrian infrastructures in Hong Kong enable multilevel city life in a vertical metropolis plagued by land scarcity. Public spaces integrated into pedestrian networks play an indispensable role in neighbourhood accessibility. We visualize the impact of the Covid-19 vaccine passport (VP) restrictions on the use of public space on pedestrian accessibility to all 97 metro stations in Hong Kong. Pedestrians without a vaccine passport (PwoVP) need to walk significantly longer alternative routes. Specifically, VP-related access restrictions to indoor walkways have doubled the shortest travel time for PwoVP and a 50% reduction in accessibility of two-thirds of stations
- β¦