Results 21 to 30 of about 157 (110)
Connecting graphs with R-hypermodules via normal fuzzy subhypermodules [PDF]
In this paper, we analyze the connection between R-hypermodules and graphs by associating a graph with an R- hypermodule through a normal fuzzy subhypermodule.
Fatemeh Niyazi +2 more
doaj +1 more source
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results [PDF]
Summary: In an edge-colored graph, we say that a path (cycle) is alternating if it has length at least 2 (3) and if any 2 adjacent edges of this path (cycle) have different colors. We give efficient algorithms for finding alternating factors with a minimum number of cycles and then, by using this result, we obtain polynomial algorithms for finding ...
Benkouar, A. +3 more
openaire +2 more sources
Fuzzy Eulerian and Fuzzy Hamiltonian Graphs with Their Applications
In this article we discussed prominence of Fuzzy Eulerian and Fuzzy Hamiltonian graphs. Fuzzy logic is introduced to study the uncertainty of the event. In Fuzzy set theory we assign a membership value to each element of the set which ranges from 0 to 1. The earnest efforts of the researchers are perceivable in the relevant establishment of the subject
Abdul. Muneera +2 more
openaire +1 more source
Scaling turbulence drives the general circulation
The NOAA Gulfstream SP4, which deployed the GPS dropsondes over the NE Pacific Ocean as part of the Winter Storms Project during the January–March periods of 2004, 2005 and 2006. Abstract Statistical multifractal analysis of airborne and dropsonde observations is used to show that persistence of velocity after molecular collisions breaks the continuous
Adrian F. Tuck
wiley +1 more source
This paper proposes a dual‐strategy collaborative reinforcement learning path planning method in response to current technical limitations and engineering requirements in concrete 3D printing path planning. A dual‐DQN model was constructed based on the dual strategy collaborative mechanism.
Dan Xu +3 more
wiley +1 more source
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES
Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization.
Al Aiyub, Mahyus Ihsan, Rahma Zuhra
doaj +2 more sources
GLONET: Mercator's End‐to‐End Neural Global Ocean Forecasting System
Abstract Accurate ocean forecasting is crucial in different areas ranging from science to decision making. Recent advancements in data‐driven models have shown significant promise, particularly in weather forecasting community, but yet no data‐driven approaches have matched the accuracy and the scalability of traditional global ocean forecasting ...
Anass El Aouni +7 more
wiley +1 more source
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
The different reflux hole areas. ABSTRACT To investigate the impact of the reflux hole area on the self‐priming performance of a self‐priming pump, this study innovatively established a circulating pipeline system that includes the self‐priming pump, water tank, and other components.
Ying‐Yu Ji +4 more
wiley +1 more source
On the wave turbulence theory of 2D gravity waves, I: Deterministic energy estimates
Abstract Our goal in this paper is to initiate the rigorous investigation of wave turbulence and derivation of wave kinetic equations (WKEs) for water waves models. This problem has received intense attention in recent years in the context of semilinear models, such as Schrödinger equations or multidimensional KdV‐type equations. However, our situation
Yu Deng +2 more
wiley +1 more source

