A subsetA of a Boolean algebra B is said to be (n,m)reaped if there is a partition of unity P ⊂ B of size n such that |{b ∈ P : b∧a 6= ∅}| ≥ m for all a ∈ A. The reaping number rn,m(B) of a Boolean algebra B is the minimum cardinality of a set A ⊂ B\ {0} such which cannot be (n,m)-reaped. It is shown that, for each n ∈ ω, there is a Boolean algebra B such that rn+1,2(B) 6= rn,2(B). Also, {rn,m(...

Although many online vendors have sponsored virtual communities (VCs) in the hope of reaping commercial benefits from it, not many have been successful in reaping commercial benefits from their VC. Online vendors can benefit greatly from having a VC, if the VC members can be converted into online buyers. This study examines the conversion of a VC member into an online buyer. Using a classical-c...

The outbreak of COVID-19 has entirely changed how consumers behave, due to an over-reliance on online shopping. With the global pandemic demanding people stay home, multiple companies had find innovative strategies remain competitive and adapt these rapid changes. However, also propelled development technologies, such as artificial intelligence (AI). AI concerns engineering machines programs ma...

Trust is fundamental to all human exchange. It is therefore necessary to understand the behavioural logic and neural underpinnings of how it is established, maintained, broken, and repaired. There are open evolutionary questions about how trust mechanisms should and do evolve; however, here we focus on more proximate psychological and neural mechanisms that mediate trust. Our perspective single...