Abstract: This paper presents a procedure of forming the
mathematical model of radial electric power systems for simulation
of both transient and steady-state conditions. The research idea has
been based on nodal voltages technique and on differentiation of
Kirchhoff's current law (KCL) applied to each non-reference node of
the radial system, the result of which the nodal voltages has been
calculated by solving a system of algebraic equations. Currents of the
electric power system components have been determined by solving
their respective differential equations. Transforming the three-phase
coordinate system into Cartesian coordinate system in the model
decreased the overall number of equations by one third. The use of
Cartesian coordinate system does not ignore the DC component
during transient conditions, but restricts the model's implementation
for symmetrical modes of operation only. An example of the input
data for a four-bus radial electric power system has been calculated.
Abstract: To analyze the behavior of Petri nets, the accessibility
graph and Model Checking are widely used. However, if the
analyzed Petri net is unbounded then the accessibility graph becomes
infinite and Model Checking can not be used even for small Petri
nets. ECATNets [2] are a category of algebraic Petri nets. The main
feature of ECATNets is their sound and complete semantics based on
rewriting logic [8] and its language Maude [9]. ECATNets analysis
may be done by using techniques of accessibility analysis and Model
Checking defined in Maude. But, these two techniques supported by
Maude do not work also with infinite-states systems. As a category
of Petri nets, ECATNets can be unbounded and so infinite systems.
In order to know if we can apply accessibility analysis and Model
Checking of Maude to an ECATNet, we propose in this paper an
algorithm allowing the detection if the ECATNet is bounded or not.
Moreover, we propose a rewriting logic based tool implementing this
algorithm. We show that the development of this tool using the
Maude system is facilitated thanks to the reflectivity of the rewriting
logic. Indeed, the self-interpretation of this logic allows us both the
modelling of an ECATNet and acting on it.
Abstract: In this paper, a numerical solution based on sinc
functions is used for finding the solution of boundary value problems
which arise from the problems of calculus of variations. This
approximation reduce the problems to an explicit system of algebraic
equations. Some numerical examples are also given to illustrate the
accuracy and applicability of the presented method.
Abstract: The notions of I-vague normal groups with membership
and non-membership functions taking values in an involutary dually
residuated lattice ordered semigroup are introduced which generalize
the notions with truth values in a Boolean algebra as well as those
usual vague sets whose membership and non-membership functions
taking values in the unit interval [0, 1]. Various operations and
properties are established.
Abstract: Applying the idea of soft set theory to lattice implication algebras, the novel concept of (implicative) filteristic soft lattice implication algebras which related to (implicative) filter(for short, (IF-)F-soft lattice implication algebras) are introduced. Basic properties of (IF-)F-soft lattice implication algebras are derived. Two kinds of fuzzy filters (i.e.(2, 2 _qk)((2, 2 _ qk))-fuzzy (implicative) filter) of L are introduced, which are generalizations of fuzzy (implicative) filters. Some characterizations for a soft set to be a (IF-)F-soft lattice implication algebra are provided. Analogously, this idea can be used in other types of filteristic lattice implication algebras (such as fantastic (positive implicative) filteristic soft lattice implication algebras).
Abstract: Grobner basis calculation forms a key part of computational
commutative algebra and many other areas. One important
ramification of the theory of Grobner basis provides a means to solve
a system of non-linear equations. This is why it has become very
important in the areas where the solution of non-linear equations is
needed, for instance in algebraic cryptanalysis and coding theory. This
paper explores on a parallel-distributed implementation for Grobner
basis calculation over GF(2). For doing so Buchberger algorithm is
used. OpenMP and MPI-C language constructs have been used to
implement the scheme. Some relevant results have been furnished
to compare the performances between the standalone and hybrid
(parallel-distributed) implementation.
Abstract: Location-aware computing is a type of pervasive
computing that utilizes user-s location as a dominant factor for
providing urban services and application-related usages. One of the
important urban services is navigation instruction for wayfinders in a
city especially when the user is a tourist. The services which are
presented to the tourists should provide adapted location aware
instructions. In order to achieve this goal, the main challenge is to
find spatial relevant objects and location-dependent information. The
aim of this paper is the development of a reusable location-aware
model to handle spatial relevancy parameters in urban location-aware
systems. In this way we utilized ontology as an approach which could
manage spatial relevancy by defining a generic model. Our
contribution is the introduction of an ontological model based on the
directed interval algebra principles. Indeed, it is assumed that the
basic elements of our ontology are the spatial intervals for the user
and his/her related contexts. The relationships between them would
model the spatial relevancy parameters. The implementation language
for the model is OWLs, a web ontology language. The achieved
results show that our proposed location-aware model and the
application adaptation strategies provide appropriate services for the
user.
Abstract: The purpose of this research is to study the concepts
of multiple Cartesian product, variety of multiple algebras and to
present some examples. In the theory of multiple algebras, like other
theories, deriving new things and concepts from the things and
concepts available in the context is important. For example, the first
were obtained from the quotient of a group modulo the equivalence
relation defined by a subgroup of it. Gratzer showed that every
multiple algebra can be obtained from the quotient of a universal
algebra modulo a given equivalence relation.
The purpose of this study is examination of multiple algebras and
basic relations defined on them as well as introduction to some
algebraic structures derived from multiple algebras. Among the
structures obtained from multiple algebras, this article studies submultiple
algebras, quotients of multiple algebras and the Cartesian
product of multiple algebras.
Abstract: The nonlinear chaotic non-autonomous fourth order
system is algebraically simple but can generate complex chaotic
attractors. In this paper, non-autonomous fourth order chaotic
oscillator circuits were designed and simulated. Also chaotic nonautonomous
Attractor is addressed suitable for chaotic masking
communication circuits using Matlab® and MultiSIM® programs.
We have demonstrated in simulations that chaos can be synchronized
and applied to signal masking communications. We suggest that this
phenomenon of chaos synchronism may serve as the basis for little
known chaotic non-autonomous Attractor to achieve signal masking
communication applications. Simulation results are used to visualize
and illustrate the effectiveness of non-autonomous chaotic system in
signal masking. All simulations results performed on nonautonomous
chaotic system are verify the applicable of secure
communication.
Abstract: Factoring Boolean functions is one of the basic operations in algorithmic logic synthesis. A novel algebraic factorization heuristic for single-output combinatorial logic functions is presented in this paper and is developed based on the set theory paradigm. The impact of factoring is analyzed mainly from a low power design perspective for standard cell based digital designs in this paper. The physical implementation of a number of MCNC/IWLS combinational benchmark functions and sub-functions are compared before and after factoring, based on a simple technology mapping procedure utilizing only standard gate primitives (readily available as standard cells in a technology library) and not cells corresponding to optimized complex logic. The power results were obtained at the gate-level by means of an industry-standard power analysis tool from Synopsys, targeting a 130nm (0.13μm) UMC CMOS library, for the typical case. The wire-loads were inserted automatically and the simulations were performed with maximum input activity. The gate-level simulations demonstrate the advantage of the proposed factoring technique in comparison with other existing methods from a low power perspective, for arbitrary examples. Though the benchmarks experimentation reports mixed results, the mean savings in total power and dynamic power for the factored solution over a non-factored solution were 6.11% and 5.85% respectively. In terms of leakage power, the average savings for the factored forms was significant to the tune of 23.48%. The factored solution is expected to better its non-factored counterpart in terms of the power-delay product as it is well-known that factoring, in general, yields a delay-efficient multi-level solution.
Abstract: In this paper, center conditions and bifurcation of limit cycles at the nilpotent critical point in a class of quintic polynomial differential system are investigated.With the help of computer algebra system MATHEMATICA, the first 10 quasi Lyapunov constants are deduced. As a result, sufficient and necessary conditions in order to have a center are obtained. The fact that there exist 10 small amplitude limit cycles created from the three order nilpotent critical point is also proved. Henceforth we give a lower bound of cyclicity of three-order nilpotent critical point for quintic Lyapunov systems. At last, we give an system which could bifurcate 10 limit circles.
Abstract: The control design for unmanned underwater vehicles (UUVs) is challenging due to the uncertainties in the complex dynamic modeling of the vehicle as well as its unstructured operational environment. To cope with these difficulties, a practical robust control is therefore desirable. The paper deals with the application of coefficient diagram method (CDM) for a robust control design of an autonomous underwater vehicle. The CDM is an algebraic approach in which the characteristic polynomial and the controller are synthesized simultaneously. Particularly, a coefficient diagram (comparable to Bode diagram) is used effectively to convey pertinent design information and as a measure of trade-off between stability, response speed and robustness. In the polynomial ring, Kharitonov polynomials are employed to analyze the robustness of the controller due to parametric uncertainties.
Abstract: In this paper we propose, a Lagrangian method to solve unsteady gas equation which is a nonlinear ordinary differential equation on semi-infnite interval. This approach is based on Modified generalized Laguerre functions. This method reduces the solution of this problem to the solution of a system of algebraic equations. We also compare this work with some other numerical results. The findings show that the present solution is highly accurate.
Abstract: The aim of this paper is to determine Frenet-Serret invariants of non-null curves in Lorentzian 5-space. First, we define a vector product of four vectors, by this way, we present a method to calculate Frenet-Serret invariants of the non-null curves. Additionally, an algebraic example of presented method is illustrated.
Abstract: The distinction among urban, periurban and rural areas represents a classical example of uncertainty in land classification. Satellite images, geostatistical analysis and all kinds of spatial data are very useful in urban sprawl studies, but it is important to define precise rules in combining great amounts of data to build complex knowledge about territory. Rough Set theory may be a useful method to employ in this field. It represents a different mathematical approach to uncertainty by capturing the indiscernibility. Two different phenomena can be indiscernible in some contexts and classified in the same way when combining available information about them. This approach has been applied in a case of study, comparing the results achieved with both Map Algebra technique and Spatial Rough Set. The study case area, Potenza Province, is particularly suitable for the application of this theory, because it includes 100 municipalities with different number of inhabitants and morphologic features.
Abstract: In this paper, the existence of multiple positive
solutions for a class of third-order three-point discrete boundary value
problem is studied by applying algebraic topology method.
Abstract: In this paper the performance of unified power flow
controller is investigated in controlling the flow of po wer over the
transmission line. Voltage sources model is utilized to study the
behaviour of the UPFC in regulating the active, reactive power and
voltage profile. This model is incorporated in Newton Raphson
algorithm for load flow studies. Simultaneous method is employed
in which equations of UPFC and the power balance equations of
network are combined in to one set of non-linear algebraic equations.
It is solved according to the Newton raphson algorithm. Case studies
are carried on standard 5 bus network. Simulation is done in Matlab.
The result of network with and without using UPFC are compared in
terms of active and reactive power flows in the line and active and
reactive power flows at the bus to analyze the performance of UPFC.
Abstract: The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
setting. In this paper, we give an algorithm to show that Groebner
bases computation is P-SPACE in Boolean rings. We also show that
with this discovery, the Groebner bases method can theoretically be
as efficient as other methods for automated verification of hardware
and software. Additionally, many useful and interesting properties of
Groebner bases including the ability to efficiently convert the bases
for different orders of variables making Groebner bases a promising
method in automated verification.
Abstract: A numerical method for Riccati equation is presented in this work. The method is based on the replacement of unknown functions through a truncated series of hybrid of block-pulse functions and Chebyshev polynomials. The operational matrices of derivative and product of hybrid functions are presented. These matrices together with the tau method are then utilized to transform the differential equation into a system of algebraic equations. Corresponding numerical examples are presented to demonstrate the accuracy of the proposed method.
Abstract: We investigate the planar quasi-septic non-analytic systems which have a center-focus equilibrium at the origin and whose angular speed is constant. The system could be changed into an analytic system by two transformations, with the help of computer algebra system MATHEMATICA, the conditions of uniform isochronous center are obtained.