Search results for "Hard"
showing 10 items of 2294 documents
MAC-Engine
2011
In this demo, we prove that the flexibility supported by off-the-shelf IEEE 802.11 hardware can be significantly extended if we move the control of the MAC programming interface from the driver to the firmware, i.e. from the host CPU to the card CPU. To this purpose, we introduce the concept of MAC--Engine, that is an executor of Programmable Finite State Machines (PFSM) implemented at the firmware level: we show how the card itself can support different protocol logics thanks to PFSM bytecode representations that can be dynamically injected inside the card memory at run-time without incurring in down time issues or network disconnect events. We provide different PFSM examples in order to t…
Predictions for Cold Nuclear Matter Effects in $p+$Pb Collisions at $\sqrt{s_{_{NN}}} = 8.16$ TeV
2017
Predictions for cold nuclear matter effects on charged hadrons, identified light hadrons, quarkonium and heavy flavor hadrons, Drell-Yan dileptons, jets, photons, gauge bosons and top quarks produced in $p+$Pb collisions at $\sqrt{s_{_{NN}}} = 8.16$ TeV are compiled and, where possible, compared to each other. Predictions of the normalized ratios of $p+$Pb to $p+p$ cross sections are also presented for most of the observables, providing new insights into the expected role of cold nuclear matter effects. In particular, the role of nuclear parton distribution functions on particle production can now be probed over a wider range of phase space than ever before.
Interpretation of Ocular Melanin Drug Binding Assays. Alternatives to the Model of Multiple Classes of Independent Sites
2016
Melanin has a high binding affinity for a wide range of drugs. The determination of the melanin binding capacity and its binding affinity are important, e.g., in the determination of the ocular drug distribution, the prediction of drug effects in the eye, and the trans-scleral drug delivery. The binding parameters estimated from a given data set vary significantly when using different isotherms or different nonlinear fitting methods. In this work, the commonly used bi-Langmuir isotherm, which assumes two classes of independent sites, is confronted with the Sips isotherm. Direct, log-log, and Scatchard plots are used, and the interpretation of the binding curves in the latter is critically a…
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…
Logic-Based Distributed Routing for NoCs
2008
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are usually proposed for NoCs, heterogeneous cores, manufacturing defects, hard failures, and chip virtualization may lead to irregular topologies. In this context, efficient routing becomes a challenge. Although switches can be easily configured to support most routing algorithms and topologies by using routing tables, this solution does not scale in terms of latency and area. We propose a new circuit that removes the need for using routing tables. The new mechanism, referred to as logic-based dis…
The Capacitated Arc Routing Problem: Lower bounds
1992
In this paper, we consider the Capacitated Arc Routing Problem (CARP), in which a fleet of vehicles, based on a specified vertex (the depot) and with a known capacity Q, must service a subset of the edges of a graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. New lower bounds are developed for this problem, producing at least as good results as the already existing ones. Three of the proposed lower bounds are obtained from the resolution of a minimum cost perfect matching problem. The fourth one takes into account the vehicle capacity and is computed using a dynamic programming algorithm. Computational results, in which these bounds…
A distributed dynamic load balancer and its implementation on multi-transputer systems for molecular dynamics simulation
1990
Abstract A new and efficient approach is described to the dynamic load-balancing problem which is central in concurrent computing. A transputer-based implementation is tested on a molecular dynamics simulation of spinodal phase separation.
An Intelligent Sensor for Fingerprint Recognition
2005
In this paper an intelligent sensor for fingerprint recognition is proposed. The sensor has the objective to overcome some limits of the fingerprint recognition software systems, as elaboration time and security issues related to fingerprint transmission between sensor and processing unit. Intelligent sensor has been prototyped using the Hamster Secugen sensor for image acquisition and the Celoxica RC1000 board, employing a Xilinx VirtexE2000 FPGA, for image processing and analysis. Resources used, elaboration time as well the recognition rates in both verification and identification modes are reported in the paper. To the best of our knowledge, this is the first implementation for a full h…
Massive evaluation and analysis of Poincar�� recurrences on grids of initial data: a tool to map chaotic diffusion
2020
We present a novel numerical method aimed to characterize global behaviour, in particular chaotic diffusion, in dynamical systems. It is based on an analysis of the Poincar\'e recurrence statistics on massive grids of initial data or values of parameters. We concentrate on Hamiltonian systems, featuring the method separately for the cases of bounded and non-bounded phase spaces. The embodiments of the method in each of the cases are specific. We compare the performances of the proposed Poincar\'e recurrence method (PRM) and the custom Lyapunov exponent (LE) methods and show that they expose the global dynamics almost identically. However, a major advantage of the new method over the known g…
"Table 2" of "Study of the Leptonic Decays of the $Z^0$ Boson"
1990
No t-channel subtraction. Statistical errors only.