Barua, R., Lee, W., Amarasinghe, S., and Agarwal, A. 2001. Compiler support for scalable and efficient memory systems. IEEE Trans. Computers 50, 11, 1234--1247.
Course Number: CMSC 199
Course Title: Undergraduate Seminar
Lecture: Section B1, 9-10 M, ICS LH3
Section C2, 10-11 M, ICS LH4
Joseph Anthony C. Hermocilla (email@example.com)
The aim of this course is to introduce students to the basic research methods in Computer Science.
At the end of this course the students should be able to:
The student will select a research paper to study from this list of journals.
The papers may be survey papers or full research papers. Students will have to write a review paper plus orally
present the research paper assigned on a designated date. All students in a section should read
the research paper to be presented and submit three (3) questions after the presentation. This ensures
that the students also read the other papers, not just the paper assigned to them. There will be two (2)
presenters each week which means that six (6) questions will be submitted by each student.
The due date of the deliverables(review paper, slides, and seminar announcement) for all students will be on Meeting #5. If a student failed to submit the deliverables, automatically he/she gets a U.
|S1[Gabilo]: A game-theoretic analysis of denial of service attacks in wireless random access||S1[Hernandez]: Demand-Aware Content Distribution on the Internet|
|S2[Punay]: Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas||S2[Felix]: HPC5: An efficient topology generation mechanism for Gnutella networks|
|S3[Adawe]: On parallel asset-liability management in life insurance: a forward risk-neutral approach||S3[Jimenez]: Adaptive Performance Management for SMS Systems|
|S4[De Leon]: A distortion-minimizing rate controller for wireless multimedia sensor networks||S4[Guiyab]:How much anonymity does network latency leak?|
|S5[Malabuyoc]: Hierarchical distributed data classification in wireless sensor networks||S5[Jusay]: Using mobile phones to determine transportation modes|
|S6[Serrano]: Ontology Based Approach for finding the similarity among questions in a distributed question bank scenario||S6[Desepeda]: Heartbeat of a nest: Using imagers as biological sensors|
|S7[Paje]: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees||S7[Vea]:A Computational Biology Database Digest: Data, Data Analysis, and Data Management|
|S8[Tye]: Bridging the semantic gap in multimedia emotion/mood recognition for ubiquitous computing environment||S8[Oliva]: An embedded audio–visual tracking and speech purification system on a dual-core processor platform|
|S9[Odsigue]: Enabling adaptive live streaming in P2P multipath networks||S9[Fontanilla]: Sensor Faults: Detection Methods and Prevalence in Real-World Datasets|
|S10[Liwanag]: On predictive models and user-drawn graphical passwords||S10[Lactuan]:Improving network lifetime with mobile wireless sensor networks|
|S11[Clabita]: NoiseSPY: A Real-Time Mobile Phone Platform for Urban Noise Monitoring and Mapping||S11[Rustia]: A survey of network virtualization|
|S12[Balandra]: A Graph Based Approach Toward Network Forensics Analysis||S12[Peralta]: Split-ballot voting: everlasting privacy with distributed trust|
|S13[Sebastian]: Automatic virtual machine configuration for database workloads||S13[Cano]:Statistical reliability for energy efficient data transport in wireless sensor networks|
|S14[Alejo]: ACAR: Adaptive Connectivity Aware Routing for Vehicular Ad Hoc Networks in City Scenarios||S14[Ajes]: A game-theoretic analysis of denial of service attacks in wireless random access|
|S15[Malazo]: The Feasibility of Navigation Algorithms on Smartphones using J2ME||S15[Mendoza]: Secure routing in wireless sensor networks: attacks and countermeasures|
|S16[Mangio]: Dynamic Power Saving Mechanism for 3G UMTS System||S16[Gertes]: Trends in the development of communication networks: Cognitive networks|
|S17[Reyes]:Scalable location-based security in wireless networks||S17[Obrador]: Wireless sensor networks for personal health monitoring: Issues and an implementation|
|S18[de la Vina]: Techcrafters and Makecrafters: A Comparison of Two Populations of Hackers||S18[Quitadio]: Using wireless sensor networks to support intelligent transportation systems|
|S19[Maximo]: Heartbeat of a nest: Using imagers as biological sensors||S19[Lagare]: Securing Medical Networks|
|S20[Tanada]: Reconstructing Social Interactions Using an unreliable Wireless Sensor Network (2010)||S20[Tolentino]: Robust and flexible Internet connectivity for mobile ad hoc networks|
|S21:||S21[Arnejo]: WISTA: A Wireless Telemedicine System for Disaster Patient Care|
|S22:||S22[Perez]: Usability and feasibility of PmEB: a mobile phone application for monitoring real time caloric balance|
|S23:||S23[Guerrero]: Thwarting E-mail Spam Laundering|
|S24:||S24[Ibay]: Improving Data Availability for Better Access Performance: A Study on Caching Scientific Data on Distributed Desktop Workstations|
|S25:||S25[Bien]: Quality of Service Networking for High Performance Grid Applications|
|1||06/07/10||(no meeting)||(no meeting)|
|2||06/14/10||(no meeting)||(no meeting)|
|3||06/21/10||Introduction/How to read research papers|
|4||06/28/10||How to write a review/Due date for selected paper|
|5||07/05/10||How to deliver a short talk/Due date for deliverables: Review Paper, Slides|
The student will get a grade of S if the following criteria are satisfied.
Attendance will be checked every meeting. University policy on attendance will be applied.
There will be a closed door policy, 15 minutes after start of class.
Students caught plagiarizing work of others will automatically get a grade of U for the course.
$Id: CMSC199-1st-Sem-2010.html 1745 2010-08-01 12:54:58Z jachermocilla $