Search results for: interaction vertex imaging

Authors: Ying Wang, Haiyan Xie, Aoming Zhang

Abstract:

The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star.

Keywords: degree distance, vertex-degree-distance, one vertex union of a cycle and a star, graph

Procedia PDF Downloads 121

Authors: Ezgi Kaya, A. Dilek Maden

Abstract:

A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix.

Keywords: energy, Laplacian energy, laplacian vertex PI eigenvalues, Laplacian vertex PI energy, vertex PI index

Procedia PDF Downloads 206

Authors: Shaikah Alsubayae, Gianluigi Casse, Carlos Chavez, Jon Taylor, Alan Taylor, Mohammad Alsulimane

Abstract:

Ensuring accurate radiotherapy with carbon therapy requires precise monitoring of radiation dose distribution within the patient's body. This monitoring is essential for targeted tumor treatment, minimizing harm to healthy tissues, and improving treatment effectiveness while lowering side effects. In our investigation, we employed a methodological approach to monitor secondary proton doses in carbon therapy using Monte Carlo simulations. Initially, Geant4 simulations were utilized to extract the initial positions of secondary particles formed during interactions between carbon ions and water. These particles included protons, gamma rays, alpha particles, neutrons, and tritons. Subsequently, we studied the relationship between the carbon ion beam and these secondary particles. Interaction Vertex Imaging (IVI) is valuable for monitoring dose distribution in carbon therapy. It provides details about the positions and amounts of secondary particles, particularly protons. The IVI method depends on charged particles produced during ion fragmentation to gather information about the range by reconstructing particle trajectories back to their point of origin, referred to as the vertex. In our simulations regarding carbon ion therapy, we observed a strong correlation between some secondary particles and the range of carbon ions. However, challenges arose due to the target's unique elongated geometry, which hindered the straightforward transmission of forward-generated protons. Consequently, the limited protons that emerged mostly originated from points close to the target entrance. The trajectories of fragments (protons) were approximated as straight lines, and a beam back-projection algorithm, using recorded interaction positions in Si detectors, was developed to reconstruct vertices. The analysis revealed a correlation between the reconstructed and actual positions.

Keywords: radiotherapy, carbon therapy, monitoring of radiation dose, interaction vertex imaging

Procedia PDF Downloads 36

Authors: Shaikah Alsubayae, Gianluigi Casse, Carlos Chavez, Jon Taylor, Alan Taylor, Mohammad Alsulimane

Abstract:

Achieving precise radiotherapy through carbon therapy necessitates the accurate monitoring of radiation dose distribution within the patient's body. This process is pivotal for targeted tumor treatment, minimizing harm to healthy tissues, and enhancing overall treatment effectiveness while reducing the risk of side effects. In our investigation, we adopted a methodological approach to monitor secondary proton doses in carbon therapy using Monte Carlo (MC) simulations. Initially, Geant4 simulations were employed to extract the initial positions of secondary particles generated during interactions between carbon ions and water, including protons, gamma rays, alpha particles, neutrons, and tritons. Subsequently, we explored the relationship between the carbon ion beam and these secondary particles. Interaction vertex imaging (IVI) proves valuable for monitoring dose distribution during carbon therapy, providing information about secondary particle locations and abundances, particularly protons. The IVI method relies on charged particles produced during ion fragmentation to gather range information by reconstructing particle trajectories back to their point of origin, known as the vertex. In the context of carbon ion therapy, our simulation results indicated a strong correlation between some secondary particles and the range of carbon ions. However, challenges arose due to the unique elongated geometry of the target, hindering the straightforward transmission of forward-generated protons. Consequently, the limited protons that did emerge predominantly originated from points close to the target entrance. Fragment (protons) trajectories were approximated as straight lines, and a beam back-projection algorithm, utilizing interaction positions recorded in Si detectors, was developed to reconstruct vertices. The analysis revealed a correlation between the reconstructed and actual positions.

Keywords: radiotherapy, carbon therapy, monitor secondary proton doses, interaction vertex imaging

Procedia PDF Downloads 46

Authors: Khidir R. Sharaf, Didar A. Ali

Abstract:

The nullity η (G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f (w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced sub-graph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the end vertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived and determined for some special types of graphs. Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs.

Keywords: graph theory, graph spectra, nullity of graphs, statistic

Procedia PDF Downloads 202

Authors: Soner Nandappa D., Ahmed Mohammed Naji

Abstract:

In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 500

Authors: Shaowei Sun

Abstract:

Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph.

Keywords: graph, normalized Laplacian eigenvalues, normalized Laplacian matrix, tree

Procedia PDF Downloads 302

Authors: Thomas Odaker, Dieter Kranzlmueller, Jens Volkert

Abstract:

We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a set of per-vertex boundaries that prevent mesh foldovers even when simplification operations are performed on neighbouring vertices. We execute multiple iterations of the calculation of the vertex errors, ordering of the error values and removal of vertices until either a desired number of vertices remains in the mesh or a minimum error value is reached. This parallel approach is used to speed up the simplification process while maintaining mesh topology and avoiding foldovers at every step of the simplification.

Keywords: computer graphics, half edge collapse, mesh simplification, precomputed simplification, topology preserving

Procedia PDF Downloads 331

Authors: Saieed Akbari, Yousef Bagheri, Amir Hossein Ghodrati, Sima Saadat Akhtar

Abstract:

Let G be a simple graph with the vertex set V (G) and with the adjacency matrix A (G). The energy E (G) of G is defined to be the sum of the absolute values of all eigenvalues of A (G). Also let n and m be number of edges and vertices of the graph respectively. A regular graph is a graph where each vertex has the same number of neighbours. Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G. In this paper we show that for every regular graphs and also for every line graphs such that (G) 3 we have, E(G) 2nm + n 1. Also at the other part of the paper we prove that 2 (G) E(G) for an arbitrary graph G.

Keywords: eigenvalues, energy, line graphs, matching number

Procedia PDF Downloads 197

Authors: Saif Akram, E. Rathakrishnan

Abstract:

The mixing promoting efficiency of two identical sharp and truncated vertex triangular tabs offering geometrical blockage of 2.5% each, placed at the exit of a Mach 1.5 elliptic nozzle was studied experimentally. The effectiveness of both the tabs in enhancing the mixing of jets with the ambient air are determined by measuring the Pitot pressure along the jet axis and the jet spread in both the minor and major axes of the elliptic nozzle, covering marginally overexpanded to moderately underexpanded levels at the nozzle exit. The results reveal that both the tabs enhance mixing characteristics of the uncontrolled elliptic jet when placed at minor axis. A core length reduction of 67% is achieved at NPR 3 which is the overexpanded state. Similarly, the core length is reduced by about 67%, 50% and 57% at NPRs of 4, 5 and 6 (underexpanded states) respectively. However, unlike the considerable increment in mixing promoting efficiency by the use of truncated vertex tabs for axisymmetric jets, the effect is not much pronounced for the case of supersonic elliptic jets. The CPD plots for both the cases almost overlap, especially when tabs are placed at minor axis, at all the pressure conditions. While, when the tabs are used at major axis, in the case of overexpanded condition, the sharp vertex triangular tabs act as a better mixing enhancer for the supersonic elliptic jets. For the jet controlled with truncated vertex triangular tabs, the core length reductions are of the same order as those for the sharp vertex triangular tabs. The jet mixing is hardly influenced by the tip effect in case of supersonic elliptic jet.

Keywords: elliptic jet, tabs, truncated, triangular

Procedia PDF Downloads 355

Authors: Chanon Promsakon, Sayan Panma

Abstract:

Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order.

Keywords: endo-Cayley graph, undirected digraphs, cyclic groups, endomorphism

Procedia PDF Downloads 308

Authors: T. Hennedige

Abstract:

Imaging plays a crucial role in the evaluation of the extent of peritoneal disease, which in turn determines prognosis and treatment choice. Despite advances in imaging technology, assessment of the peritoneum remains relatively challenging secondary to its large surface area, complex anatomy, and variety of imaging modalities available. This poster will review the mechanisms of spread, namely intraperitoneal dissemination, directly along peritoneal pathways, haematogeneous dissemination, and lymphatic spread. This will be followed by a side-by-side pictorial comparison of the detection of peritoneal deposits using CT, MRI, and PET/CT, depicting the advantages and shortcomings of each modality. An imaging selection framework will then be presented, which may aid the clinician in selecting the appropriate imaging modality for the malignancy in question.

Keywords: imaging, CT, malignancy, MRI, peritoneum, PET

Procedia PDF Downloads 114

Authors: Souad Slimani, Sylvain Gravier, Simon Schmidt

Abstract:

Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring,...); these notions were inspired by identifying codes. All of them, as well as original identifying code, is based on separating two vertices according to some conditions on their closed neighborhood. Therefore, twins can not be identified. So most of known results focus on twin-free graph. Here, we show how twins can modify optimal value of vertex-identifying parameters for identifying coloring and locally identifying coloring.

Keywords: identifying coloring, locally identifying coloring, twins, separating

Procedia PDF Downloads 112

Authors: J. C. Valenzuela-Tripodoro, P. Álvarez-Ruíz, M. A. Mateos-Camacho, M. Cera

Abstract:

In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized.

Keywords: multiple roman domination function, decision problem np-complete, bounds, exact values

Procedia PDF Downloads 69

Authors: Hiroyuki Aoki

Abstract:

Molecular imaging has attracted much attention recently, which visualizes biological molecules, cells, tissue, and so on. Among various in vivo imaging techniques, the fluorescence imaging method has been widely employed as a useful modality for small animals in pre-clinical researches. However, the higher signal intensity is needed for highly sensitive in vivo imaging. The objective of the current study is the development of a fluorescent imaging agent with high brightness for the tumor imaging of a mouse. The strategy to enhance the fluorescence signal of a bio-imaging agent is the increase of the absorption of the excitation light and the fluorescence conversion efficiency. We developed a nano-particle fluorescence imaging agent consisting of a π-conjugated polymer emitting a fluorescence signal in a near infrared region. A large absorption coefficient and high emission intensity at a near infrared optical window for biological tissue enabled highly sensitive in vivo imaging with a tumor-targeting ability by an EPR (enhanced permeation and retention) effect. The signal intensity from the π-conjugated fluorescence imaging agent is larger by two orders of magnitude compared to a quantum dot, which has been known as the brightest imaging agent. The π-conjugated polymer nano-particle would be a promising candidate in the in vivo imaging of small animals.

Keywords: fluorescence, conjugated polymer, in vivo imaging, nano-particle, near-infrared

Procedia PDF Downloads 444

Authors: E. Accomando, L. Delle Rose, S. Moretti, E. Olaiya, C. Shepherd-Themistocleous

Abstract:

Heavy sterile neutrinos are almost ubiquitous in the class of Beyond Standard Model scenarios aimed at addressing the puzzle that emerged from the discovery of neutrino flavour oscillations, hence the need to explain their masses. In particular, they are necessary in a U(1)’ enlarged Standard Model (SM). We show that these heavy neutrinos can be rather long-lived producing distinctive displaced vertices and tracks. Indeed, depending on the actual decay length, they can decay inside a Large Hadron Collider (LHC) detector far from the main interaction point and can be identified in the inner tracking system or the muon chambers, emulated here through the Compact Muon Solenoid (CMS) detector parameters. Among the possible production modes of such heavy neutrino, we focus on their pair production mechanism in the SM Higgs decay, eventually yielding displaced lepton signatures following the heavy neutrino decays into weak gauge bosons. By employing well-established triggers available for the CMS detector and using the data collected by the end of the LHC Run 2, these signatures would prove to be accessible with negligibly small background. Finally, we highlight the importance that the exploitation of new triggers, specifically, displaced tri-lepton ones, could have for this displaced vertex search.

Keywords: beyond the standard model, displaced vertex, Higgs physics, neutrino physics

Procedia PDF Downloads 109

Authors: Rao Muhammad Afzal Khan

Abstract:

Nano technology is emerging as a useful technology in nearly all areas of Science and Technology. Its role in medical imaging is attracting the researchers towards existing and new imaging modalities and techniques. This presentation gives an overview of the development of the work done throughout the world. Furthermore, it lays an idea into the scope of the future use of this technology for diagnosing different diseases. A comparative analysis has also been discussed with an emphasis to detect diseases, in general, and cancer, in particular.

Keywords: medical imaging, cancer detection, diagnosis, nano-imaging, nanotechnology

Procedia PDF Downloads 441

Authors: Sammani Danwawu Abdullahi

Abstract:

Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems.

Keywords: counting with uncertainties, mathematical programming, optimization, vertex enumeration

Procedia PDF Downloads 319

Authors: Muhammad Hassan Khalil, Xu Jiadong

Abstract:

Detection of malignant tumor inside the breast of women is a challenging field for the researchers. MWI (Microwave imaging) for breast cancer diagnosis has been of interest for last two decades, newly it suggested for finding cancerous tissues of women breast. A simple and basic idea of the mathematical modeling is used throughout this paper for imaging of malignant tumor. In this paper, the authors explained inverse scattering method in the microwave imaging and also present some simulation results.

Keywords: breast cancer detection, microwave imaging, tomography, tumor

Procedia PDF Downloads 377

Authors: Wongsakorn Charoenpanitseri

Abstract:

The total chromatic number χ"(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no incident or adjacent pair of elements receive the same color Let G be a graph with maximum degree Δ(G). Considering a total coloring of G and focusing on a vertex with maximum degree. A vertex with maximum degree needs a color and all Δ(G) edges incident to this vertex need more Δ(G) + 1 distinct colors. To color all vertices and all edges of G, it requires at least Δ(G) + 1 colors. That is, χ"(G) is at least Δ(G) + 1. However, no one can find a graph G with the total chromatic number which is greater than Δ(G) + 2. The Total Coloring Conjecture states that for every graph G, χ"(G) is at most Δ(G) + 2. In this paper, we prove that the Total Coloring Conjectur for a Δ-claw-free 3-degenerated graph. That is, we prove that the total chromatic number of every Δ-claw-free 3-degenerated graph is at most Δ(G) + 2.

Keywords: total colorings, the total chromatic number, 3-degenerated, CLAW-FREE

Procedia PDF Downloads 147

Authors: Peter J. Riley

Abstract:

Medical Imaging students must understand the roles of Photo-electric Absorption (PE) and Compton Scatter (CS) interactions in patients to enable optimal X-ray imaging in clinical practice. A simulator has been developed that shows relative interaction probabilities, color bars for patient dose from PE, % penetration to the detector, and obscuring CS as Peak Kilovoltage (kVp) changes. Additionally, an anthropomorphic chest X-ray image shows the relative tissue contrasts and overlying CS-fog at that kVp, which determine the detectability of a lesion in the image. A series of interactive exercises with MCQs evaluate the student's understanding; the simulation has improved student perception of the need to acquire "sufficient" rather than maximal contrast to enable patient dose reduction at higher kVp.

Keywords: patient dose optimization, radiological physics, simulation, tissue contrast

Procedia PDF Downloads 54

Authors: Varsha Hemant Patil, Swati A. Bhavsar, Abolee H. Patil

Abstract:

Image quality assessment plays an important role in image evaluation. This paper aims to present an investigation of classic techniques in use for image quality assessment, especially for super-resolution imaging. Researchers have contributed a lot towards the development of super-resolution imaging techniques. However, not much attention is paid to the development of metrics for testing the performance of developed techniques. In this paper, the study report of existing image quality measures is given. The paper classifies reviewed approaches according to functionality and suitability for super-resolution imaging. Probable modifications and improvements of these to suit super-resolution imaging are presented. The prime goal of the paper is to provide a comprehensive reference source for researchers working towards super-resolution imaging and suggest a better framework for measuring the performance of super-resolution imaging techniques.

Keywords: interpolation, MSE, PSNR, SSIM, super resolution

Procedia PDF Downloads 67

Authors: E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell

Abstract:

We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails.

Keywords: Hamilton cycle decision problem, computational complexity theory, graph theory, theoretical computer science

Procedia PDF Downloads 338

Authors: D. Diaz, C. Guevara, P. Rey

Abstract:

This paper contains information about designing, shielding and protocols building in order to avoid ionizing radiation in X-Rays imaging areas as generated by X-Ray, mammography equipment, computed tomography equipment and digital subtraction angiography equipment, according to global standards. Furthermore, tools and elements about infrastructure to improve protection over patients, physicians and staff involved in a diagnostic imaging area are presented. In addition, technical parameters about each machine and the architecture designs and maps are described.

Keywords: imaging area, X-ray, shielding, dose

Procedia PDF Downloads 409

Authors: Salehi Zahabi Saleh, Rajabi Hosaien, Rasaneh Samira

Abstract:

Yttrium-90 (90Y) radioembolisation(RE) is increasingly used for the treatment of patients with unresectable primary or metastatic liver tumours. Image-based approaches to assess microsphere distribution after RE have gained interest but are mostly hampered by the limited imaging possibilities of the Isotope 90Y. Quantitative 90Y-SPECT imaging has limited spatial resolution because it is based on 90Y Bremsstrahlung whereas 90Y-PET has better spatial resolution but low sensitivity. As a consequence, new alternative methods of visualizing the microspheres have been investigated, such as MR imaging of iron-labelled microspheres. It was also shown that MRI combines high sensitivity with high spatial and temporal resolution and with superior soft tissue contrast and thus can be used to cover a broad range of clinically interesting imaging parameters.The aim of the study in this article was to investigate the capability of MRI to measure the intrahepatic microsphere distribution in order to quantify the absorbed radiation dose in RE.

Keywords: radioembolisation, MRI, imaging, dosimetry

Procedia PDF Downloads 290

Authors: Hiroyuki Aoki

Abstract:

Molecular imaging has attracted much attention to visualize a tumor site in a living body on the basis of biological functions. A fluorescence in vivo imaging technique has been widely employed as a useful modality for small animals in pre-clinical researches. However, it is difficult to observe a site deep inside a body because of a short penetration depth of light. A photo-acoustic effect is a generation of a sound wave following light absorption. Because the sound wave is less susceptible to the absorption of tissues, an in vivo imaging method based on the photoacoustic effect can observe deep inside a living body. The current study developed an in vivo imaging agent for a photoacoustic imaging method. Nano-particles of poly(lactic acid) including indocyanine dye were developed as bio-compatible imaging agent with strong light absorption. A tumor site inside a mouse body was successfully observed in a photo-acoustic image. A photo-acoustic imaging with polymer nano-particle agent would be a powerful method to visualize a tumor.

Keywords: nano-particle, photo-acoustic effect, polymer, dye, in vivo imaging

Procedia PDF Downloads 122

Authors: Taha Kadir Yesin, Hanyu Liu, Zhangfan Ding, Amit Singh, Qi Tian, Yuheng Zhang, Biswajyoti Borah, Junyu Chen, Anjali P. Kusumbe

Abstract:

The skeletal structure and bone marrow endothelium collectively form a critical functional unit essential for bone development, health, and aging. At the core of osteogenesis and bone formation lies the dynamic process of angiogenesis. In this study, we reveal a potent endogenous anabolic NCAM1-14.3.3. ζδ-derived- Peptide interaction, which stimulates bone angiogenesis and osteogenesis during homeostasis, aging, and age-related bone diseases. Employing high-resolution imaging and inducible cell-specific mouse genetics, our results elucidate the pivotal role of the NCAM1-14.3.3.ζδ-derived-Peptide interaction in driving the expansion of Clec14a+ angiogenic endothelial cells. Notably, Clec14a+ endothelial cells express key osteogenic factors. The NCAM1-14.3.3.ζδ-derived-Peptide interaction in osteoblasts drives osteoblast differentiation, ultimately contributing to the genesis of bone. Moreover, the NCAM1-14.3.3.ζδ-derived-Peptide interaction leads to a reduction in bone resorption. In age-associated vascular and bone loss diseases, stimulating the NCAM1-14.3.3.ζδ-derived-Peptide interaction not only promotes angiogenesis but also reverses bone loss. Consequently, harnessing the endogenous anabolic potential of the NCAM1-14.3.3.ζδ-derived-Peptide interaction emerges as a promising therapeutic modality for managing age-related bone diseases.

Keywords: endothelial cell, NCAM1, Clec14a, 14.3.3.ζδ

Procedia PDF Downloads 20

Authors: Sujith Rajashekar Swamy, Meghana Rajashekara Swamy

Abstract:

Although T1-weighted gadolinium-enhanced imaging (T1-Gd) has its established clinical role in diagnosing brain lesions of infectious and metastatic origins, the use of post-contrast susceptibility-weighted imaging (SWI) has been understudied. This observational study aims to explore and compare the prominence of brain parenchymal lesions between T1-Gd and SWI-Gd images. A cross-sectional study design was utilized to analyze 58 patients with brain parenchymal lesions using T1-Gd and SWI-Gd scanning techniques. Our results indicated that SWI-Gd enhanced the conspicuity of metastatic as well as infectious brain lesions when compared to T1-Gd. Consequently, it can be used as an adjunct to T1-Gd for post-contrast imaging, thereby avoiding additional contrast administration. Improved conspicuity of brain lesions translates directly to enhanced patient outcomes, and hence SWI-Gd imaging proves useful to meet that endpoint.

Keywords: susceptibility weighted, T1 weighted, brain lesions, gadolinium contrast

Procedia PDF Downloads 86

Authors: Fakhrosadat Sajjadian, Ramin Ghasemi Shayan

Abstract:

The tumor microenvironment plays an fundamental part in tumor start, movement, metastasis, and treatment resistance. It varies from ordinary tissue in terms of its extracellular network, vascular and lymphatic arrange, as well as physiological conditions. The clinical application of atomic cancer imaging is regularly prevented by the tall commercialization costs of focused on imaging operators as well as the constrained clinical applications and little showcase measure of a few operators. . Since numerous cancer types share comparable characteristics of the tumor microenvironment, the capacity to target these biomarkers has the potential to supply clinically translatable atomic imaging advances for numerous types encompassing cancer and broad clinical applications. Noteworthy advance has been made in focusing on the tumor microenvironment for atomic cancer imaging. In this survey, we summarize the standards and methodologies of later progresses in atomic imaging of the tumor microenvironment, utilizing distinctive imaging modalities for early discovery and conclusion of cancer. To conclude, The tumor microenvironment (TME) encompassing tumor cells could be a profoundly energetic and heterogeneous composition of safe cells, fibroblasts, forerunner cells, endothelial cells, flagging atoms and extracellular network (ECM) components.

Keywords: molecular, imaging, TME, medicine

Procedia PDF Downloads 17

Authors: Hamid R. Chabok, Demetrios N. Christodoulides, Mercedeh Khajavikhan

Abstract:

In recent years, acousto-optic (AO) lenses with tunable foci have emerged as a powerful tool for optical beam shaping, imaging, and particle manipulation. In most current AO lenses, the incident light that propagates orthogonally to a standing ultrasonic wave converts to a Bessel-like beam pattern due to the Raman-Nath effect, thus forming annular fringes that result in compromised focus response. Here, we report a new class of AO dynamic lensing based on generating a 3D-variable refractive index profile via a z-axis-scan ultrasound transducer. By utilizing the co- /counter propagation of light and acoustic waves that interact over a longer distance, the laser beam can be strongly focused in a fully controllable manner. Using this approach, we demonstrate AO lenses with instantaneous extended depth of field (DoF) and laterally localized dynamic focusing. This new light-sound interaction scheme may pave the way towards applications that require remote focusing, 3D micromanipulation, and deep tissue therapy/imaging.

Keywords: acousto-optic, optical beam shaping, dynamic lensing, ultrasound

Procedia PDF Downloads 58