Seminar on Internet Technologies (Summer 2020) - Revision history

Sding: /* Schedule */

2020-06-28T09:24:45Z

Schedule

← Older revision		Revision as of 11:24, 28 June 2020
Line 38:		Line 38:
	* There will be no introduction meeting. Please read the introduction slides and contact the teaching assistants if you have any further questions.		* There will be no introduction meeting. Please read the introduction slides and contact the teaching assistants if you have any further questions.
	* '''June. 20''' : Deadline for registration (Tentative)		* '''June. 20''' : Deadline for registration (Tentative)
	* '''July. 2 and July. 3, 13:00-17:00''': Presentations, ~~highly likely~~ through '''Zoom '''~~instead of a face-to-face presentation in the IFI Building, Room 1.101. This time may be postponed. We will update it in due time, please keep checking the site to stay up to date.~~		* '''July. 2 and July. 3, 10:00-12:00''': Presentations, through '''Zoom '''
	* '''Sep. 30, 2019, 23:59''': Deadline for submission of the report (should be sent to the topic adviser through E-mail!)		* '''Sep. 30, 2019, 23:59''': Deadline for submission of the report (should be sent to the topic adviser through E-mail!)

Sding: /* Details */

2020-05-12T14:47:02Z

Details

← Older revision		Revision as of 16:47, 12 May 2020
Line 9:		Line 9:
	\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]		\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]
	}}		}}
	{{~~[Announcement\|~~Note: Please register the examination on Flexnow [https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung] before June 25th 2020		{{'''Note: Please register the examination on Flexnow [https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung] before June 25th 2020
	]}}		'''}}

	==Course description==		==Course description==

Sding: /* Details */

2020-05-12T14:46:44Z

Details

← Older revision		Revision as of 16:46, 12 May 2020
Line 10:		Line 10:
	}}		}}
	{{[Announcement\|Note: Please register the examination on Flexnow [https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung] before June 25th 2020		{{[Announcement\|Note: Please register the examination on Flexnow [https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung] before June 25th 2020
	}}		]}}

	==Course description==		==Course description==

Sding: /* Details */

2020-05-12T14:46:31Z

Details

← Older revision		Revision as of 16:46, 12 May 2020
Line 9:		Line 9:
	\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]		\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]
	}}		}}
	{{Announcement\|Note: Please register the examination ~~before June 25th 2020. (~~https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung)		{{[Announcement\|Note: Please register the examination on Flexnow [https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung] before June 25th 2020
	}}		}}

Sding: /* Details */

2020-05-12T14:45:19Z

Details

← Older revision		Revision as of 16:45, 12 May 2020
Line 9:		Line 9:
	\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]		\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]
	}}		}}
	{{Announcement\|Note: ~~'''~~ Please register the examination before June 25th 2020. https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung~~'''~~		{{Announcement\|Note: Please register the examination before June 25th 2020. (https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung)
	}}		}}

Sding: /* Details */

2020-05-12T14:44:48Z

Details

← Older revision		Revision as of 16:44, 12 May 2020
Line 9:		Line 9:
	\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]		\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]
	}}		}}
	{{Announcement\|Note: There will be no introduction lecture. Please refer to the attached Introduction slides and this page for all the information regarding the course and contact the teaching assistants via E-mail for any further questions.''' Please register the ~~course~~ before 04.20.'''		{{Announcement\|Note: ''' Please register the examination before June 25th 2020. https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung'''
	}}		}}

Yyuan: /* Topics */

2020-05-06T20:15:57Z

Topics

← Older revision		Revision as of 22:15, 6 May 2020
Line 68:		Line 68:
	\| [Yali Yuan, yali.yuan@cs.informatik.uni-goettingen.de]		\| [Yali Yuan, yali.yuan@cs.informatik.uni-goettingen.de]
	\| [https://github.com/ShuaiBai623/AI-City-Anomaly-Detection]		\| [https://github.com/ShuaiBai623/AI-City-Anomaly-Detection]
			\|-
			\| Multimodal Deep Learning for Image and Text Datasets (Grigor Davtyan)
			\| Learning semantic correspondence between image and text is significant as it bridges the semantic gap between vision and language. This course requires students to learn efficient multimodal deep learning for image and text datasets.
			\| Programming skills. Interested in this topic, willing to follow the advisor's guidance, patience and time for reading multiple papers
			\| [Yali Yuan, yali.yuan@cs.informatik.uni-goettingen.de]
			\| [https://dl.acm.org/doi/abs/10.1145/3343031.3350869]
	\|-		\|-
	\| Failure recovery from the breakpoint in service function chain		\| Failure recovery from the breakpoint in service function chain

Sding: /* Details */

2020-05-06T10:20:30Z

Details

← Older revision		Revision as of 12:20, 6 May 2020
Line 7:		Line 7:
	\|ta=[http://www.net.informatik.uni-goettingen.de/people/shichang_ding Shichang Ding] and [http://www.net.informatik.uni-goettingen.de/people/sripriya%20srikant_adhatarao, Sripriya Srikant Adhatarao]		\|ta=[http://www.net.informatik.uni-goettingen.de/people/shichang_ding Shichang Ding] and [http://www.net.informatik.uni-goettingen.de/people/sripriya%20srikant_adhatarao, Sripriya Srikant Adhatarao]
	\|time= '''Please read this introduction slide (https://drive.google.com/open?id=1jNZ-k8WSu4tP6bMHvY73FBoUXdrXNLql). If there is any question, please contact teaching assistants.'''		\|time= '''Please read this introduction slide (https://drive.google.com/open?id=1jNZ-k8WSu4tP6bMHvY73FBoUXdrXNLql). If there is any question, please contact teaching assistants.'''
	\|univz=[https://univz.uni-goettingen.de/qisserver/rds?state=verpublish&status=init&vmfile=no&publishid=~~251477~~&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung~~&k_semester.semid=20201&idcol=k_semester.semid&idval=20201&getglobal=semester~~]		\|univz=[https://univz.uni-goettingen.de/qisserver//rds?state=verpublish&status=init&vmfile=no&publishid=262017&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung]
	}}		}}
	{{Announcement\|Note: There will be no introduction lecture. Please refer to the attached Introduction slides and this page for all the information regarding the course and contact the teaching assistants via E-mail for any further questions.''' Please register the course before 04.20.'''		{{Announcement\|Note: There will be no introduction lecture. Please refer to the attached Introduction slides and this page for all the information regarding the course and contact the teaching assistants via E-mail for any further questions.''' Please register the course before 04.20.'''

Yyuan: /* Topics */

2020-04-28T13:22:58Z

Topics

← Older revision		Revision as of 15:22, 28 April 2020
Line 87:		Line 87:
	\| [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf]		\| [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf]
	\|-		\|-
	\| Learning Combinatorial Optimization Algorithms ~~over Graphs~~ (Ismot Jerin)		\| Learning Combinatorial Optimization Algorithms on VRP problem (Ismot Jerin)
	\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be solved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new Vihecl Routing Problem.		\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be solved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new Vihecl Routing Problem.
	\| The student should be familiar with TSP, Matching, and Integer linear programming		\| The student should be familiar with TSP, Matching, and Integer linear programming

Yyuan: /* Topics */

2020-04-28T13:21:36Z

Topics

← Older revision		Revision as of 15:21, 28 April 2020
Line 75:		Line 75:
	\|		\|
	\|-		\|-
	\| Learning Combinatorial Optimization Algorithms over Graphs ~~(Ismot Jerin)~~		\| Learning Combinatorial Optimization Algorithms over Graphs
	\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be soloved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new assignment problem		\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be soloved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new assignment problem
	\| The student should be familiar with machine learning and Integer linear programming		\| The student should be familiar with machine learning and Integer linear programming
Line 87:		Line 87:
	\| [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf]		\| [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf]
	\|-		\|-
	\| Learning Combinatorial Optimization Algorithms over Graphs		\| Learning Combinatorial Optimization Algorithms over Graphs (Ismot Jerin)
	\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be solved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new Vihecl Routing Problem.		\| There are many NP-hard problems about graph. However, these NP-hard problems cannot be solved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new Vihecl Routing Problem.
	\| The student should be familiar with TSP, Matching, and Integer linear programming		\| The student should be familiar with TSP, Matching, and Integer linear programming