9 resultados para Delay Vector Variance Method (DVV)

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

100.00% 100.00%

Publicador:

Resumo:

We present a simultaneous optical signal-to-noise ratio (OSNR) and differential group delay (DGD) monitoring method based on degree of polarization (DOP) measurements in optical communications systems. For the first time in the literature (to our best knowledge), the proposed scheme is demonstrated to be able to independently and simultaneously extract OSNR and DGD values from the DOP measurements. This is possible because the OSNR is related to maximum DOP, while DGD is related to the ratio between the maximum and minimum values of DOP. We experimentally measured OSNR and DGD in the ranges from 10 to 30 dB and 0 to 90 ps for a 10 Gb/s non-return-to-zero signal. A theoretical analysis of DOP accuracy needed to measure low values of DGD and high OSNRs is carried out, showing that current polarimeter technology is capable of yielding an OSNR measurement within 1 dB accuracy, for OSNR values up to 34 dB, while DGD error is limited to 1.5% for DGD values above 10 ps. For the first time to our knowledge, the technique was demonstrated to accurately measure first-order polarization mode dispersion (PMD) in the presence of a high value of second-order PMD (as high as 2071 ps(2)). (C) 2012 Optical Society of America

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A simple and sensitive analytical method for simultaneous determination of anastrozole, bicalutamide, and tamoxifen as well as their synthetic impurities, anastrozole pentamethyl, bicalutamide 3-fluoro-isomer, and tamoxifen e-isomer, was developed and validated by using high performance liquid chromatography (HPLC). The separation was achieved on a Symmetry (R) C-8 column (100 x 4.6 mm i.d., 3.5 mu m) at room temperature (+/- 24 degrees C), with a mobile phase consisting of acetonitrile/water containing 0.18% N,N dimethyloctylamine and pH adjusted to 3.0 with orthophosphoric acid (46.5/53.5, v/v) at a flow rate of 1.0 mL min(-1) within 20 min. The detection was made at a wavelength of 270 nm by using ultraviolet (UV) detector. No interference peaks from excipients and relative retention time indicated the specificity of the method. The calibration curve showed correlation coefficients (r) > 0.99 calculated by linear regression and analysis of variance (ANOVA). The limit of detection (LOD) and limit of quantitation (LOQ), respectively, were 2.2 and 6.7 mu g mL(-1) for anastrozole, 2.61 and 8.72 mu g mL(-1) for bicalutamide, 2.0 and 6.7 mu g mL(-1) for tamoxifen, 0.06 and 0.22 mu g mL(-1) for anastrozole pentamethyl, 0.02 and 0.07 mu g mL(-1) for bicalutamide 3-fluoro-isomer, and 0.002 and 0.007 mu g mL(-1) for tamoxifen e-isomer. Intraday and interday relative standard deviations (RSDs) were <2.0% (drugs) and <10% (degradation products) as well as the comparison between two different analysts, which were calculated by f test. (C) 2012 Elsevier B.V. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Background: In the analysis of effects by cell treatment such as drug dosing, identifying changes on gene network structures between normal and treated cells is a key task. A possible way for identifying the changes is to compare structures of networks estimated from data on normal and treated cells separately. However, this approach usually fails to estimate accurate gene networks due to the limited length of time series data and measurement noise. Thus, approaches that identify changes on regulations by using time series data on both conditions in an efficient manner are demanded. Methods: We propose a new statistical approach that is based on the state space representation of the vector autoregressive model and estimates gene networks on two different conditions in order to identify changes on regulations between the conditions. In the mathematical model of our approach, hidden binary variables are newly introduced to indicate the presence of regulations on each condition. The use of the hidden binary variables enables an efficient data usage; data on both conditions are used for commonly existing regulations, while for condition specific regulations corresponding data are only applied. Also, the similarity of networks on two conditions is automatically considered from the design of the potential function for the hidden binary variables. For the estimation of the hidden binary variables, we derive a new variational annealing method that searches the configuration of the binary variables maximizing the marginal likelihood. Results: For the performance evaluation, we use time series data from two topologically similar synthetic networks, and confirm that our proposed approach estimates commonly existing regulations as well as changes on regulations with higher coverage and precision than other existing approaches in almost all the experimental settings. For a real data application, our proposed approach is applied to time series data from normal Human lung cells and Human lung cells treated by stimulating EGF-receptors and dosing an anticancer drug termed Gefitinib. In the treated lung cells, a cancer cell condition is simulated by the stimulation of EGF-receptors, but the effect would be counteracted due to the selective inhibition of EGF-receptors by Gefitinib. However, gene expression profiles are actually different between the conditions, and the genes related to the identified changes are considered as possible off-targets of Gefitinib. Conclusions: From the synthetically generated time series data, our proposed approach can identify changes on regulations more accurately than existing methods. By applying the proposed approach to the time series data on normal and treated Human lung cells, candidates of off-target genes of Gefitinib are found. According to the published clinical information, one of the genes can be related to a factor of interstitial pneumonia, which is known as a side effect of Gefitinib.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Let N = {y > 0} and S = {y < 0} be the semi-planes of R-2 having as common boundary the line D = {y = 0}. Let X and Y be polynomial vector fields defined in N and S, respectively, leading to a discontinuous piecewise polynomial vector field Z = (X, Y). This work pursues the stability and the transition analysis of solutions of Z between N and S, started by Filippov (1988) and Kozlova (1984) and reformulated by Sotomayor-Teixeira (1995) in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields Z(epsilon), defined by averaging X and Y. This family approaches Z when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002) providing conditions on (X, Y) for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on R-2. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this article, we present a new control chart for monitoring the covariance matrix in a bivariate process. In this method, n observations of the two variables were considered as if they came from a single variable (as a sample of 2n observations), and a sample variance was calculated. This statistic was used to build a new control chart specifically as a VMIX chart. The performance of the new control chart was compared with its main competitors: the generalized sampled variance chart, the likelihood ratio test, Nagao's test, probability integral transformation (v(t)), and the recently proposed VMAX chart. Among these statistics, only the VMAX chart was competitive with the VMIX chart. For shifts in both variances, the VMIX chart outperformed VMAX; however, VMAX showed better performance for large shifts (higher than 10%) in one variance.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The accuracy of ranging measurements depends critically on the knowledge of time delays undergone by signals when retransmitted by a remote transponder and due to propagation effects. A new method determines these delays for every single pulsed signal transmission. It utilizes four ground-based reference stations, synchronized in time and installed at well-known geodesic coordinates and a repeater in space, carried by a satellite, balloon, aircraft, and so forth. Signal transmitted by one of the reference bases is retransmitted by the transponder, received back by the four bases, producing four ranging measurements which are processed to determine uniquely the time delays undergone in every retransmission process. A minimization function is derived comparing repeater's positions referred to at least two groups of three reference bases, providing the signal transit time at the repeater and propagation delays, providing the correct repeater position. The method is applicable to the transponder platform positioning and navigation, time synchronization of remote clocks, and location of targets. The algorithm has been demonstrated by simulations adopting a practical example with the transponder carried by an aircraft moving over bases on the ground.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract Background To understand the molecular mechanisms underlying important biological processes, a detailed description of the gene products networks involved is required. In order to define and understand such molecular networks, some statistical methods are proposed in the literature to estimate gene regulatory networks from time-series microarray data. However, several problems still need to be overcome. Firstly, information flow need to be inferred, in addition to the correlation between genes. Secondly, we usually try to identify large networks from a large number of genes (parameters) originating from a smaller number of microarray experiments (samples). Due to this situation, which is rather frequent in Bioinformatics, it is difficult to perform statistical tests using methods that model large gene-gene networks. In addition, most of the models are based on dimension reduction using clustering techniques, therefore, the resulting network is not a gene-gene network but a module-module network. Here, we present the Sparse Vector Autoregressive model as a solution to these problems. Results We have applied the Sparse Vector Autoregressive model to estimate gene regulatory networks based on gene expression profiles obtained from time-series microarray experiments. Through extensive simulations, by applying the SVAR method to artificial regulatory networks, we show that SVAR can infer true positive edges even under conditions in which the number of samples is smaller than the number of genes. Moreover, it is possible to control for false positives, a significant advantage when compared to other methods described in the literature, which are based on ranks or score functions. By applying SVAR to actual HeLa cell cycle gene expression data, we were able to identify well known transcription factor targets. Conclusion The proposed SVAR method is able to model gene regulatory networks in frequent situations in which the number of samples is lower than the number of genes, making it possible to naturally infer partial Granger causalities without any a priori information. In addition, we present a statistical test to control the false discovery rate, which was not previously possible using other gene regulatory network models.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Objectives: The purpose of this study was to evaluate the influence of thermal and mechanical cycling and veneering technique on the shear bond strength of Y-TZP (yttrium oxide partially stabilized tetragonal zirconia polycrystal) core–veneer interfaces. Materials and methods: Cylindrical Y-TZP specimens were veneered either by layering (n = 20) or by pressing technique (n = 20). A metal ceramic group (CoCr) was used as control (n = 20). Ten specimens for each group were thermal and mechanical cycled and then all samples were subjected to shear bond strength in a universal testing machine with a 0.5 mm/min crosshead speed. Mean shear bond strength (MPa) was analysed with a 2-way analysis of variance and Tukey’s test ( p < 0.05). Failure mode was determined using stereomicroscopy and scanning electron microscopy (SEM). Results: Thermal and mechanical cycling had no influence on the shear bond strength for all groups. The CoCr group presented the highest bond strength value ( p < 0.05) (34.72 7.05 MPa). There was no significant difference between Y-TZP veneered by layering (22.46 2.08 MPa) or pressing (23.58 2.1 MPa) technique. Failure modes were predominantly adhesive for CoCr group, and cohesive within veneer for Y-TZP groups. Conclusions: Thermal and mechanical cycling, as well as the veneering technique does not affect Y-TZP core–veneer bond strength. Clinical significance: Different methods of veneering Y-TZP restorations would not influence the clinical performance of the core/veneer interfaces.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.