Abstract: An acyclic coloring of a graph G is a coloring of its
vertices such that:(i) no two neighbors in G are assigned the same
color and (ii) no bicolored cycle can exist in G. The acyclic chromatic
number of G is the least number of colors necessary to acyclically
color G. Recently it has been proved that any graph of maximum
degree 5 has an acyclic chromatic number at most 8. In this paper
we present another proof for this result.
Abstract: This paper investigates the effect of product substitution in the single-period 'newsboy-type' problem in a fuzzy environment. It is supposed that the single-period problem operates under uncertainty in customer demand, which is described by imprecise terms and modelled by fuzzy sets. To perform this analysis, we consider the fuzzy model for two-item with upward substitution. This upward substitutability is reasonable when the products can be stored according to certain attribute levels such as quality, brand or package size. We show that the explicit consideration of this substitution opportunity increase the average expected profit. Computational study is performed to observe the benefits of product's substitution.
Abstract: This paper is concerned with an epidemic model with delay. By using the comparison theorem of the differential equation and constructing a suitable Lyapunov functional, Some sufficient conditions which guarantee the permeance and existence of a unique globally attractive positive almost periodic solution of the model are obtain. Finally, an example is employed to illustrate our result.
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 minimize the integral of the square norm 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: In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with the coefficient matrices are singular H-matrices. And we present the sufficient and necessary conditions for convergence of the extrapolated iterative methods. Moreover, we apply the results to the GMAOR methods. Finally, we give one numerical example.
Abstract: A lot of computer-based methods have been developed
to assess the evacuation capability (EC) of high-rise buildings.
Because softwares are time-consuming and not proper for on scene
applications, we adopted two methods, fuzzy analytic hierarchy
process (FAHP) and technique for order preference by similarity to an
ideal solution (TOPSIS), for EC assessment of a high-rise building in
Jinan. The EC scores obtained with the two methods and the
evacuation time acquired with Pathfinder 2009 for floors 47-60 of the
building were compared with each other. The results show that FAHP
performs better than TOPSIS for EC assessment of high-rise buildings,
especially in the aspect of dealing with the effect of occupant type and
distance to exit on EC, tackling complex problem with multi-level
structure of criteria, and requiring less amount of computation.
However, both FAHP and TOPSIS failed to appropriately handle the
situation where the exit width changes while occupants are few.
Abstract: The numerical simulation of the slip effect via
vicoelastic fluid for 4:1 contraction problem is investigated with
regard to kinematic behaviors of streamlines and stress tensor by
models of the Navier-Stokes and Oldroyd-B equations. Twodimensional
spatial reference system of incompressible creeping flow
with and without slip velocity is determined and the finite element
method of a semi-implicit Taylor-Galerkin pressure-correction is
applied to compute the problem of this Cartesian coordinate system
including the schemes of velocity gradient recovery method and the
streamline-Upwind / Petrov-Galerkin procedure. The slip effect at
channel wall is added to calculate after each time step in order to
intend the alteration of flow path. The result of stress values and the
vortices are reduced by the optimum slip coefficient of 0.1 with near
the outcome of analytical solution.
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.
Abstract: The optimal control problem of a linear distributed
parameter system is studied via shifted Legendre polynomials (SLPs)
in this paper. The partial differential equation, representing the
linear distributed parameter system, is decomposed into an n - set
of ordinary differential equations, the optimal control problem is
transformed into a two-point boundary value problem, and the twopoint
boundary value problem is reduced to an initial value problem
by using SLPs. A recursive algorithm for evaluating optimal control
input and output trajectory is developed. The proposed algorithm is
computationally simple. An illustrative example is given to show the
simplicity of the proposed approach.
Abstract: Restarted GMRES methods augmented with approximate eigenvectors are widely used for solving large sparse linear systems. Recently a new scheme of augmenting with error approximations is proposed. The main aim of this paper is to develop a restarted GMRES method augmented with the combination of harmonic Ritz vectors and error approximations. We demonstrate that the resulted combination method can gain the advantages of two approaches: (i) effectively deflate the small eigenvalues in magnitude that may hamper the convergence of the method and (ii) partially recover the global optimality lost due to restarting. The effectiveness and efficiency of the new method are demonstrated through various numerical examples.
Abstract: In the present paper, we propose numerical methods for solving the Stein equation AXC - X - D = 0 where the matrix A is large and sparse. Such problems appear in discrete-time control problems, filtering and image restoration. We consider the case where the matrix D is of full rank and the case where D is factored as a product of two matrices. The proposed methods are Krylov subspace methods based on the block Arnoldi algorithm. We give theoretical results and we report some numerical experiments.
Abstract: Students in high education are presented with new terms and concepts in nearly every lecture they attend. Many of them prefer Web-based self-tests for evaluation of their concepts understanding since they can use those tests independently of tutors- working hours and thus avoid the necessity of being in a particular place at a particular time. There is a large number of multiple-choice tests in almost every subject designed to contribute to higher level learning or discover misconceptions. Every single test provides immediate feedback to a student about the outcome of that test. In some cases a supporting system displays an overall score in case a test is taken several times by a student. What we still find missing is how to secure delivering of personalized feedback to a user while taking into consideration the user-s progress. The present work is motivated to throw some light on that question.
Abstract: Three-dimensional reconstruction of small objects has
been one of the most challenging problems over the last decade.
Computer graphics researchers and photography professionals have
been working on improving 3D reconstruction algorithms to fit the
high demands of various real life applications. Medical sciences,
animation industry, virtual reality, pattern recognition, tourism
industry, and reverse engineering are common fields where 3D
reconstruction of objects plays a vital role. Both lack of accuracy and
high computational cost are the major challenges facing successful
3D reconstruction. Fringe projection has emerged as a promising 3D
reconstruction direction that combines low computational cost to both
high precision and high resolution. It employs digital projection,
structured light systems and phase analysis on fringed pictures.
Research studies have shown that the system has acceptable
performance, and moreover it is insensitive to ambient light.
This paper presents an overview of fringe projection approaches. It
also presents an experimental study and implementation of a simple
fringe projection system. We tested our system using two objects
with different materials and levels of details. Experimental results
have shown that, while our system is simple, it produces acceptable
results.
Abstract: We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions.
Abstract: As privacy becomes a major concern for consumers
and enterprises, many research have been focused on the privacy
protecting technology in recent years. In this paper, we present a
comprehensive approach for usage access control based on the notion
purpose. In our model, purpose information associated with a given
data element specifies the intended use of the subjects and objects in
the usage access control model. A key feature of our model is that it
allows when an access is required, the access purpose is checked
against the intended purposes for the data item. We propose an
approach to represent purpose information to support access control
based on purpose information. Our proposed solution relies on usage
access control (UAC) models as well as the components which based
on the notions of the purpose information used in subjects and
objects. Finally, comparisons with related works are analyzed.
Abstract: In this paper we introduce an efficient solution
method for the Eigen-decomposition of bisymmetric and per
symmetric matrices of symmetric structures. Here we decompose
adjacency and Laplacian matrices of symmetric structures to submatrices
with low dimension for fast and easy calculation of
eigenvalues and eigenvectors. Examples are included to show the
efficiency of the method.
Abstract: Let G be an arbitrary group with identity e and let
R be a G-graded ring. In this paper we define graded semiprime submodules of a graded R-moduleM and we give a number of results
concerning such submodules. Also, we extend some results of graded semiprime submoduls to graded weakly semiprime submodules.
Abstract: This paper studies ruin probabilities in two discrete-time
risk models with premiums, claims and rates of interest modelled by
three autoregressive moving average processes. Generalized Lundberg
inequalities for ruin probabilities are derived by using recursive
technique. A numerical example is given to illustrate the applications
of these probability inequalities.
Abstract: In this paper the concept of the cosets of an anti Lfuzzy
normal subgroup of a group is given. Furthermore, the group
G/A of cosets of an anti L-fuzzy normal subgroup A of a group
G is shown to be isomorphic to a factor group of G in a natural
way. Finally, we prove that if f : G1 -→ G2 is an epimorphism of
groups, then there is a one-to-one order-preserving correspondence
between the anti L-fuzzy normal subgroups of G2 and those of G1
which are constant on the kernel of f.
Abstract: In this paper, by using the continuation theorem of coincidence degree theory, M-matrix theory and constructing some suitable Lyapunov functions, some sufficient conditions are obtained for the existence and global exponential stability of periodic solutions of recurrent neural networks with distributed delays and impulses on time scales. Without assuming the boundedness of the activation functions gj, hj , these results are less restrictive than those given in the earlier references.