Abstract: The aim of this paper is to review some of standard fact on Miura curves. We give some easy theorem in number theory to define Miura curves, then we present a new implementation of Arita algorithm for Miura curves.
Abstract: This paper presents a simple three phase power flow
method for solution of three-phase unbalanced radial distribution
system (RDN) with voltage dependent loads. It solves a simple
algebraic recursive expression of voltage magnitude, and all the data
are stored in vector form. The algorithm uses basic principles of
circuit theory and can be easily understood. Mutual coupling between
the phases has been included in the mathematical model. The
proposed algorithm has been tested with several unbalanced radial
distribution networks and the results are presented in the article. 8-
bus and IEEE 13 bus unbalanced radial distribution system results
are in agreements with the literature and show that the proposed
model is valid and reliable.
Abstract: This article is presented an experimental and modeling
study of a four-bed pressure swing adsorption process using
zeolite13X to provide oxygen-enriched air. The binary mixture N2/O2
(79/21 vol %) was used as a feed stream. The effects of purge/feed
ratio (P/F), adsorption pressure, cyclic time and product flow rate on
product purity and recovery under nonisothermal condition were
studied. The adsorption dynamics of process were determined using
a mathematical model incorporated mass and energy balances. A
Mathlab code using finite difference method was developed to solve
the set of coupled differential-algebraic equations, and the simulation
results are agreed well with experimental results.
Abstract: In this paper, we propose a new method to describe fractal shapes using parametric l-systems. First we introduce scaling factors in the production rules of the parametric l-systems grammars. Then we decorticate these grammars with scaling factors using turtle algebra to show the mathematical relation between l-systems and iterated function systems (IFS). We demonstrate that with specific values of the scaling factors, we find the exact relationship established by Prusinkiewicz and Hammel between l-systems and IFS.
Abstract: Wireless sensor network can be applied to both abominable
and military environments. A primary goal in the design of
wireless sensor networks is lifetime maximization, constrained by
the energy capacity of batteries. One well-known method to reduce
energy consumption in such networks is data aggregation. Providing
efcient data aggregation while preserving data privacy is a challenging
problem in wireless sensor networks research. In this paper,
we present privacy-preserving data aggregation scheme for additive
aggregation functions. The Cluster-based Private Data Aggregation
(CPDA)leverages clustering protocol and algebraic properties of
polynomials. It has the advantage of incurring less communication
overhead. The goal of our work is to bridge the gap between
collaborative data collection by wireless sensor networks and data
privacy. We present simulation results of our schemes and compare
their performance to a typical data aggregation scheme TAG, where
no data privacy protection is provided. Results show the efficacy and
efficiency of our schemes.
Abstract: Let A and B be two linear algebras. A linear map ϕ : A → B is called an n-homomorphism if ϕ(a1...an) = ϕ(a1)...ϕ(an) for all a1, ..., an ∈ A. In this note we have a verification on the behavior of almost n-multiplicative linear maps with n > 2 in the fuzzy normed spaces
Abstract: In this note first we define the notions of intuitionistic
fuzzy dual positive implicative hyper K-ideals of types
1,2,3,4 and intuitionistic fuzzy dual hyper K-ideals. Then we
give some classifications about these notions according to the
level subsets. Also by given some examples we show that these
notions are not equivalent, however we prove some theorems
which show that there are some relationships between these
notions. Finally we define the notions of product and antiproduct
of two fuzzy subsets and then give some theorems
about the relationships between the intuitionistic fuzzy dual
positive implicative hyper K-ideal of types 1,2,3,4 and their
(anti-)products, in particular we give a main decomposition
theorem.
Abstract: In this study, a fuzzy similarity approach for Arabic
web pages classification is presented. The approach uses a fuzzy
term-category relation by manipulating membership degree for the
training data and the degree value for a test web page. Six measures
are used and compared in this study. These measures include:
Einstein, Algebraic, Hamacher, MinMax, Special case fuzzy and
Bounded Difference approaches. These measures are applied and
compared using 50 different Arabic web pages. Einstein measure was
gave best performance among the other measures. An analysis of
these measures and concluding remarks are drawn in this study.
Abstract: Based on general proportional integral (GPI) observers and sliding mode control technique, a robust control method is proposed for the master-slave synchronization of chaotic systems in the presence of parameter uncertainty and with partially measurable output signal. By using GPI observer, the master dynamics are reconstructed by the observations from a measurable output under the differential algebraic framework. Driven by the signals provided by GPI observer, a sliding mode control technique is used for the tracking control and synchronization of the master-slave dynamics. The convincing numerical results reveal the proposed method is effective, and successfully accommodate the system uncertainties, disturbances, and noisy corruptions.
Abstract: The link between Gröbner basis and linear algebra was
described by Lazard [4,5] where he realized the Gr¨obner basis
computation could be archived by applying Gaussian elimination over
Macaulay-s matrix .
In this paper, we indicate how same technique may be used to
SAGBI- Gröbner basis computations in invariant rings.
Abstract: A plausible architecture of an ancient genetic code is derived from an extended base triplet vector space over the Galois field of the extended base alphabet {D, G, A, U, C}, where the letter D represent one or more hypothetical bases with unspecific pairing. We hypothesized that the high degeneration of a primeval genetic code with five bases and the gradual origin and improvements of a primitive DNA repair system could make possible the transition from the ancient to the modern genetic code. Our results suggest that the Watson-Crick base pairing and the non-specific base pairing of the hypothetical ancestral base D used to define the sum and product operations are enough features to determine the coding constraints of the primeval and the modern genetic code, as well as the transition from the former to the later. Geometrical and algebraic properties of this vector space reveal that the present codon assignment of the standard genetic code could be induced from a primeval codon assignment. Besides, the Fourier spectrum of the extended DNA genome sequences derived from the multiple sequence alignment suggests that the called period-3 property of the present coding DNA sequences could also exist in the ancient coding DNA sequences.
Abstract: In this paper, the Fuzzy Autocatalytic Set (FACS) is
composed into Omega Algebra by embedding the membership value
of fuzzy edge connectivity using the property of transitive affinity.
Then, the Omega Algebra of FACS is a transformation semigroup
which is a special class of semigroup is shown.
Abstract: In this paper, we show that C*-tensor product of an arbitrary C*-algebra A, (not unital necessary) and C*-algebra B without ground state, have no approximately inner strongly continuous one-parameter group of *-automorphisms.
Abstract: This work addresses the problem of optimizing
completely batch water-using network with multiple contaminants
where the flow change caused by mass transfer is taken into
consideration for the first time. A mathematical technique for
optimizing water-using network is proposed based on
source-tank-sink superstructure. The task is to obtain the freshwater
usage, recycle assignments among water-using units, wastewater
discharge and a steady water-using network configuration by
following steps. Firstly, operating sequences of water-using units are
determined by time constraints. Next, superstructure is simplified by
eliminating the reuse and recycle from water-using units with
maximum concentration of key contaminants. Then, the non-linear
programming model is solved by GAMS (General Algebra Model
System) for minimum freshwater usage, maximum water recycle and
minimum wastewater discharge. Finally, numbers of operating periods
are calculated to acquire the steady network configuration. A case
study is solved to illustrate the applicability of the proposed approach.
Abstract: The usual correctness condition for a schedule of
concurrent database transactions is some form of serializability of
the transactions. For general forms, the problem of deciding whether
a schedule is serializable is NP-complete. In those cases other approaches
to proving correctness, using proof rules that allow the steps
of the proof of serializability to be guided manually, are desirable.
Such an approach is possible in the case of conflict serializability
which is proved algebraically by deriving serial schedules using
commutativity of non-conflicting operations. However, conflict serializability
can be an unnecessarily strong form of serializability restricting
concurrency and thereby reducing performance. In practice,
weaker, more general, forms of serializability for extended models of
transactions are used. Currently, there are no known methods using
proof rules for proving those general forms of serializability. In this
paper, we define serializability for an extended model of partitioned
transactions, which we show to be as expressive as serializability
for general partitioned transactions. An algebraic method for proving
general serializability is obtained by giving an initial-algebra specification
of serializable schedules of concurrent transactions in the
model. This demonstrates that it is possible to conduct algebraic
proofs of correctness of concurrent transactions in general cases.
Abstract: For the purpose of finding the quotient structure of multiple algebras such as groups, Abelian groups and rings, we will state concepts of ( strong or weak ) equalities on multiple algebras, which will lead us to research on how ( strong or weak) are equalities defined on a multiple algebra over the quotients obtained from it. In order to find a quotient structure of multiple algebras such as groups, Abelian groups and loops, a part of this article has been allocated to the concepts of equalities (strong and weak) of the defined multiple functions on multiple algebras. This leads us to do research on how defined equalities (strong and weak) are made in the multiple algebra on its resulted quotient.
Abstract: To investigate some relations between higher mathe¬matics scores in Chinese graduate student entrance examination and calculus (resp. linear algebra, probability statistics) scores in subject's completion examination of Chinese university, we select 20 students as a sample, take higher mathematics score as a decision attribute and take calculus score, linear algebra score, probability statistics score as condition attributes. In this paper, we are based on rough-set theory (Rough-set theory is a logic-mathematical method proposed by Z. Pawlak. In recent years, this theory has been widely implemented in the many fields of natural science and societal science.) to investigate importance of condition attributes with respective to decision attribute and strength of condition attributes supporting decision attribute. Results of this investigation will be helpful for university students to raise higher mathematics scores in Chinese graduate student entrance examination.
Abstract: In order to consider the effects of the higher modes in
the pushover analysis, during the recent years several multi-modal
pushover procedures have been presented. In these methods the
response of the considered modes are combined by the square-rootof-
sum-of-squares (SRSS) rule while application of the elastic modal
combination rules in the inelastic phases is no longer valid. In this
research the feasibility of defining an efficient alternative
combination method is investigated. Two steel moment-frame
buildings denoted SAC-9 and SAC-20 under ten earthquake records
are considered. The nonlinear responses of the structures are
estimated by the directed algebraic combination of the weighted
responses of the separate modes. The weight of the each mode is
defined so that the resulted response of the combination has a
minimum error to the nonlinear time history analysis. The genetic
algorithm (GA) is used to minimize the error and optimize the weight
factors. The obtained optimal factors for each mode in different cases
are compared together to find unique appropriate weight factors for
each mode in all cases.
Abstract: The flexible follower response of a translating cam with
four different profiles for rise-dwell-fall-dwell (RDFD) motion is
investigated. The cycloidal displacement motion, the modified
sinusoidal acceleration motion, the modified trapezoidal acceleration
motion, and the 3-4-5 polynomial motion are employed to describe the
rise and the fall motions of the follower and the associated four kinds of
cam profiles are studied. Since the follower flexibility is considered,
the contact point of the roller and the cam is an unknown. Two
geometric constraints formulated to restrain the unknown position are
substituted into Hamilton-s principle with Lagrange multipliers.
Applying the assumed mode method, one can obtain the governing
equations of motion as non-linear differential-algebraic equations. The
equations are solved using Runge-Kutta method. Then, the responses of
the flexible follower undergoing the four different motions are
investigated in time domain and in frequency domain.