In response to the occurrence of an air incident, controllers at one of the three Canadian Rescue Coordination Centers (RCC) must make a series of critical decisions on the appropriate procedures to follow. These procedures (called incident prosecution) include hypotheses formulation and information gathering, development of a plan for the search and rescue (SAR) missions and in the end, the ge...

This study analyzed the fundamental geometric and kinematic characteristics of the swing hub path of the golf shot for four diverse subjects. In addition, the role of the hub path geometry in transferring the kinetic quantities from the golfer to the club were investigated. The hub path was found to have a complex geometry with significantly changing radii, and a constantly moving center-of-cur...

Emerging data-center network designs seek to provide physical topologies with high bandwidth, large bisection capacities, and many alternative data paths. Yet, existing protocols present a one-size-fits-all approach for forwarding packets. Traditionally, the routing process chooses one “best” route for each end-point pair. While some modern protocols support multiple paths through techniques li...

Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We evaluate the feasibility of using multiple independent cores within a shared multicast tree. We consider several basic designs and discuss how using multiple cores improves fault tolerance without sacrificing router state. We exa...

DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches. With one exception, we prove that a k level DCell built with n port switches is Hamiltonian-connected for k ≥ 0 and n ≥ 2. Our proof extends to all generalized DCell connection rules for n ≥ 3. Then, we...

We consider a Jackson-type network, each of whose nodes contains N identical channels with a single server. Upon arriving at a node, a task selects m of the channels at random, and enters the one with the shortest queue. We provide stochastic bounds for the distribution of the state of the network in terms of the behaviour of independent nodes of the same type. The bounds are asymptotically tig...

Optimal algorithms are derived for safisficing problem-solving search, that is, search where the goal is to reach any. solution, no distinction being made among differ-ent solutions. This task is quite different from search for best solutions or shortest path solutions. L:onstraints mav be placed on the order in which sittes may be searched. This paper treats salisficing searches through partia...