Search results for: Finite group

Authors: Shitian Liu, Deqin Chen

Abstract:

Let G be a finite group, and let F be a formation of finite group. We say that a subgroup H of G is p F -normal in G if there exists a normal subgroup T of G such that HT is a permutable Hall subgroup of G and G G (H

Keywords: Finite group, Fp -normal subgroup, Sylowsubgroup, Maximal subgroup

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1137

Authors: I. Naeem, R. Naz

Abstract:

The group invariant solution for Prandtl-s boundary layer equations for an incompressible fluid governing the flow in radial free, wall and liquid jets having finite fluid velocity at the orifice are investigated. For each jet a symmetry is associated with the conserved vector that was used to derive the conserved quantity for the jet elsewhere. This symmetry is then used to construct the group invariant solution for the third-order partial differential equation for the stream function. The general form of the group invariant solution for radial jet flows is derived. The general form of group invariant solution and the general form of the similarity solution which was obtained elsewhere are the same.

Keywords: Two-dimensional jets, radial jets, group invariant solution.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1412

Authors: Lee Feng Koo, Tze Jin Wong, Pang Hung Yiu, Nik Mohd Asri Nik Long

Abstract:

Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryptosystem. This attack required two plaintexts differ from a fixed number and encrypted under same modulus. This paper reports a security reaction of Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field under GCD attack. Lucas Based El-Gamal Cryptosystem in the Elliptic Curve group over finite field was exposed mathematically to the GCD attack using GCD and Dickson polynomial. The result shows that the cryptanalyst is able to get the plaintext without decryption by using GCD attack. Thus, the study concluded that it is highly perilous when two plaintexts have a slight difference from a fixed number in the same Elliptic curve group over finite field.

Keywords: Decryption, encryption, elliptic curve, greater common divisor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 652

Authors: Tan K. B., Norhashidah Hj. M. Ali

Abstract:

In this article, we aim to discuss the formulation of two explicit group iterative finite difference methods for time-dependent two dimensional Burger-s problem on a variable mesh. For the non-linear problems, the discretization leads to a non-linear system whose Jacobian is a tridiagonal matrix. We discuss the Newton-s explicit group iterative methods for a general Burger-s equation. The proposed explicit group methods are derived from the standard point and rotated point Crank-Nicolson finite difference schemes. Their computational complexity analysis is discussed. Numerical results are given to justify the feasibility of these two proposed iterative methods.

Keywords: Standard point Crank-Nicolson (CN), Rotated point Crank-Nicolson (RCN), Explicit Group (EG), Explicit Decoupled Group (EDG).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1547

Authors: Sam Teek Ling, Norhashidah Hj. Mohd. Ali

Abstract:

We investigate the formulation and implementation of new explicit group iterative methods in solving the two-dimensional Poisson equation with Dirichlet boundary conditions. The methods are derived from a fourth order compact nine point finite difference discretization. The methods are compared with the existing second order standard five point formula to show the dramatic improvement in computed accuracy. Numerical experiments are presented to illustrate the effectiveness of the proposed methods.

Keywords: Explicit group iterative method, finite difference, fourth order compact, Poisson equation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1625

Authors: Norhashidah Hj. Mohd Ali, Teng Wai Ping

Abstract:

In this paper, we present a high order group explicit method in solving the two dimensional Helmholtz equation. The presented method is derived from a nine-point fourth order finite difference approximation formula obtained from a 45-degree rotation of the standard grid which makes it possible for the construction of iterative procedure with reduced complexity. The developed method will be compared with the existing group iterative schemes available in literature in terms of computational time, iteration counts, and computational complexity. The comparative performances of the methods will be discussed and reported.

Keywords: Explicit group method, finite difference, Helmholtz equation, rotated grid, standard grid.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1115

Authors: M. Ghorbany

Abstract:

A square matrix over the complex field with non- negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful representation of G by quasi-permutation matrices over the rationals and the complex numbers are denoted by q(G) and c(G) respectively. Finally r (G) denotes the minimal degree of a faithful rational valued complex character of C. The purpose of this paper is to calculate q(G), c(G) and r(G) for the group S L(2, q) when extended by a certain group of order two.

Keywords: General linear group, Quasi-permutation

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1030

Authors: Atilla Akpinar, Basri Celik, Suleyman Ciftci

Abstract:

In this paper, we carry over some of the results which are valid on a certain class of Moufang-Klingenberg planes M(A) coordinatized by an local alternative ring A := A(ε) = A+Aε of dual numbers to finite projective Klingenberg plane M(A) obtained by taking local ring Zq (where prime power q = pk) instead of A. So, we show that the collineation group of M(A) acts transitively on 4-gons, and that any 6-figure corresponds to only one inversible m ∈ A.

Keywords: finite Klingenberg plane, projective collineation, 4-transitivity, 6-figures.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1194

Authors: Atilla Akpinar

Abstract:

In this paper, we study on finite projective Hjelmslev planes M(Zq) coordinatized by Hjelmslev ring Zq (where prime power q = pk). We obtain finite hyperbolic Klingenberg planes from these planes under certain conditions. Also, we give a combinatorical result on M(Zq), related by deleting a line from lines in same neighbour.

Keywords: Finite Klingenberg plane, finite hyperbolic Klingenberg plane.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1106

Authors: Norhashidah Hj. Mohd Ali, Teng Wai Ping

Abstract:

In this paper, the formulation of a new group explicit method with a fourth order accuracy is described in solving the two dimensional Helmholtz equation. The formulation is based on the nine-point fourth order compact finite difference approximation formula. The complexity analysis of the developed scheme is also presented. Several numerical experiments were conducted to test the feasibility of the developed scheme. Comparisons with other existing schemes will be reported and discussed. Preliminary results indicate that this method is a viable alternative high accuracy solver to the Helmholtz equation.

Keywords: Explicit group method, finite difference, Helmholtz equation, five-point formula, nine-point formula.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2028

Authors: Kew Lee Ming, Norhashidah Hj. Mohd. Ali

Abstract:

In a previous work, we presented the numerical solution of the two dimensional second order telegraph partial differential equation discretized by the centred and rotated five-point finite difference discretizations, namely the explicit group (EG) and explicit decoupled group (EDG) iterative methods, respectively. In this paper, we utilize a domain decomposition algorithm on these group schemes to divide the tasks involved in solving the same equation. The objective of this study is to describe the development of the parallel group iterative schemes under OpenMP programming environment as a way to reduce the computational costs of the solution processes using multicore technologies. A detailed performance analysis of the parallel implementations of points and group iterative schemes will be reported and discussed.

Keywords: Telegraph equation, explicit group iterative scheme, domain decomposition algorithm, parallelization.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1476

Authors: R. M. Barron, B. Zogheib

Abstract:

A new numerical method for solving the twodimensional, steady, incompressible, viscous flow equations on a Curvilinear staggered grid is presented in this paper. The proposed methodology is finite difference based, but essentially takes advantage of the best features of two well-established numerical formulations, the finite difference and finite volume methods. Some weaknesses of the finite difference approach are removed by exploiting the strengths of the finite volume method. In particular, the issue of velocity-pressure coupling is dealt with in the proposed finite difference formulation by developing a pressure correction equation in a manner similar to the SIMPLE approach commonly used in finite volume formulations. However, since this is purely a finite difference formulation, numerical approximation of fluxes is not required. Results obtained from the present method are based on the first-order upwind scheme for the convective terms, but the methodology can easily be modified to accommodate higher order differencing schemes.

Keywords: Curvilinear, finite difference, finite volume, SIMPLE.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3143

Authors: R. Ziaie Moayed, A. Mahigir

Abstract:

Stone column technique has been successfully employed to improve the load-settlement characteristics of foundations. A series of finite element numerical analyses of harmonic dynamic loading have been conducted on strengthened raft footing to study the effects of single and group stone columns on settlement of circular footings. The settlement of circular raft footing that improved by single and group of stone columns are studied under harmonic dynamic loading. This loading is caused by heavy machinery foundations. A detailed numerical investigation on behavior of single column and group of stone columns is carried out by varying parameters like weight of machinery, loading frequency and period. The result implies that presence of single and group of stone columns enhanced dynamic behavior of the footing so that the maximum and residual settlement of footing significantly decreased. 

Keywords: Finite element analysis, harmonic loading, settlement, stone column.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 967

Authors: S. M. Abdur Razzak, M. A. Rashid, Y. Namihira, A. Sayeem

Abstract:

A simple microstructure optical fiber design based on an octagonal cladding structure is presented for simultaneously controlling dispersion and leakage properties. The finite difference method with anisotropic perfectly matched boundary layer is used to investigate the guiding properties. It is demonstrated that octagonal photonic crystal fibers with four rings can assume negative ultra-flattened dispersion of -19 + 0.23 ps/nm/km in the wavelength range of 1.275 μm to 1.68 μm, nearly zero ultra-flattened dispersion of 0 ± 0.40 ps/nm/km in a 1.38 to 1.64 μm, and low confinement losses less than 10-3 dB/km in the entire band of interest.

Keywords: Finite difference modeling, group velocity dispersion, optical fiber design, photonic crystal fiber.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1782

Authors: Chunming Xu

Abstract:

In this paper, the finite-time symplectic synchronization between two different chaotic systems is investigated. Based on the finite-time stability theory, a simple adaptive feedback scheme is proposed to realize finite-time symplectic synchronization for the Lorenz and L¨u systems. Numerical examples are provided to show the effectiveness of the proposed method.

Keywords: Chaotic systems, symplectic synchronization, finite-time synchronization, adaptive controller.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 909

Authors: Marcelo R. G. Duarte, Marcilio Alves

Abstract:

Pedestrians are the fourth group among road traffic users that most suffer accidents. Their death rate is even higher than the motorcyclists group. This gives motivation for the development of an urban vehicle capable of complying with the United Nations Economic Commission for Europe pedestrian regulations. The conceptual vehicle is capable of transporting two passengers and small parcels for 100 km at a maximum speed of 90 km/h. This paper presents the design of this vehicle using the finite element method specially in connection with frontal crash test and car to pedestrian collision. The simulation is based in a human body FE.

Keywords: Electric urban vehicle, finite element method, global human body model, pedestrian safety, road safety.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 642

Authors: Morteza Jiryaei Sharahi

Abstract:

In this paper, the effect of width and height of the model on the earthquake response in the finite element method is discussed. For this purpose an earth dam as a soil structure under earthquake has been considered. Various dam-foundation models are analyzed by Plaxis, a finite element package for solving geotechnical problems. The results indicate considerable differences in the seismic responses.

Keywords: Geometry dimensions, finite element, earthquake

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2166

Authors: Muhammad E. Rahman, Trevor Orr

Abstract:

This paper presents the use of three-dimensional finite elements coupled with infinite elements to investigate the ground vibrations at the surface in terms of the peak particle velocity (PPV) due to construction of the first bore of the Dublin Port Tunnel. This situation is analysed using a commercially available general-purpose finite element package ABAQUS. A series of parametric studies is carried out to examine the sensitivity of the predicted vibrations to variations in the various input parameters required by finite element method, including the stiffness and the damping of ground. The results of this study show that stiffness has a more significant effect on the PPV rather than the damping of the ground.

Keywords: Finite Elements, PPV, Tunnelling, Vibration

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3197

Authors: Abdulmajid Mukhtar Afat

Abstract:

This paper aims at introducing finite automata theory, the different ways to describe regular languages and create a program to implement the subset construction algorithms to convert nondeterministic finite automata (NFA) to deterministic finite automata (DFA). This program is written in c++ programming language. The program reads FA 5tuples from text file and then classifies it into either DFA or NFA. For DFA, the program will read the string w and decide whether it is acceptable or not. If accepted, the program will save the tracking path and point it out. On the other hand, when the automation is NFA, the program will change the Automation to DFA so that it is easy to track and it can decide whether the w exists in the regular language or not.

Keywords: Finite Automata, subset construction DFA, NFA.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1944

Authors: Atilla Akpinar, Basri Celik, Suleyman Ciftci

Abstract:

In this paper, we deal with finite projective Klingenberg plane M (A) coordinatized by local ring A := Zq+Zq E (where prime power q = p', e0 Z q and 62 = 0). So, we get some combinatorical results on 6-figures. For example, we show that there exist p — 1 6-figure classes in M(A).

Keywords: finite Klingenberg plane, 6-figure, ratio of 6-figure, cross-ratio.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1245

Authors: Makoto Sakamoto, Yasuo Uchida, Makoto Nagatomo, Takao Ito, Tsunehiro Yoshinaga, Satoshi Ikeda, Masahiro Yokomichi, Hiroshi Furutani

Abstract:

In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.

Keywords: computational complexity, cooperating system, finite automaton, four-dimension, hierarchy, multihead.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1832

Authors: Jaewon Jang, Gregory R. Miller

Abstract:

This paper presents work characterizing finite element performance boundaries within which live, interactive finite element modeling is feasible on current and emerging systems. These results are based on wide-ranging tests performed using a prototype finite element program implemented specifically for this study, thereby enabling the unified investigation of numerous direct and iterative solver strategies and implementations in a variety of modeling contexts. The results are intended to be useful for researchers interested in interactive analysis by providing baseline performance estimates, to give guidance in matching solution strategies to problem domains, and to spur further work addressing the challenge of extending the present boundaries.

Keywords: Finite Elements, Interactive Modeling, NumericalAnalysis.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1306

Authors: Liqiong Liu, Shouming Zhong

Abstract:

In this paper, the finite-time stabilization of a class of multi-state time delay of fractional-order system is proposed. First, we define finite-time stability with the fractional-order system. Second, by using Generalized Gronwall's approach and the methods of the inequality, we get some conditions of finite-time stability for the fractional system with multi-state delay. Finally, a numerical example is given to illustrate the result.

Keywords: Finite-time stabilization, fractional-order system, Gronwall inequality.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1851

Authors: Abdulmajid Mukhtar Afat

Abstract:

This paper aims at introducing nondeterministic finite automata with ε value which is used to perform some operations on languages. a program is created to implement the algorithm that converts nondeterministic finite automata with ε value (ε-NFA) to deterministic finite automata (DFA).The program is written in c++ programming language. The program inputs are FA 5-tuples from text file and then classifies it into either DFA/NFA or ε -NFA. For DFA, the program will get the string w and decide whether it is accepted or rejected. The tracking path for an accepted string is saved by the program. In case of NFA or ε-NFA automation, the program changes the automation to DFA to enable tracking and to decide if the string w exists in the regular language or not.

Keywords: Finite automata, DFA, NFA, ε-NFA, Eclose, operations on languages.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 789

Authors: Mohd Agos Salim Nasir, Ahmad Izani Md. Ismail

Abstract:

Several numerical schemes utilizing central difference approximations have been developed to solve the Goursat problem. However, in a recent years compact discretization methods which leads to high-order finite difference schemes have been used since it is capable of achieving better accuracy as well as preserving certain features of the equation e.g. linearity. The basic idea of the new scheme is to find the compact approximations to the derivative terms by differentiating centrally the governing equations. Our primary interest is to study the performance of the new scheme when applied to two Goursat partial differential equations against the traditional finite difference scheme.

Keywords: Goursat problem, partial differential equation, finite difference scheme, compact finite difference

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1855

Authors: Ž. Nikolić, H. Smoljanović, N. Živaljić

Abstract:

This paper presents numerical model based on finite-discrete element method for analysis of the structural response of dry stone masonry structures under static and dynamic loads. More precisely, each discrete stone block is discretized by finite elements. Material non-linearity including fracture and fragmentation of discrete elements as well as cyclic behavior during dynamic load are considered through contact elements which are implemented within a finite element mesh. The application of the model was conducted on several examples of these structures. The performed analysis shows high accuracy of the numerical results in comparison with the experimental ones and demonstrates the potential of the finite-discrete element method for modelling of the response of dry stone masonry structures.

Keywords: Finite-discrete element method, dry stone masonry structures, static load, dynamic load.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1567

Authors: B. Singh, B. K. Nanda

Abstract:

The characterization and modeling of the dynamic behavior of many built-up structures under vibration conditions is still a subject of current research. The present study emphasizes the theoretical investigation of slip damping in layered and jointed welded cantilever structures using finite element approach. Application of finite element method in damping analysis is relatively recent, as such, some problems particularly slip damping analysis has not received enough attention. To validate the finite element model developed, experiments have been conducted on a number of mild steel specimens under different initial conditions of vibration. Finite element model developed affirms that the damping capacity of such structures is influenced by a number of vital parameters such as; pressure distribution, kinematic coefficient of friction and micro-slip at the interfaces, amplitude, frequency of vibration, length and thickness of the specimen. Finite element model developed can be utilized effectively in the design of machine tools, automobiles, aerodynamic and space structures, frames and machine members for enhancing their damping capacity.

Keywords: Amplitude, finite element method, slip damping, tack welding.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1873

Authors: Betül Gezer, Ahmet Tekcan, Osman Bizim

Abstract:

In this work, we study elliptic divisibility sequences over finite fields. Morgan Ward in [14], [15] gave arithmetic theory of elliptic divisibility sequences and formulas for elliptic divisibility sequences with rank two over finite field Fp. We study elliptic divisibility sequences with rank three, four and five over a finite field Fp, where p > 3 is a prime and give general terms of these sequences and then we determine elliptic and singular curves associated with these sequences.

Keywords: Elliptic divisibility sequences, singular elliptic divisibilitysequences, elliptic curves, singular curves.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1659

Authors: T. Kritsana, P. Sawitri, P. Teeratas

Abstract:

This article aims to study the effect of pressure on rocket motor case by Finite Element Method simulation to select optimal material in rocket motor manufacturing process. In this study, cylindrical tubes with outside diameter of 122 mm and thickness of 3 mm are used for simulation. Defined rocket motor case materials are AISI4130, AISI1026, AISI1045, AL2024 and AL7075. Internal pressure used for the simulation is 22 MPa.

The result from Finite Element Method shows that at a pressure of 22 MPa rocket motor case produced by AISI4130, AISI1045 and AL7075 can be used. A comparison of the result between AISI4130, AISI1045 and AL7075 shows that AISI4130 has minimum principal stress and confirm the results of Finite Element Method by the used of calculation method found that, the results from Finite Element Method has good reliability.

Keywords: Rocket motor case, Finite Element Method, principal Stress.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2504

Authors: Khalid Abdelmoumen, Mustapha Najmeddine, Hussain Ben-Azza

Abstract:

We present linear codes over finite commutative rings which are not necessarily Frobenius. We treat the notion of syndrome decoding by using Pontrjagin duality. We also give a version of Delsarte-s theorem over rings relating trace codes and subring subcodes.

Keywords: Codes, Finite Rings, Pontrjagin Duality, Trace Codes.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1765