Search results for " computing"
showing 10 items of 2075 documents
Neurobiological roots of language in primate audition : common computational properties
2015
Here, we present a new perspective on an old question: how does the neurobiology of human language relate to brain systems in nonhuman primates? We argue that higher-order language combinatorics, including sentence and discourse processing, can be situated in a unified, cross-species dorsal-ventral streams architecture for higher auditory processing, and that the functions of the dorsal and ventral streams in higher-order language processing can be grounded in their respective computational properties in primate audition. This view challenges an assumption, common in the cognitive sciences, that a nonhuman primate model forms an inherently inadequate basis for modeling higher-level language…
A real-time non-intrusive FPGA-based drowsiness detection system
2011
Automotive has gained several benefits from the Ambient Intelligent researches involving the deployment of sensors and hardware devices into an intelligent environment surrounding people, meeting users’ requirements and anticipating their needs. One of the main topics in automotive is to anticipate driver needs and safety, in terms of preventing critical and dangerous events. Considering the high number of caused accidents, one of the most relevant dangerous events affecting driver and passengers safety is driver’s drowsiness and hypovigilance. This paper presents a low-intrusive, real-time driver’s drowsiness detection system for common vehicles. The proposed system exploits the ‘‘bright p…
A novel methodology for accelerating bitstream relocation in partially reconfigurable systems
2012
International audience; Xilinx Virtex FPGAs offer the possibility of Partial Reconfiguration (PR). Arbitrary tasks can be allocated and de-allocated onto FPGA without system interruption. However, mapping a task to any available PR region requires a unique partial bitstream for each partition, hence reducing memory storage requirements. In recent years, an interest on overcoming this problem has lead to the concept of Partial Bitstream Relocation (PBR). The principle is to perform bitstream modification to map it to different regions. However, PBR consumes scarce resources in hardware implementations, and introduces a prohibitive time overhead when done in software. In order to find the bes…
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.
Lifespan-Aware Routing for Wireless Sensor Networks
2010
Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
A flexible and tunable route discovery mechanism for on-demand protocols
2004
Mobile ad-hoc networks are characterized by multihop wireless links and absence of cellular infrastructure. For the last years, routing has been the area under most intensive research. In particular, on-demand routing protocols proposed are extremely attractive due to their low-overhead and efficiency. Currently, wireless ad-hoc networks lack multipath routing protocols. Multipath routing enables increased QoS support, load balancing and enhanced route stability. In this paper we present a new route discovery solution that increases the number of routes found, while reducing the routing overhead when compared to previous proposals. Simulation results show that the additional routing overhea…
Optimal Usage of Multiple Network Connections
2008
In the future mobile networks, a mobile terminal is able to select the best suitable network for each data transmission. The selection of a network connection to be used has been under a lot of study. In this paper, we consider a more extensive case in which we do not select a network connection but use several network connections simultaneously to transfer data. When data is transferred using multiple network connections, a network connection has to be selected for each component of the data. We have modelled this problem as a multiobjective optimization problem and developed a heuristic to solve the problem fast in a static network environment. In this paper, we discuss solving the proble…
Accelerating short read mapping on an FPGA (abstract only)
2012
The explosive growth of short read datasets produced by high throughput DNA sequencing technologies poses a challenge to the mapping of short reads to a reference genome in terms of sensitivity and execution speed. Existing methods often use a restrictive error model for computing the alignments to improve speed, whereas more flexible error models are generally too slow for large-scale applications. Although a number of short read mapping software tools have been proposed, designs based on hardware are relatively rare. In this paper, we present a hybrid system for short read mapping utilizing both software and field programmable gate array (FPGA)-based hardware. The compute intensive semi-g…