This paper describes the design of a control and management network (orderwire) for a mobile wireless Asynchronous Transfer Mode (ATM) network. This mobile wireless ATM network is part of the Rapidly Deployable Radio Network (RDRN). The orderwire system consists of a packet radio network which overlays the mobile wireless ATM network, each network element in this network uses Global Positioning System (GPS) information to control a beamforming antenna subsystem which provides for spatial reuse. This paper also proposes a novel Virtual (...) Network Configuration (VNC) algorithm for predictive network configuration. A mobile ATM Private Network-Network Interface (PNNI) based on VNC is also discussed. Finally, as a prelude to the system implementation, results of a Maisie simulation of the orderwire system are discussed. (shrink)
Guidelines advise that x-rays do not contribute to the clinical management of simple nasal fractures. However, in cases of simple nasal fracture secondary to assault, a facial x-ray may provide additional legal evidence should the victim wish to press charges, though there is no published guidance. We examine the ethical and medico-legal issues surrounding this controversial area.
Here I review the essays by McDowell, Dreyfus, and many others edited by Schear for "The McDowell/Dreyfus Debate". Topics include the relation between conceptuality and "non-conceptual content", the role of embodied coping in human life, the extent of continuity and discontinuity between humans and other animals, and the legacies of German Idealism and phenomenology.
We give two new characterizations of K-triviality. We show that if for all Y such that Ω is Y-random, Ω is -random, then A is K-trivial. The other direction was proved by Stephan and Yu, giving us the first titular characterization of K-triviality and answering a question of Yu. We also prove that if A is K-trivial, then for all Y such that Ω is Y-random, ≡LRY. This answers a question of Merkle and Yu. The other direction is immediate, so (...) we have the second characterization of K-triviality.The proof of the first characterization uses a new cupping result. We prove that if A≰LRB, then for every set X there is a B-random set Y such that X is computable from Y⊕A. (shrink)
We call A weakly low for K if there is a c such that $K^A(\sigma)\geq K(\sigma)-c$ for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K if and only if Chaitin's Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity of 2-random reals is infinitely (...) often maximal. This had previously been proved for plain Kolmogorov complexity. (shrink)
Bart Pattyn: Needless to say, we are more than pleased with the willingness of Michael Walzer to be here in Leuven. After the stimulating lecture yesterday we now have the opportunity to pose some questions to Michael Walzer in the same room where we talked with his friend, Harry Frankfurt, as well as with Bernard Williams. I have asked Professor Selling to moderate this discussion which I am sure he will do with a firm hand.Joseph Selling: We have two (...) papers which Prof. Walzer, and many of you, have read in advance. Perhaps we can take the questions from the authors of those papers and then take other questions. (shrink)