Search results for " Computer science"
showing 10 items of 3983 documents
IP-XACT and MARTE based approach for partially reconfigurable systems-on-chip.
2011
International audience; Dynamic Partial Reconfiguration (DPR) has been introduced in recent years as a method to increase the flexibility of FPGA designs. However, using DPR for building complex systems remains a daunting task. Recently, approaches based on MDE and UML MARTE standard have emerged which aim to simplify the design of complex SoCs. Moreover, with the recent standardization of the IP-XACT specification, there is an increasing interest to use it in MDE methodologies to ease system integration and to enable design flow automation. In this paper we propose an MARTE/MDE approach which exploits the capabilities of IP-XACT to model and automatically generate DPR SoC designs. In parti…
High-Level Modeling and Automatic Generation of Dynamically Reconfigurable Systems
2011
International audience; Dynamic Partial Reconfiguration (DPR) has been introduced in recent years as a method to increase the flexibility of FPGA designs. However, using DPR for building complex systems remains a daunting task. Recently, approaches based on MDE and UML MARTE standard have emerged which aim to simplify the design of complex SoCs. Moreover, with the recent standardization of the IP-XACT specification, there is an increasing interest to use it in MDE methodologies to ease system integration and to enable design flow automation. In this paper we propose an MARTE/MDE approach which exploits the capabilities of IP-XACT to model and automatically generate DPR SoC designs. In parti…
A New Development Framework for Multi-Core Processor based Smart-Camera Implementations
2015
International audience; The exponential evolution of the smart camera processing performances is directly linked to the improvements on hardware processing elements. Nowadays, high processing performances can be reached considering hardware targets which enables a high level of task parallelism to be implemented. Highly regular tasks are good candidate for a reconfigurable logic implementation and less regular parts of the algorithm could be described on the processor. Meanwhile the prototyping time is related to the selected target and the associated development methodology. The implementation on reconfigurable logic is highly efficient in exploiting the intrinsic task parallelism neverthe…
Optimised spatio-temporal descriptors for real-time fall detection : comparison of SVM and Adaboost based classification
2013
International audience; We propose a supervised approach to detect falls in home environment using an optimized descriptor adapted to real-time tasks. We introduce a realistic dataset of 222 videos, a new metric allowing to evaluate fall detection performance in a video stream, and an automatically optimized set of spatio-temporal descriptors which fed a supervised classifier. We build the initial spatio-temporal descriptor named STHF using several combinations of transformations of geometrical features (height and width of human body bounding box, the user's trajectory with her/his orientation, projection histograms, and moments of orders 0, 1, and 2). We study the combinations of usual tr…
Understanding the human behaviors in dynamic urban areas of interest
2020
International audience; The fast growth of urban populations across evolving cities is resulting in new types of technical, physical, material, and safety-related challenges and constraints (Chen et al. 2019). Humans perceive, move, and perform actions (called behaviors) in different urban areas, and make interactions with the objects, the other humans, and the environment for achieving their goals for attaining the desired level of satisfaction (Wagner et al., 2018; Chen et al., 2015). More formally, human behaviors are observable actions or reactions of humans in response to external or internal stimuli (Wagner et al., 2018; Hong et al., 2015; Yan et al., 2015). Over the last decade, huma…
Automated detection of contextuality proofs with intermediate numbers of observables
2021
<div style=""><font face="arial, helvetica"><span style="font-size: 13px;">Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality </span></font><span style="font-size: 13px; font-family: arial, helvetica;">proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the</span></div><div style=""><font face="arial, helvetica"><span style="font-size: 13px;">contextuality property as the absence of solutions to a linear system. Then we explain why </span></font><span style="font-size: 13px; font-family: arial, helvetica…
A Route toward Protein Sequencing using Solid-State Nanopores Assisted by Machine Learning
2022
Solid-State Nanopores made of 2-D materials such as MoS2 have emerged as one of the most versatile sensors for single-biomolecule detection, which is essential for early disease diagnosis (biomarker detection). One of the most promising applications of SSN is DNA and protein sequencing, at a low cost and faster than the current standard methods. The detection principle relies on measuring the relatively small variations of ionic current as charged biomolecules immersed in an electrolyte traverse the nanopore, in response to an external voltage applied across the membrane. The passage of a biomolecule through the pore yields information about its structure and chemical properties, as demonst…
Computer-assisted enumeration and classification of multi-qubit doilies
2022
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.