To see the other types of publications on this topic, follow the link: Inner vertex number.
Journal articles on the topic 'Inner vertex number'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 27 journal articles for your research on the topic 'Inner vertex number.'
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
Amjadi, J. "The signed total Roman domatic number of a digraph." Discrete Mathematics, Algorithms and Applications 10, no. 02 (2018): 1850020. http://dx.doi.org/10.1142/s1793830918500209.
Full textAbstract:
Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text]. A signed total Roman dominating function (STRDF) on a digraph [Formula: see text] is a function [Formula: see text] such that (i) [Formula: see text] for every [Formula: see text], where [Formula: see text] consists of all inner neighbors of [Formula: see text], and (ii) every vertex [Formula: see text] for which [Formula: see text] has an inner neighbor [Formula: see text] for which [Formula: see text]. The weight of an STRDF [Formula: see text] is [Formula: see text]. The signed total Roman domination number [Formula: see text] of [Formula: see text] is the minimum weight of an STRDF on [Formula: see text]. A set [Formula: see text] of distinct STRDFs on [Formula: see text] with the property that [Formula: see text] for each [Formula: see text] is called a signed total Roman dominating family (STRD family) (of functions) on [Formula: see text]. The maximum number of functions in an STRD family on [Formula: see text] is the signed total Roman domatic number of [Formula: see text], denoted by [Formula: see text]. In this paper, we initiate the study of signed total Roman domatic number in digraphs and we present some sharp bounds for [Formula: see text]. In addition, we determine the signed total Roman domatic number of some classes of digraphs.
2
Li, Haisheng. "Twisted Modules and Pseudo-endomorphisms." Algebra Colloquium 19, no. 02 (2012): 219–36. http://dx.doi.org/10.1142/s1005386712000156.
Full textAbstract:
We exhibit a connection between two constructions of twisted modules for a general vertex operator algebra with respect to inner automorphisms. We also study pseudo-derivations, pseudo-endomorphisms, and twist deformations of ordinary modules by pseudo-endomorphisms.
3
Zheng, Lina, Yiqiao Wang, and Weifan Wang. "The Difference of Zagreb Indices of Halin Graphs." Axioms 12, no. 5 (2023): 450. http://dx.doi.org/10.3390/axioms12050450.
Full textAbstract:
The difference of Zagreb indices of a graph G is defined as ΔM(G)=∑u∈V(G)(d(u))2−∑uv∈E(G)d(u)d(v), where d(x) denotes the degree of a vertex x in G. A Halin graph G is a graph that results from a plane tree T without vertices of degree two and with at least one vertex of degree at least three such that all leaves are joined through a cycle C in the embedded order. In this paper, we establish both lower and upper bounds on the difference of Zagreb indices for general Halin graphs and some special Halin graphs with fewer inner vertices. Furthermore, extremal graphs attaining related bounds are found.
4
Bribiesca, Ernesto, Ulf-Dietrich Braumann, Angel Carrillo-Bermejo, and Humberto Sossa-Azuela. "An Approach to the Computation of the Euler Number by means of the Vertex Chain Code." Computational and Mathematical Methods in Medicine 2020 (July 16, 2020): 1–13. http://dx.doi.org/10.1155/2020/5632159.
Full textAbstract:
We present an approach to compute the number of holes in binary images using the Vertex Chain Code (VCC); the VCC was developed for representing and analyzing 2D shapes composed of cells. Using this code, it is possible to relate the outer to inner vertices of any 2D shape and to find interesting properties. Now, in this paper, we describe more properties of the VCC, such as the computation of the connected regions in a hole, the analysis of complementary chains, the computation of the number of holes in a binary shape or image, the computation of the Euler number, and the detection of convex and concave shapes. Finally, in order to illustrate the capabilities of proposed methods, we present the computation of topological properties of examples of objects of the real world.
5
Dale, P. J., and M.-C. Nielsen. "Main characteristics to distinguish Bactericera cockerelli from other psyllids in New Zealand." New Zealand Plant Protection 62 (August 1, 2009): 411. http://dx.doi.org/10.30843/nzpp.2009.62.4862.
Full textAbstract:
The tomato/potato psyllid Bactericera cockerelli (Sulc) (Hemiptera Triozidae) is found throughout most of New Zealand along with a range of native and other introduced psyllids all belonging to the superfamily Psylloidea The Psylloidea contains six families of which four are recorded from New Zealand (Psyllidae Calophyidae Homotomidae and Triozidae) Species belonging to Triozidae have trifurcate branching on the basal vein of the forewing in contrast to the other psyllid families in New Zealand which have bifurcate branching Bactericera cockerelli can be distinguished from other Triozidae species by the number of inner apical spurs on the tibiae of the hind legs (2) size and shape of the cubital cell in the forewing (short and compact) absence of long setae on vertex and dorsal thoracic surfaces and the lack of well developed genal cones Illustrations of these characters can be seen on insectwatchcom Usually body markings in insects are not suitable for identification purposes since these are likely to vary However the very distinct markings (white marginal and inner patch) on the vertex (dorsal surface of head) of B cockerelli seem stable and are a very useful characteristic for distinguishing this species from other psyllids in New Zealand
6
Khabyah, Ali Al, and Moin A. Ansari. "Exploring Geometrical Properties of Annihilator Intersection Graph of Commutative Rings." Axioms 14, no. 5 (2025): 336. https://doi.org/10.3390/axioms14050336.
Full textAbstract:
Let Λ denote a commutative ring with unity and D(Λ) denote a collection of all annihilating ideals from Λ. An annihilator intersection graph of Λ is represented by the notation AIG(Λ). This graph is not directed in nature, where the vertex set is represented by D(Λ)*. There is a connection in the form of an edge between two distinct vertices ς and ϱ in AIG(Λ) iff Ann(ςϱ)≠Ann(ς)∩Ann(ϱ). In this work, we begin by categorizing commutative rings Λ, which are finite in structure, so that AIG(Λ) forms a star graph/2-outerplanar graph, and we identify the inner vertex number of AIG(Λ). In addition, a classification of the finite rings where the genus of AIG(Λ) is 2, meaning AIG(Λ) is a double-toroidal graph, is also investigated. Further, we determine Λ, having a crosscap 1 of AIG(Λ), indicating that AIG(Λ) is a projective plane. Finally, we examine the domination number for the annihilator intersection graph and demonstrate that it is at maximum, two.
7
RODRIGUES, F. A., G. TRAVIESO, and L. da F. COSTA. "FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH." International Journal of Modern Physics C 18, no. 06 (2007): 937–47. http://dx.doi.org/10.1142/s0129183107011042.
Full textAbstract:
A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most community finding algorithms.
8
Iqbal, Muhammad Azhar, Muhammad Imran, and Muhammad Asad Zaighum. "Eccentricity based topological indices of siloxane and POPAM dendrimers." Main Group Metal Chemistry 43, no. 1 (2020): 92–98. http://dx.doi.org/10.1515/mgmc-2020-0010.
Full textAbstract:
AbstractA massive of early drug tests indicates that there is some strong inner connections among the bio-medical and pharmacology properties of nanostar dendrimers and their molecular structures. Topological descriptors are presented as fundamentally transforming a molecular graph into a number. There exist various categories of such descriptors particularly those descriptors that based on edge and vertex distances. Topological descriptors are exercised for designing biological, physico-chemical, toxicological, pharmacologic and other characteristics of chemical compounds. In this paper, we study infinite classes of siloxane and POPAM dendrimers and derive their Zagreb eccentricity indices, eccentric-connectivity and total-eccentricity indices.
9
Ou, Shikun, and Jin Zhong. "Automorphisms of a commuting graph of rank one upper triangular matrices." Electronic Journal of Linear Algebra 31 (February 5, 2016): 774–93. http://dx.doi.org/10.13001/1081-3810.3064.
Full textAbstract:
Let $F$ be a finite field, $n\geqslant 2$ an arbitrary integer, $\mathcal{M}_n(F)$ the set of all $n\times n$ matrices over $F$, and $\mathcal{U}_n^1(F)$ the set of all rank one upper triangular matrices of order $n$. For $\mathcal{S}\subseteq\mathcal{M}_n(F)$, denote $C(\mathcal{S})=\{X\in \mathcal{S} |\ XA=AX \ \hbox{for all}\ A\in \mathcal{S}\}$. The commuting graph of $\mathcal{S}$, denoted by $\Gamma(\mathcal{S})$, is the simple undirected graph with vertex set $\mathcal{S}\setminus C(\mathcal{S})$ in which for every two distinct vertices $A$ and $B$, $A\sim B$ is an edge if and only if $AB=BA$. In this paper, it is shown that any graph automorphism of $\Gamma(\mathcal{U}_n^1(F))$ with $n\geqslant 3$ can be decomposed into the product of an extremal automorphism, an inner automorphism, a field automorphism and a local scalar multiplication.
10
Stas, Michal. "Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph." Filomat 34, no. 9 (2020): 2829–46. http://dx.doi.org/10.2298/fil2009829s.
Full textAbstract:
The main aim of the paper is to give the crossing number of the join product G* + Dn for the connected graph G* of order six consisting of P4 + D1 and of one leaf incident with some inner vertex of the path P4 on four vertices, and where Dn consists of n isolated vertices. In the proofs, it will be extend the idea of the minimum numbers of crossings between two different subgraphs from the set of subgraphs which do not cross the edges of the graph G* onto the set of subgraphs by which the edges of G* are crossed exactly once. Due to the mentioned algebraic topological approach, we are able to extend known results concerning crossing numbers for join products of new graphs. The proofs are done with the help of software that generates all cyclic permutations for a given number k, and creates a new graph COG for calculating the distances between all (k-1)! vertices of the graph. Finally, by adding one edge to the graph G*, we are able to obtain the crossing number of the join product of one other graph with the discrete graph Dn.
11
Blidaru, B. M. "Testbeam performance results of bent ALPIDE monolithic active pixel sensors in view of the ALICE Inner Tracking System 3." Journal of Instrumentation 17, no. 09 (2022): C09006. http://dx.doi.org/10.1088/1748-0221/17/09/c09006.
Full textAbstract:
Abstract The ALICE Inner Tracking System has been recently upgraded to a full silicon detector consisting entirely of monolithic active pixel sensors, arranged in seven concentric layers around the LHC beam pipe. Further ahead, during the LHC Long Shutdown 3, the ALICE collaboration is planning to replace the three innermost layers of this new ITS with a novel vertex detector. The proposed design features wafer-scale, ultra-thin, truly cylindrical MAPS. The new sensors will be thinned down to 20–40 µm, featuring a material budget of less than 0.05% x/X 0 per layer, unprecedented low, and will be arranged concentrically around the beam pipe, as close as 18 mm from the interaction point. Anticipating the first prototypes in the new 65 nm CMOS technology node, an active R&D programme is underway to test the response to bending of existing 50 µm thick ALPIDE sensors. A number of such chips were successfully bent, even below the targeted innermost radius, without signs of mechanical damage, while retaining their full electrical functionality in laboratory tests. The curved detectors were subsequently tested during particle beam campaigns, where their particle detection performance was assessed. In this contribution, testbeam highlights from the data analysis of bent ALPIDE sensors, will be presented. It was proved that the current ALPIDE produced in the 180 nm CMOS technology retains its properties after bending. The results show an inefficiency that is generally below 10−4, independent of the inclination and position of the impinging beam with respect to the sensor surface. This encouraging outcome proves that the use of curved MAPS is an exciting possibility for future silicon detector designs, as not only the sensor can survive the bending exercise mechanically, but the enticing attributes that make it attractive for use in the inner tracking layers are comparable to the flat state.
12
Kimmich, Nina, Vera Grauwiler, Anne Richter, Roland Zimmermann, and Martina Kreft. "Birth Lacerations in Different Genital Compartments and their Effect on Maternal Subjective Outcome: A Prospective Observational Study." Zeitschrift für Geburtshilfe und Neonatologie 223, no. 06 (2019): 359–68. http://dx.doi.org/10.1055/a-0858-0138.
Full textAbstract:
Abstract Introduction Lacerations are common in vaginal births, but little is known about tears other than perineal tears and their association with maternal impairment. This study aimed to evaluate the frequency and distribution of birth lacerations and their association with maternal discomfort. Methods From 2/2015 to 12/2016, we conducted a prospective observational study on 140 women with singletons in vertex presentation at term, who gave birth vaginally in our center and were affected by a laceration. The lacerations were assigned objectively and subjectively to eight genital tract compartments. The presence and effect of lacerations on maternal health were assessed by questionnaires for the time before birth (T1), 1–4 days (T2), and 6–8 weeks postpartum (T3). Results The number of affected compartments was 1.33 objectively and 2.99 at T2 and 1.27 at T3 subjectively. The most affected compartment was the right perineum (73%) followed by the right inner posterior (21%) and the right outer anterior (14%) compartment. Subjective and objective assessment concurred in 83% at T2 and 69% of cases at T3. Overall, impairment of women was low, reversible, and not directly associated with the location of lacerations, although women were psychologically affected. Conclusion Birth lacerations predominantly appear at the right perineum. Physical impairment from these lacerations is generally low, reversible, and not directly associated with the location of lacerations, although psychological impairment is not negligible.
13
Chamani, Javad Ghareh, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, and Rasool Jalili. "GraphOS: Towards Oblivious Graph Processing." Proceedings of the VLDB Endowment 16, no. 13 (2023): 4324–38. http://dx.doi.org/10.14778/3625054.3625067.
Full textAbstract:
We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency notion which we call oblivious graph processing : the server learns nothing besides the number of graph vertexes and edges, and for each query its type and response size. At a technical level, GraphOS stores the graph on a doubly-oblivious data structure , so that all vertex/edge accesses are indistinguishable. For this purpose, we propose Omix++, a novel doubly-oblivious map that outperforms the previous state of the art by up to 34×, and may be of independent interest. Moreover, to avoid any leakage from CPU instruction-fetching during query evaluation, we propose algorithms for four fundamental graph queries (BFS/DFS traversal, minimum spanning tree, and single-source shortest paths) that have a fixed execution trace , i.e., the sequence of executed operations is independent of the input. By combining these techniques, we eliminate all information that a hardware adversary observing the memory access pattern within the protected enclave can infer. We benchmarked GraphOS against the best existing solution, based on oblivious relational DBMS (translating graph queries to relational operators). GraphOS is not only significantly more performant (by up to two orders of magnitude for our tested graphs) but it eliminates leakage related to the graph topology that is practically inherent when a relational DBMS is used unless all operations are "padded" to the worst case.
14
H., M. Nagesh, Chandrasekhar R., and C. Mahesh Kumar M. "Directed Pathos Block Line Cut-Vertex Digraph of an Arborescence." November 30, 2016. https://doi.org/10.5281/zenodo.826836.
Full textAbstract:
The path number of a graph <em>G</em> is the number of paths in any pathos. The path number of a tree <em>T</em> equals<em> k</em>, where <em>2k</em> is the number of odd degree vertices of T Harary and Stanton calculated the path number of certain classes of graphs like trees and complete graphs.
15
Long, Shude, and Han Ren. "Counting 2-Connected 4-Regular Maps on the Projective Plane." Electronic Journal of Combinatorics 21, no. 2 (2014). http://dx.doi.org/10.37236/4038.
Full textAbstract:
In this paper the number of rooted (near-) 4-regular maps on the projective plane are investigated with respect to the root-valency, the number of edges, the number of inner faces, the number of nonroot-vertex-loops, the number of nonroot-vertex-blocks. As special cases, formulae for several types of rooted 4-regular maps such as 2-connected 4-regular projective planar maps, rooted 2-connected (connected) 4-regular projective planar maps without loops are also presented. Several known results on the number of 4-regular maps on the projective plane are also concluded. Finally, by use of Darboux's method, very nice asymptotic formulae for the numbers of those types of maps are given.
16
Yang, Ruhao, Han Ye, Qi Wang, Yumin Liu, Wenjun Liu, and Zhenping Wu. "Complex Janus MoSSe Nanoscrolls Spontaneously Formed from Flat Nanoflakes: A Theoretical Exploration." Small Structures, January 28, 2025. https://doi.org/10.1002/sstr.202400587.
Full textAbstract:
Janus transition metal dichalcogenide (TMD) monolayers with out‐of‐plane atomic asymmetry have been experimentally observed to scroll into unique 1D nanoscrolls with diverse complex structures, while the underlying mechanism has not been unveiled. In this work, the entire scrolling process of triangular and hexagonal MoSSe nanoflakes is successfully simulated based on molecular dynamics, demonstrating the formation of five distinct nanoscroll structures. From flat configuration, the nanoflakes are released along typical directions (including edge‐to‐vertex, vertex‐to‐vertex, and vertex‐to‐edge) accounting for the time‐dependent break of van der Waals (vdW) interaction between substrate and nanoflakes. Key structural parameters such as inner radii are found to be closely related to the nanoflake shapes, sizes, and release directions. Additionally, the regions with various layer numbers in nanoscrolls are projected on the flat nanoflakes to demonstrate the local contribution to the vdW stacked multilayer structures. For each nanoflake shape and release direction, the quantitative relations between the area of specific layer number and both inner radius and interlayer distance are obtained. The results provide a fundamental understanding of complex nanoscrolls spontaneously formed from Janus TMD nanoflakes.
17
Haynes, Gerald, Catherine Park, Amanda Schaeffer, Jordan Webster, and Lon H. Mitchell. "Orthogonal Vector Coloring." Electronic Journal of Combinatorics 17, no. 1 (2010). http://dx.doi.org/10.37236/327.
Full textAbstract:
A vector coloring of a graph is an assignment of a vector to each vertex where the presence or absence of an edge between two vertices dictates the value of the inner product of the corresponding vectors. In this paper, we obtain results on orthogonal vector coloring, where adjacent vertices must be assigned orthogonal vectors. We introduce two vector analogues of list coloring along with their chromatic numbers and characterize all graphs that have (vector) chromatic number two in each case.
18
Lua Ngo and Jae-Ho Han. "Graph-based segmentation with homogeneous hue and texture vertices." Optica Applicata 51, no. 4 (2021). http://dx.doi.org/10.37190/oa210406.
Full textAbstract:
This work presents an automated segmentation method, based on graph theory, which processes superpixels that exhibit spatially similarities in hue and texture pixel groups, rather than individual pixels. The graph shortest path includes a chain of neighboring superpixels which have minimal intensity changes. This method reduces graphics computational complexity because it provides large decreases in the number of vertices as the superpixel size increases. For the starting vertex prediction, the boundary pixel in first column which is included in this starting vertex is predicted by a trained deep neural network formulated as a regression task. By formulating the problem as a regression scheme, the computational burden is decreased in comparison with classifying each pixel in the entire image. This feasibility approach, when applied as a preliminary study in electron microscopy and optical coherence tomography images, demonstrated high measures of accuracy: 0.9670 for the electron microscopy image and 0.9930 for vitreous/nerve-fiber and inner-segment/outer-segment layer segmentations in the optical coherence tomography image.
19
Schüßler, Vincent, Johannes Hanika, and Carsten Dachsbacher. "Bridge Sampling for Connections via Multiple Scattering Events." Computer Graphics Forum 43, no. 4 (2024). http://dx.doi.org/10.1111/cgf.15160.
Full textAbstract:
AbstractExplicit sampling of and connecting to light sources is often essential for reducing variance in Monte Carlo rendering. In dense, forward‐scattering participating media, its benefit declines, as significant transport happens over longer multiple‐scattering paths around the straight connection to the light. Sampling these paths is challenging, as their contribution is shaped by the product of reciprocal squared distance terms and the phase functions. Previous work demonstrates that sampling several of these terms jointly is crucial. However, these methods are tied to low‐order scattering or struggle with highly‐peaked phase functions.We present a method for sampling a bridge: a subpath of arbitrary vertex count connecting two vertices. Its probability density is proportional to all phase functions at inner vertices and reciprocal squared distance terms. To achieve this, we importance sample the phase functions first, and subsequently all distances at once. For the latter, we sample an independent, preliminary distance for each edge of the bridge, and afterwards scale the bridge such that it matches the connection distance. The scale factor can be marginalized out analytically to obtain the probability density of the bridge. This approach leads to a simple algorithm and can construct bridges of any vertex count. For the case of one or two inserted vertices, we also show an alternative without scaling or marginalization.For practical path sampling, we present a method to sample the number of bridge vertices whose distribution depends on the connection distance, the phase function, and the collision coefficient. While our importance sampling treats media as homogeneous we demonstrate its effectiveness on heterogeneous media.
20
F. Pylypaka, S., and A. V. Nesvidomin. "Finding the trajectories of the movement of a material particle on the inner surface of a cone with a vertical axis with lateral feed of the material." Energy and automation, December 20, 2024, 77–92. https://doi.org/10.31548/energiya5(75).2024.077.
Full textAbstract:
The movement of material particles along the inner surface of the cone takes place in cyclones, the designs of which can have both cylindrical and conical parts. Aerodynamic processes occurring in a cyclone are complex in nature, therefore they cannot be accurately modeled on the basis of theoretical approaches. A number of simplifications were introduced during the research: air resistance is not taken into account, since the particle is fed into the cone together with the air, although later their directions of movement do not coincide (the particle damps the speed and falls down, and the air along the central part along the axis of the cone rises up and goes out); the influence of particles on each other, their size, etc. The purpose of the article is to study the motion of a material particle entering the inner surface of a vertical cone with a given initial velocity. If a material particle is directed with an initial velocity to the inner wall of the cone perpendicular to its generator, then its further motion will include both rotation around the axis of the cone and descent down under the action of its own weight. To find the trajectory of motion, a material point was taken as the vertex of the accompanying Frenet trihedron, which has three mutually perpendicular orthogonal planes. The second accompanying Darboux trihedron has a common orthogonal plane tangent to the trajectory with the Frenet trihedron. The balance of the acting forces in the projections onto the orthogonal planes of the Darboux trihedron was considered. This made it possible to determine the projections of the curvature of the curve onto the corresponding orthogonal planes of the Darboux trihedron. The differential geometry apparatus made it possible to find them through the first and second quadratic forms of the surface, which allows avoiding cumbersome transformations. Differential equations of motion of a material particle along the inner surface of a vertical cone were compiled. The equations were solved using the MatLab system. The equation of motion of a particle along the inner surface of the cone was obtained. Analyzing the trajectory of the particle, we can conclude that it is significantly different from the trajectory of motion along the inner surface of the cylinder. The graphs of changes in velocity also show the difference between the motion of a particle along a cone and the same motion along a cylinder. If, upon entering the surface of a cylinder, the particle damps its velocity to a certain limit, and then it begins to increase again, then during movement along a cone the velocity of the particle has a certain periodic character and approaches zero over time. In the absence of friction and air resistance, a material particle, after entering the inner surface of the cone at a certain angle to the generator (except zero), performs an oscillatory motion, alternately rising and falling along a trajectory in the form of a loop, moving for any length of time. Depending on the initial conditions, the particle can describe a finite number of branches of the loop, an infinite number of branches, move along a straight-line generator of the cone, or along an intermediate trajectory between a straight line and a loop. In the presence of friction, the particle will descend to the top of the cone, with possible local rises, the magnitude of which will depend on the initial velocity and the angle of inclination of the generating cone. The velocity in such a motion will damp out, while also having an oscillatory character.
21
Zarei, Mehdi, and Gholam Hossein Rahimi. "External pressure buckling of composite sandwich conical shells with variable skin thickness." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, July 20, 2022, 095441002211017. http://dx.doi.org/10.1177/09544100221101764.
Full textAbstract:
In this paper, an analytical model is developed to investigate the buckling analysis of the composite sandwich conical shell with variable skin thickness under lateral pressure loading. This problem involves composite shells, which are produced during the filament-winding process, where the skin thickness varies through the length of the shell. An effective smeared method is employed to reduce the reinforced lattice core into a layer. This is done by analyzing forces and moments on a unit cell. Therefore, equivalent stiffness parameters of reinforced lattice core are determined. By superimposing stiffness parameters due to the lattice core with those of the inner and outer skins, the equivalent stiffness of the sandwich panel will be obtained. Governing equations are established based on the first shear deformation theory. The power series method is used to extract the buckling load of the stiffened shell. To verify achieved results, a 3D finite element model is provided. Comparisons showed that the analytical solution is qualified enough to study the buckling behavior of the composite sandwich conical shell. Through this study, the effects of a set of important parameters like stiffener orientation angle, number of stiffeners, semi-vertex angle, and skin lamination are investigated.
22
Yılmaz, Cengizhan, Murat Kabak, and Sedef Selviler Sizer. "Comparative macroanatomical and scanning electron microscopy study of the eyeball in brachycephalic and mesocephalic dog breeds." Microscopy Research and Technique, June 2024. http://dx.doi.org/10.1002/jemt.24624.
Full textAbstract:
AbstractThe anatomical structures forming the eyeball differ among dog breeds, both morphologically and morphometrically. This study was aimed at determining the morphometric values of the eyeball layers of different dog breeds and the morphological structures of these layers using scanning electron microscopy. Thirty‐two eyeballs of 17 dogs belonging to 9 different breeds that died from traffic accidents, falling from a height, and naturally were used. These dog breeds were grouped according to their brachycephalic and mesocephalic skull structures, and morphometric measurements of the eyeballs of each group were obtained. Scanning electron microscopy was used to examine the morphological structure of the eyeball layers. The studied dogs' eyeballs comprised three layers: outer, middle, and inner. Thickness measurements obtained from three different regions of the eyeball indicated that the equatorial region was the thinnest among all dog breeds. Moreover, the cornea, which is covered by the sclera along its edges, was thicker at the corneal limbus than at the corneal vertex. A positive correlation was observed between lens thickness and the number of ciliary processes, which varied according to the dogs' head structures. Notably, depression was observed in the posterior surface of the lens in brachycephalic dogs. The morphometric values of the eyeball layers in the brachycephalic and mesocephalic dog breeds were also determined. These values will help researchers study this subject, and the determined morphometric and morphological values will contribute to the anatomy literature.Research Highlights This comprehensive study investigates the morphometric and morphological variations in the eyeball layers of different dog breeds, utilizing scanning electron microscopy to analyze eyeballs. It reveals significant breed‐specific differences, particularly between brachycephalic and mesocephalic dogs, regarding eyeball layer thickness, corneal structure, lens thickness, and the number of ciliary processes.
23
Khalid, Asad, and S. M. Rohaizan. "Performance of tri-tubular conical energy absorber under axial compression." Journal of Mechanical Engineering and Sciences, March 30, 2024, 9872–82. http://dx.doi.org/10.15282/jmes.18.1.2024.6.0781.
Full textAbstract:
Quasi static axial compression loading on tri-tubular cone (TC) has been carried out using LS-DYNA finite element analysis method. Tri-tubular cones of three arrangements; the first arrangement (model TC-1) consists of cone heights of 50 mm, 75 mm and 100 mm where the inner cone is the maximum height. The second arrangement (model TC-2) consists of cone heights of 100 mm, 75 mm, and 50 mm where the outer cone is the maximum height. The third arrangement (model TC-3) consists of three cones of the same height of 100 mm. Cone semi vertex angle of 20o was maintained for all tri-tubular cones tested. Materials used for this research are glass, jute and jute-glass/epoxy. Crashworthiness analyses were performed to investigate the effect of material used, and tri-tubular cone arrangement on peak load. Crush efficiency, and absorbed energy were drawn and discussed. Failure mechanism of the fractured specimens was also discussed. Effect of number of layers and fiber stacking sequence were also investigated. Results show that the cone arrangement TC-3 gives better performance than the cone arrangement TC-2 followed by the cone arrangement TC-1. Maximum load obtained by tri-tubular cone type TC-3 was found higher 7.09% and 14.96% than TC-2 and TC-1 respectively for glass/epoxy. Material saving was achieved by using tri-tubular cones of different heights under compression. Material used has significant influence on the absorbed energy. Failure mode of tri-tubular conical energy absorber was presented and discussed.
24
Zhang, Muhan, Zhicheng Cui, Shali Jiang, and Yixin Chen. "Beyond Link Prediction: Predicting Hyperlinks in Adjacency Space." Proceedings of the AAAI Conference on Artificial Intelligence 32, no. 1 (2018). http://dx.doi.org/10.1609/aaai.v32i1.11780.
Full textAbstract:
This paper addresses the hyperlink prediction problem in hypernetworks. Different from the traditional link prediction problem where only pairwise relations are considered as links, our task here is to predict the linkage of multiple nodes, i.e., hyperlink. Each hyperlink is a set of an arbitrary number of nodes which together form a multiway relationship. Hyperlink prediction is challenging---since the cardinality of a hyperlink is variable, existing classifiers based on a fixed number of input features become infeasible. Heuristic methods, such as the common neighbors and Katz index, do not work for hyperlink prediction, since they are restricted to pairwise similarities. In this paper, we formally define the hyperlink prediction problem, and propose a new algorithm called Coordinated Matrix Minimization (CMM), which alternately performs nonnegative matrix factorization and least square matching in the vertex adjacency space of the hypernetwork, in order to infer a subset of candidate hyperlinks that are most suitable to fill the training hypernetwork. We evaluate CMM on two novel tasks: predicting recipes of Chinese food, and finding missing reactions of metabolic networks. Experimental results demonstrate the superior performance of our method over many seemingly promising baselines.
25
Holod, Monique, Anna McCormick, and Samantha de los Reyes. "Association of race and ethnicity in cesarean rates in a diverse low-risk populationAssociation of race and ethnicity in cesarean rates in a diverse low-risk population." HPHR Journal, no. 85 (2024). http://dx.doi.org/10.54111/0001/gggg4.
Full textAbstract:
Objective To evaluate racial disparities in cesarean delivery rates in an ethnically diverse nulliparous, term, singleton, vertex (NTSV) population at an inner-city tertiary care center. Methods This is a retrospective cohort study evaluating cesarean delivery rates by race and ethnicity in an ethnically diverse NTSV population with approximately equal numbers of Hispanic, non-Hispanic Black and non-Hispanic White participants from January 1st through December 31st, 2020. The primary outcome was cesarean delivery rate. The secondary outcome was urgency of cesarean delivery categorized as emergent, unscheduled or elective. Univariable analysis was utilized to evaluate the association of maternal clinical characteristics and the primary and secondary outcomes. Multivariable analysis was performed for variables significant in univariable analysis (p <0.05). Results A total of 872 patients were included in the study. 290 were non-Hispanic White (33.3%), 258 were non-Hispanic Black (29.6%), 245 were Hispanic (28.1%), and 79 were Asian (9.1%). The overall cesarean rate was 32.5%. The cesarean delivery rates for non-Hispanic White, non-Hispanic Black, Hispanic, and Asian patients were 26.6%, 40.7%, 31.4%, and 30.4%, respectively. Non-Hispanic Black patients had significantly higher odds of cesarean delivery when compared to non-Hispanic White patients (OR 1.96, 95% CI: 1.37-2.81). This increased risk persisted in the multivariable analysis (aOR 1.83, 95% CI: 1.13-2.97). The risk of emergent cesarean delivery for non-Hispanic Black patients was also significantly increased (OR 3.69, 95% CI: 2.28-5.75), (aOR 3.39, 95% CI: 1.90-6.05). Conclusion Non-Hispanic Black patients had significantly higher risk of cesarean delivery and emergent cesarean delivery when compared to non-Hispanic White patients in an NTSV population at an inner-city tertiary care center.
26
ISMAIL, HEBA M., DAVID D. CUTHBERTSON, ANANTA ADDALA, et al. "1525-P: Genetic Ancestry and Progression through Type 1 Diabetes (T1D) Stages." Diabetes 74, Supplement_1 (2025). https://doi.org/10.2337/db25-1525-p.
Full textAbstract:
Introduction and Objective: Race/ethnicity is a social construct affecting T1D risk while genetic ancestry (GA) (a biological factor) is understudied. Here, we examined if GA is related to autoantibody (Ab) and metabolic patterns in those at risk for T1D. Methods: We studied relatives of people with T1D in the TrialNet Pathway to Prevention study and classified them using GRAF-pop, a distance-based method to infer GA groups, into European (E), African American (AA), Latin American 1 (LA1), Latin American 2 (LA2), South Asian (SA), and Asian-Pacific Islander (API). We compared GA groups for Ab and metabolic characteristics at screening and each T1D stage. Results: At screening (N=4508, mean±SD age 14.7±12.4 yrs, 50.4% male), GA groups were different in Ab number (single vs multiple vs negative, p=0.015), type (MIAA and ZnT8A most prevalent in E; IA-2A in AA, and ICA in API; p&lt;0.05), and titer. For Ab+ participants who underwent monitoring (follow up 4.4±15.3 yrs), differences in Ab prevalence were seen in all 3 stages, though differing from screening patterns, e.g., MIAA was most common in AA. Metabolic differences were most notable at stage 2 (Table), while risk of progression to stage 3 was not different by GA. There were no differences in age or sex by GA groups. Conclusion: We saw differences in Ab prevalence and metabolic markers but not progression to stage 3 T1D by GA. Social factors may explain previously reported racial/ethnic differences. Disclosure H.M. Ismail: Consultant; Rise Therapeutics. D.D. Cuthbertson: None. A. Addala: None. S.M. Cabrera: None. A.F. Siller: None. L.A. DiMeglio: Stock/Shareholder; Lilly USA LLC. Research Support; Lilly Diabetes. Other Relationship; Lilly USA LLC. Research Support; MannKind Corporation. Other Relationship; Sanofi. Research Support; Zealand Pharma A/S. Consultant; Vertex Pharmaceuticals Incorporated, Tandem Diabetes Care, Inc, Biomea Fusion. Other Relationship; Merck & Co., Inc. K.C. Herold: Consultant; Sanofi, Dompé, Vertex Pharmaceuticals Incorporated, Sonoma, NexImmune. M. Tosur: None. I. Libman: None. M.J. Redondo: None. Funding NIDDK (K23DK129799)
27
Gai, Guodong, and Anthony Wachs. "On the streamwise vorticity generation and distribution in an angular particle wake." Journal of Fluid Mechanics 964 (June 7, 2023). http://dx.doi.org/10.1017/jfm.2023.408.
Full textAbstract:
We investigate the streamwise vorticity generation mechanism and distribution pattern in an unbounded steady inertial flow past a fixed Platonic polyhedron. Three angular positions are selected: an edge facing the flow (E), a face facing the flow (F) and a vertex facing the flow (V). We provide compelling evidence that the generation of the streamwise vorticity is primarily caused by the tilting of the transverse vorticity that originates from the particle front surface. Each inclined face on the front surface generates a pair of opposite-signed streamwise vortices. They are advected to the particle wake and form a chiral vorticity pattern which preserves the symmetry of the particle front surface. Two particles at dual angular positions exhibit highly similar vorticity patterns. Our study reveals a striking similarity between the vorticity patterns and the far-field optics diffraction pattern of a light beam past a polygonal aperture. We discover the deterministic vorticity generation mechanism to predict the streamwise vorticity patterns based on the distribution of edges and inclined faces on the particle front surface. Conversely, the vorticity patterns themselves can serve as a diagnostic tool to infer the geometry of the opaque particle front surface. Additionally, the vorticity patterns can be used to predict the stable angular position of a freely settling angular particle, which tends to be such that the number of streamwise vorticity pairs in the wake is maximized.