Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this work we have discussed the impact of thermal radiation on heat transfer to nanofluid flow over an unsteady permeable stretching sheet using various types of arbitrary shape nanoparticles of Copper (Cu), Silver (Ag), Alumina [...], and Titania Oxide [...] in the base fluid. Suitable transformations have been employed to build ODEs from the partial differential equations. Numerical results are therefore obtained particularly for cylindrical shape and spherical shape nanoparticles. Our analysis substantiates that the velocity and temperature profiles increases with enhanced thermal radiation parameter. Further, Nusselt number is more advanced for the nanofluid that contains cylindrical shape nanoparticles as compared to spherical shape nanoparticles.
EN
This article presents a combinatorial algorithm to find a shortest triangular path (STP) between two points inside a digital object imposed on triangular grid that runs in O(n/g log n/g) time, where n is the number of pixels on the contour of the object and g is the grid size. Initially, the inner triangular cover which maximally inscribes the object is constructed to ensure that the path lies within the object. An appropriate bounding parallelogram is considered with those two points in diagonally opposite corners and then one of the semi-perimeters of the parallelogram is traversed. Certain combinatorial rules are formulated based on the properties of triangular grid and are applied during the traversal whenever required to shorten the triangular path. A shortest triangular path between any two points may not be unique. Another combinatorial algorithm is presented, which finds the family of shortest triangular path (FSTP) (i.e., the region containing all possible shortest triangular paths) between two given points inside a digital object and runs in O(n/g log n/g) time. Experimental results are presented to verify the correctness, robustness, and efficacy of the algorithms. STP and FSTP can be useful for shape analysis of digital objects and determining shape signatures.
EN
This article presents a combinatorial algorithm to find a shortest triangular path (STP) between two points inside a digital object imposed on triangular grid that runs in O(n/g log n/g)time, where n is the number of pixels on the contour of the object and g is the grid size. Initially, the inner triangular cover which maximally inscribes the object is constructed to ensure that the path lies within the object. An appropriate bounding parallelogram is considered with those two points in diagonally opposite corners and then one of the semi-perimeters of the parallelogram is traversed. Certain combinatorial rules are formulated based on the properties of triangular grid and are applied during the traversal whenever required to shorten the triangular path. A shortest triangular path between any two points may not be unique. Another combinatorial algorithm is presented, which finds the family of shortest triangular path (FSTP) (i.e., the region containing all possible shortest triangular paths) between two given points inside a digital object and runs in O(n/g log n/g) time. Experimental results are presented to verify the correctness, robustness, and efficacy of the algorithms. STP and FSTP can be useful for shape analysis of digital objects and determining shape signatures.
EN
The purpose of this article is to develop a multicriteria group decision making (MCGDM) method in dual hesitant fuzzy (DHF) environment by evaluating the weights of the decision makers from the decision matrices using two newly defined prioritized aggregation operators based on score function to remove the inconsistencies in choosing the best alternative. Prioritized weighted averaging operator and prioritized weighted geometric operator based on Einstein operations are described first for aggregating DHF information. Some of their desirable properties are also investigated in details. A method for finding the rank of alternatives in MCGDM problems with DHF information based on priority levels of decision makers is developed. An illustrative example concerning MCGDM problem is considered to establish the application potentiality of the proposed approach. The method is efficient enough to solve different real life MCGDM problems having DHF information.
5
Content available remote Generalized Sasakian-space-forms with projective curvature tensor
EN
The object of the present paper is to study φ-projectively flat generalized Sasakian-space-forms, projectively locally symmetric generalized Sasakian-space-forms and projectively locally φ-symmetric generalized Sasakian-space-forms. All the obtained results are in the form of necessary and sufficient conditions. Interesting relations between projective curvature tensor and conformal curvature tensor of a generalized Sasakian-spaceform of dimension greater than three have been established. Some of these properties are also analyzed in the light of quarter-symmetric metric connection, in addition with the Levi-Civita connection. Obtained results are supported by illustrative examples.
EN
A hybrid unsupervised learning algorithm, which is termed as Parallel Rough-based Archived Multi-Objective Simulated Annealing (PARAMOSA), is proposed in this article. It comprises a judicious integration of the principles of the rough sets theory and the scalable distributed paradigm with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of rough sets in this implementation, deals with the incompleteness in the dynamic classification method with the quality of classification coefficient as the classificatory competencemeasurement, the time-efficient parallel approach enables faster convergence of the Pareto-archived evolution strategy. It incorporates both the rough set-based dynamic archive classification method and the distributed implementation as a two-phase speedup strategy in this algorithm. A measure of the amount of domination between two solutions has been incorporated in this work to determine the acceptance probability of a new solution with an improvement in the spread of the non-dominated solutions in the Pareto-front by adopting rough sets theory. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with three other existing and well-known Multi-Objective Evolutionary Algorithms (MOEAs) demonstrate the effectiveness of the former with respect to four existing performance metrics and eleven benchmark test problems of varying degrees of difficulties. The superiority of this new parallel implementation over other algorithms also has been demonstrated in timing, which achieves a near optimal speedup with a minimal communication overhead.
7
Content available remote On three-dimensional locally phi-recurrent quasi-Sasakian manifolds
EN
The object of the present paper is to study three-dimensional locally phi-recurrent quasi-Sasakian manifolds.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.