Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Vecdi Aytaç"'
Autor:
Ali Mert CEYLAN, Vecdi AYTAÇ
In this study, we present a novel formalization for exponential approximation. This formalization is for discrete analysis of continuous time-dependent perturbation operator of quantum mechanics, compared to multiplying exponentials. This leads us to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1aad9993ae08ba41a00e39b44da939c
https://doi.org/10.21203/rs.3.rs-2271337/v2
https://doi.org/10.21203/rs.3.rs-2271337/v2
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811971259
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4c06eea6482b1efa9b6bf3e322a915e
https://doi.org/10.1007/978-981-19-7126-6_2
https://doi.org/10.1007/978-981-19-7126-6_2
Autor:
Ali Mert CEYLAN, Vecdi AYTAÇ
In this study, we present a novel formalization for exponential approximation. This formalization is for discrete analysis of continuous time-dependent perturbation operator of quantum mechanics, compared to multiplying exponentials. This leads us to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b67fbc93e5a3128dd72ac6db943f06bf
https://doi.org/10.21203/rs.3.rs-2271337/v1
https://doi.org/10.21203/rs.3.rs-2271337/v1
Autor:
Vecdi Aytaç, Tufan Turacı
Publikováno v:
Malaya Journal of Matematik. 9:194-205
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de72aa0af901bcd84200cbd29ec35692
https://doi.org/10.26637/mjm904/003
https://doi.org/10.26637/mjm904/003
Autor:
Vecdi Aytaç, Fatmana Şentürk
Let V be the set of vertex of a graph G. The set S is a dominating set, being a subset of the set V, if every vertex in the set V is in the set S, or if it is neighbor of a vertex in the set S. The number of elements of the set S with the least numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fea8e3d1c5e902c64cb97c3e38b47ed
https://hdl.handle.net/11499/47323
https://hdl.handle.net/11499/47323
Autor:
Vecdi Aytaç
Publikováno v:
New Trends in Mathematical Sciences, Vol 5, Iss 4, Pp 1-11 (2017)
Volume: 5, Issue: 4 1-11
New Trends in Mathematical Sciences
Volume: 5, Issue: 4 1-11
New Trends in Mathematical Sciences
A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4344eaf4c31d8785acdc029362bcae7e
https://ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8334
https://ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8334
Autor:
Tufan Turaci, Vecdi Aytaç
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 51:17-27
Let G ( V,E ) be a simple undirected graph. Recently, the vertex attack tolerance (VAT) of G has been defined as τ( G ) = min {| S | / | V - S - C max ( G - S )|+1 : S ⊂ V } , where C max ( G − S ) is the order of a largest connected component i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c9ea0c0797d15148884ac3646a2122c
https://doi.org/10.1051/ita/2017005
https://doi.org/10.1051/ita/2017005
Autor:
Fatmana Senturk, Vecdi Aytaç
Publikováno v:
CITS
Ontologies are metadata describing properties of a domain, instance data and relationships between properties, developed for many different purposes. But, they can be different names or properties even within the same domain. Ontology matching can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87127e402024a374baecc79ec568ac90
https://doi.org/10.1109/cits.2018.8440159
https://doi.org/10.1109/cits.2018.8440159
Autor:
Vecdi Aytaç, Tufan Turaci
Publikováno v:
Scopus-Elsevier
WOS: 000434285300007
Let G (V (G), E(G)) be a simple connected graph and d(G)(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying v
Let G (V (G), E(G)) be a simple connected graph and d(G)(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1489c011f76e94535e2c47e00a4bca1
https://hdl.handle.net/11454/66362
https://hdl.handle.net/11454/66362
Autor:
Vecdi Aytaç, Fatmana Senturk
Publikováno v:
2017 International Conference on Computer Science and Engineering (UBMK).
Ontologies are domain-specific constructs developed for many different purposes. But, they can be different even within the same domain. Ontology matching is a method for finding the same things in between existing ontologies by looking at semantic s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b31faadd59cf80e13f5fb2585531932
https://doi.org/10.1109/ubmk.2017.8093469
https://doi.org/10.1109/ubmk.2017.8093469