941 resultados para Permutation Polynomial
Resumo:
Objective: To evaluate the long-term effects of the standard (Class II) Balters bionator in growing patients with Class II malocclusion with mandibular retrusion by using morphometrics (thin-plate spline [TPS] analysis). Materials and Methods: Twenty-three Class II patients (8 male, 15 female) were treated consecutively with the Balters bionator (bionator group). The sample was evaluated at T0, start of treatment; T1, end of bionator therapy; and T2, long-term observation (including fixed appliances). Mean age at the start of treatment was 10 years 2 months (T0); at posttreatment, 12 years 3 months (T1); and at long-term follow-up, 18 years 2 months (T2). The control group consisted of 22 subjects (11 male, 11 female) with untreated Class II malocclusion. Lateral cephalograms were analyzed at the three time points for all groups. TPS analysis evaluated statistical differences (permutation tests) in the craniofacial shape and size between the bionator and control groups. Results: TPS analysis showed that treatment with the bionator is able to produce favorable mandibular shape changes (forward and downward displacement) that contribute significantly to the correction of the Class II dentoskeletal imbalance. These results are maintained at a long-term observation after completion of growth. The control group showed no statistically significant differences in the correction of Class II malocclusion. Conclusions: This study suggests that bionator treatment of Class II malocclusion produces favorable results over the long term with a combination of skeletal and dentoalveolar shape changes.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Micro-electromechanical systems (MEMS) are micro scale devices that are able to convert electrical energy into mechanical energy or vice versa. In this paper, the mathematical model of an electronic circuit of a resonant MEMS mass sensor, with time-periodic parametric excitation, was analyzed and controlled by Chebyshev polynomial expansion of the Picard interaction and Lyapunov-Floquet transformation, and by Optimal Linear Feedback Control (OLFC). Both controls consider the union of feedback and feedforward controls. The feedback control obtained by Picard interaction and Lyapunov-Floquet transformation is the first strategy and the optimal control theory the second strategy. Numerical simulations show the efficiency of the two control methods, as well as the sensitivity of each control strategy to parametric errors. Without parametric errors, both control strategies were effective in maintaining the system in the desired orbit. On the other hand, in the presence of parametric errors, the OLFC technique was more robust.
Resumo:
Pós-graduação em Agronomia (Produção Vegetal) - FCAV
Resumo:
This work explores the suitability of the Lagrange interpolating polynomial as a tool to estimate and correct solar databases. From the knowledge of the irradiance distribution over a day, a portion of it was removed for applying Lagrange interpolation polynomial. After generation of the estimates by interpolation, the assessment was made by MBE and RMSE statistical indicators. The application of Lagrange interpolating generated the following results: underestimation of 0.27% (MBE = -1.83 W/m2) and scattering of 0.51% (RMSE = 3.48 W/m2).
Resumo:
Evaluated statistical equations estimates (based on radiometric fractions) of the hourly diffuse radiation incident on inclined surfaces for the North to 12.85, 22.85 and 32.85°, the climate and geographical conditions of Botucatu, SP. The database was generated from April/1998 to December/2007, with measures in the three tilted surfaces in different periods, but concomitant to the horizontal plane. In the validation of the equations were used indicative statistics MBE (mean absolute error), RMSE (square root mean square error) and index adjustment (d) for three inclinations and conditions of sky coverage. The increased angle of inclination of the surface led to increased scattering of hourly values for the coefficient of atmospheric transmissivity of diffuse radiation for inclined and horizontal surfaces. Estimates of diffuse radiation on the basis of hourly tilted horizontal global radiation occur for quadratic polynomial models, which adjust K'Dβ maximum values of between 0.14 and 0.30 for winter and summer when KTH varies between 0.40 and 0.66, indicating that energy, the highest values of diffuse radiation occur in partly cloudy sky conditions and / or partially open. The increase in atmospheric transmissivity decreases the performance of annual and monthly equations at all inclinations.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Pós-graduação em Matemática em Rede Nacional - IBILCE
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.
Resumo:
Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.
Resumo:
Wavelength division multiplexing (WDM) offers a solution to the problem of exploiting the large bandwidth on optical links; it is the current favorite multiplexing technology for optical communication networks. Due to the high cost of an optical amplifier, it is desirable to strategically place the amplifiers throughout the network in a way that guarantees that all the signals are adequately amplified while minimizing the total number amplifiers being used. Previous studies all consider a star-based network. This paper demonstrates an original approach for solving the problem in switch-based WDM optical network assuming the traffic matrix is always the permutation of the nodes. First we formulate the problem by choosing typical permutations which can maximize traffic load on individual links; then a GA (Genetic Algorithm) is used to search for feasible amplifier placements. Finally, by setting up all the lightpaths without violating the power constaints we confirm the feasibility of the solution.