Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by LIAAD

2010

Time Domain BRS Estimation: Least Squares versus Quantile Regression

Authors
Gouveia, S; Rocha, C; Rocha, AP; Silva, ME;

Publication
COMPUTING IN CARDIOLOGY 2010, VOL 37

Abstract
The BRS can be quantified as the slope between SBP and RR values identified in baroreflex events, estimated by ordinary least squares (OLS) minimization. Quantile regression (QR) is a more robust procedure than OLS and allows a more complete characterization of the data, by estimating conditional functions for different quantiles of interest. In this work, OLS and QR for BRS estimation are compared regarding slope estimates and dispersion. The EuroBaVar results indicate that OLS slope and QR slopes at different quantiles do not exhibit significant differences. Also, OLS and QR slopes require similar number of beats to achieve a given BRS precision in stationary recordings. Finally, BRS estimated with OLS exhibit relative dispersion lower than 10% and 5% when computed from stationary recordings of approximately 3 and 9 minutes length, respectively.

2010

A Branch and Bound Approach for Truss Topology Design Problems with Valid Inequalities

Authors
Cerveira, A; Agra, A; Bastos, F; Varum, H; Simos, TE; Psihoyios, G; Tsitouras, C;

Publication
NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III

Abstract
One of the classical problems in the structural optimization field is the Truss Topology Design Problem (TTDP) which deals with the selection of optimal configuration for structural systems for applications in mechanical, civil, aerospace engineering, among others. In this paper we consider a TTDP where the goal is to find the stiffest truss, under a given load and with a bound on the total volume. The design variables are the cross-section areas of the truss bars that must be chosen from a given finite set. This results in a large-scale non-convex problem with discrete variables. This problem can be formulated as a Semidefinite Programming Problem (SDP problem) with binary variables. We propose a branch and bound algorithm to solve this problem. In this paper it is considered a binary formulation of the problem, to take advantage of its structure, which admits a Knapsack problem as subproblem. Thus, trying to improve the performance of the Branch and Bound, at each step, some valid inequalities for the Knapsack problem are included.

2010

Formulations for the Weight-Constrained Minimum Spanning Tree Problem

Authors
Requejo, C; Agra, A; Cerveira, A; Santos, E; Simos, TE; Psihoyios, G; Tsitouras, C;

Publication
NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III

Abstract
We consider the Weight-constrained Minimum Spanning Tree problem (WMST). The WMST aims at finding a minimum spanning tree such that the overall tree weight does not exceed a specified limit on a graph with costs and weights associated with each edge. We present and compare, from the computational point of view, several formulations for the WMST. From preliminary computational results we propose a model that combines a formulation similar to the well known Miller-Tucker-Zemlin formulation with the cut-set inequalities.

2010

Automatic identification of drops in images of agitated liquid-liquid dispersion

Authors
Gomes, EF; Bras, LMR; Ribeiro, MMM;

Publication
International Journal of Imaging

Abstract
In this paper we present an algorithm that identifies circular drops of different sizes in monochromatic digitized frames of a liquid-liquid chemical process. These image frames were obtained at our Laboratory, using a non-intrusive process, with a digital video camera, a microscope, and an illumination setup from a dispersion of toluene in water within a transparent mixing vessel. Here we describe in detail the two-phase approach used for the automatic identification of the drops in images of the chemical process, which employs a Hough transform. Empirical evaluation on an independent set of images shows promising results for the automatic classification of the drops. Copyright © 2010 by IJI (CESER Publications).

2010

Mitotic cell-cycle progression is regulated by CPEB1 and CPEB4-dependent translational control

Authors
Novoa, I; Gallego, J; Ferreira, PG; Mendez, R;

Publication
NATURE CELL BIOLOGY

Abstract
Meiotic and early-embryonic cell divisions in vertebrates take place in the absence of transcription and rely on the translational regulation of stored maternal messenger RNAs. Most of these mRNAs are regulated by the cytoplasmic-polyadenylation-element-binding protein (CPEB), which mediates translational activation and repression through cytoplasmic changes in their poly(A) tail length. It was unknown whether translational regulation by cytoplasmic polyadenylation and CPEB can also regulate mRNAs at specific points of mitotic cell-cycle divisions. Here we show that CPEB-mediated post-transcriptional regulation by phase-specific changes in poly(A) tail length is required for cell proliferation and specifically for entry into M phase in mitotically dividing cells. This translational control is mediated by two members of the CPEB family of proteins, CPEB1 and CPEB4. We conclude that regulation of poly(A) tail length is not only required to compensate for the lack of transcription in specialized cell divisions but also acts as a general mechanism to control mitosis.

2010

Innovational Outliers in INAR(1) Models

Authors
Barczy, M; Ispany, M; Pap, G; Scotto, M; Silva, ME;

Publication
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS

Abstract
We consider integer-valued autoregressive models of order one contaminated with innovational outliers. Assuming that the time points of the outliers are known but their sizes are unknown, we prove that Conditional Least Squares (CLS) estimators of the offspring and innovation means are strongly consistent. In contrast, CLS estimators of the outliers' sizes are not strongly consistent. We also prove that the joint CLS estimator of the offspring and innovation means is asymptotically normal. Conditionally on the values of the process at time points preceding the outliers' occurrences, the joint CLS estimator of the sizes of the outliers is asymptotically normal.

  • 428
  • 513