260 resultados para Applied cryptography
Resumo:
This study aimed at evaluating the validity, reliability, and factorial invariance of the complete (34-item) and shortened (8-item and 16-item) versions of the Body Shape Questionnaire (BSQ) when applied to Brazilian university students. A total of 739 female students with a mean age of 20.44 (standard deviation = 2.45) years participated. Confirmatory factor analysis was conducted to verify the degree to which the one-factor structure satisfies the proposal for the BSQ's expected structure. Two items of the 34-item version were excluded because they had factor weights (lambda)< 40. All models had adequate convergent validity (average variance extracted =.43-.58; composite reliability=.85-.97) and internal consistency (alpha =.85-.97). The 8-item B version was considered the best shortened BSQ version (Akaike information criterion = 84.07, Bayes information criterion = 157.75, Browne-Cudeck criterion= 84.46), with strong invariance for independent samples (Delta chi(2)lambda(7)= 5.06, Delta chi(2)Cov(8)= 5.11, Delta chi(2)Res(16) = 19.30). (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
Structural durability is an important design criterion, which must be assessed for every type of structure. In this regard, especial attention must be addressed to the durability of reinforced concrete (RC) structures. When RC structures are located in aggressive environments, its durability is strongly reduced by physical/chemical/mechanical processes that trigger the corrosion of reinforcements. Among these processes, the diffusion of chlorides is recognized as one of major responsible of corrosion phenomenon start. To accurate modelling the corrosion of reinforcements and to assess the durability of RC structures, a mechanical model that accounts realistically for both concrete and steel mechanical behaviour must be considered. In this context, this study presents a numerical nonlinear formulation based on the finite element method applied to structural analysis of RC structures subjected to chloride penetration and reinforcements corrosion. The physical nonlinearity of concrete is described by Mazars damage model whereas for reinforcements elastoplastic criteria are adopted. The steel loss along time due to corrosion is modelled using an empirical approach presented in literature and the chloride concentration growth along structural cover is represented by Fick's law. The proposed model is applied to analysis of bended structures. The results obtained by the proposed numerical approach are compared to responses available in literature in order to illustrate the evolution of structural resistant load after corrosion start. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
Topological optimization problems based on stress criteria are solved using two techniques in this paper. The first technique is the conventional Evolutionary Structural Optimization (ESO), which is known as hard kill, because the material is discretely removed; that is, the elements under low stress that are being inefficiently utilized have their constitutive matrix has suddenly reduced. The second technique, proposed in a previous paper, is a variant of the ESO procedure and is called Smooth ESO (SESO), which is based on the philosophy that if an element is not really necessary for the structure, its contribution to the structural stiffness will gradually diminish until it no longer influences the structure; its removal is thus performed smoothly. This procedure is known as "soft-kill"; that is, not all of the elements removed from the structure using the ESO criterion are discarded. Thus, the elements returned to the structure must provide a good conditioning system that will be resolved in the next iteration, and they are considered important to the optimization process. To evaluate elasticity problems numerically, finite element analysis is applied, but instead of using conventional quadrilateral finite elements, a plane-stress triangular finite element was implemented with high-order modes for solving complex geometric problems. A number of typical examples demonstrate that the proposed approach is effective for solving problems of bi-dimensional elasticity. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Concept drift, which refers to non stationary learning problems over time, has increasing importance in machine learning and data mining. Many concept drift applications require fast response, which means an algorithm must always be (re)trained with the latest available data. But the process of data labeling is usually expensive and/or time consuming when compared to acquisition of unlabeled data, thus usually only a small fraction of the incoming data may be effectively labeled. Semi-supervised learning methods may help in this scenario, as they use both labeled and unlabeled data in the training process. However, most of them are based on assumptions that the data is static. Therefore, semi-supervised learning with concept drifts is still an open challenging task in machine learning. Recently, a particle competition and cooperation approach has been developed to realize graph-based semi-supervised learning from static data. We have extend that approach to handle data streams and concept drift. The result is a passive algorithm which uses a single classifier approach, naturally adapted to concept changes without any explicit drift detection mechanism. It has built-in mechanisms that provide a natural way of learning from new data, gradually "forgetting" older knowledge as older data items are no longer useful for the classification of newer data items. The proposed algorithm is applied to the KDD Cup 1999 Data of network intrusion, showing its effectiveness.
Resumo:
In Computer-Aided Diagnosis-based schemes in mammography analysis each module is interconnected, which directly affects the system operation as a whole. The identification of mammograms with and without masses is highly needed to reduce the false positive rates regarding the automatic selection of regions of interest for further image segmentation. This study aims to evaluate the performance of three techniques in classifying regions of interest as containing masses or without masses (without clinical findings), as well as the main contribution of this work is to introduce the Optimum-Path Forest (OPF) classifier in this context, which has never been done so far. Thus, we have compared OPF against with two sorts of neural networks in a private dataset composed by 120 images: Radial Basis Function and Multilayer Perceptron (MLP). Texture features have been used for such purpose, and the experiments have demonstrated that MLP networks have been slightly better than OPF, but the former is much faster, which can be a suitable tool for real-time recognition systems.
Resumo:
Piezosurgery is a new and modern technique of bone surgery in implantology. Selective cutting is possible for different ultrasonic frequencies acting only in hard tissues (mineralized), saving vital anatomical structures. With the piezoelectric osteotomy technique, receptor site preparation for implants, autogenous bone graft acquistition (particles and blocks), osteotomy for alveolar bone crest expansion, maxillary sinus lifting, and dental implant removal can be performed accurately and safely, providing excellent clinical and biological results, especially for osteocyte viability. The aim of this review was, through literature review, to present clinical applications of piezosurgery in implant dentistry and outline their advantages and disadvantages over conventional surgical systems. Moreover, this study addressed the biological aspects related to piezosurgery that differentiate it from those of bone tissue approaches. Overall, piezosurgery enables critical operations in simple and fully executable procedures; and effectively, areas that are difficult to access have less risk of soft tissue and neurovascular tissue damage via piezosurgery.
Resumo:
Since the beginning, some pattern recognition techniques have faced the problem of high computational burden for dataset learning. Among the most widely used techniques, we may highlight Support Vector Machines (SVM), which have obtained very promising results for data classification. However, this classifier requires an expensive training phase, which is dominated by a parameter optimization that aims to make SVM less prone to errors over the training set. In this paper, we model the problem of finding such parameters as a metaheuristic-based optimization task, which is performed through Harmony Search (HS) and some of its variants. The experimental results have showen the robustness of HS-based approaches for such task in comparison against with an exhaustive (grid) search, and also a Particle Swarm Optimization-based implementation.
Resumo:
The technologies are rapidly developing, but some of them present in the computers, as for instance their processing capacity, are reaching their physical limits. It is up to quantum computation offer solutions to these limitations and issues that may arise. In the field of information security, encryption is of paramount importance, being then the development of quantum methods instead of the classics, given the computational power offered by quantum computing. In the quantum world, the physical states are interrelated, thus occurring phenomenon called entanglement. This study presents both a theoretical essay on the merits of quantum mechanics, computing, information, cryptography and quantum entropy, and some simulations, implementing in C language the effects of entropy of entanglement of photons in a data transmission, using Von Neumann entropy and Tsallis entropy.
Resumo:
In this letter, a speech recognition algorithm based on the least-squares method is presented. Particularly, the intention is to exemplify how such a traditional numerical technique can be applied to solve a signal processing problem that is usually treated by using more elaborated formulations.
Resumo:
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over binary Galois Field (ECC- GF(2m)). The purpose of our coprocessor is to accelerate the scalar multiplication performed over elliptic curve points represented by affine coordinates in polynomial basis. Our method consists of using elliptic curve parameters over GF(2163) in accordance with international security requirements to implement a bit-parallel coprocessor on field-programmable gate-array (FPGA). Our coprocessor performs modular inversion by using a process based on the Stein's algorithm. Results are presented and compared to results of other related works. We conclude that our coprocessor is suitable for comparing with any other ECC-hardware proposal, since its speed is comparable to projective coordinate designs.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)