We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
The concept of a learning object (LO) has spread quickly without a very specific universal definition, and though born originally from the idea of object oriented design, with a ...
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
—A robust active queue management (AQM) scheme based on H-infinty theory is presented for the problem of congestion control in TCP communication networks. In TCP/IP networks, the...
Yuanwei Jing, Hongwei Wang, Georgi M. Dimirovski, ...