Sensory information entering the nervous system follows independent paths of processing such that specific features are individually detected. However, sensory perception, awareness, and cognition emerge from the combination of information. Here we have analyzed the corticocortical network of the cat, looking for the anatomical substrate which permits the simultaneous segregation and integratio...

In the face of renewed interest in High-Speed Rail (HSR) projects, Ohio is one of several states seeking federal funding to relieve pressure on aging, overburdened highway infrastructure by constructing passenger rail routes between major cities. This paper evaluates the creation of a new rail route in Ohio’s 3-C Corridor utilizing GIS. The authors consider two primary cost factors in construct...

Once a baseline level of full automation is possible for an Automated Highway System, there are numerous choices to be made in deploying enhanced capabilities to improve safety, throughput, and travel time. Identifying a set of orthogonal capabilities enables describing multiple deployment paths within a common framework. Sixteen AHS configurations can be formed from a proposed set of orthogona...

This paper presents an integrated approach to mobile robot path planning by combining grid-map based and case-based methods. The map-based path planner is used to suggest new innovative solutions for a particular path planning problem. A probabilistic path transform method is introduced for grid-map based path planning which proposes several alternative solutions for a single path planning prob...

We present a new end-to-end transport protocol called Multipath Transmission Control Protocol (M/TCP) and its robust acknowledgement (ACK) schemes. M/TCP is designed as an alternative TCP option to improve reliability and performance of today’s Internet. M/TCP allows a sender to simultaneously transmit data via multiple controlled paths to the same destination. The protocol requires no modifica...

Worst-case execution time (WCET) analysis of real-time code needs to be performed on the executable binary code for soundness. Obtaining tight WCET bounds requires determination of loop bounds and elimination of infeasible paths. The binary code, however, lacks information necessary to determine these bounds. This information is usually provided through manual intervention, or preserved in the ...

The project The Forking Paths aims to create a set of interactive cinematographic narratives, within an applied research that seeks to transfer the spectator from an extradiegetic level to an intradiegetic level, creating a metalepsis. The intention is, above all, to analyze the possibilities of the spectator’s identification as the main character, by the manipulation of the idea of time in Cin...

Currently Open Shortest Path First (OSPF) is the most commonly used and promising intra-domain internet routing protocol where packets are routed along shortest paths to the destination. The shortest path computation is based on some static link costs and the change of the paths only happens when existing link components become unreachable or when new link components are added. In other words, ...

Internet applications that route data over default Internet paths can often increase performance by sending their traffic over alternative “detour” paths. Previous work has shown that applications can use detour routing to improve end-to-end metrics such as latency and path availability. However, the potential of detour routing has yet to be applied where it may be most important: improving TCP...

Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic ...