Relevant bibliographies by topics / N-part graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'N-part graph'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'N-part 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.

Journal articles on the topic "N-part graph"

1

Fran, Fransiskus, Alexander, Yundari, Putri Romanda, and Ervina Febyolga. "The Complexity of Octopus Graph, Friendship Graph, and Snail Graph." EduMatSains : Jurnal Pendidikan, Matematika dan Sains 9, no. 1 (2024): 84–101. http://dx.doi.org/10.33541/edumatsains.v9i1.6042.

Full text
Abstract:
Graphs are basic structures that represent objects with nodes and relationships between objects with edges. Trees are one of the parts studied in graph theory along with finding the number of spanning trees of a graph such as octopus graph, friendship graph, and snail graph. The complexity of an octopus graph is strongly dependent on the number and length of tentacles, the complexity of a friendship graph is dependent on the number of triangle cycles, and the complexity of a snail graph is dependent on the number of edges and vertices located in the shell-like part of the snail. To calculate t
APA, Harvard, Vancouver, ISO, and other styles
2

Day, Maxwell Christopher, Frank Christopher Hawthorne, and Ali Rostami. "Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO4) n− tetrahedra." Acta Crystallographica Section A Foundations and Advances 80, no. 3 (2024): 258–81. http://dx.doi.org/10.1107/s2053273324002432.

Full text
Abstract:
In Part I of this series, all topologically possible 1-periodic infinite graphs (chain graphs) representing chains of tetrahedra with up to 6–8 vertices (tetrahedra) per repeat unit were generated. This paper examines possible restraints on embedding these chain graphs into Euclidean space such that they are compatible with the metrics of chains of tetrahedra in observed crystal structures. Chain-silicate minerals with T = Si4+ (plus P5+, V5+, As5+, Al3+, Fe3+, B3+, Be2+, Zn2+ and Mg2+) have a grand nearest-neighbour 〈T–T〉 distance of 3.06±0.15 Å and a minimum T...T separation of 3.71 Å betwee
APA, Harvard, Vancouver, ISO, and other styles
3

Ghanbari, Nima, and Saeid Alikhani. "A graph related to the Euler ø function." Mathematical Gazette 107, no. 569 (2023): 263–72. http://dx.doi.org/10.1017/mag.2023.57.

Full text
Abstract:
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph G is a pair G = (V, E), where V and E are the vertex set and the edge set of G, respectively. The order and size of G is the number of vertices and edges of G, respectively. The degree or valency of a vertex u in a graph G (loopless), denoted by deg (u), is the number of edges meeting at u. If, for every vertex ν in G, deg (ν) = k, we say that G is a k-regular graph. The cycle of order n is denoted by Cn and is a connected 2-regular graph. The path gr
APA, Harvard, Vancouver, ISO, and other styles
4

Nofal, Samer. "On finding a satisfactory partition in an undirected graph: algorithm design and results." AIMS Mathematics 9, no. 10 (2024): 27308–29. http://dx.doi.org/10.3934/math.20241327.

Full text
Abstract:
<p>A satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part. Generally, the problem of determining whether a given undirected graph has a satisfactory partition is known to be NP-complete. In this paper, we show that for a given undirected graph with $ n $ vertices, a satisfactory partition (if any exists) can be computed recursively with a recursion tree of depth of $ \mathcal{O}(\ln n) $ in expectation. Subsequently, we show th
APA, Harvard, Vancouver, ISO, and other styles
5

LIN, YAW-LING, and STEVEN S. SKIENA. "COMPLEXITY ASPECTS OF VISIBILITY GRAPHS." International Journal of Computational Geometry & Applications 05, no. 03 (1995): 289–312. http://dx.doi.org/10.1142/s0218195995000179.

Full text
Abstract:
In this paper, we consider two distinct problems related to complexity aspects of the visibility graphs of simple polygons. Recognizing visibility graphs is a long-standing open problem. It is not even known whether visibility graph recognition is in NP. That visibility graph recognition is in NP would be established if we could demonstrate that any n vertex visibility graph is realized by a polygon which can be drawn on an exponentially-sized grid. This motivates a study of the area requirements for realizing visibility graphs. In this paper, we prove: • Θ(n3) area is necessary and sufficient
APA, Harvard, Vancouver, ISO, and other styles
6

Venkataraman, Yegnanarayanan, George Barnabas, and Bryan Freyberg. "Chromatic Coloring of Distance Graphs V." Journal of Combinatorial Mathematics and Combinatorial Computing 122, no. 1 (2024): 317–24. http://dx.doi.org/10.61091/jcmcc122-26.

Full text
Abstract:
Let G = ( V , E ) be any graph. If there exists an injection f : V → Z , such that | f ( u ) – f ( v ) | is prime for every u v ∈ E , then we say G is a prime distance graph (PDG). The problem of characterizing the family of all prime distance graphs (PDGs) with chromatic number 3 or 4 is challenging. In the fourth part of this series of articles, we determined which fans are PDGs and which wheels are PDGs. In addition, we showed: (1) a chain of n mutually isomorphic PDGs is a PDG, and (2) the Cartesian product of a PDG and a path is a PDG. In this part of the series, we improve (1) by showing
APA, Harvard, Vancouver, ISO, and other styles
7

S., Geetha, and S. Jayakumar Dr. "COMPUTER REPRESENTATION OF GRAPHS USING BINARY LOGIC CODES IN DISCRETE MATHEMATICS." International Journal of Multidisciplinary Research and Modern Education 3, no. 1 (2017): 152–57. https://doi.org/10.5281/zenodo.438946.

Full text
Abstract:
Discrete Mathematics is a fundamental component of mathematics and computer science. It is the study of finite systems. The Digital computer is basically a finite structure and many of its properties can be understood and interpreted within the framework of finite mathematical systems. Graph are represented by means of Diagrams. These Graphs may be considered as Graph of certain relation. Graphs, Directed Graphs appear in many areas of Mathematics and Computer Science. Graphs are defined as an abstract mathematical system. Elements of Graph Theory are indispensable in almost all areas of Compu
APA, Harvard, Vancouver, ISO, and other styles
8

Xu, Chunyan, Rong Liu, Tong Zhang, Zhen Cui, Jian Yang, and Chunlong Hu. "Dual-Stream Structured Graph Convolution Network for Skeleton-Based Action Recognition." ACM Transactions on Multimedia Computing, Communications, and Applications 17, no. 4 (2021): 1–22. http://dx.doi.org/10.1145/3450410.

Full text
Abstract:
In this work, we propose a dual-stream structured graph convolution network ( DS-SGCN ) to solve the skeleton-based action recognition problem. The spatio-temporal coordinates and appearance contexts of the skeletal joints are jointly integrated into the graph convolution learning process on both the video and skeleton modalities. To effectively represent the skeletal graph of discrete joints, we create a structured graph convolution module specifically designed to encode partitioned body parts along with their dynamic interactions in the spatio-temporal sequence. In more detail, we build a se
APA, Harvard, Vancouver, ISO, and other styles
9

Alnefaie, Kholood, Nanggom Gammi, Saifur Rahman, and Shakir Ali. "On Zero-Divisor Graphs of Zn When n Is Square-Free." Axioms 14, no. 3 (2025): 180. https://doi.org/10.3390/axioms14030180.

Full text
Abstract:
In this article, some properties of the zero-divisor graph Γ(Zn) are investigated when n is a square-free positive integer. It is shown that the zero-divisor graph Γ(Zn) of ring Zn is a (2k−2)-partite graph when the prime decomposition of n contains k distinct square-free primes using the method of congruence relation. We present some examples, accompanied by graphic representations, to achieve the desired results. It is also obtained that the zero-divisor graph Γ(Zn) is Eulerian if n is a square-free odd integer. Since Zn is a semisimple ring when n is square-free, the results can be generali
APA, Harvard, Vancouver, ISO, and other styles
10

Zhong, Chuang, and Shuangliang Tian. "Neighbor Sum Distinguishing Edge (Total) Coloring of Generalized Corona Product." Journal of Physics: Conference Series 2381, no. 1 (2022): 012031. http://dx.doi.org/10.1088/1742-6596/2381/1/012031.

Full text
Abstract:
Abstract The coloring theory of graphs is an important part of graph theory research. The key problem of the coloring theory of graphs is to determine the coloring number of each kind of coloring. Traditional coloring concepts mainly include proper vertex coloring, proper edge coloring, proper total coloring, and so on. In recent years, scholars at home and abroad have put forward some new coloring concepts, such as neighbor vertex distinguishing edge (total) coloring, and neighbor sum distinguishing edge (total) coloring, based on traditional coloring concepts and by adding other constraints.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "N-part graph"

1

Poulain, Rémy. "Analyse et modélisation de la diversité des structures relationnelles à l'aide de graphes multipartis." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS453.

Full text
Abstract:
Il n’est plus à prouver que le numérique, Internet et le web ont entraîné une révolution notamment dans la manière de s’informer. Comme toute révolution, elle est suivie par une série d’enjeux : égalité de traitement des utilisateurs et des fournisseurs, consommations écologiquement durables, liberté d’expression et censure, etc. Il est nécessaire que la recherche apporte une vision claire de ces enjeux. Parmi ces enjeux, nous pouvons parler de deux phénomènes : le phénomène de chambre d’écho et le phénomène de bulle de filtre. Ces deux phénomènes sont liés au manque de diversité de l’informat
APA, Harvard, Vancouver, ISO, and other styles
2

Montagner, Arnaldo Jovanini. "A estrutura de dados gema para representação de mapas n-dimensionais." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276246.

Full text
Abstract:
Orientador: Jorge Stolfi [Orientador]<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação.<br>Made available in DSpace on 2018-08-10T07:43:58Z (GMT). No. of bitstreams: 1 Montagner_ArnaldoJovanini_D.pdf: 2204093 bytes, checksum: 4c9c86ca0312f3b5507e1daa8c6553db (MD5) Previous issue date: 2007<br>Resumo: Mapas são subdivisões de espaços topológicos em regiões simples, e triangulações são um tipo específico de mapa em que cada elemento é um simplexo (aresta, triângulo, tetraedro, etc). Neste trabalho, tratamos o problema de representação da topologia de triangulaç
APA, Harvard, Vancouver, ISO, and other styles
3

Ghaemi, Mohammadreza. "Etude de la complexité algorithmique associée à des opérations de décomposition de graphes." Paris 6, 2008. http://www.theses.fr/2008PA066449.

Full text
Abstract:
La thèse porte sur des problèmes de complexitè liés à des opération de décomposition de graphes. Etant donné un graphe donné H (clique, stable, biparti, graphe à seuil) et un graphe G n-apparié, on étudie la complexité algorithmique du problème suivant : Existe-t-il un sous-graphe induit de G qui contient exactement un sommet de chacune des n paires de G isomorphe à H?. On montrera enfin que le problème de décomposition des graphes appelés graphes Stubborn est équivalent au problème précédent pour un cas particulier de graphes n-appariés.
APA, Harvard, Vancouver, ISO, and other styles
4

Sharma, Manish. "Receptores iterativos para canais de acesso múltiplo ruidosos com N frequências e T usuários." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260834.

Full text
Abstract:
Orientador: Jaime Portugheis<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação<br>Made available in DSpace on 2018-08-17T00:51:09Z (GMT). No. of bitstreams: 1 Sharma_Manish_D.pdf: 1122815 bytes, checksum: ac184067a2eeb2f29617e0a5da608708 (MD5) Previous issue date: 2010<br>Resumo: O objetivo deste trabalho é analisar o desempenho da recepção e detecção conjunta e iterativa para canais de acesso múltiplo. A análise se concentrou em torno de um canal ruidoso com N frequências compartilhado por T usuários. Encontramos valores para a capacid
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "N-part graph"

1

Tanasa, Adrian. Combinatorial Physics. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192895493.001.0001.

Full text
Abstract:
After briefly presenting (for the physicist) some notions frequently used in combinatorics (such as graphs or combinatorial maps) and after briefly presenting (for the combinatorialist) the main concepts of quantum field theory (QFT), the book shows how algebraic combinatorics can be used to deal with perturbative renormalisation (both in commutative and non-commutative quantum field theory), how analytic combinatorics can be used for QFT issues (again, for both commutative and non-commutative QFT), how Grassmann integrals (frequently used in QFT) can be used to proCve new combinatorial identi
APA, Harvard, Vancouver, ISO, and other styles
2

KJV Study Bible for Girls Grape/Surf Blue, Floral Design Duravella. Baker Books, 2016.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "N-part graph"

1

Schiff, Krzysztof. "Partitioning of an M-Part Weighted Graph with N Vertices in Each Part into N Cliques with M Vertices and the Total Minimum Sum of Their Edges Weights Using Ant Algorithms." In Lecture Notes in Networks and Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37720-4_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ball, John, and Dominic Welsh. "Algebra In Graph Theory." In Graph Theory as I Have Known It. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198502517.003.0005.

Full text
Abstract:
Abstract I learned a little Combinatorial Topology at Cambridge. That subject dealt with structures called “n-complexes”. These were made by fitting together units called “n-simplexes”, n-dimensional analogues of the point, the segment, the triangle and the tetrahedron. The graphs of Graph Theory appeared as the case n = 1, and by combinatorial topologists they were usually looked upon as trivialities. However O. Veblen devoted part of a textbook to them and to their associated maps on surfaces [108]. The topological textbook then favoured at Cambridge was that of Seifert and Threlfall [52].
APA, Harvard, Vancouver, ISO, and other styles
3

Alhassan, Ahmad, and Auwal Aliyu. "The Principle of Interpretation of Gravity Data Using Second Vertical Derivative Method." In Gravitational Field - Concepts and Applications. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.100443.

Full text
Abstract:
This chapter is aimed at demonstrating how the second vertical derivative method is been applied to gravity data for subsurface delineation. Satellite gravity data of some part of Northern Nigeria that lie between latitude 11°–13°E and longitude 8°–14°N obtained from Bureau Gravimetrique International (BGI) were used for demonstration. The Bouguer graph was plotted using surfer software. The second vertical derivative graph was also plotted. Very low gravity anomalies are observed on the Bouguer map, which recommends the presence of sedimentary rocks which have low density. The result of the s
APA, Harvard, Vancouver, ISO, and other styles
4

Smith, Justin R. "Graph Algorithms." In The Design and Analysis of Parallel Algorithms. Oxford University PressNew York, NY, 1993. http://dx.doi.org/10.1093/oso/9780195078817.003.0026.

Full text
Abstract:
Abstract Introduction. This section develops an algorithm for parsing precedence gram mars and the evaluation of an arithmetic expression in O(lg n) time. Although parts of this algorithm are somewhat similar to the doubling algorithms of the previous section, we put these algorithms in a separate section because of their complexity. They are interesting for a number of reasons.
APA, Harvard, Vancouver, ISO, and other styles
5

Shaikh, Zulfa, and Poonam Garg. "Secure Multiparty Computing Protocol." In Interdisciplinary Perspectives on Business Convergence, Computing, and Legality. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-4209-6.ch012.

Full text
Abstract:
Secure Multiparty Computation (SMC) can be defined as n number of parties who do joint computation on their inputs (x1, x2…xn) using some function F and want output in the form of y. The increase in sensitive data on a network raises concern about the security and privacy of inputs. During joint computation, each party wants to preserve the privacy of their inputs. Therefore, there is a need to define an efficient protocol that maintains privacy, security, and correctness parameters of SMC. In this chapter, an approach towards secure computation is provided and analyzed with security graphs.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "N-part graph"

1

McMains, Sara, and Xiaorui Chen. "Determining Moldability and Parting Directions for Polygons With Curved Edges." In ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-62227.

Full text
Abstract:
We consider the problem of whether a given geometry can be molded in a two part, rigid, reusable mold with opposite removal directions. We describe an efficient algorithm for solving the opposite direction moldability problem for a 2D “polygon” bounded by edges that may be either straight or curved. We introduce a structure, the normal graph of the polygon, that represents the range of normals of the polygon’s edges, along with their connectivity. We prove that the normal graph captures the directions of all lines corresponding to feasible parting directions. Rather than building the full norm
APA, Harvard, Vancouver, ISO, and other styles
2

Ranger, A. E. "Surface Structure of Coatings." In Papermaking Raw Materials, edited by V. Punton. Fundamental Research Committee (FRC), Manchester, 1985. http://dx.doi.org/10.15376/frc.1985.2.673.

Full text
Abstract:
The positive intercept which appears on a graph of K and N ink absorption versus a function of absorption time has previously been interpreted as a measure of surface roughness. In the case of coated surfaces, evidence is offered that it is an indicator of a porous top layer of the coating with distinctly different properties from those of the main part of the coating. It is shown that the total void volume of this top layer depends on both the capillary suction exerted by the substrate and on the speed of drying of the coating and its pore size is intermediate between that of the substrate an
APA, Harvard, Vancouver, ISO, and other styles
3

Mota, Guilherme Oliveira. "Advances in anti-Ramsey theory for random graphs." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3204.

Full text
Abstract:
Dados grafos G e H, denotamos a seguinte propriedade por G ÝrÑpb H: para toda coloração própria das arestas de G (com uma quantidade arbitrária de cores) existe uma cópia multicolorida de H em G, i.e., uma cópia de H sem duas arestas da mesma cor. Sabe-se que, para todo grafo H, a função limiar prHb prHbpnq para essa propriedade no grafo aleatório binomial Gpn; pq é assintoticamente no máximo n 1{mp2qpHq, onde mp2qpHq denota a assim chamada 2-densidade máxima de H. Neste trabalho discutimos esse e alguns resultados recentes no estudo de propriedades anti-Ramsey para grafos aleatórios, e mostra
APA, Harvard, Vancouver, ISO, and other styles
4

Kumar T. V., Sateesh, and S. Meenakshi. "Lucky labeling of jelly fish graph J(m, n), cocktail party graph CPk and crown graph Cn*." In 2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021. AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0108660.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

You, Li. "Multi-party quantum correlation and entanglement." In Workshop on Entanglement and Quantum Decoherence. Optica Publishing Group, 2008. http://dx.doi.org/10.1364/weqd.2008.eas2.

Full text
Abstract:
A characterization of the complete correlation structure in an n-party system is proposed in terms of a series of (k, n) threshold classical secret sharing protocols (2 ≤ k ≤ n). The total correlation is shown to be the sum of independent correlations of 2-, 3-,…, n-parties. Our result unifies several earlier scattered works, and shines new light at the important topic of multi-party quantum entanglement. As an application, we explicitly construct the hierarchy of correlations in an n-qubit graph state.
APA, Harvard, Vancouver, ISO, and other styles
6

Gopalakrishnan, Praveen Kumare, Jeffery Cavallaro, Sogol Jahanbekam, and Sara Behdad. "A Graph Coloring Technique for Identifying the Minimum Number of Parts for Physical Integration in Product Design." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-98251.

Full text
Abstract:
Abstract The objective of this study is to develop a mathematical framework for determining the minimum number of parts required in a product to satisfy a list of functional requirements (FRs) given a set of connections between FRs. The problem is modeled as a graph coloring technique in which a graph G with n nodes (representing the FRs) and m edges (representing the connections between the FRs) is studied to determine the graph’s chromatic number χ(G), which is the minimum number of colors required to properly color the graph. The chromatic number of the graph represents the minimum number o
APA, Harvard, Vancouver, ISO, and other styles
7

Oliveira, Rafael F., Vander L. S. Freitas, Gladston J. P. Moreira, and Eduardo J. S. Luz. "Explorando Redes Neurais de Grafos para Classificação de Arritmias." In Simpósio Brasileiro de Computação Aplicada à Saúde. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbcas.2022.222510.

Full text
Abstract:
Arritmia cardíaca é uma condição de risco e seu diagnóstico precoce é de fundamental importância. Por isso, a automação do processo de identificação de arritmia é desejável. Neste contexto, um modelo de classificação automática de arritmias em sinais de eletrocardiograma (ECG) é proposto baseado em Graph Neural Network (GNN) e o batimento cardíaco representado por meio de um grafo via algoritmo Visibility Graph (VG). São avaliados três modelos de redes GNN: uma rede convolutional de grafos com duas camadas (GCN-2L), outra com três camadas (GCN-3L) e GraphSAGE (GraphSAGE-4L). Sob o paradigma in
APA, Harvard, Vancouver, ISO, and other styles
8

Avila, Caio Viktor S., and Vania Vidal. "LiRB: Um Navegador Leve Baseado em Texto para Knowledge Graphs RDF." In Anais Estendidos do Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sbbd_estendido.2023.232837.

Full text
Abstract:
Neste artigo apresentamos LIght RDF Browser (LiRB), uma interface leve para a navegação interativa sobre Knowledge Graphs (KGs) RDF. LiRB apresenta uma interface Web baseada em texto, proporcionando uma experiência de navegação semelhante às páginas Web tradicionais, promovendo uma menor curva de aprendizagem aos usuários. Como diferenciais, LiRB utiliza consultas simples e rápidas, sendo ideal para a navegação de KGs massivos e/ou virtuais. Além disso, a ferramenta também permite a abstração de relacionamentos N-ários para representar a semântica de propriedades de relacionamentos, além da ap
APA, Harvard, Vancouver, ISO, and other styles
9

Fasanelli, Roberto, Anna Liguori, and Ida Galli. "A Similarity Graph-based Approach to Study Social Representations of the Economic Crisis: A Comparison between Italian and Greek Social Groups." In International Association of Cross Cultural Psychology Congress. International Association for Cross-Cultural Psychology, 2016. http://dx.doi.org/10.4087/trkm7515.

Full text
Abstract:
In order to analyse the common sense theories about the economic thinking and acting, this research has been conducted with the theoretical framework of the Social Representation Theory. By interviewing Italian and Greek participants belonging to different social groups, we examined how &lt;em&gt;expert&lt;/em&gt; and &lt;em&gt;lay&lt;/em&gt; people face this phenomenon. Inspired by the Structural Approach, which considers SRs as constituted of two parts (a structure and a content), data were collected through specific strategies and were created &lt;em&gt;ad&lt;/em&gt; &lt;em&gt;hoc&lt;/em&gt
APA, Harvard, Vancouver, ISO, and other styles
10

Shrivastava, Parnika, J. J. Roy, M. K. Samal, P. K. Jain, and Puneet Tandon. "Parameter Optimization of Incremental Sheet Metal Forming Based on Taguchi Design and Response Surface Methodology." In ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-51227.

Full text
Abstract:
Incremental Sheet Forming (ISF) is a flexible and innovative rapid prototyping technique for the fabrication of limited sheet metal components. In the present investigation, the dependency of formability and thickness reduction of ISF parts on tool diameter, incremental step depth along with the preheating of sheet material has been determined. After preheating, initial grain size of the sheet material is selected as a parameter under study. Incremental Sheet Forming process has been studied using Taguchi design of experiments along with Response surface methodology (RSM). ANOVA, 3D surface gr
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'N-part graph' for particular source types:
Journal articles
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!

To the bibliography