Log in

Relevant bibliographies by topics / SD graph / Journal articles

To see the other types of publications on this topic, follow the link: SD graph.

Journal articles on the topic 'SD graph'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'SD graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Lourdusamy, A., S. Jenifer Wency, and F. Patrick. "On SD-Harmonious Labeling." Mapana - Journal of Sciences 17, no. 3 (2018): 1–15. http://dx.doi.org/10.12723/mjs.46.1.

Full text

Abstract:

A graph G is said to be SD-harmonious labeling if there exists an injection f: V(G) -> {0,1,2,...,q} such that the induced function f*: E(G) ->{0,2,...,2q-2} defined by f(uv)=S+D (mod 2q) is bijective, where S=f(u)+f(v) and D=|f(u)-f(v)|, for every edge uv in E(G). A graph which admits SD-harmonious labeling is called SD-harmonious graph. In this paper, we investigate SD-harmonious labeling of path related graphs, tree related graphs, star related graphs and disjoint union of graphs.

APA, Harvard, Vancouver, ISO, and other styles

2

A. Delman, S. Koilraj, and P. Lawrence Rozario Raj. "SD and k-SD Prime Cordial graphs." International Journal of Fuzzy Mathematical Archive 15, no. 02 (2018): 189–95. http://dx.doi.org/10.22457/ijfma.v15n2a9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

González Yero, Ismael. "The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families." Mathematics 8, no. 1 (2020): 125. http://dx.doi.org/10.3390/math8010125.

Full text

Abstract:

We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph. In concordance, we consider here connected graphs G whose vertex sets are represented as V ( G ) , and the following terminology. Two vertices u , v ∈ V ( G ) are strongly resolved by a vertex w ∈ V ( G ) , if there is a shortest w − v path containing u or a shortest w − u containing v. A set A of vertices of the graph G is said to be a strong metric generator for G if every two vertices of G are strongly resolve

APA, Harvard, Vancouver, ISO, and other styles

4

ANDRARI, FINATA RASTIC, MAIMUNAH MAIMUNAH, and NURMALA DEWI QADARSIH. "PENERAPAN ALGORITMA WELCH-POWELL PADA PENJADWALAN MATA PELAJARAN SD." E-Jurnal Matematika 12, no. 4 (2023): 268. http://dx.doi.org/10.24843/mtk.2023.v12.i04.p428.

Full text

Abstract:

In the context of scheduling class timetables and allocating teachers to specific subjects in schools, a common issue is the occurrence of schedule conflicts. These conflicts often result in situations where a teacher is assigned to teach the same subject at the same time in different classes, or where teachers are scheduled to teach different subjects simultaneously. The Welch Powell algorithm is a graph coloring method that can be applied to scheduling problems. The scheduling process begins by representing subjects and the teachers assigned to them as a graph. Each subject is represented as

APA, Harvard, Vancouver, ISO, and other styles

5

Imran, Muhammad, and Shehnaz Akhter. "Degree-based topological indices of double graphs and strong double graphs." Discrete Mathematics, Algorithms and Applications 09, no. 05 (2017): 1750066. http://dx.doi.org/10.1142/s1793830917500665.

Full text

Abstract:

The topological indices are useful tools to the theoretical chemists that are provided by the graph theory. They correlate certain physicochemical properties such as boiling point, strain energy, stability, etc. of chemical compounds. For a graph [Formula: see text], the double graph [Formula: see text] is a graph obtained by taking two copies of graph [Formula: see text] and joining each vertex in one copy with the neighbors of corresponding vertex in another copy and strong double graph SD[Formula: see text] of the graph [Formula: see text] is the graph obtained by taking two copies of the g

APA, Harvard, Vancouver, ISO, and other styles

6

FAVARON, O., R. KHOEILAR, and S. M. SHEIKHOLESLAMI. "TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS." Discrete Mathematics, Algorithms and Applications 05, no. 03 (2013): 1350009. http://dx.doi.org/10.1142/s1793830913500092.

Full text

Abstract:

A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set. The total outer-connected domination subdivision number sd γ toc (G) is the minimum number of edges that must be subdivided in order to increase the total outer-connected domination number. We prove the existence of sd γ toc (G) for every connected graph G of order at least 3 and give upper bounds on it in some classes of grap

APA, Harvard, Vancouver, ISO, and other styles

7

Hao, Jianlong, Zhibin Liu, Qiwei Sun, Chen Zhang, and Jie Wang. "A Static-Dynamic Hypergraph Neural Network Framework Based on Residual Learning for Stock Recommendation." Complexity 2024 (January 8, 2024): 1–12. http://dx.doi.org/10.1155/2024/5791802.

Full text

Abstract:

Stock ranking prediction is an effective method for achieving a high investment return and plays a crucial role in investment decisions. However, previous studies have overlooked the interconnections among stocks or have solely relied on predefined graphs for stock relationship information. The predefined graphs may not capture all possible relationships and may not be suitable for describing dynamic relationships. To address these issues, we propose a Static-Dynamic hypergraph neural network framework based on Residual Learning (SD-RL). Compared with traditional methods, SD-RL has the followi

APA, Harvard, Vancouver, ISO, and other styles

8

G. Navamani. "Optimizing Subdivisions on Fair Domination in Petersen Graph Structures." Advances in Nonlinear Variational Inequalities 28, no. 3s (2024): 20–29. https://doi.org/10.52783/anvi.v28.2845.

Full text

Abstract:

A fair dominating set (FDS) J is a dominating set of a graph H, such that all vertices in V \J are dominated by the same number of vertices of J. The fair domination number (FDN) is the minimum cardinality of a fair dominating set of H, denoted by γ_fd (H). The domination subdivision number (FDSN) 〖Sd〗_γ (H), represents the smallest number of edges in H that needs to be subdivided (with each edge being subdivided at most once) to increase the domination number of the graph. The fair domination subdivision number, 〖Sd〗_(γ_fd)^+ (H) (or 〖Sd〗_(γ_fd)^- (H)) is the minimum number of edge subdivisio

APA, Harvard, Vancouver, ISO, and other styles

9

Senchenko, Oleksii, and Mykola Prytula. "The presentation of deterministic and strongly deterministic graphs." Algebra and Discrete Mathematics 36, no. 2 (2023): 225–42. http://dx.doi.org/10.12958/adm2157.

Full text

Abstract:

The paper proposes a presentation of D-graphsand SD-graphs by a defining pair of words in the alphabet of their vertex labels. We present an algorithm that, given an arbitrary pair of sets, either constructs a D-graph for which this pair is the defining pair or informs that it is impossible to do so. We alsopresent an algorithm for constructing a canonical defining pair fora D-graph and find some numerical estimates of this pair.

APA, Harvard, Vancouver, ISO, and other styles

10

Kononov, Yu M., S. V. Sapunov, O. S. Senchenko, and V. V. Sliesariev. "Stochastic methods for modeling the topological operating environment of an autonomous mobile agent." Proceedings of the Institute of Applied Mathematics and Mechanics NAS of Ukraine 38 (December 18, 2024): 79–95. https://doi.org/10.37069/1683-4720-2024-38-8.

Full text

Abstract:

Stochastic methods are used to model the topological operating environment of an autonomous mobile agent that performs goal-directed movement or navigation. For successful navigation, it is necessary to efficiently represent information about the environment, i.e. to create its map. The topological representation focuses on the structural characteristics of the environment and the connections between different areas of space. The model of this representation is a graph, where vertices represent important locations and edges represent possible paths between them. In this paper, the environment

APA, Harvard, Vancouver, ISO, and other styles

11

Babikir, Ammar, Magda Dettlaff, Michael A. Henning, and Magdalena Lemańska. "Independent Domination Subdivision in Graphs." Graphs and Combinatorics 37, no. 3 (2021): 691–709. http://dx.doi.org/10.1007/s00373-020-02269-3.

Full text

Abstract:

AbstractA set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G. The independent domination subdivision number $$ \hbox {sd}_{\mathrm{i}}(G)$$ sd i ( G ) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the independent domination number. We show that for every connected graph G o

APA, Harvard, Vancouver, ISO, and other styles

12

常, 馨予. "Knowledge Graph Analysis of Breakthrough Innovation Research Based on Citespace." Sustainable Development 13, no. 01 (2023): 116–23. http://dx.doi.org/10.12677/sd.2023.131014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Prajapati, U. M., and Anit Vantiya. "SD-Prime cordial labeling of alternate k-polygonal snake of various types." Proyecciones (Antofagasta) 40, no. 3 (2021): 619–34. http://dx.doi.org/10.22199/issn.0717-6279-4015.

Full text

Abstract:

Let f : V (G) → {1, 2,..., |V (G)|} be a bijection, and let us denote S = f(u) + f(v) and D = |f(u) − f(v)| for every edge uv in E(G). Let f' be the induced edge labeling, induced by the vertex labeling f, defined as f' : E(G) → {0, 1} such that for any edge uv in E(G), f' (uv)=1 if gcd(S, D)=1, and f' (uv)=0 otherwise. Let ef' (0) and ef' (1) be the number of edges labeled with 0 and 1 respectively. f is SD-prime cordial labeling if |ef' (0) − ef' (1)| ≤ 1 and G is SD-prime cordial graph if it admits SD-prime cordial labeling. In this paper, we have discussed the SD-prime cordial labeling of

APA, Harvard, Vancouver, ISO, and other styles

14

Margutti, Ana V. B., Jacqueline P. Monteiro, and José S. Camelo. "Reference distribution of the bioelectrical impedance vector in healthy term newborns." British Journal of Nutrition 104, no. 10 (2010): 1508–13. http://dx.doi.org/10.1017/s000711451000245x.

Full text

Abstract:

Bioelectrical impedance vector analysis (BIVA) is a new method that is used for the routine monitoring of the variation in body fluids and nutritional status with assumptions regarding body composition values. The aim of the present study was to determine bivariate tolerance intervals of the whole-body impedance vector and to describe phase angle (PA) values for healthy term newborns aged 7–28 d. This descriptive cross-sectional study was conducted on healthy term neonates born at a low-risk public maternity. General and anthropometric neonatal data and bioelectrical impedance data (800 μA–50

APA, Harvard, Vancouver, ISO, and other styles

15

朱, 亚斌. "Research on Innovative Development of Smart Tourism Based on Knowledge Graph." Sustainable Development 14, no. 06 (2024): 1548–56. http://dx.doi.org/10.12677/sd.2024.146178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Pan, Weijun, Yidi Wang, Yumei Zhang, and Boyuan Han. "ATC-SD Net: Radiotelephone Communications Speaker Diarization Network." Aerospace 11, no. 7 (2024): 599. http://dx.doi.org/10.3390/aerospace11070599.

Full text

Abstract:

This study addresses the challenges that high-noise environments and complex multi-speaker scenarios present in civil aviation radio communications. A novel radiotelephone communications speaker diffraction network is developed specifically for these circumstances. To improve the precision of the speaker diarization network, three core modules are designed: voice activity detection (VAD), end-to-end speaker separation for air–ground communication (EESS), and probabilistic knowledge-based text clustering (PKTC). First, the VAD module uses attention mechanisms to separate silence from irrelevant

APA, Harvard, Vancouver, ISO, and other styles

17

CHARBIT, PIERRE, and STÉPHAN THOMASSÉ. "Graphs with Large Girth Not Embeddable in the Sphere." Combinatorics, Probability and Computing 16, no. 6 (2007): 829–32. http://dx.doi.org/10.1017/s0963548307008528.

Full text

Abstract:

In 1972, Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than $\sqrt 3$(ie, distance more than 2π/3 on the sphere). In 1978, Larman [LAR] disproved this conjecture, constructing a triangle-free graph for which the minimum length of an edge could not exceed $\sqrt{8/3}$. In addition, he conjectured that the right answer would be $\sqrt{2}$, which is not better than the class of all graphs. Larman'sconjecture was independently proved by Rosenfeld [MR] and Rödl [VR[. In this last paper it was

APA, Harvard, Vancouver, ISO, and other styles

18

Farahani, Mohammad Reza. "On the SD-Polynomial and SD-Index of an Infinite Class of “Armchair Polyhex Nanotubes”." International Letters of Chemistry, Physics and Astronomy 31 (March 2014): 63–68. http://dx.doi.org/10.18052/www.scipress.com/ilcpa.31.63.

Full text

Abstract:

Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G),without loops and multiple edges. For counting qoc strips in G, Diudea introduced the Ω-polynomialof G and was defined as Ω(G, x) = ∑ki-1xi where C1, C2,..., Ck be the “opposite edge strips” ops of Gand ci = |Ci| (I = 1, 2,..., k). One can obtain the Sd-polynomial by replacing xc with x|E(G)|-c in Ω-polynomial. Then the Sd-index will be the first derivative of Sd(x) evaluated at x = 1. In this paper wecompute the Sd-polynomial and Sd-index of an infinite class of “Armchair Polyhe x Nanotubes”.

APA, Harvard, Vancouver, ISO, and other styles

19

Farahani, Mohammad Reza. "On the SD-Polynomial and SD-Index of an Infinite Class of “Armchair Polyhex Nanotubes”." International Letters of Chemistry, Physics and Astronomy 31 (March 28, 2014): 63–68. http://dx.doi.org/10.56431/p-7cxmfb.

Full text

Abstract:

Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G),without loops and multiple edges. For counting qoc strips in G, Diudea introduced the Ω-polynomialof G and was defined as Ω(G, x) = ∑ki-1xi where C1, C2,..., Ck be the “opposite edge strips” ops of Gand ci = |Ci| (I = 1, 2,..., k). One can obtain the Sd-polynomial by replacing xc with x|E(G)|-c in Ω-polynomial. Then the Sd-index will be the first derivative of Sd(x) evaluated at x = 1. In this paper wecompute the Sd-polynomial and Sd-index of an infinite class of “Armchair Polyhe x Nanotubes”.

APA, Harvard, Vancouver, ISO, and other styles

20

Lee, Wonseok, Jaehyun Ha, Wook-Shin Han, et al. "DoppelGanger++: Towards Fast Dependency Graph Generation for Database Replay." Proceedings of the ACM on Management of Data 2, no. 1 (2024): 1–26. http://dx.doi.org/10.1145/3639322.

Full text

Abstract:

A database replay system (DRS) captures workloads on a production system and then replays them in a test system to test various system changes, avoiding any risk before realizing them in production. The dependency graph generation in a DRS is crucial in preserving output determinism while maximizing concurrency. The state-of-the-art dependency graph generation algorithm deployed in a commercial DBMS uses a generate-and-prune strategy. It first generates a dependency graph by performing backward scans for each request in a workload. It then prunes all redundant edges using an expensive, transit

APA, Harvard, Vancouver, ISO, and other styles

21

王, 曼茜. "Research Status and Hotspot Analysis of Smart City Based on CiteSpace Knowledge Graph." Sustainable Development 11, no. 02 (2021): 161–68. http://dx.doi.org/10.12677/sd.2021.112019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Amjadi, J., and H. Sadeghi. "Triple Roman domination subdivision number in graphs." Computer Science Journal of Moldova 30, no. 1(88) (2022): 109–30. http://dx.doi.org/10.56415/csjm.v30.07.

Full text

Abstract:

For a graph $G=(V, E)$, a triple Roman domination function is a function $f: V(G)\longrightarrow\{0, 1, 2, 3, 4\}$ having the property that for any vertex $v\in V(G)$, if $f(v)<3$, then $f(\mbox{AN}[v])\geq|\mbox{AN}(v)|+3$, where $\mbox{AN}(v)=\{w\in N(v)\mid f(w)\geq1\}$ and $\mbox{AN}[v]=\mbox{AN}(v)\cup\{v\}$. The weight of a triple Roman dominating function $f$ is the value $\omega(f)=\sum_{v\in V(G)}f(v)$. The triple Roman domination number of $G$, denoted by $\gamma_{[3R]}(G)$, equals the minimum weight of a triple Roman dominating function on $G$. {\em The triple Roman domination su

APA, Harvard, Vancouver, ISO, and other styles

23

Sufia, Aziz, E. John Peter, and V. Khadikar Padmakar. "Use of structure codes (counts) for computing Sadhana (Sd) index of phenylenes and its hexagonal squeezes for QSAR studies." Journal of Indian Chemical Society Vol. 87, Dec 2010 (2010): 1449–54. https://doi.org/10.5281/zenodo.5805062.

Full text

Abstract:

Department of Applied Sciences (Mathematics), Institute of Engineering and Technology. DAVV. Khandwa Road, Indore, Madhya Pradesh, India <em>E-mail :</em> sufiaaziz@yahoo.co.in Technische Universitat Iimenau, Fakulat for Mathematik and Naturwissenchaften, Institut for Mathematik, Postfach 100565, D-98884, Ilmenau Research Division, Laxmi Fumigation and Pest Control, Pvt. Ltd., 3 , Khatipura .. Indore-452 007, Madhya Pradesh, India <em>E-mail:</em> pvkhadikar@rediffmail.com <em>Manuscript received 20 September 2010, accepted 5 October 2010</em> Structural codes vis-\(\grave{a}\)-vis structural

APA, Harvard, Vancouver, ISO, and other styles

24

Patel, Sahaj Anilbhai, and Abidin Yildirim. "Overcoming Dimensionality Constraints: A Gershgorin Circle Theorem-Based Feature Extraction for Weighted Laplacian Matrices in Computer Vision Applications." Journal of Imaging 10, no. 5 (2024): 121. http://dx.doi.org/10.3390/jimaging10050121.

Full text

Abstract:

In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the local and global properties of a complex graph structure within computer vision applications. However, with increasing graph nodes, the Laplacian matrix’s dimensionality also increases accordingly. Therefore, there is always the “curse of dimensionality”; In response to this challenge, this paper introduces a new approach to reducing the dimensionality of the weighted Laplacian matrix by utilizing the Gershgorin circle theorem by transforming the weighted Laplacian matrix into a strictly diagonal dom

APA, Harvard, Vancouver, ISO, and other styles

25

Harary, Frank. "The Automorphism Group of a Hypercube." JUCS - Journal of Universal Computer Science 6, no. (1) (2000): 136–38. https://doi.org/10.3217/jucs-006-01-0136.

Full text

Abstract:

We present explicitly in this expository note the automorphism group of the hypercube Qd of dimension d as a permutation group acting on its 2d nodes. This group (Qd) acts on the node set Vd of Qd and thus has degree 2d. It is expressed as the binary operation called exponentiation which combines the two symmetric groups S2 (of degree and order 2) and Sd (of degree d and order d!). Specifically, (Qd) = [S2]Sd. has order 2dd!. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.

APA, Harvard, Vancouver, ISO, and other styles

26

Muralinath, Rashmi N., Vishwambhar Pathak, and Prabhat K. Mahanti. "Metastable Substructure Embedding and Robust Classification of Multichannel EEG Data Using Spectral Graph Kernels." Future Internet 17, no. 3 (2025): 102. https://doi.org/10.3390/fi17030102.

Full text

Abstract:

Classification of neurocognitive states from Electroencephalography (EEG) data is complex due to inherent challenges such as noise, non-stationarity, non-linearity, and the high-dimensional and sparse nature of connectivity patterns. Graph-theoretical approaches provide a powerful framework for analysing the latent state dynamics using connectivity measures across spatio-temporal-spectral dimensions. This study applies the graph Koopman embedding kernels (GKKE) method to extract latent neuro-markers of seizures from epileptiform EEG activity. EEG-derived graphs were constructed using correlati

APA, Harvard, Vancouver, ISO, and other styles

27

Falahat, Mohyedin, Seyed Sheikholeslami, and Lutz Volkmann. "New bounds on the rainbow domination subdivision number." Filomat 28, no. 3 (2014): 615–22. http://dx.doi.org/10.2298/fil1403615f.

Full text

Abstract:

A 2-rainbow dominating function (2RDF) of a graph G is a function f from the vertex set V(G) to the set of all subsets of the set {1,2} such that for any vertex v ? V(G) with f (v) = ? the condition Uu?N(v) f(u)= {1,2} is fulfilled, where N(v) is the open neighborhood of v. The weight of a 2RDF f is the value ?(f) = ?v?V |f(v)|. The 2-rainbow domination number of a graph G, denoted by r2(G), is the minimum weight of a 2RDF of G. The 2-rainbow domination subdivision number sd?r2(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to

APA, Harvard, Vancouver, ISO, and other styles

28

Ryazanov, Yu D., and S. V. Nazina. "Building parsers based on syntax diagrams with multiport components." Prikladnaya Diskretnaya Matematika, no. 55 (2022): 102–19. http://dx.doi.org/10.17223/20710410/55/8.

Full text

Abstract:

The problem of constructing parsers from syntax diagrams with multiport components (SD) is solved. An algorithm for constructing a parser based on the GLL algorithm is proposed, which results in the compact representation of the input chain parse forest. The proposed algorithm makes it possible to build parsers based on the SD of an arbitrary structure and does not require preliminary SD transformations. We introduce the concepts of “inference tree” and “parsing forest” for SD and describe the data structures used by the parser, such as a graph-structured stack, a parser descriptor, and a comp

APA, Harvard, Vancouver, ISO, and other styles

29

禹, 怀亮. "Visualization Study of Land Use and Ecosystem Services in the Last Two Decades —A Knowledge Graph Analysis Based on CiteSpace." Sustainable Development 15, no. 05 (2025): 169–79. https://doi.org/10.12677/sd.2025.155136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Nugrahani, Asa Faren, Dhea Salbila Dwi Saputri, Annisa Diah Iffadah, Satria Nugraha Adiwijaya, and Firma Andrian. "Analisis Keterbacaan Bahan Ajar Bahasa Indonesia Pada Kelas I SD Berdasarkan Grafik Fry." JEMARI (Jurnal Edukasi Madrasah Ibtidaiyah) 6, no. 1 (2024): 46–51. http://dx.doi.org/10.30599/jemari.v6i1.3017.

Full text

Abstract:

Abstract This research aims to assess the readability level of Indonesian language teaching materials for Grade 1 in the Elementary School with the Merdeka Curriculum using the Fry Graph Formula. The research focuses on presenting issues through the analysis of text readability in the teaching materials of Indonesian language for Grade 1 students following the Merdeka Curriculum. This study applies a descriptive qualitative research method. Data is gathered through reading texts from Indonesian language teaching materials as the research instrument. The results of the readability analysis are

APA, Harvard, Vancouver, ISO, and other styles

31

Pallav, Pratyush, Anup Kumar Keshri, Yogendra Aggarwal, and Rakesh Kumar Sinha. "Online Continuous Monitoring of Time Domain Parameters of Heart Rate Variability Using MATLAB and Its Implementation on Human and Rat Electrocardiogram Data." Journal of Clinical Engineering 50, no. 1 (2025): 15–21. https://doi.org/10.1097/jce.0000000000000677.

Full text

Abstract:

The project calculates the heart rate variability using the variation in the consecutive R peaks in the electrocardiogram signals. The code can calculate various dependent factors based on the calculated R peak orientation. Meanrespiratory rate (RR), SD of NN (normal-to-normal)intervals (SDNN), mean heart rate, SD of heart rate, root mean square of successive differences between adjacent RR intervals (RMSSD), number of pairs of successive NN intervals that differ by more than 50 milliseconds (NN50), percentage of NN50 (pNN50), RR triangular index, and triangular interpolation of NN interval hi

APA, Harvard, Vancouver, ISO, and other styles

32

Shoaib, Muhammad, Waqas Mahmood, Qin Xin, and Fairouz Tchier. "Certain Operations on Picture Fuzzy Graph with Application." Symmetry 13, no. 12 (2021): 2400. http://dx.doi.org/10.3390/sym13122400.

Full text

Abstract:

Fuzzy graphs (FGs) can play a useful role in natural and human-made structures, including process dynamics in physical, biological, and social systems. Since issues in everyday life are often uncertain due to inconsistent and ambiguous information, it is extremely difficult for an expert to model those difficulties using an FG. Indeterminate and inconsistent information related to real-valued problems can be studied through a picture of the fuzzy graph (PFG), while the FG does not provide mathematically acceptable information. In this regard, we are interested in reducing the limitations of FG

APA, Harvard, Vancouver, ISO, and other styles

33

Durand, Marie-Anne, Renata W. Yen, James O’Malley, Glyn Elwyn, and Julien Mancini. "Graph literacy matters: Examining the association between graph literacy, health literacy, and numeracy in a Medicaid eligible population." PLOS ONE 15, no. 11 (2020): e0241844. http://dx.doi.org/10.1371/journal.pone.0241844.

Full text

Abstract:

Objectives Graphic display formats are often used to enhance health information. Yet limited attention has been paid to graph literacy in people of lower education and lower socioeconomic status (SES). This study aimed to: 1) examine the relationship between graph literacy, numeracy, health literacy and sociodemographic characteristics in a Medicaid-eligible population 2) determine the impact of graph literacy on comprehension and preference for different visual formats. Methods We conducted a cross-sectional online survey among people in the US on Medicaid, and of presumed lower education and

APA, Harvard, Vancouver, ISO, and other styles

34

Chen, Jinpeng, Josiah Poon, Simon K. Poon, Ling Xu, and Daniel M. Y. Sze. "Mining Symptom-Herb Patterns from Patient Records Using Tripartite Graph." Evidence-Based Complementary and Alternative Medicine 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/435085.

Full text

Abstract:

Unlike the western medical approach where a drug is prescribed against specific symptoms of patients, traditional Chinese medicine (TCM) treatment has a unique step, which is called syndrome differentiation (SD). It is argued that SD is considered as patient classification because prior to the selection of the most appropriate formula from a set of relevant formulae for personalization, a practitioner has to label a patient belonging to a particular class (syndrome) first. Hence, to detect the patterns between herbs and symptoms via syndrome is a challenging problem; finding these patterns can

APA, Harvard, Vancouver, ISO, and other styles

35

Doğan Durgun, Derya, and Berna Lökçü. "Weak and strong domination in thorn graphs." Asian-European Journal of Mathematics 13, no. 04 (2019): 2050071. http://dx.doi.org/10.1142/s1793557120500710.

Full text

Abstract:

Let [Formula: see text] be a graph and [Formula: see text] A dominating set [Formula: see text] is a set of vertices such that each vertex of [Formula: see text] is either in [Formula: see text] or has at least one neighbor in [Formula: see text]. The minimum cardinality of such a set is called the domination number of [Formula: see text], [Formula: see text] [Formula: see text] strongly dominates [Formula: see text] and [Formula: see text] weakly dominates [Formula: see text] if (i) [Formula: see text] and (ii) [Formula: see text] A set [Formula: see text] is a strong-dominating set, shortly

APA, Harvard, Vancouver, ISO, and other styles

36

Farahani, Mohammad Reza. "Computing a Counting Polynomial of an Infinite Family of Linear Polycene Parallelogram Benzenoid Graph P(a,b)." JOURNAL OF ADVANCES IN PHYSICS 3, no. 1 (2007): 186–90. http://dx.doi.org/10.24297/jap.v3i1.2088.

Full text

Abstract:

Omega polynomial was defined by M.V. Diudea in 2006 as Â where the number of edges co-distant with e is denoted by n(e). One can obtain Theta Î˜, Sadhana Sd and Pi Î polynomials by replacing xn(e) with n(e)xn(e), x|E|-n(e) and n(e)x|E|-n(e) in Omega polynomial, respectively. Then Theta Î˜, Sadhana Sd and Pi Î indices will be the first derivative of Î˜(x), Sd(x) and Î (x) evaluated at x=1. In this paper, Pi Î (G,x) polynomial and Pi Î (G) index of an infinite family of linear polycene parallelogram benzenoid graph P(a,b) are computed for the first time.

APA, Harvard, Vancouver, ISO, and other styles

37

Dettlaff, Magda, Saeed Kosary, Magdalena Lemańska, and Seyed Sheikholeslami. "Weakly convex domination subdivision number of a graph." Filomat 30, no. 8 (2016): 2101–10. http://dx.doi.org/10.2298/fil1608101d.

Full text

Abstract:

A set X is weakly convex in G if for any two vertices a,b ? X there exists an ab-geodesic such that all of its vertices belong to X. A set X ? V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number ?wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd?wcon (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the weakly convex domination number. In this paper we initiate the stu

APA, Harvard, Vancouver, ISO, and other styles

38

Sturgeon, Jonathan P., Michaela A. Mayhew, Janet Campbell, and Fenella M. Willis. "Automated Erythrocytapheresis in Sickle Cell Disease: Impact On Hospital Admission Rate and Iron Loading." Blood 114, no. 22 (2009): 1522. http://dx.doi.org/10.1182/blood.v114.22.1522.1522.

Full text

Abstract:

Abstract Abstract 1522 Poster Board I-545 INTRODUCTION Red cell exchange in sickle cell disease (SCD) reduces the risk of life threatening complications including acute chest syndrome, and thromboembolic stroke. Reduction in Hb S to less than 30% reduces overall blood viscosity and improves tissue oxygenation. With treatment being life-long, concerns over iron loading, patient compliance, blood-bourne infections, and cost could temper its effectiveness. METHODS/SUBJECTS A retrospective study of 74 patients with SCD (mean age 37.5, range 19-73) on automated red cell exchange (mean 21.3 exchange

APA, Harvard, Vancouver, ISO, and other styles

39

王, 佳楠. "Review on the Research Progress and Hot Spots of Water Quality Assessment in China from 1992 to 2019: Analysis of Knowledge Graph Based on CiteSpace." Sustainable Development 11, no. 01 (2021): 1–6. http://dx.doi.org/10.12677/sd.2021.111001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Fadillah, Nurul. "Mengurangi Kesalahan Menulis Berbantuan Media Pembelajaran Interaktif Pada Anak Disgrafia Kelas II SD Negeri 060952 Medan." Prosiding Seminar Nasional IKIP Budi Utomo 2, no. 01 (2021): 573–94. http://dx.doi.org/10.33503/prosiding.v2i01.1446.

Full text

Abstract:

This research is motivated by the problem of dysgraphia children who often make mistakes in writing. This study aims to reduce writing errors assisted by interactive learning media in class II dysgraphia children at SD Negeri 060952 Medan. The type of research used is experimental research in the form of Single Subject Research (SSR) with an A-B-A design. The technical analysis of the data used is visual analysis of graphs, visual analysis of graphs. Research subjects are children who have difficulty learning to write (dysgraphia). The results of this study indicate that there is a reduction i

APA, Harvard, Vancouver, ISO, and other styles

41

Nugrahani, Calista Suci, Christian Constantine, and A. N. M. Salman. "Strong 3-Rainbow Indexes of Closed Helm Graphs." Indonesian Journal of Combinatorics 8, no. 2 (2024): 109. https://doi.org/10.19184/ijc.2024.8.2.5.

Full text

Abstract:

Let <em>G</em> be a nontrivial, edge-colored, and connected graph of order <em>m</em>≥3 where adjacent edges may have the same color. A tree <em>T</em> in graph <em>G</em> is called a rainbow tree if all the edges in <em>T</em> have different colors. For <em>S</em>⊆<em>V</em>(<em>G</em>), the Steiner distance <em>sd</em>(<em>S</em>) of <em>S</em> is the minimum size of a tree in <em>G</em> containing <em>S</em>. Let <em>k</em> b

APA, Harvard, Vancouver, ISO, and other styles

42

Wei, Puling, Juan Yang, and Yali Xiao. "Hierarchical Cross-Modal Interaction and Fusion Network Enhanced with Self-Distillation for Emotion Recognition in Conversations." Electronics 13, no. 13 (2024): 2645. http://dx.doi.org/10.3390/electronics13132645.

Full text

Abstract:

Emotion recognition in conversations (ERC), which aims to capture the dynamic changes in emotions during conversations, has recently attracted a huge amount of attention due to its importance in providing engaging and empathetic services. Considering that it is difficult for unimodal ERC approaches to capture emotional shifts in conversations, multimodal ERC research is on the rise. However, this still suffers from the following limitations: (1) failing to fully explore richer multimodal interactions and fusion; (2) failing to dynamically model speaker-dependent context in conversations; and (

APA, Harvard, Vancouver, ISO, and other styles

43

Ma, Lingfei, and Jonathan Li. "SD-GCN: Saliency-based dilated graph convolution network for pavement crack extraction from 3D point clouds." International Journal of Applied Earth Observation and Geoinformation 111 (July 2022): 102836. http://dx.doi.org/10.1016/j.jag.2022.102836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Farahani, Mohammad Reza. "Π(G,x) Polynomial and Π(G) Index of Armchair Polyhex Nanotubes TUAC₆[m,n]". International Letters of Chemistry, Physics and Astronomy 36 (липень 2014): 201–6. http://dx.doi.org/10.18052/www.scipress.com/ilcpa.36.201.

Full text

Abstract:

Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x) = ∑cm(G,c)xc where m(G,c) be number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al as Sd(G,x) = ∑cm(G,c)x[E(G)]-c in this paper we compute the Pi polynomial Π(G,x) = ∑cm(G,c)x[E(G)]-c and Pi Index Π(G ) = ∑cc·m(G,c)([E(G)]-c) of an infinite class of “Armchair polyhex nanotubes TUAC6[m,n]”.

APA, Harvard, Vancouver, ISO, and other styles

45

Farahani, Mohammad Reza. "Π(G,x) Polynomial and Π(G) Index of Armchair Polyhex Nanotubes TUAC<sub>6</sub>[m,n]". International Letters of Chemistry, Physics and Astronomy 36 (15 липня 2014): 201–6. http://dx.doi.org/10.56431/p-120lw3.

Full text

Abstract:

Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x) = ∑cm(G,c)xc where m(G,c) be number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al as Sd(G,x) = ∑cm(G,c)x[E(G)]-c in this paper we compute the Pi polynomial Π(G,x) = ∑cm(G,c)x[E(G)]-c and Pi Index Π(G ) = ∑cc·m(G,c)([E(G)]-c) of an infinite class of “Armchair polyhex nanotubes TUAC6[m,n]”.

APA, Harvard, Vancouver, ISO, and other styles

46

Quintero-González, D. C., M. Muñoz-Urbano, J. Sanchez-Bautista, et al. "AB0527 DIFFUSE ALVEOLAR HEMORRHAGE IN LATIN AMERICAN PATIENTS WITH SYSTEMIC LUPUS ERYTHEMATOSUS: A CASE-CONTROL STUDY." Annals of the Rheumatic Diseases 81, Suppl 1 (2022): 1391.2–1392. http://dx.doi.org/10.1136/annrheumdis-2022-eular.3649.

Full text

Abstract:

BackgroundDiffuse alveolar hemorrhage (DAH) is an uncommon and life-threatening complication of systemic lupus erythematosus (SLE) with a high mortality rate (estimated average 50%). The presence of respiratory symptoms (dyspnea, cough, hemoptysis), a new drop in hemoglobin levels, and diffuse infiltrates on chest imaging should raise suspicion of this complication.ObjectivesWe aimed to describe DAH-SLE patients and compare them with non-DAH SLE patients.MethodsWe conducted a single-center, case-control study that enrolled hospitalized patients between 2012 and 2020 in Colombia. Twenty-three D

APA, Harvard, Vancouver, ISO, and other styles

47

Routroy, Srikanta, Sudeep Kumar Pradhan, and C. V. Sunil Kumar. "Evaluating the implementation performance of a supplier development program." Asia Pacific Journal of Marketing and Logistics 28, no. 4 (2016): 663–82. http://dx.doi.org/10.1108/apjml-08-2015-0128.

Full text

Abstract:

Purpose The purpose of this paper is to quantify, evaluate and compare the implementation performance of a supplier development (SD) program using graph theoretic approach (GTA). Design/methodology/approach Broadly 13 critical success factors (CSFs) were identified and they were classified into four significant categories (SCs). Featuring these SCs and CSFs under each SC, GTA was proposed for evaluating the implementation performance of SD programs. The analysis was further extended to evaluate the performance of a SD program along the timeline to capture the other influences (if any), eventua

APA, Harvard, Vancouver, ISO, and other styles

48

Usha, A., Nijisha Shajil, and M. Sasikala. "Automatic Anisotropic Diffusion Filtering and Graph-search Segmentation of Macular Spectral-domain Optical Coherence Tomographic (SD-OCT) Images." Current Medical Imaging Formerly Current Medical Imaging Reviews 15, no. 3 (2019): 308–18. http://dx.doi.org/10.2174/1573405613666171201155119.

Full text

Abstract:

Background: Optical Coherence Tomography (OCT) is a non-invasive medical imaging technique that provides high-resolution cross-sectional images of the retina. There is a need to develop algorithms for obtaining quantitative and qualitative information about the retina which are essential for assessing and managing eye conditions. Methods: This work emphasizes on an automated image processing algorithm for segmenting retinal layers. It involves preprocessing of the acquired retinal SD-OCT image (B-scan) using the proposed automatic Anisotropic diffusion filter, followed with contrast stretching

APA, Harvard, Vancouver, ISO, and other styles

49

Antony, Bhavna J., Michael D. Abràmoff, Matthew M. Harper, et al. "A combined machine-learning and graph-based framework for the segmentation of retinal surfaces in SD-OCT volumes." Biomedical Optics Express 4, no. 12 (2013): 2712. http://dx.doi.org/10.1364/boe.4.002712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Miri, Mohammad Saleh, Michael D. Abràmoff, Young H. Kwon, Milan Sonka, and Mona K. Garvin. "A machine-learning graph-based approach for 3D segmentation of Bruch’s membrane opening from glaucomatous SD-OCT volumes." Medical Image Analysis 39 (July 2017): 206–17. http://dx.doi.org/10.1016/j.media.2017.04.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!