Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Use of the Normalized Absorbance Ratio as an Internal Standardization Approach To Minimize Measurement Error in Enzyme-Linked Immunosorbent Assays for Diagnosis of Human Papillomavirus Infection

The serological detection of antibodies against human papillomavirus (HPV) antigens is a useful tool to determine exposure to genital HPV infection and in predicting the risk of infection persistence and associated lesions. Enzyme-linked immunosorbent assays (ELISAs) are commonly used for seroepidemiological studies of HPV infection but are not standardized. Intra-and interassay performance variation is difficult to control, especially in cohort studies that require the testing of specimens over extended periods. We propose the use of normalized absorbance ratios (NARs) as a standardization procedure to control for such variations and minimize measurement error. We compared NAR and ELISA optical density (OD) values for the strength of the correlation between serological results for paired visits 4 months apart and HPV-16 DNA positivity in cervical specimens from a cohort investigation of 2,048 women tested with an ELISA using HPV-16 virus-like particles. NARs were calculated by dividing the mean blank-subtracted (net) ODs by the equivalent values of a control serum pool included in the same plate in triplicate, using different dilutions. Stronger correlations were observed with NAR values than with net ODs at every dilution, with an overall reduction in nonexplained regression variability of 39%. Using logistic regression, the ranges of odds ratios of HPV-16 DNA positivity contrasting upper and lower quintiles at different dilutions and their averages were 4.73 to 5.47 for NARs and 2.78 to 3.28 for net ODs, with corresponding significant improvements in seroreactivity-risk trends across quintiles when NARs were used. The NAR standardization is a simple procedure to reduce measurement error in seroepidemiological studies of HPV infection.

Bounds on contact interactions from LEP1 data and high-Q2 HERA events

A contact four-fermion interaction between light quarks and electrons has been evoked as a possible explanation for the excess of events observed by HERA at high-Q2. We explore the 1-loop effects of such interaction in Γ(Z0 → e+e-) measured at LEP and impose strong bounds on the lower limit of the effective scale. Our results are able to discard some of the contact interactions as possible explanation for the HERA events. © 1997 Elsevier Science B.V.

Bounds on Higgs and gauge-boson interactions from LEP2 data

We derive bounds on Higgs and gauge-boson anomalous interactions using the LEP2 data on the production of three photons and photon pairs in association with hadrons. In the framework of SU(2)L ⊗ U(1)Y effective Lagrangians, we examine all dimension-six operators that lead to anomalous Higgs interactions involving γ and Z. The search for Higgs boson decaying to γγ pairs allow us to obtain constrains on these anomalous couplings that are comparable with the ones originating from the analysis of pp̄ collisions at the Tevatron. Our results also show that if the coefficients of all blind operators are assumed to have the same magnitude, the indirect constraints on the anomalous couplings obtained from this analysis, for Higgs masses MH ≲ 140 GeV, are more restrictive than the ones coming from the W+W- production. © 1998 Elsevier Science B.V. All rights reserved.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

A study on human error in the interaction with the computer systems

The term human factor is used by professionals of various fields meant for understanding the behavior of human beings at work. The human being, while developing a cooperative activity with a computer system, is subject to cause an undesirable situation in his/her task. This paper starts from the principle that human errors may be considered as a cause or factor contributing to a series of accidents and incidents in many diversified fields in which human beings interact with automated systems. We propose a simulator of performance in error with potentiality to assist the Human Computer Interaction (HCI) project manager in the construction of the critical systems. © 2011 Springer-Verlag.

Evaluacion y correccion de datos demograficos. I. Conceptos basicos. II. El error en las estadisticas demograficas

Capítulos de este documento disponibles separadamente (3611.00, 4912.00 y 3336.00)

Mensajes de error del compilador WATFOR

El documento contiene una lista de errores detectados por el compilador WATFOR/360

Particle competition and cooperation to prevent error propagation from mislabeled data in semi-supervised learning

Semi-supervised learning is applied to classification problems where only a small portion of the data items is labeled. In these cases, the reliability of the labels is a crucial factor, because mislabeled items may propagate wrong labels to a large portion or even the entire data set. This paper aims to address this problem by presenting a graph-based (network-based) semi-supervised learning method, specifically designed to handle data sets with mislabeled samples. The method uses teams of walking particles, with competitive and cooperative behavior, for label propagation in the network constructed from the input data set. The proposed model is nature-inspired and it incorporates some features to make it robust to a considerable amount of mislabeled data items. Computer simulations show the performance of the method in the presence of different percentage of mislabeled data, in networks of different sizes and average node degree. Importantly, these simulations reveals the existence of the critical points of the mislabeled subset size, below which the network is free of wrong label contamination, but above which the mislabeled samples start to propagate their labels to the rest of the network. Moreover, numerical comparisons have been made among the proposed method and other representative graph-based semi-supervised learning methods using both artificial and real-world data sets. Interestingly, the proposed method has increasing better performance than the others as the percentage of mislabeled samples is getting larger. © 2012 IEEE.

Error estimates for a neumann problem in highly oscillating thin domains

In this work we analyze the convergence of solutions of the Poisson equation with Neumann boundary conditions in a two-dimensional thin domain with highly oscillatory behavior. We consider the case where the height of the domain, amplitude and period of the oscillations are all of the same order, and given by a small parameter e > 0. Using an appropriate corrector approach, we show strong convergence and give error estimates when we replace the original solutions by the first-order expansion through the Multiple-Scale Method.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

Informação quântica e relatividade

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Desenvolvimento regional e meio ambiente: desafios para a construção da região metropolitana de Bogotá (Colômbia)

Pós-graduação em Geografia - IGCE

Convergence Property of the Measurement Gross Error Correction in Power System State Estimation, Using Geometrical Background

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)