Abstract: With the increasing spread of computers and the internet among culturally, linguistically and geographically diverse communities, issues of internationalization and localization and becoming increasingly important. For some of the issues such as different scales for length and temperature, there is a well-developed measurement theory. For others such as date formats no such theory will be possible. This paper fills a gap by developing a measurement theory for a class of scales previously overlooked, based on discrete and interval-valued scales such as spanner and shoe sizes. The paper gives a theoretical foundation for a class of data representation problems.
Abstract: In this paper we propose a new approach to constructing the Delaunay Triangulation and the optimum algorithm for the case of multidimensional spaces (d ≥ 2). Analysing the modern state, it is possible to draw a conclusion, that the ideas for the existing effective algorithms developed for the case of d ≥ 2 are not simple to generalize on a multidimensional case, without the loss of efficiency. We offer for the solving this problem an effective algorithm that satisfies all the given requirements. But theoretical complexity of the problem it is impossible to improve as the Worst - Case Optimality for algorithms of solving such a problem is proved.
Abstract: Process measurement is the task of empirically and objectively assigning numbers to the properties of business processes in such a way as to describe them. Desirable attributes to study and measure include complexity, cost, maintainability, and reliability. In our work we will focus on investigating process complexity. We define process complexity as the degree to which a business process is difficult to analyze, understand or explain. One way to analyze a process- complexity is to use a process control-flow complexity measure. In this paper, an attempt has been made to evaluate the control-flow complexity measure in terms of Weyuker-s properties. Weyuker-s properties must be satisfied by any complexity measure to qualify as a good and comprehensive one.
Abstract: In this note, we consider a family of iterative formula for computing the weighted Minskowski inverses AM,N in Minskowski space, and give two kinds of iterations and the necessary and sufficient conditions of the convergence of iterations.
Abstract: A numerical simulation of vortex-induced vibration of
a 2-dimensional elastic circular cylinder with two degree of freedom
under the uniform flow is calculated when Reynolds is 200.
2-dimensional incompressible Navier-Stokes equations are solved
with the space-time finite element method, the equation of the cylinder
motion is solved with the new explicit integral method and the mesh
renew is achieved by the spring moving mesh technology. Considering
vortex-induced vibration with the low reduced damping parameter, the
variety trends of the lift coefficient, the drag coefficient, the
displacement of cylinder are analyzed under different oscillating
frequencies of cylinder. The phenomena of locked-in, beat and
phases-witch were captured successfully. The evolution of vortex
shedding from the cylinder with time is discussed. There are very
similar trends in characteristics between the results of the one degree
of freedom cylinder model and that of the two degree of freedom
cylinder model. The streamwise vibrations have a certain effect on the
lateral vibrations and their characteristics.
Abstract: In this paper, the sum of squares in linear regression is
reduced to sum of squares in semi-parametric regression. We
indicated that different sums of squares in the linear regression are
similar to various deviance statements in semi-parametric regression.
In addition to, coefficient of the determination derived in linear
regression model is easily generalized to coefficient of the
determination of the semi-parametric regression model. Then, it is
made an application in order to support the theory of the linear
regression and semi-parametric regression. In this way, study is
supported with a simulated data example.
Abstract: In this paper we propose a class of second derivative multistep methods for solving some well-known classes of Lane- Emden type equations which are nonlinear ordinary differential equations on the semi-infinite domain. These methods, which have good stability and accuracy properties, are useful in deal with stiff ODEs. We show superiority of these methods by applying them on the some famous Lane-Emden type equations.
Abstract: In this paper, two versions of an iterative loopless
algorithm for the classical towers of Hanoi problem with O(1) storage complexity and O(2n) time complexity are presented. Based
on this algorithm the number of different moves in each of pegs with its direction is formulated.
Abstract: Solution of some practical problems is reduced to the
solution of the integro-differential equations. But for the numerical
solution of such equations basically quadrature methods or its
combination with multistep or one-step methods are used. The
quadrature methods basically is applied to calculation of the integral
participating in right hand side of integro-differential equations. As
this integral is of Volterra type, it is obvious that at replacement with
its integrated sum the upper limit of the sum depends on a current
point in which values of the integral are defined. Thus we receive the
integrated sum with variable boundary, to work with is hardly.
Therefore multistep method with the constant coefficients, which is
free from noted lack and gives the way for finding it-s coefficients is
present.
Abstract: The theory of rough sets is generalized by using a
filter. The filter is induced by binary relations and it is used to
generalize the basic rough set concepts. The knowledge
representations and processing of binary relations in the style of
rough set theory are investigated.
Abstract: Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if every vertex v ∈ V -D is strongly (weakly) dominated by some vertex u in D. We denote a strong (weak) fuzzy dominating set by sfd-set (wfd-set). The minimum scalar cardinality of a sfd-set (wfd-set) is called the strong (weak) fuzzy domination number of G and it is denoted by γsf (G)γwf (G). In this paper we introduce the concept of strong (weak) domination in fuzzy graphs and obtain some interesting results for this new parameter in fuzzy graphs.
Abstract: Change in impedance of an encircling coil is obtained
in the present paper for the case where the electric conductivity and
magnetic permeability of a metal cylindrical tube depend on the
radial coordinate. The system of equations for the vector potential is
solved by means of the Fourier cosine transform. The solution is
expressed in terms of improper integral containing modified Bessel
functions of complex order.
Abstract: We present new finite element methods for Helmholtz and Maxwell equations on general three-dimensional polyhedral meshes, based on domain decomposition with boundary elements on the surfaces of the polyhedral volume elements. The methods use the lowest-order polynomial spaces and produce sparse, symmetric linear systems despite the use of boundary elements. Moreover, piecewise constant coefficients are admissible. The resulting approximation on the element surfaces can be extended throughout the domain via representation formulas. Numerical experiments confirm that the convergence behavior on tetrahedral meshes is comparable to that of standard finite element methods, and equally good performance is attained on more general meshes.
Abstract: The Stokes equation connected with the fluid flow
over the axisymmetric bodies in a cylindrical area is considered. The
equation is studied in a moving coordinate system with the
appropriate boundary conditions. Effective formulas for the velocity
components are obtained. The graphs of the velocity components and
velocity profile are plotted.
Abstract: Exponentially weighted moving average control chart (EWMA) is a popular chart used for detecting shift in the mean of parameter of distributions in quality control. The objective of this paper is to compare the efficiency of control chart to detect an increases in the mean of a process. In particular, we compared the Maximum Exponentially Weighted Moving Average (MaxEWMA) and Maximum Generally Weighted Moving Average (MaxGWMA) control charts when the observations are Exponential distribution. The criteria for evaluate the performance of control chart is called, the Average Run Length (ARL). The result of comparison show that in the case of process is small sample size, the MaxEWMA control chart is more efficiency to detect shift in the process mean than MaxGWMA control chart. For the case of large sample size, the MaxEWMA control chart is more sensitive to detect small shift in the process mean than MaxGWMA control chart, and when the process is a large shift in mean, the MaxGWMA control chart is more sensitive to detect mean shift than MaxEWMA control chart.
Abstract: In this paper, by introducing twice continuously differentiable mappings, we develop an interior path following following method, which enables us to give a constructive proof of the general Brouwer fixed point theorem and thus to solve fixed point problems in a class of non-convex sets. Under suitable conditions, a smooth path can be proven to exist. This can lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.
Abstract: In today-s modern world, the number of vehicles is
increasing on the road. This causes more people to choose walking
instead of traveling using vehicles. Thus, proper planning of
pedestrians- paths is important to ensure the safety of pedestrians in a
walking area. Crowd dynamics study the pedestrians- behavior and
modeling pedestrians- movement to ensure safety in their walking paths.
To date, many models have been designed to ease pedestrians-
movement. The Social Force Model is widely used among researchers
as it is simpler and provides better simulation results. We will discuss
the problem regarding the ritual of circumambulating the Ka-aba
(Tawaf) where the entrances to this area are usually congested which
worsens during the Hajj season. We will use the computer simulation
model SimWalk which is based on the Social Force Model to simulate
the movement of pilgrims in the Tawaf area. We will first discuss the
effect of uni and bi-directional flows at the gates. We will then restrict
certain gates to the area as the entrances only and others as exits only.
From the simulations, we will study the effect of the distance of other
entrances from the beginning line and their effects on the duration of
pilgrims circumambulate Ka-aba. We will distribute the pilgrims at the
different entrances evenly so that the congestion at the entrances can be
reduced. We would also discuss the various locations and designs of
barriers at the exits and its effect on the time taken for the pilgrims to
exit the Tawaf area.
Abstract: The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.
Abstract: In the present work, we propose a new method for
solving the matrix equation AXB=F . The new method can
be considered as a generalized form of the well-known global full
orthogonalization method (Gl-FOM) for solving multiple linear
systems. Hence, the method will be called extended Gl-FOM (EGl-
FOM). For implementing EGl-FOM, generalized forms of block
Krylov subspace and global Arnoldi process are presented. Finally,
some numerical experiments are given to illustrate the efficiency of
our new method.
Abstract: Beginning from the creator of integro-differential
equations Volterra, many scientists have investigated these
equations. Classic method for solving integro-differential
equations is the quadratures method that is successfully applied up
today. Unlike these methods, Makroglou applied hybrid methods
that are modified and generalized in this paper and applied to the
numerical solution of Volterra integro-differential equations. The
way for defining the coefficients of the suggested method is also
given.