Abstract: Horizontal platform system (HPS) is popularly applied
in offshore and earthquake technology, but it is difficult and
time-consuming for regulation. In order to understand the nonlinear
dynamic behavior of HPS and reduce the cost when using it, this paper
employs differential transformation method to study the bifurcation
behavior of HPS. The numerical results reveal a complex dynamic
behavior comprising periodic, sub-harmonic, and chaotic responses.
Furthermore, the results reveal the changes which take place in the
dynamic behavior of the HPS as the external torque is increased.
Therefore, the proposed method provides an effective means of
gaining insights into the nonlinear dynamics of horizontal platform
system.
Abstract: This paper presents an on-going research work on the
implementation of feature-based machining via macro programming.
Repetitive machining features such as holes, slots, pockets etc can
readily be encapsulated in macros. Each macro consists of methods
on how to machine the shape as defined by the feature. The macro
programming technique comprises of a main program and
subprograms. The main program allows user to select several
subprograms that contain features and define their important
parameters. With macros, complex machining routines can be
implemented easily and no post processor is required. A case study
on machining of a part that comprised of planar face, hole and pocket
features using the macro programming technique was carried out. It
is envisaged that the macro programming technique can be extended
to other feature-based machining fields such as the newly developed
STEP-NC domain.
Abstract: In elliptic curve theory, number of rational points on
elliptic curves and determination of these points is a fairly important
problem. Let p be a prime and Fp be a finite field and k ∈ Fp. It
is well known that which points the curve y2 = x3 + kx has and
the number of rational points of on Fp. Consider the circle family
x2 + y2 = r2. It can be interesting to determine common points of
these two curve families and to find the number of these common
points. In this work we study this problem.
Abstract: In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimizes the integral of the Lorentz inner product of Darboux vector of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.
Abstract: Suppose G(V,E) is a graph, a function f : V \cup E \to \{1, 2, 3, \cdots, k\} is called the total edge(vertex) irregular k-labelling for G such that for each two edges are different having distinct weights. The total edge(vertex) irregularity strength of G, denoted by tes(G)(tvs(G), is the smallest k positive integers such that G has a total edge(vertex) irregular k-labelling. In this paper, we determined the total edge(vertex) irregularity strength of an amalgamation of two isomorphic cycles. The total edge irregularity strength and the total vertex irregularity strength of two isomorphic cycles on n vertices are \lceil (2n+2)/3 \rceil and \lceil 2n/3 \rceil for n \geq 3, respectively.
Abstract: A numerical method for solving nonlinear Fredholm integral equations of second kind is proposed. The Fredholm type equations which have many applications in mathematical physics are then considered. The method is based on hybrid function approximations. The properties of hybrid of block-pulse functions and Chebyshev polynomials are presented and are utilized to reduce the computation of nonlinear Fredholm integral equations to a system of nonlinear. Some numerical examples are selected to illustrate the effectiveness and simplicity of the method.
Abstract: As a security mechanism, authorization is to provide access control to the system resources according to the polices and rules specified by the security strategies. Either by update or in the initial specification, conflicts in authorization is an issue needs to be solved. In this paper, we propose a new approach to solve conflict by using prioritized logic programs and discuss the uniqueness of its answer set. Addressing conflict resolution from logic programming viewpoint and the uniqueness analysis of the answer set provide a novel, efficient approach for authorization conflict resolution.
Abstract: This paper is concerned with exponential stability and stabilization of switched linear systems with interval time-varying delays. The time delay is any continuous function belonging to a given interval, in which the lower bound of delay is not restricted to zero. By constructing a suitable augmented Lyapunov-Krasovskii functional combined with Leibniz-Newton-s formula, a switching rule for the exponential stability and stabilization of switched linear systems with interval time-varying delays and new delay-dependent sufficient conditions for the exponential stability and stabilization of the systems are first established in terms of LMIs. Numerical examples are included to illustrate the effectiveness of the results.
Abstract: in this paper, we propose a numerical method
for the approximate solution of fuzzy Fredholm functional
integral equations of the second kind by using an iterative
interpolation. For this purpose, we convert the linear fuzzy
Fredholm integral equations to a crisp linear system of integral
equations. The proposed method is illustrated by some fuzzy
integral equations in numerical examples.
Abstract: In this paper, the robust exponential stability problem of uncertain discrete-time recurrent neural networks with timevarying delay is investigated. By constructing a new augmented Lyapunov-Krasovskii function, some new improved stability criteria are obtained in forms of linear matrix inequality (LMI). Compared with some recent results in literature, the conservatism of the new criteria is reduced notably. Two numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed results.
Abstract: In this paper, we extend the compound binomial model to the case where the premium income process, based on a binomial process, is no longer a linear function. First, a mathematically recursive formula is derived for non ruin probability, and then, we examine the expected discounted penalty function, satisfy a defect renewal equation. Third, the asymptotic estimate for the expected discounted penalty function is then given. Finally, we give two examples of ruin quantities to illustrate applications of the recursive formula and the asymptotic estimate for penalty function.
Abstract: The objective of this paper is to analyse the
application of the Half-Sweep Gauss-Seidel (HSGS) method by using
the Half-sweep approximation equation based on central difference
(CD) and repeated trapezoidal (RT) formulas to solve linear fredholm
integro-differential equations of first order. The formulation and
implementation of the Full-Sweep Gauss-Seidel (FSGS) and Half-
Sweep Gauss-Seidel (HSGS) methods are also presented. The HSGS
method has been shown to rapid compared to the FSGS methods.
Some numerical tests were illustrated to show that the HSGS method
is superior to the FSGS method.
Abstract: Extreme temperature of several stations in Malaysia is
modelled by fitting the monthly maximum to the Generalized
Extreme Value (GEV) distribution. The Mann-Kendall (MK) test
suggests a non-stationary model. Two models are considered for
stations with trend and the Likelihood Ratio test is used to determine
the best-fitting model. Results show that half of the stations favour a
model which is linear for the location parameters. The return level is
the level of events (maximum temperature) which is expected to be
exceeded once, on average, in a given number of years, is obtained.
Abstract: This paper treats a discrete-time batch arrival queue with single working vacation. The main purpose of this paper is to present a performance analysis of this system by using the supplementary variable technique. For this purpose, we first analyze the Markov chain underlying the queueing system and obtain its ergodicity condition. Next, we present the stationary distributions of the system length as well as some performance measures at random epochs by using the supplementary variable method. Thirdly, still based on the supplementary variable method we give the probability generating function (PGF) of the number of customers at the beginning of a busy period and give a stochastic decomposition formulae for the PGF of the stationary system length at the departure epochs. Additionally, we investigate the relation between our discretetime system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on some crucial performance characteristics of the system.
Abstract: For the last years, the variants of the Newton-s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we present a new Newton-s method based on contra harmonic mean with cubically convergent. Numerical examples show that the new method can compete with the classical Newton's method.
Abstract: This paper proves that the problem of finding connected
vertex cover in a 2-connected planar graph ( CVC-2 ) with maximum degree 4 is NP-complete. The motivation for proving this result is to
give a shorter and simpler proof of NP-Completeness of TRA-MLC (the Top Right Access point Minimum-Length Corridor) problem [1], by finding the reduction from CVC-2. TRA-MLC has many applications in laying optical fibre cables for data communication and electrical wiring in floor plans.The problem of finding connected vertex cover in any planar graph ( CVC ) with maximum degree 4 is NP-complete [2]. We first show that CVC-2 belongs to NP and then we find a polynomial reduction from CVC to CVC-2. Let a graph G0 and an integer K form an instance of CVC, where G0 is a planar graph and K is an upper bound on the size of the connected vertex cover in G0. We construct a 2-connected planar graph, say G, by identifying the blocks and cut vertices of G0, and then finding the planar representation of all the blocks of G0, leading to a plane graph G1. We replace the cut vertices with cycles in such a way that the resultant graph G is a 2-connected planar graph with maximum
degree 4. We consider L = K -2t+3 t i=1 di where t is the number of cut vertices in G1 and di is the number of blocks for which ith cut vertex is common. We prove that G will have a connected vertex
cover with size less than or equal to L if and only if G0 has a connected vertex cover of size less than or equal to K.
Abstract: In this paper, the estimation of the stress-strength
parameter R = P(Y < X), when X and Y are independent and both
are Lomax distributions with the common scale parameters but
different shape parameters is studied. The maximum likelihood
estimator of R is derived. Assuming that the common scale parameter
is known, the bayes estimator and exact confidence interval of R are
discussed. Simulation study to investigate performance of the
different proposed methods has been carried out.
Abstract: In this paper, a generalized derivatives operator n
λ,βf
introduced by the authors will be discussed. Some subordination and
superordination results involving this operator for certain normalized
analytic functions in the open unit disk will be investigated. Our
results extend corresponding previously known results.
Abstract: Identifying parameters in an epidemic model is one
of the important aspect of modeling. In this paper, we suggest a
method to identify the transmission rate by using the multistage
Adomian decomposition method. As a case study, we use the data of
the reported dengue fever cases in the city of Shah Alam, Malaysia.
The result obtained fairly represents the actual situation. However, in
the SIR model, this method serves as an alternative in parameter
identification and enables us to make necessary analysis for a smaller
interval.