Scholarly

FEA for Teeth Preparations Marginal Geometry

Year: 2011 Volume: 5 Issue: 6 818 - 821 Pages

Abstract: Knowledge of factors, which influence stress and its distribution, is of key importance to the successful production of durable restorations. One of this is the marginal geometry. The objective of this study was to evaluate, by finite element analysis (FEA), the influence of different marginal designs on the stress distribution in teeth prepared for cast metal crowns. Five margin designs were taken into consideration: shoulderless, chamfer, shoulder, sloped shoulder and shoulder with bevel. For each kind of preparation three dimensional finite element analyses were initiated. Maximal equivalent stresses were calculated and stress patterns were represented in order to compare the marginal designs. Within the limitation of this study, the shoulder and beveled shoulder margin preparations of the teeth are preferred for cast metal crowns from biomechanical point of view.

Fuzzy Adjacency Matrix in Graphs

Year: 2011 Volume: 5 Issue: 6 815 - 817 Pages

Abstract: In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples . This form matrix has complete of information of a graph.

Solution of Fuzzy Maximal Flow Problems Using Fuzzy Linear Programming

Year: 2011 Volume: 5 Issue: 6 810 - 814 Pages

Abstract: In this paper, the fuzzy linear programming formulation of fuzzy maximal flow problems are proposed and on the basis of the proposed formulation a method is proposed to find the fuzzy optimal solution of fuzzy maximal flow problems. In the proposed method all the parameters are represented by triangular fuzzy numbers. By using the proposed method the fuzzy optimal solution of fuzzy maximal flow problems can be easily obtained. To illustrate the proposed method a numerical example is solved and the obtained results are discussed.

Projective Synchronization of a Class of Fractional-Order Chaotic Systems

Year: 2011 Volume: 5 Issue: 6 805 - 809 Pages

Abstract: This paper at first presents approximate analytical solutions for systems of fractional differential equations using the differential transform method. The application of differential transform method, developed for differential equations of integer order, is extended to derive approximate analytical solutions of systems of fractional differential equations. The solutions of our model equations are calculated in the form of convergent series with easily computable components. After that a drive-response synchronization method with linear output error feedback is presented for “generalized projective synchronization" for a class of fractional-order chaotic systems via a scalar transmitted signal. Genesio_Tesi and Duffing systems are used to illustrate the effectiveness of the proposed synchronization method.

A New Similarity Measure on Intuitionistic Fuzzy Sets

Year: 2011 Volume: 5 Issue: 6 800 - 804 Pages

Abstract: Intuitionistic fuzzy sets as proposed by Atanassov, have gained much attention from past and latter researchers for applications in various fields. Similarity measures between intuitionistic fuzzy sets were developed afterwards. However, it does not cater the conflicting behavior of each element evaluated. We therefore made some modification to the similarity measure of IFS by considering conflicting concept to the model. In this paper, we concentrate on Zhang and Fu-s similarity measures for IFSs and some examples are given to validate these similarity measures. A simple modification to Zhang and Fu-s similarity measures of IFSs was proposed to find the best result according to the use of degree of indeterminacy. Finally, we mark up with the application to real decision making problems.

Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0

Year: 2011 Volume: 5 Issue: 6 797 - 799 Pages

Authors:
Chillali Abdelhakim

Abstract: Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.

International Journal of Engineering, Mathematical and Physical Sciences

Archive

Last Issue

Top Journal

SUGGEST A JOURNAL