Relevant bibliographies by topics / Graph burning

Academic literature on the topic 'Graph burning'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph burning.'

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 "Graph burning"

1

García-Díaz, Jesús, Lil María Xibai Rodríguez-Henríquez, Julio César Pérez-Sansalvador, and Saúl Eduardo Pomares-Hernández. "Graph Burning: Mathematical Formulations and Optimal Solutions." Mathematics 10, no. 15 (August 5, 2022): 2777. http://dx.doi.org/10.3390/math10152777.

Full text
Abstract:
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify how vulnerable a graph is to contagion. This paper introduces three mathematical formulations of the problem: an integer linear program (ILP) and two constraint satisfaction problems (CSP1 and CSP2). Thanks to off-the-shelf optimization software, these formulations can be solved optimally over arbitrary graphs; this is relevant because the only algorithms designed to date for this problem are approximation algorithms and heuristics, which do not guarantee to find optimal solutions. We empirically compared the proposed formulations using random graphs and off-the-shelf optimization software. The results show that CSP1 and CSP2 tend to reach optimal solutions in less time than the ILP. Therefore, we executed them over some benchmark graphs of order at most 5908. The previously best-known solutions for some of these graphs were improved. We draw some empirical observations from the experimental results. For instance, we find the tendency: the larger the graph’s optimal solution, the more difficult it is to find it. Finally, the resulting set of optimal solutions might be helpful as a benchmark dataset for the performance evaluation of non-exact algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Mitsche, Dieter, Paweł Prałat, and Elham Roshanbin. "Burning number of graph products." Theoretical Computer Science 746 (October 2018): 124–35. http://dx.doi.org/10.1016/j.tcs.2018.06.036.

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

Bessy, Stéphane, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, and Elham Roshanbin. "Burning a graph is hard." Discrete Applied Mathematics 232 (December 2017): 73–87. http://dx.doi.org/10.1016/j.dam.2017.07.016.

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

Tan, Ta Sheng, and Wen Chean Teh. "Graph burning: Tight bounds on the burning numbers of path forests and spiders." Applied Mathematics and Computation 385 (November 2020): 125447. http://dx.doi.org/10.1016/j.amc.2020.125447.

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

Khakzad, Nima. "A Graph Theoretic Approach to Optimal Firefighting in Oil Terminals." Energies 11, no. 11 (November 9, 2018): 3101. http://dx.doi.org/10.3390/en11113101.

Full text
Abstract:
Effective firefighting of major fires in fuel storage plants can effectively prevent or delay fire spread (domino effect) and eventually extinguish the fire. If the number of firefighting crew and equipment is sufficient, firefighting will include the suppression of all the burning units and cooling of all the exposed units. However, when available resources are not adequate, fire brigades would need to optimally allocate their resources by answering the question “which burning units to suppress first and which exposed units to cool first?” until more resources become available from nearby industrial plants or residential communities. The present study is an attempt to answer the foregoing question by developing a graph theoretic methodology. It has been demonstrated that suppression and cooling of units with the highest out-closeness index will result in an optimum firefighting strategy. A comparison between the outcomes of the graph theoretic approach and an approach based on influence diagram has shown the efficiency of the graph approach.
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Jiahui, Yi Yang, Ling Peng, Luanjie Chen, and Xingtong Ge. "Knowledge Graph Representation Learning-Based Forest Fire Prediction." Remote Sensing 14, no. 17 (September 3, 2022): 4391. http://dx.doi.org/10.3390/rs14174391.

Full text
Abstract:
Forest fires destroy the ecological environment and cause large property loss. There is much research in the field of geographic information that revolves around forest fires. The traditional forest fire prediction methods hardly consider multi-source data fusion. Therefore, the forest fire predictions ignore the complex dependencies and correlations of the spatiotemporal kind that usually bring valuable information for the predictions. Although the knowledge graph methods have been used to model the forest fires data, they mainly rely on artificially defined inference rules to make predictions. There is currently a lack of a representation and reasoning methods for forest fire knowledge graphs. We propose a knowledge-graph- and representation-learning-based forest fire prediction method in this paper for addressing the issues. First, we designed a schema for the forest fire knowledge graph to fuse multi-source data, including time, space, and influencing factors. Then, we propose a method, RotateS2F, to learn vector-based knowledge graph representations of the forest fires. We finally leverage a link prediction algorithm to predict the forest fire burning area. We performed an experiment on the Montesinho Natural Park forest fire dataset, which contains 517 fires. The results show that our method reduces mean absolute deviation by 28.61% and root-mean-square error by 53.62% compared with the previous methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Данилов, I. Danilov, Попова, and I. Popova. "IMPROVEMENT AND CALCULATION OF TRAFFIC SIGNAL CYCLE TO REDUCE CONGESTION BY USING A PHASE COEFFICIENT." Alternative energy sources in the transport-technological complex: problems and prospects of rational use of 3, no. 1 (March 16, 2016): 298–301. http://dx.doi.org/10.12737/17768.

Full text
Abstract:
The article describes the method of calculating the optimum values of the traffic light phase, which will minimize traffic congestion. Conditions of occurrence of traffic jams were analyzed. A graph of the phase factor of the burning time of traffic light was composed
APA, Harvard, Vancouver, ISO, and other styles
8

Šimon, Marek, Ladislav Huraj, Iveta Dirgová Luptáková, and Jiří Pospíchal. "Heuristics for Spreading Alarm throughout a Network." Applied Sciences 9, no. 16 (August 9, 2019): 3269. http://dx.doi.org/10.3390/app9163269.

Full text
Abstract:
This paper provides heuristic methods for obtaining a burning number, which is a graph parameter measuring the speed of the spread of alarm, information, or contagion. For discrete time steps, the heuristics determine which nodes (centers, hubs, vertices, users) should be alarmed (in other words, burned) and in which order, when afterwards each alarmed node alarms its neighbors in the network at the next time step. The goal is to minimize the number of discrete time steps (i.e., time) it takes for the alarm to reach the entire network, so that all the nodes in the networks are alarmed. The burning number is the minimum number of time steps (i.e., number of centers in a time sequence alarmed “from outside”) the process must take. Since the problem is NP complete, its solution for larger networks or graphs has to use heuristics. The heuristics proposed here were tested on a wide range of networks. The complexity of the heuristics ranges in correspondence to the quality of their solution, but all the proposed methods provided a significantly better solution than the competing heuristic.
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Yangxun, Weinan Liu, Huihong Liao, Hasier Ashan, Wenhua Zhou, and Cangsu Xu. "An Experimental and a Kinetic Modelling Study of Ethanol/Acetone/Ethyl Acetate Mixtures." Energies 15, no. 9 (April 20, 2022): 2992. http://dx.doi.org/10.3390/en15092992.

Full text
Abstract:
With the world’s energy resources decreasing, ethanol/acetone/ethyl acetate mixed fuel has the potential as a fossil fuel alternative or oxygenated fuel additive. In this work, the burning characteristics of ethanol/acetone/ethyl acetate mixed fuels including 3 pure fuels, 9 binary fuels, and 7 ternary fuels were studied at a temperature of 358 K, the pressure of 1 bar, and the equivalence ratios of 0.7 to 1.4 in the constant volume combustion chamber (CVCC). The burning velocities of the ternary fuels were compared at ϕ = 0.8, 1.0, and 1.4. The results show that the laminar burning velocities of the mixed fuels are affected by the contents of ethanol, acetone, and ethyl acetate. The Markstein length, Markstein number, and burning flux were also analyzed in this paper. Furthermore, a detailed chemical mechanism comprising 506 species and 2809 reactions was reduced to a skeletal mechanism including 98 species and 642 reactions, using the directed relation graph with error propagation (DRGEP). The experimental and the simulated laminar burning velocities were compared. The results of laminar burning velocities show that the relative deviation of ETEAAC 112 is approximately 17.5%. The sensitivity coefficients, flame structure, and reaction paths of ethyl acetate were investigated with the skeletal and the detailed mechanisms. It is found that the key reaction path is retained in the skeletal mechanism.
APA, Harvard, Vancouver, ISO, and other styles
10

Hu, Xiaoxue, Jiacheng Hu, and Jiangxu Kong. "The Surviving Rate of IC-Planar Graphs." Symmetry 14, no. 6 (June 17, 2022): 1258. http://dx.doi.org/10.3390/sym14061258.

Full text
Abstract:
Let k and n be two positive integers. Firefighting is a discrete dynamical process of preventing the spread of fire. Let G be a connected graph G with n vertices. Assuming a fire starts at one of the vertices of G, the firefighters choose k unburned vertices at each step, and then the fire spreads to all unprotected neighbors of the burning vertices. The process continues until the fire stops spreading. The goal is to protect as many vertices as possible. When a fire breaks out randomly at a vertex of G, its k-surviving rate, ρk(G), is the expected number of saved vertices. A graph is IC-planar if it has a drawing in which each edge cross once and their endpoints are disjoint. In this paper, we prove that ρ4(G)>1124 for every IC-planar graph G. This is proven by the discharging method and the locally symmetric of the graph.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graph burning"

1

Balackiy, Evgeniy, Natal'ya Ekimova, Aleksandr Rudnev, and Aleksandr Gusev. New approaches to modeling economic development. ru: INFRA-M Academic Publishing LLC., 2022. http://dx.doi.org/10.12737/1862597.

Full text
Abstract:
The monograph presents new results of the authors' long-term research on various topical issues of economic development. All the proposed new approaches are given in the broad context of already existing theories and models, as well as illustrated by numerous vivid examples from the history of different countries. Most of the topics covered belong to the category of the most burning social issues of our time, which gives the work an element of scientific "freshness" and discussion. All the fundamental theses are accompanied by the necessary models, equations, formulas, graphs and figures, but in general the material is not overloaded with technical details, which makes it quite accessible to any interested reader. The peculiarity of the monograph is that all its sections are based on the "paradox principle", the essence of which is to formulate the original problem in the most acute form, taking the form of a logical paradox. The range of topics under consideration covers the history of mankind from antiquity to the modern state. For example, why did humanity, which had been vegetating in the Malthusian trap for 10 thousand years, break out of it at the turn of the XVII and XVIII centuries? What is needed so that the economic growth that has begun does not "choke" in a short time and does not degenerate again into prolonged stagnation? How are economic growth and return on capital related? How are income inequality and the country's investment activity related? How to measure and in practice link the dialectical properties of institutions that presuppose order and freedom? Is it possible to diagnose "failures" in the regulatory activities of central banks? How to explain the transcendent technological creativity of Russian researchers and engineers with Russia's systematic technological lag behind Western countries? Does Russia have a chance to join the club of the most developed and prosperous countries in the world and what is needed for this? And much, much more. It is addressed to both professional specialists and everyone interested in modern problems of human development.
APA, Harvard, Vancouver, ISO, and other styles
2

Publishing, Frank H. Truck Driver- Notebook 120 Pages : 6''x 9'' Checkerd Graph Paper: If Diesel Ain't Burnin', Then I Ain't Earnin' -- Perfekt As a Log Notebook, Diarys, Day Planner, Journal and to-Do List for Work, University or at School. Independently Published, 2021.

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

Book chapters on the topic "Graph burning"

1

Bonato, Anthony, and Shahin Kamali. "Approximation Algorithms for Graph Burning." In Lecture Notes in Computer Science, 74–92. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14812-6_6.

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

Kare, Anjeneya Swami, and I. Vinod Reddy. "Parameterized Algorithms for Graph Burning Problem." In Lecture Notes in Computer Science, 304–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25005-8_25.

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

Bonato, Anthony, Jeannette Janssen, and Elham Roshanbin. "Burning a Graph as a Model of Social Contagion." In Lecture Notes in Computer Science, 13–22. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13123-8_2.

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

Lieskovský, Matej, and Jiří Sgall. "Graph Burning and Non-uniform k-centers for Small Treewidth." In Approximation and Online Algorithms, 20–35. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6_2.

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

Land, Max R., and Linyuan Lu. "An Upper Bound on the Burning Number of Graphs." In Lecture Notes in Computer Science, 1–8. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49787-7_1.

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

"Graph burning." In An Invitation to Pursuit-Evasion Games and Graph Theory, 91–120. Providence, Rhode Island: American Mathematical Society, 2022. http://dx.doi.org/10.1090/stml/097/04.

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

Allchin, Douglas. "Ahead of the Curve." In Sacred Bovines. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190490362.003.0006.

Full text
Abstract:
Graphs function plainly to summarize data. They hardly seem momentous. They are not like a famous discovery, whose significance is often marked by an eponymous name: Mendel’s laws, the Watson and Crick model of DNA, Darwinian theory. Who would name a mere graph? They seem mundane fragments of science, hardly worth celebrating. A notable exception, however, is the Keeling Curve (Figure 2.1). This simple graph depicts the steady rise in the concentration of carbon dioxide (CO2) in the Earth’s atmosphere over the last half century. It helps document how humans have transformed the atmosphere and, with it, the Earth’s temperature. The Keeling Curve is a linchpin in the evidence that humans have changed the planet’s climate. The Keeling Curve starts in 1958 and continues uninterrupted for over five decades. The scale of the data is extraordinary, an ideal rarely achieved in science. The hard data from real-time measurements show the steady accumulation of CO2 from burning fossil fuels. The results, presented in a simple yet striking visual format, serve to warn an energy-hungry culture of its environmental hubris. Although just a graph, it is monumental in scope and significance. The Keeling Curve, viewed in retrospect, raises an interesting question about how science works. How do such important long-term data sets emerge? Often we assume that scientific investigations find just what they intend to find. That is an implicit lesson of the tidy scientific method, as widely presented (see essay 5). But should we trust this sacred bovine? Could anyone have predicted this curve or its importance in advance? How did these important data originate? What happened before the graph was fully created? What happened, literally, ahead of the Curve? The Keeling Curve is named after its creator, Charles David Keeling. In the 1950s, as a handsome young man frequently enjoying the great outdoors (Figure 2.2), he hardly fit the stereotypical image of a scientist clad in a white coat, isolated in a lab. Indeed, with a fresh degree in chemistry, he turned down many job opportunities because he wanted to be closer to nature on the West Coast.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graph burning"

1

Hirata, Akihisa, Koji Kitamura, and Yoshifumi Nishida. "Visualizing Prioritized Typical and Potential Risks of Consumer Products by Graph Mining of an Accident Database." In Applied Human Factors and Ergonomics Conference. AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001300.

Full text
Abstract:
Designing a safe product requires predicting how consumers will use the product and what sort of risks exist in their daily environment. However, assistive technology for risk assessment of consumer products used in the daily environment has not yet been established. One of the most promising approaches is to utilize data on actual accidents that have occurred in the past. This paper proposes a new method that uses recently developed data mining technology to predict the typical and potential risks of consumer products. The proposed method is as follows: 1) create a situational graph database by structuralizing accident data as a graph; 2) visualize the typical risk using this situational graph database; and 3) visualize the potential risk using two methods: a probabilistic latent semantic indexing (pLSI) method and a method based on the features of the product. Prioritizing design improvement requires considering severity of injury. To this end, a function for supporting severity control is also implemented. To demonstrate the effectiveness of the proposed system, we applied our system to a dataset of 681 cases of accidental burning or scalding injuries. Injury severity was evaluated using body area of burn and scald injuries.
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Hyung Woo, Soo Hyun Kim, Yoon Keun Kwak, and Chang Soo Han. "A New Method for a Single Semi-Conducting Nanotube Device." In ASME 2004 International Mechanical Engineering Congress and Exposition. ASMEDC, 2004. http://dx.doi.org/10.1115/imece2004-61602.

Full text
Abstract:
We report a new technology for the selective deposition of a semi-conducting single-walled carbon nanotube(SWNT) between two electrodes. This technology consists of two processes. First, to separate the most of metallic nanotubes from semi-conducting ones and align the nanotubes, we applied dc and ac voltage to the electrodes respectively. But, in spite of the separation of the metallic nanotubes from semi-conducting nanotubes, some of metallic nanotubes and semi-conducting nanotubes are still deposited together. The second process is to burn the metallic and semi-conducting nanotubes by applying the voltage between two electrodes which enable to obtain a single semi-conducting nanotube structure. We verified the trace of the burning by SEM images or AFM images, and checked the characteristic of semi-conducting nanotubes through the I-V characteristic graph.
APA, Harvard, Vancouver, ISO, and other styles
3

Roy, Shrabanti, and Omid Askari. "Ethanol Mechanism Reduction Based on DRGEPSA Method at Various Operating Ranges." In ASME 2020 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/imece2020-24455.

Full text
Abstract:
Abstract Reducing the size of a detail chemical kinetic is necessary in the prospect of numerical computation. In this work a skeleton reduction is done on a detail mechanism of ethanol. The detailed ethanol mechanism used here is developed through reaction mechanism generator (RMG). The generated mechanism is validated at wide range of engine relevant operating conditions using laminar burning speed (LBS), ignition delay time (IDT) and species mole fraction calculation at different reactor conditions. This detail mechanism consists of 67 species and 1031 reactions. Though the mechanism is in a very good agreement at various operating ranges with experimental data, it is costly to use a detail mechanism for 3D computational fluid dynamics (CFD) analysis. To make the mechanism applicable for CFD simulation further reduction of species and reactions is essential. In this work a skeleton mechanism is generated using directed relation graph technique with error propagation and sensitivity analysis (DRGEPSA). The DRGEPSA method, works based on error calculation at user defined condition. This technique is a combination of two methods, directed relation graph with error propagation (DRGEP) and directed relation graph with sensitivity analysis (DRGASA). To ensure the wide range of applicability of the skeleton mechanism, IDT is calculated at temperature, pressure, and equivalence ratio ranges from 700–2000 K, 1–40 atm and 0.6–1.4 respectively. A 10% error estimation is considered during the process. Initially DRGEP is applied on the detail mechanism to eliminate unimportant species. Further, sensitivity analysis helps to identify and reduce more unimportant species from the mechanism. Reactions related to the deleted species are automatically removed from the mechanism in each step. The final skeleton mechanism has 42 species and 464 reactions. This skeleton mechanism is validated and compared with different IDT data for the conditions not used in reduction technique. Results of LBS and different species concentration from reactor conditions is considered for validation. The skeleton mechanism can reduce computational time by 35% for LBS and 25% for IDT calculation. For future work, this skeleton mechanism will be considered in optimum reduction process.
APA, Harvard, Vancouver, ISO, and other styles
4

Lilley, David G. "Calculations Related to Municipal Solid Waste MSW Burning Under High Temperature Air Combustion HiTAC Conditions." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34864.

Full text
Abstract:
New “high temperature air combustion” HiTAC technologies are evolving for the incineration of municipal solid waste for energy production and minimal pollution. As a contribution to this area of current research interest, a calculation procedure has been developed that permits rapid generation of general fuel-air combustion with many parameter variations. The program calculations are via Excel/VBA with immediate graphics of the parameter effects on the results. Thus, an extensive range of parameter effects may be quickly investigated and assessed. The very-general fuel is specified by way of its C-H-O-N-S content and additional water content and the “air” by way of the volume percent of oxygen, and the other component of “air” (nitrogen and/or carbon dioxide), each specified by the user. The temperature of each inlet (fuel and “air”) is specified by the user. The methodology and computer code takes as input also the equivalence ratio. Then, results of adiabatic flame temperature are calculated along with the equilibrium product species both with and without dissociation. Alternatively, the products temperature may be specified and the heat transfer in the combustor is then calculated. The computer code is very user friendly, with automatic nested loops for parameter variation and automatic generation of graphs, which are particularly useful in assessing the particular process under consideration. The application now is to incineration of municipal solid waste for energy production and minimal pollution. The waste may consist of a variety of specified components, including plastics and non-plastics, cellulose, cardboard, wood, etc. In the developed computer code, the choice of which components and their relative amounts is easily specified by the user.
APA, Harvard, Vancouver, ISO, and other styles
5

Bagdanavicius, Audrius, Nasser Shelil, Philip J. Bowen, Nick Syred, and Andrew P. Crayford. "Investigations of Gaseous Alternative Fuels at Atmospheric and Elevated Temperature and Pressure Conditions." In ASME Turbo Expo 2010: Power for Land, Sea, and Air. ASMEDC, 2010. http://dx.doi.org/10.1115/gt2010-23270.

Full text
Abstract:
Increasing interest in alternative fuels for gas turbines stimulates research in gaseous fuels other than natural gas. Various gas mixtures, based on methane as the main component, are considered as possible fuels in the future. In particular, methane enrichment with hydrogen or dilution with carbon dioxide is of considerable interest. Some experiments and numerical calculations have been undertaken to investigate methane-hydrogen and methane-carbon dioxide gas flames, however most of these investigations are limited by particular pressure or temperature conditions. This paper presents the investigation of the combustion of methane–carbon dioxide mixtures at atmospheric and elevated temperature and pressure conditions. Two experimental rigs were used, a Bunsen burner and swirl burner. Bunsen burner experiments were performed in the High Pressure Optical Chamber, which is located within the Gas Turbine Research Centre of Cardiff University — at 3 bara and 7 bara pressure, and 473 K, 573 K and 673 K temperature conditions for lean and rich mixtures. Planar Laser Tomography (PLT) was applied to investigate turbulent burning velocity. Burning velocity of the gas mixture was calculated using two different image processing techniques and the difference in the results obtained using these two techniques is presented and discussed. Laser Doppler anemometry (LDA) was utilised to define turbulence characteristics such as turbulence intensity and integral length scale. Due to the variability of the velocity flow field and turbulence intensity across Bunsen burners, the importance of measuring position and conditions is discussed. The sensitivity of this variance on the flame regime as defined in the Borghi diagram is evaluated. In the second part of the study, a generic swirl burner was used to define the flame flashback limits for methane–carbon dioxide mixtures at atmospheric conditions. The gas mixture stability graphs are plotted, and the effect of CO2 addition are discussed.
APA, Harvard, Vancouver, ISO, and other styles
6

Rice, Ivan G. "Split Stream Boilers for High Temperature/High Pressure Topping Steam Turbine Combined Cycles." In ASME 1995 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/95-gt-029.

Full text
Abstract:
Research and Development work on high temperature and high pressure (up to 1500 °F TIT and 4500 psia)1 topping steam turbines and associated steam generators for steam power plants as well as combined cycle plants is being carried forward by DOE, EPRI and independent companies. Aero Derivative gas turbines and Heavy Duty gas turbines both will require exhaust gas supplementary firing to achieve high throttle temperatures. This paper presents an analysis and examples of a split stream boiler arrangement for high temperature and high pressure topping steam turbine combined cycles. A portion of the gas turbine exhaust flow is run in parallel with a conventional heat recovery steam generator (HRSG). This side stream is supplementary fired opposed to current practice of full exhaust flow firing. Chemical fuel gas recuperation can be incorporated in the side stream as an option. A significant combined cycle efficiency gain of 2 to 4 percentage points can be realized using this split stream approach. Calculations and graphs show how the DOE goal of 60 % combined cycle efficiency burning natural gas fuel can be exceeded. The boiler concept is equally applicable to the integrated coal gas fuel combined cycle (IGCC).
APA, Harvard, Vancouver, ISO, and other styles
7

Vijayashree, P., V. Jyothish Kumar, and V. Ganesan. "GANESH: A GUI Approach to SI Engine Simulation." In ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-14332.

Full text
Abstract:
This paper is mainly concerned with the simulation of a four-stroke SI engine processes. To this effect a numerical approach has been followed and this has resulted in the development of a software by the name GANESH. It is an acronym that stands for Graphical And Numerical Engine Software Hub. The results are obtained by solving appropriate process governing equations and presented in the form of animated graphs and data. The software is developed using Visual C++ and OpenGL. The proposed approach for analysis involves step-by-step procedure in developing various models. For a four-stroke spark ignition engine, ideal Otto cycle provides the foundation. Assuming fuel-air mixture as working fluid modifies the analysis bringing fuel into account. This allows fuel vaporisation effect as well as instantaneous adiabatic combustion. Intake and exhaust stroke is modeled in a simplified manner. As a next step the progressive combustion analysis has been carried out. To determine burning rate three empirical models are considered in the analysis. The intake and exhaust stroke analysis are modelled by taking into consideration gas exchange process. Detailed gas exchange analysis tries to determine exact mass of the working fluid at the start of the compression stroke. The heat transfer between the working fluid and cylinder surface is by forced convection which is taken care of by empirical correlations. Empirical relations available in the literature are used to determine the loss due to friction. Thus all processes involved in a four-stroke SI engine are simulated and the user friendly software can be used with ease and it will be particularly useful for getting results which will reduce the development time.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Graph burning' 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