Institution
INESC-ID
Nonprofit•Lisbon, Portugal•
About: INESC-ID is a nonprofit organization based out in Lisbon, Portugal. It is known for research contribution in the topics: Field-programmable gate array & Control theory. The organization has 932 authors who have published 2618 publications receiving 37658 citations.
Topics: Field-programmable gate array, Control theory, Adaptive control, Model predictive control, Machine translation
Papers published on a yearly basis
Papers
More filters
••
12 Dec 2005TL;DR: In this paper, an adaptive receding horizon control algorithm for a distributed collector solar field is presented, being described by a nonlinear hyperbolic partial differential equation (PDE) which models the temperature dynamics.
Abstract: This paper presents an adaptive receding horizon control algorithm for a distributed collector solar field which explicitly explores its distributed parameter character The plant considered is a distributed collector solar field, being described by a nonlinear hyperbolic partial differential equation (PDE) which models the temperature dynamics A lumped parameter model is obained by applying Orthogonal Collocation This model is then used as a basis for controller design Stability is ensured for the lumped parameter model by resorting to Control Lyapunov function methods Simulation results using a detailed physically based simulator of the solar field are provided
32 citations
••
TL;DR: This paper significantly extends previous error taxonomies so that translation errors associated with Romance language specificities can be accommodated and carries out an extensive analysis of the errors generated by four different systems.
Abstract: A detailed error analysis is a fundamental step in every natural language processing task, as to be able to diagnose what went wrong will provide cues to decide which research directions are to be followed. In this paper we focus on error analysis in Machine Translation (MT). We significantly extend previous error taxonomies so that translation errors associated with Romance language specificities can be accommodated. Furthermore, based on the proposed taxonomy, we carry out an extensive analysis of the errors generated by four different systems: two mainstream online translation systems Google Translate (Statistical) and Systran (Hybrid Machine Translation), and two in-house MT systems, in three scenarios representing different challenges in the translation from English to European Portuguese. Additionally, we comment on how distinct error types differently impact translation quality.
32 citations
••
TL;DR: In this article, a set of planar trapezoidal coils were used to detect sub-millimetre defects with any orientation on the inner surface of pipes, and five different probes were designed, produced and experimentally validated.
Abstract: Novel eddy current probes were developed to detect sub-millimetre defects with any orientation on the inner surface of pipes. Five different probes were designed, produced and experimentally validated. These probes include arrays of planar trapezoidal coils in a flexible substrate used alone or together with different winded drive coils. Numerical simulations with Finite Element Method were used to predict the probe response to defects with any orientation. Experimental results in austenitic steel jackets used in ITER revealed that the new probes have an improved reliability compared to conventional toroidal bobbin probes, allowing a higher sensitivity to circumferential defects.
32 citations
01 Jan 2003
TL;DR: In this article, the spectral parameters obtained by frequency filtering (FF) of the logarithmic filter-bank energies (logFBEs) have been compared with the MFCCs and the Rasta-PLP features using both a hybrid HMM/MLP and a usual HMM-GMM recognition system, for both clean and noisy speech.
Abstract: Recently, the advantages of the spectral parameters obtained by frequency filtering (FF) of the logarithmic filter-bank energies (logFBEs) have been reported. These parameters, which are frequency derivatives of the lofFBEs, lie in the frequency domain, and have shown good recognition performance with repect to the conventional MFCCs for HMM systems. In this paper, the FF features are first compared with the MFCCs and the Rasta-PLP features using both a hybrid HMM/MLP and a usual HMM/GMM recognition system, for both clean and noisy speech. Taking advantage of the ability of the hybrid system to deal with correlated features, the inclusion of both the frequency second-derivatives and the raw logFBes as additional features is proposed and tested. Moreover, the robustness of these features in noisy conditions is enhanced by combining the FF technique with the Rasta temporal filtering approach. Finally, a study of the FF features in the framework of multi-stram processing is presented. The best recognition results for both clean and noisy speech are obtained from the multi-stream combination of the J-Rasta-PLP features and the FF features.
32 citations
••
26 Oct 2021TL;DR: Kauri as discussed by the authors is a BFT communication abstraction that can sustain high throughput as the system size grows, leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees.
Abstract: With the growing commercial interest in blockchains, permissioned implementations have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. Many state-of-the-art algorithms require a single leader process to receive and validate votes from a quorum of processes and then broadcast the result, which is inherently non-scalable. Recent approaches avoid this bottleneck by using dissemination/aggregation trees to propagate values and collect and validate votes. However, the use of trees increases the round latency, which ultimately limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that can sustain high throughput as the system size grows, leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Our evaluation shows that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, such as HotStuff, by up to 28x. Interestingly, in many scenarios, the parallelization provided by Kauri can also decrease the latency.
32 citations
Authors
Showing all 967 results
Name | H-index | Papers | Citations |
---|---|---|---|
João Carvalho | 126 | 1278 | 77017 |
Jaime G. Carbonell | 72 | 496 | 31267 |
Chris Dyer | 71 | 240 | 32739 |
Joao P. S. Catalao | 68 | 1039 | 19348 |
Muhammad Bilal | 63 | 720 | 14720 |
Alan W. Black | 61 | 413 | 19215 |
João Paulo Teixeira | 60 | 636 | 19663 |
Bhiksha Raj | 51 | 359 | 13064 |
Joao Marques-Silva | 48 | 289 | 9374 |
Paulo Flores | 48 | 321 | 7617 |
Ana Paiva | 47 | 472 | 9626 |
Miadreza Shafie-khah | 47 | 450 | 8086 |
Susana Cardoso | 44 | 400 | 7068 |
Mark J. Bentum | 42 | 226 | 8347 |
Joaquim Jorge | 41 | 290 | 6366 |