Relevant bibliographies by topics / GRAPE (Computer file)

Contents

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

Academic literature on the topic 'GRAPE (Computer file)'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

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 'GRAPE (Computer file).'

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 "GRAPE (Computer file)"

1

Wang, Yi, Han Ding, and Ge Ging Xu. "Computer Aided Organic Synthesis Based on Graph Grammars." Applied Mechanics and Materials 411-414 (September 2013): 227–30. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.227.

Full text
Abstract:
Traditionally, computer aided organic synthesis is based on the one-dimensional string model that employs string grammars to tackle the structure of molecular; the processing of organic reactions, and the establishment of the knowledge bases and file systems. Because of the limitations of one-dimensional method for tackling two-dimensional issues like organic syntheses, this paper presents a method for computer aided organic synthesis based on two-dimensional graph grammars. The method could apply the basic principle of the graph grammars to effectively and efficiently solve organic synthesis problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Richter, Tobias, Johannes Naumann, and Stephan Noller. "LOGPAT: A semi-automatic way to analyze hypertext navigation behavior." Swiss Journal of Psychology 62, no. 2 (June 2003): 113–20. http://dx.doi.org/10.1024//1421-0185.62.2.113.

Full text
Abstract:
In hypertext research, log files represent a useful source of information about users’ navigational behavior. Since log files can contain enormous amounts of data, methods for data reduction with a minimum loss of information are needed. In this paper, LOGPAT (Log file Pattern Analysis) is presented, a Web-based tool for analyzing log files. With LOGPAT, single-unit, sequential, and graph-theoretic measures (including distance matrices) for the description of user navigation can be computed. The paper gives an overview of these methods and discusses their value for psychological research on hypertext. Components and analysis options of LOGPAT are described in detail. The program’s basic options are illustrated by data from a study on learning with hypertext.
APA, Harvard, Vancouver, ISO, and other styles
3

Mustikasari, Dyah. "Ibm Smk Muhammadiyah Sumoroto Pelatihan Pembuatan Film Animas." Adimas : Jurnal Pengabdian Kepada Masyarakat 1, no. 1 (April 12, 2017): 31. http://dx.doi.org/10.24269/adi.v1i1.415.

Full text
Abstract:
Sekolah Menengah Kejuruan (vocational school) has a purpose to generate graduate which is ready to be employed. Therefore, the students need to have additional competence. It will be additional value for students to compete in the workplace environment. SMK Muhammadiyah Sumoroto is one of vocational schools in Kecamatan Kauman, Kabupaten Ponorogo. This school has two majors; there are accounting and computer networking technique. To improve students’ skill and creativity in graphic design needs to carry out training in Graphic Design, particularly animation design. This training is carried out in SMK Muhammadiyah 1 Sumoroto with participants as many as 20 students from first and second grade. The software used in this training was Alice3 because it is pretty easy to run for beginners in animation design. The training was conducted twice and additional meeting to review and to discuss the result. The biggest obstacle of this training is a lack of computers. The amount of computer was less adequate, so that one computer was used by more than one student. It lead the training become less maximum. Overall the students could have used the software though the result have not been perfect yet.
APA, Harvard, Vancouver, ISO, and other styles
4

White, Charles S. "Developing Information-Processing Skills through Structured Activities with a Computerized File-Management Program." Journal of Educational Computing Research 3, no. 3 (August 1987): 355–75. http://dx.doi.org/10.2190/mj4b-mh97-rr32-yf29.

Full text
Abstract:
Considerable attention has been focused recently on the development of thinking skills among pre-college students. Advocates of computer-based education have suggested that computerized file-management programs can enhance thinking skills, especially those involving the identification, retrieval, organization and evaluation of information required for effective problem solving. Employing a randomized block design, a two-treatment experiment to test this claim was devised, involving fourteen paired classrooms and 665 seventh- through twelfth-grade students. The treatments and treatment materials were adapted from commercially produced social studies curriculum data bases. The computer-using/structured-activities treatment group achieved significantly higher mean scores than the non-computer-using/non-structured-activities group on a 14-item power test of selected information-processing skills (effect size = .27). The difference persisted when verbal ability and grade level were controlled. Suggestions for further research are proposed, and implications for instructional methodology, curriculum development, and conceptions of pre-college computer literacy are discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

HOLZRICHTER, MICHAEL, and SUELY OLIVEIRA. "A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM." International Journal of Foundations of Computer Science 10, no. 02 (June 1999): 225–46. http://dx.doi.org/10.1142/s0129054199000162.

Full text
Abstract:
The problem of partitioning a graph such that the number of edges incident to vertices in different partitions is minimized, arises in many contexts. Some examples include its recursive application for minimizing fill-in in matrix factorizations and load-balancing for parallel algorithms. Spectral graph partitioning algorithms partition a graph using the eigenvector associated with the second smallest eigenvalue of a matrix called the graph Laplacian. The focus of this paper is the use graph theory to compute this eigenvector more quickly.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Xin Jie. "Research and Application of Lost Foam Technology of Goods Train Low-Carbon Alloy Steel Casting." Advanced Materials Research 284-286 (July 2011): 2340–49. http://dx.doi.org/10.4028/www.scientific.net/amr.284-286.2340.

Full text
Abstract:
Apply an organic whole technological medium of computer aided three dimensions design 、computer aided solidification process numerical value simulation engineering ＆ computer aided numerical control programming manufacturing, by means of optimization product pattern structure、foundry processing parameters 、die auxiliary equipment and tool、riser gating system ＆ die cavity numerical control cutter location source file , the type of Z8A goods train low-carbon alloy adapter lost foam casting has been under development .Compare lost foam technology to ordinary sand mold casting ,the casting monomer weight lightened 3kg , grade of casting weight precision come to MT7 , grade of casting size precision come to CT8 ,foundry processing yield come to 65% ；Casting defects easily appeared in the course of large quantities production has been analysed ＆ offered solution methods in this article.
APA, Harvard, Vancouver, ISO, and other styles
7

Ali, Faridah, and Imtiaz Ahmad. "Register-file allocation via graph coloring." Microprocessors and Microsystems 21, no. 9 (April 1998): 523–32. http://dx.doi.org/10.1016/s0141-9331(98)00047-7.

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

Jiang, Ying, and Jie Liu. "Computer Aided Design on Thin-Film Evaporator in Parametric Drawing." Applied Mechanics and Materials 201-202 (October 2012): 267–70. http://dx.doi.org/10.4028/www.scientific.net/amm.201-202.267.

Full text
Abstract:
This article introduces parameterized drawing technology on complete film evaporators by the classification of parameterized drawing strategy. And by sample of film evaporators parts graph drawing process, parametric parts prints and the assembly drawing strategy in detail. Development of aided design software of film evaporators would help users realize integration design of process design, and can greatly shorten the development cycle of the products, improve the design quality and enhance the competitiveness of their products.
APA, Harvard, Vancouver, ISO, and other styles
9

Diomande, Bre Moussa, and Luc Laperrière. "AUTOMATIC LIAISON MODEL GENERATION FROM 3-D SOLID MODELS." Transactions of the Canadian Society for Mechanical Engineering 20, no. 4 (December 1996): 333–47. http://dx.doi.org/10.1139/tcsme-1996-0019.

Full text
Abstract:
Computer Aided Assembly Planning (CAAP) is characterized by the manual generation of a liaison (or graph) model used to represent explicitly mating information among parts. This paper describes an automatic method for generating such relational information. It is based on an exhaustive and systematic surface-level analysis of the Boundary Representation (B-Rep) file of the solid modeled product. Simple mathematical tests performed on pairs of surfaces each on a different part enable the identification of mating surfaces. The system which performs this analysis also enables a visual display of the mating information in the form of a graph model This paper describes how mating surfaces are identified from more elemental information found in the B-Rep file and also provides examples of the automatically generated graph model for some products.
APA, Harvard, Vancouver, ISO, and other styles
10

Rowley, Peter, and Paul Taylor. "Involutions in Janko’s simple group J4." LMS Journal of Computation and Mathematics 14 (November 1, 2011): 238–53. http://dx.doi.org/10.1112/s1461157009000540.

Full text
Abstract:
AbstractIn this paper we determine the suborbits of Janko’s largest simple group in its conjugation action on each of its two conjugacy classes of involutions. We also provide matrix representatives of these suborbits in an accompanying computer file. These representatives are used to investigate a commuting involution graph for J4.Supplementary materials are available with this article.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "GRAPE (Computer file)"

1

Islam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.

Full text
Abstract:
G-Net system is being developed by the members of the G-Net research group under the supervision of Dr. K. Jay Bagga. The principle objective of the G-Net system is to provide an integrated tool for dealing with various aspects of graph theory. G-Net system is divided into two parts. GETS (Graph theory Experiments Tool Set) will provide a set of tools to experiment with graph theory, and HYGRES (HYpertext Graph theory Reference Service), the second subcomponent of the G-Net system to aid graph theory study and research. In this research a hypertext application is built to present the graph theory concepts, graph models and the algorithms. In other words, HYGRES (Guide Version) provides the hypertext facilities for organizing a graph theory database in a very natural and interactive way. An hypertext application development tool, called Guide, is used to implement this version of HYGRES. This project integrates the existing version of GETS so that it can also provide important services to HYGRES. The motivation behind this project is to study the initial criterion for developing a hypertext system, which can be used for future development of a stand alone version of the G-Net system.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
2

Warty, Durgesh A. "Development of Graphcards a hypertext system for learning graph theory and graph algorithms." Virtual Press, 1998. http://liblink.bsu.edu/uhtbin/catkey/1101590.

Full text
Abstract:
GraphCards is a research project devoted to the development of a system for learning graph theory and implementing graph algorithms. It contains an information base for learning and referencing graph theory topics, integrated with an experimentation tool set to create and manipulate graphs. Due to the non-linear relationship of the information, its organization is hypertext based. The hypertext system NoteCards 1 is used to develop the application.The contribution of the current project is to complete and improve an existing system by reclassifying and rewriting the textual information into different chunks called "typed cards". This should serve to enhance the organization and make the traversal by the user easier.This project will also contribute to the development of an interface between the Information Base and the Graph Experimentation Tool Set.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
3

Vemuri, Suresh P. "Jedit : a graph editor in Java." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1036185.

Full text
Abstract:
There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
4

Nall, Aaron J. "An extensible Java system for graph editing and algorithm animation." Virtual Press, 1998. http://liblink.bsu.edu/uhtbin/catkey/1115431.

Full text
Abstract:
The G-Net research group at Ball State University previously developed a graph editor, written in Java, with limited algorithm support. This editor was modified until the code had the instability of a legacy system. It was decided that, rather than continue working with the old system, a new version would be created.The enhancements planned for this new version were more efficient data structures, easy addition of new algorithms, and animated algorithm output. Additionally, the new version was to be written in compliance with the latest Java standards. This paper describes the structure of this new program, Jedit3.1. An overview of the structure of the program and detailed descriptions of the material that future programmers will need to understand in order to add new algorithms is included. Appropriate descriptions are included for files that future programmers should understand but not necessarily modify.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
5

Mu, Xiaohua. "The design and implementation of Graphperfect : a graph editor for G-net." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834616.

Full text
Abstract:
There is an increasing demand for a computer graphics - oriented software package for graph theory teaching and research. G-Net, a department research project headed by Dr. Kunwarjit Bagga, is an effort to create a computer software that contains a graph theory database, a graph editor, and a collection of algorithms to be executed on the graphs. This thesis concentrates on the design and implementation of a graph editor - GrapliPerfect. Graphs have been widely used to model many other phenomena. In this thesis, computer generated graphics images are used to represent graphs. This modeling relation between graphs and graphics is analyzed, and its role in the design and implementation of GraphPerfect is discussed in the thesis. To enhance the friendliness of the user interface, a simplified window system is presented.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
6

Thanawala, Rajiv P. "Development of G-net (a software system for graph theory & algorithms) with special emphasis on graph rendering on raster output devices." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834618.

Full text
Abstract:
In this thesis we will describe the development of software functions that render graphical and textual information of G-Net(A software system for graph theory & algorithms) onto various raster output devices.Graphs are mathematical structures that are used to model very diverse systems such as networks, VLSI design, chemical compounds and many other systems where relations between objects play an important role. The study of graph theory problems requires many manipulative techniques. A software system (such as G-Net) that can automate these techniques will be a very good aid to graph theorists and professionals. The project G-Net, headed by Prof. Kunwarjit S. Bagga of the computer science department has the goal of developing a software system having three main functions. These are: learning basics of graph theory, drawing/manipulating graphs and executing graph algorithms.The thesis will begin with an introduction to graph theory followed by a brief description of the evolution of the G-Net system and its current status. To print on various printers, the G-Net system translates all the printable information into PostScript' files. A major part of this thesis concentrates on this translation. To begin with, the necessity of a standard format for the printable information is discussed. The choice of PostScript as a standard is then justified. Next,the design issues of translator and the translation algorithm are discussed in detail. The translation process for each category of printable information is explained. Issues of printing these PostScript files onto different printers are dealt with at the end.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
7

Sawant, Vivek Manohar. "A hypertext application and system for G-net and the complementary relationship between graph theory and hypertext." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879843.

Full text
Abstract:
Many areas of computer science use graph theory and thus benefit from research in graph theory. Some of the important activities involved in graph theory work are the study of concepts, algorithm development, and theorem proving. These can be facilitated by providing computerized tools for graph drawing, algorithm animation and accessing graph theory information bases. Project G-Net is aimed at developing a set of such tools.Project G-Net has chosen to provide the tools in hypertext form based on the analysis of users' requirements. The project is presently developing a hypertext application and a hypertext system for providing the above set of tools. In the process of this development various issues pertaining to hypertext authoring, hypertext usability and application of graph theory to hypertext are being explored.The focus of this thesis is in proving that hypertext approach is most appropriate for realizing the goals of the G-Net project. The author was involved in the research that went into analysis of requirements, design of hypertext application and system, and the investigation of the complementary relationship between graph theory and hypertext.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Mingrui. "On the size of induced subgraphs of hypercubes and a graphical user interface to graph theory." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879847.

Full text
Abstract:
The hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying properties of graphs. An MS WINDOWS based graphical system is developed which allows the creation and display of graphs and their spanning graphs, line graphs and super line graphs.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
9

Hsieh, Chao-Ho. "Implementation of graph manipulation under X Window system environment." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834634.

Full text
Abstract:
In graph theory graphs are mathematical objects that can be used to model networks, data structures, process scheduling, computations and a variety of other systems where the relations between the objects in the system play a dominant role.We will now consider graphs as mathematically self-contained units with rich structure and comprehensive theory; as models for many phenomena, particularly those arising in computer systems; and as structures which can be processed by a variety of sophisticated and interesting algorithms.For graph theory presentation, we need a very good graphical user interface(GUI) to approach the goal. X Window system is ideally suited for such a purpose. This package program is based on X Window system environment. With this package, we can manipulate graphs by special functions which can put nodes, put edges, delete nodes, delete edges, change the whole graph size, move graph location, and modify edge weights.
Department of Computer Science
APA, Harvard, Vancouver, ISO, and other styles
10

Pope, Ellis Abel. "Integrating technology into a grade five resource-based weather unit." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0029/MQ47468.pdf.

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

Books on the topic "GRAPE (Computer file)"

1

Makino, Junichiro. Scientific simulations with special-purpose computers: The GRAPE Systems. Chichester: Wiley, 1998.

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

Junichiro, Makino, and Hut Piet 1952-, eds. Astrophysical supercomputing using particle simulations: Proceedings of the 208th Symposium of the International Astronomical Union held in Tokyo, Japan, 10-13 July 2001. San Francisco, Calif: Published on behalf of IAU by the Astronomical Society of the Pacific, 2003.

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

AppleWorks with advanced applications: Calc, File, Write, Graph! Dubuque, Iowa: W.C. Brown, 1985.

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

Survey, Ontario Geological. Grade-tonnage data for the mineral deposit models described in Open file report 5945 [computer file]. Sudbury, ON: Ministry of Northern Development and Mines, 1996.

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

Using the PFS family: FILE, WRITE, GRAPH, REPORT. Indianapolis: Que Corp., 1985.

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

Institute, SAS, ed. SAS/GRAPH: Beyond the basics. Cary, N.C: SAS Pub., 2012.

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

Skiena, Steven S. Implementing discrete mathematics: Combinatorics and graph theory with Mathematica. Redwood City, Calif: Addison-Wesley, 1990.

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

Producing high-quality figures using SAS/Graph® and ODS graphics procedures. Boca Raton, FL: CRC Press, 2015.

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

I, Prince Far. Facebook Graph API development with Flash: Beginner's guide : build social Flash applications fully integrated with the Facebook Graph API. Birmingham, U.K: Packt Pub., 2010.

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

Gnuplot in action: Understanding data with graphs. Greenwich, Conn: Manning Publications, 2010.

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

Book chapters on the topic "GRAPE (Computer file)"

1

Ni, Ming, Qianmu Li, Hong Zhang, Tao Li, and Jun Hou. "File Relation Graph Based Malware Detection Using Label Propagation." In Lecture Notes in Computer Science, 164–76. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26187-4_12.

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

Dahlhaus, Elias. "Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs." In Graph-Theoretic Concepts in Computer Science, 351–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/10692760_28.

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

Broersma, H. J., E. Dahlhaus, and T. Kloks. "Algorithms for the treewidth and minimum fill-in of HHD-free graphs." In Graph-Theoretic Concepts in Computer Science, 109–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0024492.

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

Meister, Daniel. "Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time." In Graph-Theoretic Concepts in Computer Science, 91–102. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604686_9.

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

Jaffke, Lars, and Bart M. P. Jansen. "Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems." In Lecture Notes in Computer Science, 345–56. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57586-5_29.

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

He, Xin, Ting Ding, and Kun Liu. "A Key Technologies for Commercial-Grade File Upload and Download Platform." In Recent Advances in Computer Science and Information Engineering, 175–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25792-6_27.

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

Broersma, Hajo, Ton Kloks, Dieter Kratsch, and Haiko Müller. "A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking." In Graph-Theoretic Concepts in Computer Science, 88–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/10692760_8.

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

Bao, Tran Minh, and Truong Cong Tuan. "Querying Object-Oriented Databases Based on Signature File Hierarchy and Signature Graph." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 298–308. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29236-6_29.

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

Meilicke, Christian, Manuel Fink, Yanjie Wang, Daniel Ruffinelli, Rainer Gemulla, and Heiner Stuckenschmidt. "Fine-Grained Evaluation of Rule- and Embedding-Based Systems for Knowledge Graph Completion." In Lecture Notes in Computer Science, 3–20. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00671-6_1.

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

Gustafson, Brenda J., and Peter G. Mahaffy. "Using Computer Visualizations to Introduce Grade Five Students to the Particle Nature of Matter." In Reading for Evidence and Interpreting Visualizations in Mathematics and Science Education, 181–202. Rotterdam: SensePublishers, 2012. http://dx.doi.org/10.1007/978-94-6091-924-4_10.

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

Conference papers on the topic "GRAPE (Computer file)"

1

Pasterk, Stefan, and Andreas Bollin. "Graph-based analysis of computer science curricula for primary education." In 2017 IEEE Frontiers in Education Conference (FIE). IEEE, 2017. http://dx.doi.org/10.1109/fie.2017.8190610.

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

Carnegie, Dale A., Craig A. Watterson, Morgan Atkins, and James Eldridge. "Differences in Grade Outcomes Between ICT Engineering and Computer Science Degrees." In 2018 IEEE Frontiers in Education Conference (FIE). IEEE, 2018. http://dx.doi.org/10.1109/fie.2018.8658850.

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

Namouz, Essam Z., and Joshua D. Summers. "Comparison of Graph Generation Methods for Structural Complexity Based Assembly Time Estimation." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12300.

Full text
Abstract:
This paper compares two different methods of graph generation for input into the complexity connectivity method to estimate the assembly time of a product. The complexity connectivity method builds predictive models for assembly time based on twenty-nine complexity metrics applied to the product graphs. Previously the part connection graph was manually created, but recently the Assembly Mate Method and the Interference Detection Method have introduced new automated tools for creating the part connectivity graphs. These graph generation methods are compared on their ability to predict the assembly time of multiple products. For this research, eleven consumers products are used to train an artificial neural network and three products are reserved for testing. The results indicate that both the Assembly Mate Method and the Interference Detection Method can create connectivity graphs that predict the assembly time of a product to within 45% of the target time. The Interference Detection Method showed less variability than the Assembly Mate Method in the time estimations. The Assembly Mate Method is limited to only SolidWorks assembly files, while the Interference Detection Method is more flexible and can operate on different file formats including IGES, STEP, and Parasolid. Overall, both of the graph generation methods provide a suitable automated tool to form the connectivity graph, but the Interference Detection Method provides less variance in predicting the assembly time and is more flexible in terms of file types that can be used.
APA, Harvard, Vancouver, ISO, and other styles
4

Kumar, Amruth N. "Quantifying the Relationship Between Projects, Assignments and Grade in Computer Science I." In 2019 IEEE Frontiers in Education Conference (FIE). IEEE, 2019. http://dx.doi.org/10.1109/fie43999.2019.9028481.

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

Sirageldin, Abubakr, Baharum Baharudin, and Low Tang Jung. "Detecting malicious executable file via graph comparison using support vector machine." In 2012 International Conference on Computer & Information Science (ICCIS). IEEE, 2012. http://dx.doi.org/10.1109/iccisci.2012.6297291.

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

Wang, Sujing, Stefan Andrei, Otilia Urbina, and Dorothy A. Sisk. "A Coding/Programming Academy for 6th-Grade Females to Increase Knowledge and Interest in Computer Science." In 2019 IEEE Frontiers in Education Conference (FIE). IEEE, 2019. http://dx.doi.org/10.1109/fie43999.2019.9028578.

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

Zhou, Feng, and Yuanqing Lin. "Fine-Grained Image Classification by Exploring Bipartite-Graph Labels." In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2016. http://dx.doi.org/10.1109/cvpr.2016.127.

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

Petelin, Stojan, Marko Perkovic, Peter Vidmar, and Katja Petelin. "Ship’s Engine Room Fire Modelling." In International Joint Power Generation Conference collocated with TurboExpo 2003. ASMEDC, 2003. http://dx.doi.org/10.1115/ijpgc2003-40176.

Full text
Abstract:
When traffic accidents occur, transport systems can result in irreparable negative impacts on people as well as the environment. In maritime transport unexpected fire in the ship’s engine room represents a grave risk. Because such accidents are very often difficult to prevent, modelling of fire propagation bears a vital significance for setting up preventive measures and safety systems, whose task is the suppression of fire danger. The paper describes the CFAST computer model (Building and Fire Research Laboratory - National Institute of Standards and Technology), whose purpose is to solve the problem of fire propagation in a complex multi-compartment environment. In our example it was used in a concrete ship’s engine room, with a fire starting in the ship’s main propulsion engine. The application includes all elements that can be damaged in case of fire at different ventilation conditions of the ship’s engine room. By means of simulation, the analysis and presentation of physical parameters working upon exposed engine components was made.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Shizhe, Yida Zhao, Qin Jin, and Qi Wu. "Fine-Grained Video-Text Retrieval With Hierarchical Graph Reasoning." In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2020. http://dx.doi.org/10.1109/cvpr42600.2020.01065.

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

Zeng, Heming, Chi Zhang, Chentao Wu, Gen Yang, Jie Li, Guangtao Xue, and Minyi Guo. "FAGR: An Efficient File-aware Graph Recovery Scheme for Erasure Coded Cloud Storage Systems." In 2020 IEEE 38th International Conference on Computer Design (ICCD). IEEE, 2020. http://dx.doi.org/10.1109/iccd50377.2020.00033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'GRAPE (Computer file)' for particular source types:
Journal articles Dissertations / Theses Books
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