Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userS.N Algorithm To Find Cycle Intersection Of Tow Projective Curves
الخوارزمية S.N لإيجاد التقاطع الحلقي لمنحنيين اسقاطيين
679
0 53
0
(
0
)
Added by
Aِl-Baath University ورقة بحثية
Publication date
2016
fields
Mathematics
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
قد يصعب , في كثير من الأحيان , إيجاد التقاطع الحلقي لمنحنيين في المستوي الإسقاطي. و لذا نقدم , في ورقتنا البحثية الحالية , آلية جديدة لإيجاده ممثلة بالخوارزمية S.N التي تعمل على تبسيط التقاطع المفروض إلى مجموع تقاطعات حلقية يسيل إيجادها. و من جهة أخرى استفدنا من الخوارزمية S.N لبناء برهان جديد و مبسط لمبرهنة بيزوت المعروفة.
It may be difficult, often, finding the cycle intersection of two curves in the projective plane. Therefore, in our paper, we have mentioned a new mechanism to find it which was represented by S.N algorithm that works on writing this intersection as sum of simple cycle intersections which is easy to find. On the other hand, by this algorithm we mentioned a new and simplified proof of the known Bezout’s theorem.
References used
COX, D and LITTLE, J and OSHEA, D 2007 - Ideals, varieties, and algorithms . Springer, p551
COX, D and LITTLE, J and OSHEA, D 2005 - Using Algebraic Geometry . Springer, p572
FULTON, W 2008 - Algebraic curves .,an introduction to Algebraic Geometry , Springer, Third Preface, p121
rate research
Read More
This research focuses on optimising the traffic control at ( Al-
TARBYA) signalised intersection in Homs city to improve its
capacity and the Level Of Service (LOS).
The importance of this research comes from analysing the
movement of vehicles, p
edestrians, the intersection geometry, signal
phasing plan on the intersection, and referring to some problems
affects the intersection in order to get the best improvement to
traffic movement at the aforementioned intersection.
The principal objective of this research is an adoption of the Genetic
Algorithm (GA) for studying it firstly, and to stop over the operations which
are introduced from the genetic algorithm.The candidate field for applying
the operations of the g
enetic algorithm is the sound data compression field.
This research uses the operations of the genetic algorithm for the
enhancement of the performance of one of the popular compression method.
Vector Quantization (VQ) method is selected in this work. After studying
this method, new proposed algorithm for mixing the (GA) with this method
was constructed and then the required programs for testing this algorithm
was written. A good enhancement was recorded for the performance of the
(VQ) method when mixed with the (GA). The proposed algorithm was
tested by applying it on some sound data files. Some fidelity measures are
calculated to evaluate the performance of the new proposed algorithm.
In this paper, we introduce an Effective algorithm to find the
shortest path in Multiple – Source Graph, by choosing the path
between the source and the distance that gives at least the length of
the path down to the sink. This algorithm is based
on the principle
of iteration to access the optimal solution of the shortest-path
problem, Where the algorithm steps are repeated for all the darts in
the Graph. We proved that the time of implementation of the
proposed algorithm in this paper is linear time O(n+L) and This is
considered the best times of the algorithms at all.
Thin walled Steel products are very much used in the construction industry, where it
is cold formed from uniform thickness steel plates. This study aims at determining the
optimal section of cold formed thin walled lipped C compressed member under
the effect
of several levels of axial force using Genetic Algorithm.
The research found that the genetic algorithm is able to resolve the issue of the
optimal design of studied column with high efficiency, accuracy. Also it found that the
torsional flexural buckling constraint and the overall buckling constraint in x-direction are
the effective constraints in case of long height.
The study recommends restudying the same issue as a multi objective optimization
problem by adding additional objective functions which are the overall buckling in x&y
directions.
The all-nodes shortest paths problem is undoubtedly one of
the most basic problems in algorithmic graph theory. In this paper,
we introduce simple and efficient algorithm for all nodes shortest
paths problem for directed (undirected) graphs. In th
is problem, we
find the shortest path from a given source node to all other nodes in
the graph, in which the shortest path is a path with minimum cost,
i.e., sum of the edge weights.
We proved that the complexity of the proposed algorithm in
this paper depends only on the edges graph, and we show that the
time of implementation of this algorithm is linear time O(m) and
This is considered the best times of the algorithms at all. And
a Comparison between complexity of proposed algorithm and the
famous shortest path algorithms have been made, and the obtained
results have shown that the complexity of the proposed algorithm
is best.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
