To see the other types of publications on this topic, follow the link: GRAPE (Computer file).
Dissertations / Theses on the topic 'GRAPE (Computer file)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 19 dissertations / theses for your research 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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Islam, Mustafa R. "A hypertext graph theory reference system." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879844.
Full textAbstract:
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
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 textAbstract:
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
3
Vemuri, Suresh P. "Jedit : a graph editor in Java." Virtual Press, 1996. http://liblink.bsu.edu/uhtbin/catkey/1036185.
Full textAbstract:
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
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 textAbstract:
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
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 textAbstract:
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
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 textAbstract:
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
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 textAbstract:
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
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 textAbstract:
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
9
Hsieh, Chao-Ho. "Implementation of graph manipulation under X Window system environment." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834634.
Full textAbstract:
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
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
11
Srinivaasan, Gayathri. "Malicious Entity Categorization using Graph modelling." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-202980.
Full textAbstract:
Today, malware authors not only write malicious software but also employ obfuscation, polymorphism, packing and endless such evasive techniques to escape detection by Anti-Virus Products (AVP). Besides the individual behavior of malware, the relations that exist among them play an important role for improving malware detection. This work aims to enable malware analysts at F-Secure Labs to explore various such relationships between malicious URLs and file samples in addition to their individual behavior and activity. The current detection methods at F-Secure Labs analyze unknown URLs and file samples independently without taking into account the correlations that might exist between them. Such traditional classification methods perform well but are not efficient at identifying complex multi-stage malware that hide their activity. The interactions between malware may include any type of network activity, dropping, downloading, etc. For instance, an unknown downloader that connects to a malicious website which in turn drops a malicious payload, should indeed be blacklisted. Such analysis can help block the malware infection at its source and also comprehend the whole infection chain. The outcome of this proof-of-concept study is a system that detects new malware using graph modelling to infer their relationship to known malware as part of the malware classification services at F-Secure.Idag, skadliga program inte bara skriva skadlig programvara men också använda förvirring, polymorfism, packning och ändlösa sådana undan tekniker för att fly detektering av antivirusprodukter (AVP). Förutom individens beteende av skadlig kod, de relationer som finns mellan dem spelar en viktig roll för att förbättra detektering av skadlig kod. Detta arbete syftar till att ge skadliga analytiker på F-Secure Labs att utforska olika sådana relationer mellan skadliga URL: er och fil prover i Förutom deras individuella beteende och aktivitet. De aktuella detektionsmetoder på F-Secure Labs analysera okända webbadresser och fil prover oberoende utan med beaktande av de korrelationer som kan finnas mellan dem. Sådan traditionella klassificeringsmetoder fungerar bra men är inte effektiva på att identifiera komplexa flerstegs skadlig kod som döljer sin aktivitet. Interaktioner mellan malware kan innefatta någon typ av nätverksaktivitet, släppa, nedladdning, etc. Till exempel, en okänd loader som ansluter till en skadlig webbplats som i sin tur släpper en skadlig nyttolast, bör verkligen vara svartlistad. En sådan analys kan hjälpa till att blockera malware infektion vid källan och även förstå hela infektion kedja. Resultatet av denna proof-of-concept studien är ett system som upptäcker ny skadlig kod med hjälp av diagram modellering för att sluta deras förhållande till kända skadliga program som en del av de skadliga klassificerings tjänster på F-Secure.
12
Leonard, Jonathan Thomas. "A comparison and contrast of fifth-grade students' perceptions of HyperCard classroom environments and non-HyperCard classroom environments." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/862269.
Full textAbstract:
The purpose of this study was to describe students' perceptions of their classroom in which HyperCard is used and to compare it to a non-HyperCard environment in which no HyperCard is or has been used. The participants were 67 fifth-grade students from four intact classrooms from the same school in a large, urban, midwestern city.A non-randomized control-group versus treatment group design was used. In this design preassembled groups were selected and given an environmental perception instrument and then compared for similarity on the five dependent measures: cohesiveness, friction, difficulty, satisfaction, and competitiveness.Specifically, the statistical design was a two factor MANOVA examining each of two levels (classroom type and gender), and five dependent measures corresponding to the five scales of the Mv Class Inventory, (MCI). Eleven null hypotheses were tested at the .05 level of significance.In this study, students' perceptions of the non-HyperCard utilizing classroom learning environments were compared to classroom environments utilizing HyperCard. Four fifth-grade classrooms were examined: two classrooms utilizing HyperCard and two non-HyperCard classrooms.The following results were reported:1. Multivariate tests of significance for Sex by Group effect found no interaction (p. = .274) Multivariate Analysis (MANOVA) of the differences between boys and girls as measured jointly on the subscales of the found no significant differences (with F [5,59] = .91, p = .483).2. Multivariate tests of the differences between groups, as measured jointly on the subscales of the MCI, found significant differences (with F [5,59] = 5.34, p - .000).The researcher concluded that HyperCard classrooms present new and more difficult challenges that are not addressed in similar and familiar ways.Recommendations for further research included longitudinal studies that would ascertain how students' perceptions of their classroom environment change over a period of time. Additional research might examine the effects a more time-intensive HyperCard program has on students' perceptions of their environment.Department of Elementary Education
13
Lombard, Pierre. "NFSP : Une solution de stockage distribué pour architectures grande échelle." Phd thesis, Grenoble INPG, 2003. http://tel.archives-ouvertes.fr/tel-00004373.
Full textAbstract:
Le stockage de données utilise souvent des systèmes se caractérisant par une grande intrusivité : ceux-ci requièrent de nombreuses modifications logicielles, voire parfois même matérielles, pour être déployés et utilisés. Notre solution consiste à offrir un stockage distribué logiciel pour architectures de type grappes de nature faiblement intrusive dans la mesure où le protocole standard omni-présent du monde Unix, NFS, est utilisé. L'approche retenue se caractérise par une séparation de la gestion des méta-données et des données permettant ainsi de répartir la charge d'entrées/sorties et d'obtenir de meilleures performances. L'ajout de redondance permet aussi de disposer à moindre coût de stockage distribué encore plus performant et plus sûr. Le développement d'outils de transfert efficace inter-grappes et d'un système distribué de fichiers à plus grande échelle a permis de valider notre approche.
14
Gondran, Alexandre. "Modélisation et optimisation de la planification des réseaux locaux sans fil." Phd thesis, Université de Technologie de Belfort-Montbéliard, 2008. http://tel.archives-ouvertes.fr/tel-00416060.
Full textAbstract:
Le problème de planification de réseaux WLAN consiste d'une part à positionner et à paramétrer des antennes dans un bâtiment et d'autre part à leur affecter une fréquence afin d'offrir aux clients un accès sans fil au réseau local. Le réseau ainsi construit doit répondre à des critères de couverture et de qualité de service, tout en minimisant le coût financier.Notre modélisation est basée sur le calcul du débit réel offert en chaque point de demande de service du réseau. Nous montrons que ce critère de débit réel permet une modélisation complète de la qualité de service car il unifie les critères habituels de couverture, de gestion des interférences et de capacité.
Notre optimisation traite simultanément le problème de placement des points d'accès et le problème d'affectation de fréquences par un algorithme à Voisinages Variables Aléatoires VVA : à chaque itération de cette recherche locale le type de voisinage est tiré au hasard. Cet algorithme est très modulaire et permet facilement de combiner les deux sous problèmes (placement et affection).
Ces travaux ont donné lieu à des collaborations et partenariats industriels : logiciel de planification globale des WLAN avec Orange Labs et solutions de planification séquentielle avec la start-up Trinaps.
Enfin nous approfondissons la modélisation du problème en explicitant les liens entre le calcul du débit réel et les SINR. Dans une première étape, nous montrons que les contraintes de seuil sur les SINR induisent un problème de T-coloration de graphe (condition nécessaire). Pour obtenir une équivalence rendant compte des interférences multiples, une généralisation du problème de T-coloration pour les hypergraphes est introduite. Dans une seconde étape, nous définissons un algorithme déduisant les seuils de SINR à partir des contraintes sur les débits réels. Cette nouvelle modélisation est la base de nos développements futurs.
15
Hauspie, Michaël. "Contributions à l'étude des gestionnaires de services distribués dans les réseaux ad hoc." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2005. http://tel.archives-ouvertes.fr/tel-00656359.
Full textAbstract:
Les réseaux ad hoc sont des réseaux distribués, auto-organisés ne nécessitant pas d'infrastructure. Les entités formant un tel réseau doivent collaborer afin d'assurer le bon fonctionnement des services réseaux, tel que le routage. Dans un tel environnement, de nombreux algorithmes développés pour le monde filaire ne peuvent être adaptés de façon naïve sans entraîner une congestion importante du réseau qui va réduire son efficacité. Notre travail de thèse se penche sur l'étude de la gestion de services. En effet, sans application, le développement d'une architecture comme les réseaux ad hoc est inutile. La gestion de services consiste à fournir tout les moyens possibles pour faciliter et rendre fiable l'utilisation d'applications distribuées. Nos travaux contribuent à l'étude de deux points précis de la gestion de services. Premièrement, nous fournissons un algorithme permettant de répartir efficacement une information dans le réseau en sélectionnant certains objets du réseau pour être des réplicats de l'information. Cet algorithme peut alors être utilisé pour publier les informations relatives à un service afin de permettre sa recherche. Deuxièmement, nous avons étudié la prédiction de déconnexion entrainée par la mobilité des noeuds. Nous proposons trois solutions basées sur la recherche d'ensemble de chemins disjoints, la recherche de liens critiques et la recherche de noeuds critiques. Les recherches que nous proposons sont entièrement réalisées à partir d'informations locales. Les résultats obtenus fournissent une base au développement d'un gestionnaire de services distribués. De plus, certains de nos algorithmes (comme la recherche d'ensembles de chemins disjoints) peuvent être réutilisés dans d'autres applications, comme le routage QoS multi-chemins.
16
Gallard, Pascal. "Conception d'un service de communication pour systèmes d'exploitation distribués pour grappes de calculateurs : mise en oeuvre dans le système à image unique Kerrighed." Phd thesis, Université Rennes 1, 2004. http://tel.archives-ouvertes.fr/tel-00011152.
Full textAbstract:
Dans la ligné des réseaux de stations de travail, les grappes de calculateurs représentent une alternative attrayante, en terme de performance et de coût, comparativement aux machines parallèles traditionnelles, pour l'exécution d'applications parallèles de calcul à haute performance. Une grappe de calculateurs est constituée d'un ensemble de noeuds interconnectés par un réseau dédié à haute performance. Les systèmes à image unique (Single System Image -- SSI) forment une classe de logiciel offrant aux utilisateurs et programmeurs d'une grappe de calculateurs, l'illusion d'une machine unique. Un SSI peut être conçu à différents niveaux (intergiciel, système d'exploitation) selon le degré d'exigence quant à laréutilisation sans modification de modèles de programmation et d'applications existants. Dans notre contexte, les applications visées sont de type MPI ou OpenMP. Comme pour tout système distribué, le système d'interconnexion des noeuds de la grappe se trouve au coeur des performances globales de la grappe et des SSIs.
Les travaux présentés dans cette thèse portent sur la conception d'un système de communication dédié aux systèmes d'exploitation distribués pour grappes. Ces travaux s'inscrivent dans le cadre de la conception et la réalisation d'un SSI pour l'exécution d'applications haute performance sur grappe de calculateurs.
Notre première contribution se situe dans la conception d'un modèle de communication adapté aux communications internes aux services systèmes distribués qui constituent le SSI. En effet, de la performance des communications dépendent les performances globales de la grappe. Les transactions de communication permettent (i) de décrire un message lors de sa création, (ii) d'acheminer efficacement le message en
fontion des ressources disponibles, et (iii) de délivrer et traiter le
message au plus tôt sur le noeud destinataire.
Notre seconde contribution correspond à la conception d'un support au déplacement de processus communiquant par flux de données (socket, pipe, etc.). En effet, au sein d'un SSI, les processus peuvent être déplacés en cours d'exécution par un ordonnanceur global. Les flux dynamiques permettent le déplacement d'une extrémité de communication sans dégradation des performances.
Nos propositions ont été mises en oeuvre dans le prototype de SSI Kerrighed, conçu au sein du projet INRIA PARIS de l'IRISA. Ce prototype nous a permis d'évaluer le système de communication proposé. Nous avons montré une réactivité accrue des services systémes distribués ainsi qu'une absence de dégradation des performances des applications communiquant par messages (en particulier MPI) aprés déplacement d'un processus. L'ensemble de ce travail est distribué sous licence GPL en tant que partie de Kerrighed et est disponible à l'adresse: http://www.kerrighed.org.
17
Penn, Irmgard. "A social studies computer simulation : alternative treatments with grade five students." 1987. http://hdl.handle.net/1993/9439.
Full text
18
Zhong, Peilin. "New Primitives for Tackling Graph Problems and Their Applications in Parallel Computing." Thesis, 2021. https://doi.org/10.7916/d8-pnyz-ck91.
Full textAbstract:
We study fundamental graph problems under parallel computing models. In particular, we consider two parallel computing models: Parallel Random Access Machine (PRAM) and Massively Parallel Computation (MPC). The PRAM model is a classic model of parallel computation. The efficiency of a PRAM algorithm is measured by its parallel time and the number of processors needed to achieve the parallel time. The MPC model is an abstraction of modern massive parallel computing systems such as MapReduce, Hadoop and Spark. The MPC model captures well coarse-grained computation on large data --- data is distributed to processors, each of which has a sublinear (in the input data) amount of local memory and we alternate between rounds of computation and rounds of communication, where each machine can communicate an amount of data as large as the size of its memory. We usually desire fully scalable MPC algorithms, i.e., algorithms that can work for any local memory size. The efficiency of a fully scalable MPC algorithm is measured by its parallel time and the total space usage (the local memory size times the number of machines).
Consider an 𝑛-vertex 𝑚-edge undirected graph 𝐺 (either weighted or unweighted) with diameter 𝐷 (the largest diameter of its connected components). Let 𝑁=𝑚+𝑛 denote the size of 𝐺. We present a series of efficient (randomized) parallel graph algorithms with theoretical guarantees. Several results are listed as follows:
1) Fully scalable MPC algorithms for graph connectivity and spanning forest using 𝑂(𝑁) total space and 𝑂(log 𝐷loglog_{𝑁/𝑛} 𝑛) parallel time.
2) Fully scalable MPC algorithms for 2-edge and 2-vertex connectivity using 𝑂(𝑁) total space where 2-edge connectivity algorithm needs 𝑂(log 𝐷loglog_{𝑁/𝑛} 𝑛) parallel time, and 2-vertex connectivity algorithm needs 𝑂(log 𝐷⸱log²log_{𝑁/𝑛} n+\log D'⸱loglog_{𝑁/𝑛} 𝑛) parallel time. Here 𝐷' denotes the bi-diameter of 𝐺.
3) PRAM algorithms for graph connectivity and spanning forest using 𝑂(𝑁) processors and 𝑂(log 𝐷loglog_{𝑁/𝑛} 𝑛) parallel time.
4) PRAM algorithms for (1 + 𝜖)-approximate shortest path and (1 + 𝜖)-approximate uncapacitated minimum cost flow using 𝑂(𝑁) processors and poly(log 𝑛) parallel time.
These algorithms are built on a series of new graph algorithmic primitives which may be of independent interests.
19
Krčah, Marcel. "Segmentation of Bones in 3D CT Images." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313946.
Full textAbstract:
Accurate and automatic segmentation techniques that do not require any explicit prior model have been of high interest in the medical community. We propose a fully-automatic method for segmenting the femur from 3D Computed Tomography scans, based on the graph-cut segmentation framework and the bone boundary enhancement filter analyzing second-order local structures. The presented algorithm is evaluated in large-scale experiments, conducted on 197 CT volumes, and compared to other three automatic bone segmentation methods. Out of the four tested approaches, the proposed algorithm achieved most accurate results and segmented the femur correctly in 81% of the cases.