Conecte-se

Bibliografias temáticas / Variation graph

Índice

Artigos de revistas
Teses / dissertações
Livros
Capítulos de livros
Trabalhos de conferências
Relatórios de organizações

Literatura científica selecionada sobre o tema "Variation graph"

Autor: Grafiati

Publicado: 21 de dezembro de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Variation graph".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Variation graph"

1

Arifin, Samsul, Indra Bayu Muktyas, and Jeremy Matthew Mandei. "Graph coloring program for variation of exam scheduling modeling at Binus University based on Welsh and Powell algorithm." Journal of Physics: Conference Series 2279, no. 1 (2022): 012005. http://dx.doi.org/10.1088/1742-6596/2279/1/012005.

Texto completo da fonte

Resumo:

Abstract In this article, we will design a computer program to solve graph colouring and to visualize the variation of exam scheduling modelling at Binus University in graphs based on the Welch and Powell Algorithm. A vertex colouring of graph G = (V, E) is an F: V → N mapping where the adjacent vertex are different colours in N, i.e. if the edge (u, v) are in E, then F (u) is not equal to F (v). The formulation of problems regarding computer programs based on a small experiment and variations in modelling exams is carried out in graph form using the Visual Basic Application.

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Firmansah, Fery. "Pelabelan Harmonis Ganjil pada Graf Bunga Double Quadrilateral." JURNAL ILMIAH SAINS 20, no. 1 (2020): 12. http://dx.doi.org/10.35799/jis.20.1.2020.27278.

Texto completo da fonte

Resumo:

Graf harmonis ganjil adalah graf yang memenuhi sifat-sifat pelabelan harmonis ganjil. Tujuan dari penelitian ini adalah mendapatkan kelas graf baru yang merupakan graf harmonis ganjil. Metode penelitian yang digunakan terdiri dari beberapa tahapan yaitu konstruksi definisi, formulasi fungsi pelabelan dan pembuktian teorema. Hasil dari penelitian ini adalah konstruksi graf bunga double quadrilateral dengan dan graf bunga variasi double quadrilateral dengan yang merupakan pengembangan dari graf double quadrilateral dan graf variasi double quadrilateral . Lebih lanjut telah dibuktikan bahwa graf

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Prabhakaran, Rahul, Giovanni Bertotti, Janos Urai, and David Smeulders. "Investigating spatial heterogeneity within fracture networks using hierarchical clustering and graph distance metrics." Solid Earth 12, no. 10 (2021): 2159–209. http://dx.doi.org/10.5194/se-12-2159-2021.

Texto completo da fonte

Resumo:

Abstract. Rock fractures organize as networks, exhibiting natural variation in their spatial arrangements. Therefore, identifying, quantifying, and comparing variations in spatial arrangements within network geometries are of interest when explicit fracture representations or discrete fracture network models are chosen to capture the influence of fractures on bulk rock behaviour. Treating fracture networks as spatial graphs, we introduce a novel approach to quantify spatial variation. The method combines graph similarity measures with hierarchical clustering and is applied to investigate the s

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Rautiainen, Mikko, Veli Mäkinen, and Tobias Marschall. "Bit-parallel sequence-to-graph alignment." Bioinformatics 35, no. 19 (2019): 3599–607. http://dx.doi.org/10.1093/bioinformatics/btz162.

Texto completo da fonte

Resumo:

Abstract Motivation Graphs are commonly used to represent sets of sequences. Either edges or nodes can be labeled by sequences, so that each path in the graph spells a concatenated sequence. Examples include graphs to represent genome assemblies, such as string graphs and de Bruijn graphs, and graphs to represent a pan-genome and hence the genetic variation present in a population. Being able to align sequencing reads to such graphs is a key step for many analyses and its applications include genome assembly, read error correction and variant calling with respect to a variation graph. Results

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Bhat, Farooq Ahmad, and M. Arif Wani. "Elastic Bunch Graph Matching Based Face Recognition Under Varying Lighting, Pose, and Expression Conditions." IAES International Journal of Artificial Intelligence (IJ-AI) 3, no. 4 (2016): 177. http://dx.doi.org/10.11591/ijai.v3.i4.pp177-182.

Texto completo da fonte

Resumo:

In this paper performance of elastic bunch graph matching (EBGM) for face recognition under variation in facial expression, variation in lighting condition and variation in poses are given. In this approach faces are represented by labelled graphs. Experimental results of EBGM on ORL, Yale B and FERET datasets are provided. Strong and weak features of EBGM algorithm are discussed.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Qiu, Yutong, and Carl Kingsford. "Constructing small genome graphs via string compression." Bioinformatics 37, Supplement_1 (2021): i205—i213. http://dx.doi.org/10.1093/bioinformatics/btab281.

Texto completo da fonte

Resumo:

Abstract Motivation The size of a genome graph—the space required to store the nodes, node labels and edges—affects the efficiency of operations performed on it. For example, the time complexity to align a sequence to a graph without a graph index depends on the total number of characters in the node labels and the number of edges in the graph. This raises the need for approaches to construct space-efficient genome graphs. Results We point out similarities in the string encoding mechanisms of genome graphs and the external pointer macro (EPM) compression model. We present a pair of linear-time

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Angadi, Shanmukhappa A., and Sanjeevakumar M. Hatture. "Face Recognition Through Symbolic Modeling of Face Graphs and Texture." International Journal of Pattern Recognition and Artificial Intelligence 33, no. 12 (2019): 1956008. http://dx.doi.org/10.1142/s0218001419560081.

Texto completo da fonte

Resumo:

Face recognition helps in authentication of the user using remotely acquired facial information. The dynamic nature of face images like pose, illumination, expression, occlusion, aging, etc. degrades the performance of the face recognition system. In this paper, a new face recognition system using facial images with illumination variation, pose variation and partial occlusion is presented. The facial image is described as a collection of three complete connected graphs and these graphs are represented as symbolic objects. The structural characteristics, i.e. graph spectral properties, energy o

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Youssef, Maged Zakaria, and Zainab Saad Almoreed. "On odd prime labeling of graphs." Open Journal of Discrete Applied Mathematics 3, no. 3 (2020): 33–40. http://dx.doi.org/10.30538/psrp-odam2020.0041.

Texto completo da fonte

Resumo:

In this paper we give a new variation of the prime labeling. We call a graph \(G\) with vertex set \(V(G)\) has an odd prime labeling if its vertices can be labeled distinctly from the set \(\big\{1, 3, 5, ...,2\big|V(G)\big| -1\big\}\) such that for every edge \(xy\) of \(E(G)\) the labels assigned to the vertices of \(x\) and \(y\) are relatively prime. A graph that admits an odd prime labeling is called an <i>odd prime graph</i>. We give some families of odd prime graphs and give some necessary conditions for a graph to be odd prime. Finally, we conjecture that every prime graph

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Kuhlmann, Marco, and Stephan Oepen. "Towards a Catalogue of Linguistic Graph Banks." Computational Linguistics 42, no. 4 (2016): 819–27. http://dx.doi.org/10.1162/coli_a_00268.

Texto completo da fonte

Resumo:

Graphs exceeding the formal complexity of rooted trees are of growing relevance to much NLP research. Although formally well understood in graph theory, there is substantial variation in the types of linguistic graphs, as well as in the interpretation of various structural properties. To provide a common terminology and transparent statistics across different collections of graphs in NLP, we propose to establish a shared community resource with an open-source reference implementation for common statistics.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Da Silva, Kévin, Nicolas Pons, Magali Berland, Florian Plaza Oñate, Mathieu Almeida, and Pierre Peterlongo. "StrainFLAIR: strain-level profiling of metagenomic samples using variation graphs." PeerJ 9 (August 23, 2021): e11884. http://dx.doi.org/10.7717/peerj.11884.

Texto completo da fonte

Resumo:

Current studies are shifting from the use of single linear references to representation of multiple genomes organised in pangenome graphs or variation graphs. Meanwhile, in metagenomic samples, resolving strain-level abundances is a major step in microbiome studies, as associations between strain variants and phenotype are of great interest for diagnostic and therapeutic purposes. We developed StrainFLAIR with the aim of showing the feasibility of using variation graphs for indexing highly similar genomic sequences up to the strain level, and for characterizing a set of unknown sequenced genom

Estilos ABNT, Harvard, Vancouver, APA, etc.

Teses / dissertações sobre o assunto "Variation graph"

1

Kural, Deniz. "Methods for Inter- and Intra-Species Genomics for the Detection of Variation and Function." Thesis, Boston College, 2014. http://hdl.handle.net/2345/bc-ir:104053.

Texto completo da fonte

Resumo:

Thesis advisor: Gabor T. Marth<br>This thesis concerns itself with the development of methods for comparing genomes. Chapter 2 is a comparative genomics investigation of coding regions across multiple species. Regions of the genome coding for proteins show higher conservation than non-coding regions. Furthermore, we show that a portion of coding regions are conserved beyond the requirements of protein conservation, supporting functions such as microRNA binding and splicing enhancement, providing the non-coding functional impetus to conservation. In Chapter 3, we focus on the detection and char

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Romain, Sandra. "Identification, génotypage et représentation des variants de structure dans les pangénomes." Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. https://ged.univ-rennes1.fr/nuxeo/site/esupversions/71b8c90f-bac9-4948-9bb1-a4b6d953f322.

Texto completo da fonte

Resumo:

Les variants structuraux (SVs), des variations génomiques de plus de 50 pb, contribuent de manière significative à la diversité génétique et à l'évolution des espèces. La détection et le génotypage précis des SVs est crucial pour comprendre leur rôle dans la variation phénotypique et l'adaptation. Les graphes de variation (VGs) et graphes de pangénomes (PGs), qui représentent les variations génomiques comme des chemins alternatifs dans un graphe, offrent une approche prometteuse pour l'analyse des SVs. Cette thèse explore l'utilisation des VGs et PGs pour la détection et le génotypage des SVs

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Jaillard, Dancette Magali. "Vers une cartographie fine des polymorphismes liés à la résistance aux antimicrobiens." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE1282/document.

Texto completo da fonte

Resumo:

Mieux comprendre les mécanismes de la résistance aux antibiotique est un enjeu important dans la lutte contre les maladies infectieuses, qui fait face à la propagation de bactéries multi-résistantes. Les études d'association à l'échelle des génomes sont des outils puissants pour explorer les polymorphismes liés aux variations phénotypiques dans une population. Leur cadre méthodologique est très documenté pour les eucaryotes, mais leur application aux bactéries est très récente. Durant cette thèse, j'ai cherché à rendre ces outils mieux adaptés aux génomes plastiques des bactéries, principaleme

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Yeo, Ronald A., Sephira G. Ryman, den Heuvel Martijn P. van, et al. "Graph Metrics of Structural Brain Networks in Individuals with Schizophrenia and Healthy Controls: Group Differences, Relationships with Intelligence, and Genetics." Cambridge University Press, 2016. https://tud.qucosa.de/id/qucosa%3A70691.

Texto completo da fonte

Resumo:

Objectives: One of the most prominent features of schizophrenia is relatively lower general cognitive ability (GCA). An emerging approach to understanding the roots of variation in GCA relies on network properties of the brain. In this multi-center study, we determined global characteristics of brain networks using graph theory and related these to GCA in healthy controls and individuals with schizophrenia. Methods: Participants (N = 116 controls, 80 patients with schizophrenia) were recruited from four sites. GCA was represented by the first principal component of a large battery of neurocog

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Meinhardt, Llopis Enric. "Morphological and statistical techniques for the analysis of 3D images." Doctoral thesis, Universitat Pompeu Fabra, 2011. http://hdl.handle.net/10803/22719.

Texto completo da fonte

Resumo:

Aquesta tesi proposa una estructura de dades per emmagatzemar imatges tridimensionals. L'estructura da dades té forma d'arbre i codifica les components connexes dels conjunts de nivell de la imatge. Aquesta estructura és la eina bàsica per moltes aplicacions proposades: operadors morfològics tridimensionals, visualització d'imatges mèdiques, anàlisi d'histogrames de color, seguiment d'objectes en vídeo i detecció de vores. Motivada pel problema de la completació de vores, la tesi conté un estudi de com l'eliminació de soroll mitjançant variació total anisòtropa es pot fer servir pe

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Jacob, Jobby. "Variations on graph products and vertex partitions." Connect to this title online, 2009.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Sonnerat, Nicolas. "Galaxy cutsets and graph connectivity: variations on a theme." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97002.

Texto completo da fonte

Resumo:

In this thesis we consider cutsets in graphs which can be expressed as unionsof sets each of which is spanned by a tree of diameter at most d-1 for someinteger d ≥ 1; we call these sets galaxy cutsets. These galaxycutsets generalise both star-cutsets and vertex-cuts, and serve as simple models for virus-like attacks on or cascading failures in networks,the crucial property being that neighbours of affected vertices may alsofail and cease to function. We approach our subject from four different pointsof view. We begin by exploring the connection between galaxiesand a suitable type of flow, prov

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Pandey, Arti. "Algorithmic aspects of domination and its variations." Thesis, IIT Delhi, 2016. http://localhost:8080/xmlui/handle/12345678/7038.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Trillos, Nicolás Garcia. "Variational Limits of Graph Cuts on Point Clouds." Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/518.

Texto completo da fonte

Resumo:

The main goal of this thesis is to develop tools that enable us to study the convergence of minimizers of functionals defined on point clouds towards minimizers of equivalent functionals in the continuum; the point clouds we consider are samples of a ground-truth distribution. In particular, we investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our focus is on functionals based on graph cuts like the Cheeger and ratio cuts. We show that minimizers of these cuts converge as the sample size increases to a minimizer of a

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Couprie, Camille. "Graph-based variational optimization and applications in computer vision." Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00666878.

Texto completo da fonte

Resumo:

Many computer vision applications such as image filtering, segmentation and stereovision can be formulated as optimization problems. Recently discrete, convex, globally optimal methods have received a lot of attention. Many graph-based methods suffer from metrication artefacts, segmented contours are blocky in areas where contour information is lacking. In the first part of this work, we develop a discrete yet isotropic energy minimization formulation for the continuous maximum flow problem that prevents metrication errors. This new convex formulation leads us to a provably globally optimal so

Estilos ABNT, Harvard, Vancouver, APA, etc.

Livros sobre o assunto "Variation graph"

1

Science, Lawrence Hall of, ed. Equals investigations, remote rulers: A middle-school mathematics unit focusing on the relationship between algebraic graphs and graphs from real data involving direct and inverse variation. University of California at Berkeley, 1994.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

de, Werra D., and Hertz A, eds. Graph colouring and variations. North-Holland, 1989.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Krishnamoorthy, Raju. Dynamics, Graph Theory, and Barsotti-Tate Groups: Variations on a Theme of Mochizuki. [publisher not identified], 2016.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Salavessa, Isabel Maria da Costa. Graphs with parallel mean curvature and a variational problem in conformal geometry. typescript, 1987.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

E, Gaines Steven, Hipskind R. Stephen, United States. National Aeronautics and Space Administration., and San Jose State University. Meteorology Dept., eds. An atlas of objectively analyzed atmospheric cross sections 1973-1980. National Aeronautics and Space Administration, 1985.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Barg, Alexander, and O. R. Musin. Discrete geometry and algebraic combinatorics. American Mathematical Society, 2014.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Schurz, Henri, Philip J. Feinsilver, Gregory Budzban, and Harry Randolph Hughes. Probability on algebraic and geometric structures: International research conference in honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea, June 5-7, 2014, Southern Illinois University, Carbondale, Illinois. Edited by Mohammed Salah-Eldin 1946- and Mukherjea Arunava 1941-. American Mathematical Society, 2016.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Lyman, R. Lee. Graphing Culture Change in North American Archaeology. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198871156.001.0001.

Texto completo da fonte

Resumo:

Documentation, analysis, and explanation of culture change have long been goals of archaeology. The earliest archaeological spindle graphs appeared in the 1880s and 1890s, but had no influence on subsequent archaeologists. Line graphs showing change in frequencies of specimens in each of several artifact types were used in the 1910s and 1920s. Seriograms or straight-sided spindles diagraming interpretations of culture change were published in the 1930s, but were seldom subsequently mimicked. Spindle graphs of centered and stacked columns of bars, each column representing a distinct artifact ty

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Werra, D. de, and A. Hertz. Graph Colouring and Variations. Elsevier Science & Technology Books, 1989.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Graph Colouring and Variations. Elsevier, 1989. http://dx.doi.org/10.1016/s0167-5060(08)x7011-6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Variation graph"

1

Mitra, Susanta, and Aditya Bagchi. "Modeling Temporal Variation in Social Network: An Evolutionary Web Graph Approach." In Handbook of Social Network Technologies and Applications. Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7142-5_8.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Salim, Asif, S. S. Shiju, and S. Sumitra. "Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69900-4_65.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Subercaseaux, Bernardo, and Marijn J. H. Heule. "The Packing Chromatic Number of the Infinite Square Grid is 15." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_20.

Texto completo da fonte

Resumo:

AbstractA packing k-coloring is a natural variation on the standard notion of graph k-coloring, where vertices are assigned numbers from $$\{1, \ldots , k\}$$ { 1 , … , k } , and any two vertices assigned a common color $$c \in \{1, \ldots , k\}$$ c ∈ { 1 , … , k } need to be at a distance greater than c (as opposed to 1, in standard graph colorings). Despite a sequence of incremental work, determining the packing chromatic number of the infinite square grid has remained an open problem since its introduction in 2002. We culminate the search by proving this number to be 15. We achieve this result by improving the best-known method for this problem by roughly two orders of magnitude. The most important technique to boost performance is a novel, surprisingly effective propositional encoding for packing colorings. Additionally, we developed an alternative symmetry breaking method. Since both new techniques are more complex than existing techniques for this problem, a verified approach is required to trust them. We include both techniques in a proof of unsatisfiability, reducing the trusted core to the correctness of the direct encoding.

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Alivanistos, Dimitrios, Seth van der Bijl, Michael Cochez, and Frank van Harmelen. "The Effect of Knowledge Graph Schema on Classifying Future Research Suggestions." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65794-8_10.

Texto completo da fonte

Resumo:

AbstractThe output of research doubles at least every 20 years and in most research fields the number of research papers has become overwhelming. A critical task for researchers is to find promising future directions and interesting scientific challenges in the literature. To tackle this problem, we hypothesize that structured representations of information in the literature can be used to identify these elements. Specifically, we look at structured representations in the form of Knowledge Graphs (KGs) and we investigate how using different input schemas for extraction impacts the performance on the tasks of classifying sentences as future directions. Our results show that the MECHANIC-Granular schema yields the best performance across different settings and achieves state of the art performance when combined with pretrained embeddings. Overall, we observe that schemas with limited variation in the resulting node degrees and significant interconnectedness lead to the best downstream classification performance.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Lodhi, Aminah Bilal, Muhammad Abdullah Bilal, Hafiz Syed Muhammad Bilal, et al. "PNRG: Knowledge Graph-Driven Methodology for Personalized Nutritional Recommendation Generation." In Digital Health Transformation, Smart Ageing, and Managing Disability. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43950-6_20.

Texto completo da fonte

Resumo:

AbstractChronic Diseases are a prevalent problem that affects millions of people worldwide. It is a prevalent health condition that requires careful diet and medication management and preventing chronic diseases. Traditional approaches to nutritional recommendation generation often rely on generic guidelines and population-based data, which may not account for individual dietary needs and preferences variations. In this paper, we propose a knowledge graph driven methodology for generating highly personalized nutritional recommendations that leverage the power of knowledge graphs to integrate and analyze complex data about an individual's health, lifestyle, and dietary habits. Our methodology employs a multi-step process that includes data collection and curation, knowledge graph construction, and personalized recommendation generation. We illustrate the effectiveness of our approach through a case study in which we generate personalized nutritional recommendations for a sample individual based on their specific health and dietary goals.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Müller-Olm, Markus. "5. Parallel Flow Graphs." In Variations on Constants. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11871743_5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Ayabe, Hiroaki, Emmanuel Manalo, Mari Fukuda, and Norihiro Sadato. "What Diagrams Are Considered Useful for Solving Mathematical Word Problems in Japan?" In Diagrammatic Representation and Inference. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86062-2_8.

Texto completo da fonte

Resumo:

AbstractPrevious studies have shown that diagram use is effective in mathematical word problem solving. However, they have also revealed that students manifest many problems in using diagrams for such purposes. A possible reason is an inadequacy in students’ understanding of variations in types of problems and the corresponding kinds of diagrams appropriate to use. In the present study, a preliminary investigation was undertaken of how such correspondences between problem types and kinds of diagrams are represented in textbooks. One government-approved textbook series for elementary school level in Japan was examined for the types of mathematical word problems, and the kinds of diagrams presented with those problems. The analyses revealed significant differences in association between kinds of diagrams and types of problems. More concrete diagrams were included with problems involving change, combination, variation, and visualization of quantities; while number lines were more often used with comparison and variation problems. Tables and graphs corresponded to problems requiring organization of quantities; and more concrete diagrams and graphs to problems involving quantity visualization. These findings are considered in relation to the crucial role of textbooks and other teaching materials in facilitating strategy knowledge acquisition in students.

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Mahdavi, Sedigheh, Shima Khoshraftar, and Aijun An. "Dynamic Joint Variational Graph Autoencoders." In Machine Learning and Knowledge Discovery in Databases. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43823-4_32.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Dontchev, Asen L. "Mappings with Convex Graphs." In Lectures on Variational Analysis. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79911-3_6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Finn, Robert. "The inclination of an H-graph." In Calculus of Variations and Partial Differential Equations. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0082884.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Variation graph"

1

Crowley, Daniel, Marco Dalla, Barry O'Sullivan, and Andrea Visentin. "SAT Instances Generation Using Graph Variational Autoencoders." In ESANN 2024. Ciaco - i6doc.com, 2024. http://dx.doi.org/10.14428/esann/2024.es2024-223.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Shahid, Nauman, Nathanael Perraudin, Vassilis Kalofolias, Benjamin Ricaud, and Pierre Vandergheynst. "PCA using graph total variation." In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016. http://dx.doi.org/10.1109/icassp.2016.7472562.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Ono, Shunsuke, Isao Yamada, and Itsuo Kumazawa. "Total generalized variation for graph signals." In ICASSP 2015 - 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2015. http://dx.doi.org/10.1109/icassp.2015.7179014.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Ahmed, H. Bay, D. Dare, and A. O. Boudraa. "Graph signals classification using total variation and graph energy informations." In 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2017. http://dx.doi.org/10.1109/globalsip.2017.8309043.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Berger, Peter, Manfred Buchacher, Gabor Hannak, and Gerald Matz. "Graph Learning Based on Total Variation Minimization." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461603.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Bin Wu, Xin Yang, Yi Huang, and Jianbin Tan. "Analyzing temporal variation of telecom graph structure." In China-Ireland International Conference on Information and Communications Technologies (CIICT 2008). IEE, 2008. http://dx.doi.org/10.1049/cp:20080791.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Li, Ying, Jing Qin, Stanley Osher, and Wentai Liu. "Graph fractional-order total variation EEG source reconstruction." In 2016 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2016. http://dx.doi.org/10.1109/embc.2016.7590650.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Bai, Yuanchao, Gene Cheung, Xianming Liu, and Wen Gao. "Blind Image Deblurring Via Reweighted Graph Total Variation." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8462255.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Shi, Min, Yu Huang, Xingquan Zhu, Yufei Tang, Yuan Zhuang, and Jianxun Liu. "GAEN: Graph Attention Evolving Networks." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/213.

Texto completo da fonte

Resumo:

Real-world networked systems often show dynamic properties with continuously evolving network nodes and topology over time. When learning from dynamic networks, it is beneficial to correlate all temporal networks to fully capture the similarity/relevance between nodes. Recent work for dynamic network representation learning typically trains each single network independently and imposes relevance regularization on the network learning at different time steps. Such a snapshot scheme fails to leverage topology similarity between temporal networks for progressive training. In addition to the stati

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Vu, Huy, Gene Cheung, and Yonina C. Eldar. "Unrolling of Deep Graph Total Variation for Image Denoising." In ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2021. http://dx.doi.org/10.1109/icassp39728.2021.9414453.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "Variation graph"

1

Panas, R., J. Cuadra, K. Mohan, and R. Morales. Model and Standard Operating Procedures Supporting Signal Variation Flow Graph Analysis. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1668519.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Kriegel, Francesco. Efficient Axiomatization of OWL 2 EL Ontologies from Data by means of Formal Concept Analysis. Technische Universität Dresden, 2023. http://dx.doi.org/10.25368/2023.214.

Texto completo da fonte

Resumo:

We present an FCA-based axiomatization method that produces a complete EL TBox (the terminological part of an OWL 2 EL ontology) from a graph dataset in at most exponential time. We describe technical details that allow for efficient implementation as well as variations that dispense with the computation of extremely large axioms, thereby rendering the approach applicable albeit some completeness is lost. Moreover, we evaluate the prototype on real-world datasets.

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Heitman, Joshua L., Alon Ben-Gal, Thomas J. Sauer, Nurit Agam, and John Havlin. Separating Components of Evapotranspiration to Improve Efficiency in Vineyard Water Management. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594386.bard.

Texto completo da fonte

Resumo:

Vineyards are found on six of seven continents, producing a crop of high economic value with much historic and cultural significance. Because of the wide range of conditions under which grapes are grown, management approaches are highly varied and must be adapted to local climatic constraints. Research has been conducted in the traditionally prominent grape growing regions of Europe, Australia, and the western USA, but far less information is available to guide production under more extreme growing conditions. The overarching goal of this project was to improve understanding of vineyard water

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Monetary Policy Report, July 2023. Banco de la República, 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr3-2023.

Texto completo da fonte

Resumo:

In the second quarter of 2023, total annual infation fell to 12.1% and the rise of core infation halted and stood at 10.5%; both measures were lower than those forecasted in the April Report but remained well above the 3.0% target. The aggregate effects of monetary policy actions and the unwinding of certain shocks that affected prices will contribute towards bringing infation closer to the target in 2024. By component, the annual variations in the CPI for food and the CPI excluding food and regulated items have lessened more markedly than anticipated by the Central Bank’s technical staff, und

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Monetary Policy Report - January 2023. Banco de la República, 2023. http://dx.doi.org/10.32468/inf-pol-mont-eng.tr1-2023.

Texto completo da fonte

Resumo:

1. Macroeconomic Summary In December, headline inflation (13.1%) and the average of the core inflation measures (10.3%) continued to trend upward, posting higher rates than those estimated by the Central Bank's technical staff and surpassing the market average. Inflation expectations for all terms exceeded the 3.0% target. In that month, every major group in the Consumer Price Index (CPI) registered higher-than-estimated increases, and the diffusion indicators continued to show generalized price hikes. Accumulated exchange rate pressures on prices, indexation to high inflation rates, and sever

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!