Relevant bibliographies by topics / Stream graphs

Contents

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

Academic literature on the topic 'Stream graphs'

Author: Grafiati
Published: 25 May 2024

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 'Stream graphs.'

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 "Stream graphs"

1

Ashrafi-Payaman, Nosratali, Mohammad Reza Kangavari, and Amir Mohammad Fander. "A new method for graph stream summarization based on both the structure and concepts." Open Engineering 9, no. 1 (2019): 500–511. http://dx.doi.org/10.1515/eng-2019-0060.

Full text
Abstract:
AbstractGraph datasets are common in many application domains and for which their graphs are usually massive. One solution to process such massive graphs is summarization. There are two kinds of graphs, stationary and stream. For stationary graphs, a number of summarization algorithms are available while for graph stream there is no a comprehensive summarization method that summarizes a graph stream based on the structure, vertex attributes or both with varying contributions. This is because of challenges of graph stream, which are volume of data and changing of data over time. In this paper,
APA, Harvard, Vancouver, ISO, and other styles
2

Malik, Avinash, and David Gregg. "Orchestrating stream graphs using model checking." ACM Transactions on Architecture and Code Optimization 10, no. 3 (2013): 1–25. http://dx.doi.org/10.1145/2512435.

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

Du, Zhihui, Oliver Alvarado Rodriguez, Joseph Patchett, and David A. Bader. "Interactive Graph Stream Analytics in Arkouda." Algorithms 14, no. 8 (2021): 221. http://dx.doi.org/10.3390/a14080221.

Full text
Abstract:
Data from emerging applications, such as cybersecurity and social networking, can be abstracted as graphs whose edges are updated sequentially in the form of a stream. The challenging problem of interactive graph stream analytics is the quick response of the queries on terabyte and beyond graph stream data from end users. In this paper, a succinct and efficient double index data structure is designed to build the sketch of a graph stream to meet general queries. A single pass stream model, which includes general sketch building, distributed sketch based analysis algorithms and regression based
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Ruize, Zhongyu Wei, Piji Li, Qi Zhang, and Xuanjing Huang. "Storytelling from an Image Stream Using Scene Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (2020): 9185–92. http://dx.doi.org/10.1609/aaai.v34i05.6455.

Full text
Abstract:
Visual storytelling aims at generating a story from an image stream. Most existing methods tend to represent images directly with the extracted high-level features, which is not intuitive and difficult to interpret. We argue that translating each image into a graph-based semantic representation, i.e., scene graph, which explicitly encodes the objects and relationships detected within image, would benefit representing and describing images. To this end, we propose a novel graph-based architecture for visual storytelling by modeling the two-level relationships on scene graphs. In particular, on
APA, Harvard, Vancouver, ISO, and other styles
5

Ni, Xiang, Jing Li, Mo Yu, Wang Zhou, and Kun-Lung Wu. "Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 01 (2020): 857–64. http://dx.doi.org/10.1609/aaai.v34i01.5431.

Full text
Abstract:
This paper considers the problem of resource allocation in stream processing, where continuous data flows must be processed in real time in a large distributed system. To maximize system throughput, the resource allocation strategy that partitions the computation tasks of a stream processing graph onto computing devices must simultaneously balance workload distribution and minimize communication. Since this problem of graph partitioning is known to be NP-complete yet crucial to practical streaming systems, many heuristic-based algorithms have been developed to find reasonably good solutions. I
APA, Harvard, Vancouver, ISO, and other styles
6

Declerck, Philippe. "DETECTION OF CHANGES BY OBSERVER IN TIMED EVENT GRAPHS AND TIME STREAM EVENT GRAPHS." IFAC Proceedings Volumes 40, no. 6 (2007): 49–54. http://dx.doi.org/10.3182/20070613-3-fr-4909.00011.

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

Llaves, Alejandro, Oscar Corcho, Peter Taylor, and Kerry Taylor. "Enabling RDF Stream Processing for Sensor Data Management in the Environmental Domain." International Journal on Semantic Web and Information Systems 12, no. 4 (2016): 1–21. http://dx.doi.org/10.4018/ijswis.2016100101.

Full text
Abstract:
This paper presents a generic approach to integrate environmental sensor data efficiently, allowing the detection of relevant situations and events in near real-time through continuous querying. Data variety is addressed with the use of the Semantic Sensor Network ontology for observation data modelling, and semantic annotations for environmental phenomena. Data velocity is handled by distributing sensor data messaging and serving observations as RDF graphs on query demand. The stream processing engine presented in the paper, morph-streams++, provides adapters for different data formats and di
APA, Harvard, Vancouver, ISO, and other styles
8

Mathieu, Claire, and Michel de Rougemont. "Large very dense subgraphs in a stream of edges." Network Science 9, no. 4 (2021): 403–24. http://dx.doi.org/10.1017/nws.2021.17.

Full text
Abstract:
AbstractWe study the detection and the reconstruction of a large very dense subgraph in a social graph with n nodes and m edges given as a stream of edges, when the graph follows a power law degree distribution, in the regime when $m=O(n. \log n)$ . A subgraph S is very dense if it has $\Omega(|S|^2)$ edges. We uniformly sample the edges with a Reservoir of size $k=O(\sqrt{n}.\log n)$ . Our detection algorithm checks whether the Reservoir has a giant component. We show that if the graph contains a very dense subgraph of size $\Omega(\sqrt{n})$ , then the detection algorithm is almost surely co
APA, Harvard, Vancouver, ISO, and other styles
9

Ajwani, Deepak, Shoukat Ali, Kostas Katrinis, et al. "Generating synthetic task graphs for simulating stream computing systems." Journal of Parallel and Distributed Computing 73, no. 10 (2013): 1362–74. http://dx.doi.org/10.1016/j.jpdc.2013.06.002.

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

Li, Yan, Tingjian Ge, and Cindy Chen. "Data stream event prediction based on timing knowledge and state transitions." Proceedings of the VLDB Endowment 13, no. 10 (2020): 1779–92. http://dx.doi.org/10.14778/3401960.3401973.

Full text
Abstract:
We study a practical problem of predicting the upcoming events in data streams using a novel approach. Treating event time orders as relationship types between event entities, we build a dynamic knowledge graph and use it to predict future event timing. A unique aspect of this knowledge graph embedding approach for prediction is that we enhance conventional knowledge graphs with the notion of "states"---in what we call the ephemeral state nodes---to characterize the state of a data stream over time. We devise a complete set of methods for learning relevant events, for building the event-order
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Stream graphs"

1

Gillani, Syed. "Semantically-enabled stream processing and complex event processing over RDF graph streams." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSES055/document.

Full text
Abstract:
Résumé en français non fourni par l'auteur<br>There is a paradigm shift in the nature and processing means of today’s data: data are used to being mostly static and stored in large databases to be queried. Today, with the advent of new applications and means of collecting data, most applications on the Web and in enterprises produce data in a continuous manner under the form of streams. Thus, the users of these applications expect to process a large volume of data with fresh low latency results. This has resulted in the introduction of Data Stream Processing Systems (DSMSs) and a Complex Event
APA, Harvard, Vancouver, ISO, and other styles
2

Rannou, Léo. "Temporal Connectivity and Path Computation for Stream Graph." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS418.

Full text
Abstract:
Les données structurelles et les données temporelles ont, pendant longtemps, été analysées séparément. De nombreux réseaux complexes contiennent une dimension temporelle, comme les contacts entre individus ou les transactions financières. La théorie des graphes fournit un large ensemble d'outils pour modéliser et analyser les connexions entre entités. Malheureusement, cette approche ne prend pas compte la nature temporelle des interactions. La théorie des stream graphs est un formalisme permettant de modéliser les réseaux dynamiques dans lesquels les nœuds et/ou les liens arrivent et/ou parten
APA, Harvard, Vancouver, ISO, and other styles
3

Faleiros, Thiago de Paulo. "Propagação em grafos bipartidos para extração de tópicos em fluxo de documentos textuais." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10112016-105854/.

Full text
Abstract:
Tratar grandes quantidades de dados é uma exigência dos modernos algoritmos de mineração de texto. Para algumas aplicações, documentos são constantemente publicados, o que demanda alto custo de armazenamento em longo prazo. Então, é necessário criar métodos de fácil adaptação para uma abordagem que considere documentos em fluxo, e que analise os dados em apenas um passo sem requerer alto custo de armazenamento. Outra exigência é a de que essa abordagem possa explorar heurísticas a fim de melhorar a qualidade dos resultados. Diversos modelos para a extração automática das informações latentes d
APA, Harvard, Vancouver, ISO, and other styles
4

Arnoux, Thibaud. "Prédiction d'interactions dans les flots de liens. Combiner les caractéristiques structurelles et temporelles." Electronic Thesis or Diss., Sorbonne université, 2018. http://www.theses.fr/2018SORUS229.

Full text
Abstract:
Le formalisme des flots de liens représente une approche permettant de conserver la dynamique du système tout en fournissant un cadre d'étude solide pour appréhender le comportement du système. Un flot de liens est une série de triplets (t,u,v) indiquant qu'une interaction a eu lieu entre u et v au temps t. La forte importance de la dynamique du système dans la prédiction dans les flots de liens la place au carrefour de la prédiction de liens dans les graphes et de la prédiction de séries temporelles. Nous allons explorer différentes formalisations du problème de la prédiction dans les flots d
APA, Harvard, Vancouver, ISO, and other styles
5

Baudin, Alexis. "Cliques statiques et temporelles : algorithmes d'énumération et de détection de communautés." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS609.

Full text
Abstract:
Les graphes sont des objets mathématiques qui permettent de modéliser des interactions ou connexions entre entités de types variés. Un graphe peut représenter par exemple un réseau social qui connecte les utilisateurs entre eux, un réseau de transport comme le métro où les stations sont connectées entre elles, ou encore un cerveau avec les milliards de neurones en interaction qu'il contient. Depuis quelques années, la forte dynamicité de ces structures a été mise en évidence, ainsi que l'importance de prendre en compte l'évolution temporelle de ces réseaux pour en comprendre le fonctionnement.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Changliang. "Continuous subgraph pattern search over graph streams /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20WANG.

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

Navarin, Nicolò <1984&gt. "Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6578/1/navarin_nicolo_tesi.pdf.

Full text
Abstract:
In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data. Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit mapping
APA, Harvard, Vancouver, ISO, and other styles
8

Navarin, Nicolò <1984&gt. "Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6578/.

Full text
Abstract:
In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data. Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit mapping
APA, Harvard, Vancouver, ISO, and other styles
9

Reyes, Juan C. (Juan Carlos) 1980. "A graph editing framework for the StreamIt language." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17980.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (leaves 55-56).<br>A programming language is more useful if it provides a level of abstraction that makes programming more intuitive and also allows the development of tools that take advantage of the language's internal representation. StreamIt, a language for the development of streaming applications, has a hierarchical and structural nature that lends itself to a graphical programming tool. I created a prototype StreamIt Graph Editor (SG
APA, Harvard, Vancouver, ISO, and other styles
10

Karczmarek, Michal 1977. "Constrained and phased scheduling of synchronous data flow graphs for StreamIt language." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87333.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2003.<br>Includes bibliographical references (p. 107-109).<br>by Michal Karczmarek.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Stream graphs"

1

Lees, Timothy. On context stream tuples and higher-order context flow graphs. University of Edinburgh Department ofComputer Science, 1990.

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

Kirk, Andy. Stream Graph. SAGE Publications, Ltd., 2016. http://dx.doi.org/10.4135/9781529777154.

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

Lees, Timothy. On context streams and the boundaries of context flow graphs. University of Edinburgh Department of Computer Science, 1990.

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

Koivunen-Niemi, Laura. Learn to Create a Stream Graph in R With Data From Our World in Data (2018). SAGE Publications, Ltd., 2021. http://dx.doi.org/10.4135/9781529772005.

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

Hart, Susan J. Entering adulthood.: A curriculum for grades 9-12. Network Publications, 1990.

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

Hart, Susan J. Entering adulthood.: A curriculum for grades 9-12. Network Publications, 1990.

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

Graphiscape - New York. RotoVision, 2003.

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

Child, Nancy Fraser. A comparison of the English language and reading achievement of French immersion students with transfer and English stream students (grades 3-6). Research Centre, Saskatchewan School Trustees Association, 1987.

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

Dianne, Schilling, ed. Less student stress, more school success: Strategies and activities for creating optimal learning environments, grades K-12. Pro-Ed, 2010.

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

Castellucci, Cecil. The plain Janes. DC Comics, 2007.

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

Book chapters on the topic "Stream graphs"

1

Ganguly, Sumit. "Data Stream Algorithms via Expander Graphs." In Algorithms and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_8.

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

Schiller, Benjamin, Sven Jager, Kay Hamacher, and Thorsten Strufe. "StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs." In Algorithms for Computational Biology. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21233-3_5.

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

Parmentier, P., T. Viard, B. Renoust, and J. F. Baffier. "Introducing Multilayer Stream Graphs and Layer Centralities." In Complex Networks and Their Applications VIII. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36683-4_55.

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

Rutten, J. J. M. M. "An Application of Stream Calculus to Signal Flow Graphs." In Formal Methods for Components and Objects. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30101-1_13.

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

Rannou, Léo, Clémence Magnien, and Matthieu Latapy. "Strongly Connected Components in Stream Graphs: Computation and Experimentations." In Complex Networks & Their Applications IX. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65347-7_47.

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

Nguyen, Quan, Peter Eades, and Seok-Hee Hong. "StreamEB: Stream Edge Bundling." In Graph Drawing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36763-2_36.

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

Latapy, Matthieu, Clémence Magnien, and Tiphaine Viard. "Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks." In Computational Social Sciences. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23495-9_3.

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

Latapy, Matthieu, Clémence Magnien, and Tiphaine Viard. "Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks." In Computational Social Sciences. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-30399-9_3.

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

Raab, Marius, Mark Wernsdorfer, Emanuel Kitzelmann, and Ute Schmid. "From Sensorimotor Graphs to Rules: An Agent Learns from a Stream of Experience." In Artificial General Intelligence. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22887-2_39.

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

Goh, Alwyn, G. S. Poh, and David C. L. Ngo. "Loss-Tolerant Stream Authentication via Configurable Integration of One-Time Signatures and Hash-Graphs." In Communications and Multimedia Security. Advanced Techniques for Network and Data Protection. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45184-6_20.

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

Conference papers on the topic "Stream graphs"

1

Shirui Pan, Xingquan Zhu, Chengqi Zhang, and P. S. Yu. "Graph stream classification using labeled and unlabeled graphs." In 2013 29th IEEE International Conference on Data Engineering (ICDE 2013). IEEE, 2013. http://dx.doi.org/10.1109/icde.2013.6544842.

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

Kakkad, Vasvi, Andrew E. Santosa, and Bernhard Scholz. "Migrating operator placement for compositional stream graphs." In the 15th ACM international conference. ACM Press, 2012. http://dx.doi.org/10.1145/2387238.2387261.

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

Amma, Keigo, Shunsuke Wada, Kanto Nakayama, Yuki Akamatsu, Yuichi Yaguchi, and Keitaro Naruse. "Visualization of spread of topic words on Twitter using stream graphs and relational graphs." In 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS). IEEE, 2014. http://dx.doi.org/10.1109/scis-isis.2014.7044759.

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

Amini, Lisa, Jorge Lepre, and Martin Kienzle. "Distributed stream control for self-managing media processing graphs." In the seventh ACM international conference. ACM Press, 1999. http://dx.doi.org/10.1145/319878.319905.

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

Chavez, Nidia Yadira Vaquera, and Trilce Estrada. "PASCAL-G: a Probabilistic Stream Clustering Analysis on Graphs." In 2021 IEEE International Conference on Big Data (Big Data). IEEE, 2021. http://dx.doi.org/10.1109/bigdata52589.2021.9671750.

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

Nguyen, Dong, and Jongeun Lee. "Communication-aware mapping of stream graphs for multi-GPU platforms." In CGO '16: 14th Annual IEEE/ACM International Symposium on Code Generation and Optimization. ACM, 2016. http://dx.doi.org/10.1145/2854038.2854055.

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

Hu, Binbin, Zhengwei Wu, Jun Zhou, et al. "MERIT: Learning Multi-level Representations on Temporal Graphs." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/288.

Full text
Abstract:
Recently, representation learning on temporal graphs has drawn increasing attention, which aims at learning temporal patterns to characterize the evolving nature of dynamic graphs in real-world applications. Despite effectiveness, these methods commonly ignore the individual- and combinatorial-level patterns derived from different types of interactions (e.g.,user-item), which are at the heart of the representation learning on temporal graphs. To fill this gap, we propose MERIT, a novel multi-level graph attention network for inductive representation learning on temporal graphs.We adaptively em
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Geon, Minyoung Choe, and Kijung Shin. "HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/296.

Full text
Abstract:
Sequences of group interactions, such as emails, online discussions, and co-authorships, are ubiquitous; and they are naturally represented as a stream of hyperedges (i.e., sets of nodes). Despite its broad potential applications, anomaly detection in hypergraphs (i.e., sets of hyperedges) has received surprisingly little attention, compared to anomaly detection in graphs. While it is tempting to reduce hypergraphs to graphs and apply existing graph-based methods, according to our experiments, taking higher-order structures of hypergraphs into consideration is worthwhile. We propose HashNWalk,
APA, Harvard, Vancouver, ISO, and other styles
9

Akili, Samira, and Matthias Weidlich. "MuSE Graphs for Flexible Distribution of Event Stream Processing in Networks." In SIGMOD/PODS '21: International Conference on Management of Data. ACM, 2021. http://dx.doi.org/10.1145/3448016.3457318.

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

Middendorf, Lars, and Christian Haubelt. "Scheduling of Recursive and Dynamic Data-Flow Graphs Using Stream Rewriting." In 2014 International Symposium on Computer Architecture and High Performance Computing Workshop (SBAC-PADW). IEEE, 2014. http://dx.doi.org/10.1109/sbac-padw.2014.7.

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

Reports on the topic "Stream graphs"

1

Tercek, Michael. Climate monitoring in the Mediterranean Coast Network 2020: Cabrillo National Monument. National Park Service, 2022. http://dx.doi.org/10.36967/2294406.

Full text
Abstract:
This report details the climate (temperature, precipitation, drought, and streamflow) of Cabrillo National Monument during 2020. Gridded GIS maps are used to present broad-brush conditions across the region for each month. This regional presentation is compared to detailed data from weather stations in the Global Historical Climatology Network (GHCN), automated meteorological stations, and data from USGS stream gages. Prior to analysis, a set of data quality control checks were performed by the author in accordance with an established National Park Service protocol. Readers can download the da
APA, Harvard, Vancouver, ISO, and other styles
2

Tercek, Michael. Climate monitoring in the Mediterranean Coast Network 2020: Santa Monica Mountains National Recreation Area. National Park Service, 2022. http://dx.doi.org/10.36967/2294435.

Full text
Abstract:
This report details the climate (temperature, precipitation, drought, and streamflow) of Santa Monica Mountains National Recreation Area (NRA) during 2020. Gridded GIS maps are used to present broad-brush conditions across the region for each month. This regional presentation is compared to detailed data from Remote Automated Weather Stations (RAWS), weather stations in Global Historical Climatology Network (GHCN), and data from USGS stream gages. Prior to analysis, a set of data quality control checks were performed by the authors in accordance with an established National Park Service protoc
APA, Harvard, Vancouver, ISO, and other styles
3

Fait, Aaron, Grant Cramer, and Avichai Perl. Towards improved grape nutrition and defense: The regulation of stilbene metabolism under drought. United States Department of Agriculture, 2014. http://dx.doi.org/10.32747/2014.7594398.bard.

Full text
Abstract:
The goals of the present research proposal were to elucidate the physiological and molecular basis of the regulation of stilbene metabolism in grape, against the background of (i) grape metabolic network behavior in response to drought and of (ii) varietal diversity. The specific objectives included the study of the physiology of the response of different grape cultivars to continuous WD; the characterization of the differences and commonalities of gene network topology associated with WD in berry skin across varieties; the study of the metabolic response of developing berries to continuous WD
APA, Harvard, Vancouver, ISO, and other styles
4

Mikhaleva, E., E. Babikova, G. Bezhashvili, M. Ilina, and I. Samkova. VALUE STREAM PROGRAM. Sverdlovsk Regional Medical College, 2022. http://dx.doi.org/10.12731/er0618.03122022.

Full text
Abstract:
In order to increase the efficiency of the work of a medical organization, it is necessary to train medical workers, employees of medical organizations, students of educational organizations in the techniques and methods of lean production, followed by the application of the acquired skills directly at the workplace in a medical organization. The purpose of the training under the program is to acquire new competencies necessary to perform professional tasks using lean manufacturing tools - mapping the value stream to ensure maximum operational efficiency of production processes. The program pr
APA, Harvard, Vancouver, ISO, and other styles
5

Beckett-Brown, C. E., A. M. McDonald, and M. B. McClenaghan. Discovering a porphyry deposit using tourmaline: a case study from Yukon. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331349.

Full text
Abstract:
As the exploration for porphyry Cu-Au-Mo deposits has become increasingly challenging, the development of more effective techniques directed at detecting buried deposits has become critical. One methodology is to focus on key minerals, one of which is tourmaline, a robust, ubiquitous mineral in most mineralized porphyry systems. Overall, a combination of physical and chemical characteristics including 1) macro-color, 2) morphology, 3) inclusion populations, and 4) trace-element compositions are useful in discriminating between porphyry- versus non-porphyry-derived (or related) tourmaline in su
APA, Harvard, Vancouver, ISO, and other styles
6

Werne, R. The Contact Stress Sensor _ Proposal to the FY2020 Technology Tech Mat Grants Program. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1598958.

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

Holub, Oleksandr, Mykhailo Moiseienko, and Natalia Moiseienko. Fluid Flow Modelling in Houdini. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4128.

Full text
Abstract:
The modern educational environment in the field of physics and information technology ensures the widespread use of visualization software for successful and deep memorization of material. There are many software for creating graphic objects for presentations and demonstrations, the most popular of which were analyzed. The work is devoted to the visualization of liquids with different viscosity parameters. The article describes the development of a fluid model in the form of a particle stream. The proposed methodology involves using the Houdini application to create interactive models. The dev
APA, Harvard, Vancouver, ISO, and other styles
8

Schwarte, Kirk A., and James R. Russell. Grazing Management Effects on the Sward and Physical Characteristics Relative to Streams in Cool-Season Grass Pastures. Iowa State University, 2009. http://dx.doi.org/10.31274/ans_air-180814-71.

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

Light. L52011 Development of Fieldable Magnet and Digital MIVC Stress Measurement Techniques. Pipeline Research Council International, Inc. (PRCI), 2002. http://dx.doi.org/10.55274/r0010147.

Full text
Abstract:
The objective of this project was to start the process of making the MIVC technique simple and cost effective for use in the field by reducing both the size of the required sensors and instrumentation and the calibration requirements. Three steps were taken to meet this objective: (1) design and build a small, lightweight magnetic circuit that can be handled by a single technician, (2) reduce the number and size of the instruments used to perform the MIVC measurements, and (3) investigate the variability of the MIVC calibration curves among different pipe grades and the feasibility of establis
APA, Harvard, Vancouver, ISO, and other styles
10

Firon, Nurit, Prem Chourey, Etan Pressman, Allen Hartwell, and Kenneth J. Boote. Molecular Identification and Characterization of Heat-Stress-Responsive Microgametogenesis Genes in Tomato and Sorghum - A Feasibility Study. United States Department of Agriculture, 2007. http://dx.doi.org/10.32747/2007.7591741.bard.

Full text
Abstract:
Exposure to higher than optimal temperatures - heat-stress (HS) - is becoming increasingly common to all crop plants worldwide. Heat stress coinciding with microgametogenesis, especially during the post-meiotic phase that is marked by starch biosynthesis, is often associated with starch-deficient pollen and male sterility and ultimately, greatly reduced crop yields. The molecular basis for the high sensitivity of developing pollen grains, on one hand, and factors involved in pollen heat-tolerance, on the other, is poorly understood. The long-term goal of this project is to provide a better und
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography