10 주 실습강의 XML Visualization(2) 2009. 1 학기, 소프트웨어 설계 및 실험 ( Ⅰ )

Slides:



Advertisements
Similar presentations
Programming with OpenGL - Getting started - Hanyang University Han Jae-Hyek.
Advertisements

OpenGL Open a Win32 Console Application in Microsoft Visual C++.
CIP4 JDF APIs JDF Editor Elena Skobchenko
LINKED LIST, STACKS AND QUEUES Saras M Srivastava, PGT – Comp. Sc. Kendriya Vidyalaya TengaValley.
CS224W Recitation: A Tutorial of SNAP
CPSC 441 TUTORIAL – JANUARY 16, 2012 TA: MARYAM ELAHI INTRODUCTION TO C.
Visualization of Computer Networks By Richard Zschech Supervisors: Dr. Ken Hawick, Dr. Paul Coddington.
OPEN GL. Install GLUT Download package di sini Dari devcpp, buka Tools->PackageManager-
BEA WebLogic version Practice 장성봉
Whitebox Testing Fra: CS Fall Whitebox Testing AKA Structural, Basis Path Test Normally used at unit level Assumes errors at unit level are.
Exercise 2.
Course Introduction Bryce Boe 2013/06/25 CS24, Summer 2013 C.
Programming Paradigms Introduction. 6/15/2005 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved. L1:
Analysis of programs with pointers. Simple example What are the dependences in this program? Problem: just looking at variable names will not give you.
A really fairly simple guide to: mobile browser-based application development (part 1) Chris Greenhalgh G54UBI / Chris Greenhalgh
Lecture # 11 JavaScript Graphics. Scalable Vector Graphics (SVG) Scalable Vector Graphics (SVG), as the name implies, are - scalable (without pixelation):
 2001 Prentice Hall, Inc. All rights reserved. 1.
XML Namespaces Each schema file associated with a URL to uniquely identify where elements come from – Like packages in Java
4/17/2015Comp Sci 3461 XML_2 Ch. 7. 4/17/2015Comp Sci 3462 XML Vocabularies  MathML  An application to parse, render, and edit MathML: Amaya 
XML Namespaces Kanda Runapongsa Dept. of Computer Engineering Khon Kaen University.
Binghamton University CS-220 Spring 2015 Binghamton University CS-220 Spring 2015 Object Code.
Introduction to OpenCV Dr. Chung-Hao Chen Haole Guo Sep 2011.
Stack buffer overflow.
Gavin S Page OpenCV Tutorial Part I Using OpenCV with Microsoft Visual Studio.net November 2005.
Programming Review: Functions, pointers and strings.
Exercise 10 Review: pointers, strings and recursion.
7. Preflow-Push Demo. 2 Preflow-Push Algorithm s 2 1 t 10 2 G: 5 3 s 2 1 t G f :
© Copyright 2000, Julia Hartman 1 Scatterplot Output: Editing the Graph You can edit the output to display the entire variable label. Click inside the.
LAMAD Symbian Qt install and deploy Installing Qt SDK and deploying Qt applications.
Programming is instructing a computer to perform a task for you with the help of a programming language.
Library of Efficient Data types and Algorithms (LEDA)
SOAP 실전예제 Internet Computing KUT Youn-Hee Han.
LEDA A Library of Efficient Data-Types and Algorithms Presentation by Amitai Armon.
Introduction to GAIGS XML Scripting Integrating Algorithm Visualization into Computer Science Education Grand Valley State University June 13-16, 2006.
Java Programming: From Problem Analysis to Program Design, Second Edition1  Learn about basic GUI components.  Explore how the GUI components JFrame,
CITA 330 Section 6 XSLT. Transforming XML Documents to XHTML Documents XSLT is an XML dialect which is declared under namespace "
omegalib. VR system development Heterogeneous applications – Need custom software/library stack depending on scenario.
Module 3: Working with Components. Overview An Introduction to Key.NET Framework Development Technologies Creating a Simple.NET Framework Component Creating.
Simfo Marco Adelfio, Dan Bucatanschi, Bo Liu, Nick Violi.
Library of Efficient Data types and Algorithms (LEDA)
Slicer3 for developers – S.Pujol -1- National Alliance for Medical Image Computing Slicer3 Course for developers Sonia Pujol, Ph.D. Surgical Planning Laboratory.
ARToolKit Settings The department of Computer Engineering Shin ho hwan.
9 주 실습강의 XML Visualization(1) 학기, 소프트웨어 설계 및 실험 ( Ⅰ )
OPERATING SYSTEMS 1 - HARDWARE PIETER HARTEL 1. Hardware 2.
1 9/6/05CS360 Windows Programming CS360 Windows Programming.
July Doxygen A Code Documentation System Doxygen generates documentation directly from the structure and comments in the code –Browsable HTML documentation.
Java Programming: From Problem Analysis to Program Design, Second Edition1 Lecture 5 Objectives  Learn about basic GUI components.  Explore how the GUI.
CS415 C++ Programming Takamitsu Kawai x4212 G11 CERC building WV Virtual Environments Lab West Virginia University.
Documenting a function. Documenting a function definition We have a template for information that we need you to put at the top of each function - if.
Diagrammer Takes a GraphML file and displays a diagram from it The following are the meaningful concepts for the diagrammer: – Graph (the graph being displayed)
Querying Large XML Data Hsuan-Heng, Wu Shawn Ju. XML V.S. HTML XML is designed to describe data XML don’t use predefined tags XML is used to exchange.
7 Finding Bridge in a Graph. What is a bridge ? A C D B F G E.
Eunis 2002 Grafos 2001 New Technologies for Teaching and Learning António Roberto Ana Sofia Lino Escola Superior de Gestão de Santarém Portugal A Software.
아주대학교 LifecareScienceLAB Android Seminar 2 nd class Android Software Development 2011/04/13 – p.m. 06:00 – 팔달관 409 호 아주대학교.
By Mackenzie.  Defining Attributes:  6 flat faces  8 vertices  12 edges  Stacks and slides  Shape of faces is a square.
Analog IC design 7주차 Dec.4th Multimedia Lab..
Lecture No.05 Data Structures Dr. Sohail Aslam.  Josephus Problem #include "CList.cpp" void main(int argc, char *argv[]) { CList list; int i, N=10, M=3;
The Overview Panel on Gephi 0.9.1
OpenCV Tutorial Part I Using OpenCV with Microsoft Visual Studio .net November 2005 Gavin S Page
Command Line Arguments
Introduction to OpenGL
Stack buffer overflow.
Code::Block vs Visual C++
Search Exercise Search Tree? Solution (Breadth First Search)?
7. Preflow-Push Demo.
The Overview Panel on Gephi 0.9.1
How Memory Leaks Work with Memory Diagram
C++, Sorting, Convex Hull
SPL – PS1 Introduction to C++.
Introduction to OpenGL Programming
Presentation transcript:

10 주 실습강의 XML Visualization(2) 학기, 소프트웨어 설계 및 실험 ( Ⅰ )

Artificial Intelligence Laboratory 실습목표

Artificial Intelligence Laboratory The Confidence Man Output ElementStart=book AttributeQName=genre AttributeValue=novel ElementStart=title TextValue=The Confidence Man ElementEnd=title ElementEnd=book

Artificial Intelligence Laboratory LEDA ?  Library  C++ 클래스 라이브러리로 구현되었음.  많은 양의 data type(stack, heap, graph,…), 알고리즘 제 공  사용하기 편리  빠른 속도, 안정성  Manual, Reference 제공  상용 ( 학습용으로 free edition 제공 )

Artificial Intelligence Laboratory LEDA 사용법  Borame.cs.pusan.ac.kr 에서 download  압축해제  프로젝트 생성  프로젝트 속성  C/C++ -> 일반 -> 추가 포함 디렉토리  \incl 추가  C/C++ -> 전처리기 -> 전처리기 정의  ;LEDA_DLL 추가  링커 -> 일반 -> 추가 라이브러리 디렉토리  추가  링커 -> 입력 -> 추가 종속성  libGeoW_mdd_dll.lib  Leda_mdd.lib 추가  파일 복사 leda_mdd.dll

Artificial Intelligence Laboratory LEDA  LEDA Test  Main.cpp 추가  Leda demo 에 있는거 이것 저것 실행시켜본다. 

Artificial Intelligence Laboratory LEDA graphwin #include using namespace leda; int main(int argc, char * argv){ GraphWin gw; gw.display(window::center, window::center); gw.edit(); return 0; }

Artificial Intelligence Laboratory LEDA graphwin

Artificial Intelligence Laboratory LEDA graphwin  Graph  node, edge 의 집합  GraphWin  그래프의 생성, 디스플레이, 조작 및 에니메이션  node, edge 의 추가 및 디스플레이 설정 가능 

Artificial Intelligence Laboratory LEDA graphwin #include using namespace leda; int main(int argc, char * argv){ GraphWin gw; gw.display(window::center, window::center); gw.edit(); return 0; }

Artificial Intelligence Laboratory LEDA graphwin #include using namespace leda; int main(int argc, char * argv){ GraphWin gw; gw.display(window::center, window::center); gw.new_node(point(50,50)); gw.edit(); return 0; }

Artificial Intelligence Laboratory LEDA graphwin node n1 = nil; node n2 = nil; n1 = gw.new_node(point(50,50)); n2 = gw.new_node(point(100, 100)); gw.new_edge(n1, n2);

Artificial Intelligence Laboratory LEDA graphwin node n1; list nodeList; gw.set_node_width(90); n1 = gw.new_node(point(50,50)); gw.set_label(n1, "first node"); gw.set_shape(n1, rectangle_node); nodeList.push_back(n1); n1 = gw.new_node(point(150,150)); gw.set_label(n1, "second node"); gw.new_edge(nodeList.back(), n1);

Artificial Intelligence Laboratory 구현방법  startElement event 발생시 해당 element 의 이름으로 그 래프의 노드 추가  Attributes 가 있으면 해당 element 에 추가

Artificial Intelligence Laboratory