Group Photo, 3rd EASIAM Conference, Xiamen, China

Photo Caption: Participants of the 3rd East Asia SIAM (Society for Industrial and Applied Mathematics). Photo taken on November 2, 2007 in front of the Main Building of Xiamen University, China.

Note: Click on the photo to view a larger image.

Trip to Xiamen, China (Day 3)

Photo Caption: Members of the Executive Committee of EASIAM during the Business Meeting held on November 3, 2007 in Xiamen, University, Xiamen, China.


Today (November 3, 2007) is the second day of the 3rd East Asia SIAM Conference in Xiamen, China being held at Xiamen University from November 2 - 5, 2007.

.



The featured speakers are as follows:

• SIAM Keynote Lecture: Dr. Andy Wathen (Oxford University), "Preconditioning And The Iterative Solution Of PDE Problems"



• Dr. Pingwen Zhang, "Moment Closure Approximation Of Kinetic Theories For Complex Fluids"



• Dr. Masahisa Tabata, "Numerical Simulations Of Multi-Fluid Flow Problems By An Energy-Stable Finite Element Scheme"



• Dr. Xia-qing Jin, "Numerical Optimal Preconditioners And Bottcher's Conjecture"

In the afternoon, there were three parallel sessions. One of the sessions was the EASIAM Business Meeting. As a member of the EASIAM Executive Committee I attended the EASIAM Business Meeting.

The following are the current members of the EASIAM Executive Committee:

Zhong-Ci Shi (Chair)
Chinese Academy of Sciences (CAS), China
Pham Ky Anh
Vietnam National University
Raymond Chan
The Chinese University of Hong Kong
I-Liang Chern
National Taiwan University
Victor D. Didenko
Universitii Brunei Darussalam
Roger Hosking
Universitii Brunei Darussalam
Nguyen Van Huu
Hanoi University of Science
Xiao-qing Jin
University of Macau
Hyung-Chun Lee
Ajou University
Ping Lin
National University of Singapore
Tom Mitsui
Nagoya University
Michael Ng
Hong Kong Baptist University
Hisashi Okamoto
Kyoto University
Mohd Omar
University of Malaysia
Abdul Rahni
Universiti Sains Malaysia
Rafael P. Saldana
Ateneo de Manila University
Dongwoo Sheen
Seoul National University
Zuowei Shen
National University of Singapore
Haiwei Sun
University of Macau
Tao Tang
Hong Kong Baptist University

The following items were discussed by the EASIAM Executive Committee during the business meeting:

1. EASIAM Meeting 2008 (Dates and Venue)

2. Election schedule of Chairman, Vice-Chairman and Secretary

3. Rule of EASIAM Student Paper Competition

In the evening, the conference participants had a banquet in a seafood restaurant in downtown Xiamen. One of the highlights of the banquet is the announcement of the winners of the EASIAM Best Student Paper Award.

Below are the winners:

First Place: Shipeng Mao, "Error Estimates For Degenerate Quadrilateral Finite Elements"

Second Place: Yu-Mei Huang, "On Preconditioned Iterative Methods For Burgers Equations"

Third Place:

Alexander Shapeev, "Application of Combined Spectral And Finite Difference Method To Unsteady Viscous Flow"

and Chien-Hong Cho, "On The Finite Difference Approximation For A Parabolic Blow-Up Problems"

CONGRATULATIONS TO ALL WINNERS!

Cheers,

Raffy
Xiamen, China
11/3/07

Trip to Xiamen, China (Day 2)

I arrived at the Xiamen Gaoqi Airport at 4:30 p.m. yesterday (Nov. 1, 2007). I was met at the airport by representatives of the 3rd EASIAM local organizing committee. The trip (by car) from the airport to Xiamen university took around 30 minutes.

My local hosts brought me to the Xiamen University International Academic Exchange Center (which is actually a hotel) located inside the main campus of Xiamen University. When I have settled in my room, I contacted my student, Timothy James "TJ" Yusun who arrived earlier at Xiamen via Philippine Airlines. TJ and I had dinner together with other 3rd East Asia SIAM (EASIAM) conference participants at the hotel's restaurant.

Today (November 2, 2007) was the first day of the Conference. It was held at the main building of the university. Xiamen University has a very impressive campus: it has a small lake surrounded by trees and buildings. It is near hills and the sea.

PROGRAM, Day 1, November 2.

Dr. Zhong-ci Shi of the Chinese Academy of Sciences and Chairman of EASIAM gave the Welcome Remarks at 8:30 a.m. He introduced the SIAM Keynote Lecturer, Dr. Gene Golub of Stanford University (USA). Dr. Golub gave a talk on "Inner/Outer Iterations For Solving Linear Systems Of Equations."

The second speaker was Dr. Yoshimasa Nakamura of Kyoto University (Japan) who gave a talk on "mdLVs Algorithm For Computing Matrix Singular Values."

We had a group picture taking and coffee break from 10:25 to 10:50 a.m.

From 10:50 a.m. to 12:20 p.m. two invited speakers presented their talks: Dr. Dongwoo Sheen Professor of Mathematics at Seoul National University (South Korea) and Vice-Chair of EASIAM gave a talk on "Numerical Laplace Inversion With Applications To Evolution Problems." Dr. Sheen's lecture was followed by the talk of Dr. Zuowei Shen, Professor of Mathematics at the National University of Singapore, who gave a lecture on "A Unified Tight Frame Approach For Missing Data Recovery in Images."

At 12:20 p.m. we had a lunch break. The Lunch was at the restaurant of the university hotel, a short walking distance from the Main Building.

The afternoon session started at 2:00 p.m. There were three parallel sessions: One session was the presentations of the candidates for EASIAM Best Student Paper Award, namely: Alexander Shapeev ("Application of Combined Spectral And Finite Difference Method To Unsteady Viscous Flow In Canonical Domains"), Chien-Hong Cho ("On The Finite Difference Approximation For A Parabolic Blow-Up Problems"), Yu-Mei Huang ("On Preconditioned Iterative Methods For Burgers Equations"), and Shipeng Mao ("Error Estimates For Degenerate Quadrilateral Finite Elements").

The other parallel sessions were Session 1 and Session 2.

Our paper was included in Session 2.

Session 2 was held in a building near the hotel were we stayed. The paper presentors in Session 2 are as follows:

1. Dr. Hisashi Okamoto (Kyoto University, Japan), "Fluid Mechanical Blow-Up Problems: Model Equations and Numerical Computations";

2. Dr. Hyung-Chun Lee (Ajou University, South Korea), "Reduced-Oredr Modeling Of Optimal Control Problems For Navier-Stokes Equations";

3. Dr. Katsuhisa Ozaki (Waseda University, Japan), "An Efficient Method of Applying Accurate Summation Algorithms To 3D Orientation Problem"; and

4. Dr. Rafael Saldaña and Timothy James Yusun (Ateneo de Manila University), "A Study on Modeling Landslide Dynamics Using Cellular Automata and the Minimization Algorithm."

After the coffee break from 3:40 - 4:00 p.m., I attended the talks in Session 3, which included the following:

1. Dr. Victor Didenko (Univesiti Brunei Darussalam, Brunei), "Computational Approach To Solvability Of Refinement Equations";

2. Dr. Michael Ng (Hong Kong Baptist University, Hong Kong), "Computational Methods For Superresolution Imaging";

3. Dr. Abd Rahni Mt. Piah (University Sains Malaysia), "Rational Generalized Ball Functions For the Visualization Of Monotonic Data", and

4. Dr. Katsuo Takano (Ibaraki University, Japan), "On A Property Of Laplace Transforms Of Some Probability Densities."

Trip to Xiamen, China (Day 1)

Today (Nov. 1, 2007) I am leaving for Xiamen, China to attend the 3rd EASIAM Annual Conference hosted by Xiamen University.

Details of the conference are found in the following website:

http://www.math.hkbu.edu.hk/easiam_Xiamen/

This will be my fourth trip to Mainland China (excluding Hong Kong and Macau). I first visited Mainland China in October 1996 when I presented a paper at the International Conference on Ecological Engineering in Beijing. My second visit to Mainland China was during the Asia-Pacific High Performance Computing (HPC-Asia) Conference held in May 2000 in Beijing. My third visit to Mainland China was in April 2005 when I attended the ACM ICPC Regional Directors' Workshop and the 2005 ACM ICPC World Finals in Shanghai.

I will leave Manila at 2 pm via Cebu Pacific Airlines and will arrive in Xiamen at 4:20 p.m.

My student, Timothy James "TJ" Yusun, will also participate in the 3rd East Asia SIAM (EASIAM) Conference. TJ and I will present our paper "A Study on Modeling Landslide Dynamics Using Cellular Automata and the Minimization Algorithm." The schedule of our presentation is tomorrow afternoon, Nov. 2.

Cheers,

Raffy
11/1/07

The 2007 ACM Asia Programming Contest - Singapore Roster

The 2007 ACM Asia Programming Contest - Singapore Roster
as of 10/31/2007 5:47:58 PM Central Time

.

Note: To view the current team roster under the 2007 ACM Asia Programming Contest-Singapore Site, click on the following link:

http://icpc.baylor.edu/icpc/regionals/RosterPublic.asp?ContestID=880

Acknowledgment: ACM ICPC Philippines 2007

To All Concerned:

On behalf of the ACM ICPC Philippines 2007 and the Computing Society of the Philippines, I would like to thank the following administrators, faculty, staff, and students of De La Salle Canlubang for their valuable contributions to the success of the recently concluded First Philippine National Inter-Collegiate Programming Competition (ACM ICPC Philippines 2007):

1. Br. Joaquin S. Martinez FSC, D. Min.
President, De La Salle Canlubang

2. Dr. Arnulfo Azcarraga
Dean, De La Salle Canlubang

College and Administrative Staff
3. Jenny Villena
4. Marilet Recaldo
5. Myles Hilario

Building Administrators
6. Mar Moraga
7. Engr. Allan Manio
8. Ms. Teng

I.T. Staff
9. Alberto Agawa (Head)
10. Emilson Mabuti
11. Raymond Marcelo
12. Chris Alegre
13. Rodolfo Ramiscal

Audio-Visual Staff
14. Rochiren Larga
15. Jaypeeh Navarete

Others
16. Karen Hebron (Registrar)
17. Rhea Boholano

Student Volunteers
18. Louise Noriega (student representative, CompSci/InfoMgt students)
19. Aiath Maclit (president, Digital Arts Club)
20. JR Sarabia
21. Rochelle Hizon
22. Kemuel Bathan
23. Jefrey Valencia
24. Angelica De Borja
25. Kirk Narvaez
26. Arnaldo Tayao, Jr.
27. Christian Hernandez
28. Mark Sigue
29. Mark Descalsota
30. Ted De La Cruz
31. Sandy Bacalso

Sincererely,

Dr. Rafael P. Saldaña
Director
ACM ICPC Philippines 2007

A Commentary on Problems Given During the ACM ICPC Philippines 2007

Last October 20, 2007 I directed the First Philippine National Inter-Collegiate Programming Competitition (ACM ICPC Philippines 2007). This contest is affiliated with the ACM ICPC Asia-Singapore Regional Site. I spearheaded the organization of the contest in my capacity as the ACM ICPC Philippines Representative and on behalf of the Computing Society of the Philippines. The contest was hosted by De La Salle Canlubang. ACM stands for Association for Computing Machinery.

The following is the composition of the ACM ICPC Philippines 2007 Board of Judges:

Dr. Rafael Saldaña (Ateneo de Manila University) - Chair
Dr. Henry Adorna (University of the Philippines -Diliman) - Member
Dr. Eliezer Albacea (University of the Philippines -Los Baños) - Member
Dr. Jaime Caro (University of the Philippines-Diliman)- Member
Dr. Caslon Chua (De La Salle University - Manila) -Member
Dr. Nelson Marcos (De La Salle University - Manila) -Member
Dr. Raymond Todd Melton (Ateneo de Manila University)- Member

The Board of Judges prepared six (6) problems to be solved by the contestants in three (3) hours. The problems ranged from 'easy' to 'difficult'. They are standard problems in computer science.

The following are the problems given during the ACM ICPC Philippines 2007:

1. Problem A: Forward and Backward
2. Problem B: Counting Corners
3. Problem C: "NBN"
4. Problem D: Longest Common Subsequence
5. Problem E: Factor Factory
6. Problem F: Full Binary Search Tree

The easiest among the six problems is Problem A (Forward and Backward) while the most difficult is Problem E (Factor Factory). Out of 50 teams that participated in the competition, 35 teams were able to solve Problem A while 15 teams did not. No team was able to solve Problem E.

I was the one who gave Problem A. I gave this problem to ensure that most teams will go home with a balloon after the contest. (Note: A trademark of ACM programming contests is the giving of color-coded balloons to teams that have solved a problem. For example, if one team was able to solve 6 problems then that team will receive 6 balloons).

Problem A deals with palindromes. As explained in the problem formulation, a palindrome is a "word, phrase, number or other sequence of units that has the property of reading the same in either direction." For example, the word tenet and the number 123321 are palindromes. A number that is a palindrome is called a palindromic number. [ Note: I made several blog entries on palindromes in my blog last August 2007 :) . I got fascinated with palindromes when I found out that my phone number is a palindromic number. See http://raffysaldana.blogspot.com/2007/08/palindromes-and-palindromic-numbers.html]

The solution to Problem A involves comparing the first element of a string with the last element, the second element with the second to the last element, etc. until there are (N/2) comparisons done, where N (an integer) is the size of the given string. If all comparisons are successful then the given string is a palindrome.

The solution to Problem A is quite trivial. This makes me wonder why 15 out of 50 teams who joined the competition were not able to solve it.

What are the factors why a team gets zero in an ACM programming competition?

Here are my guesses:

1. Lack of preparation/experience/team work
2. Nervousness
3. Not reading the problem formulation carefully
4. Not fit for competition

I would like to encourage schools (offering bachelors' degree in computer science, computer engineering, information science, information technology, or related courses) to join ACM programming contests such as the Philippine National Inter-Collegiate Programming Competition to benchmark their students' aptitude in computer programming and problem solving.

Dr. Rafael P. Saldaña
Director
ACM ICPC Philippines
10/30/07

Problem F (ACM ICPC Philippines 2007)

ACM ICPC Philippines 2007
First Philippine National Inter-Collegiate Programming Competition
20 October 2007, De La Salle Canlubang

Problem F: Full Binary Search Tree
(Input File: pf.in)

A full binary tree is a tree in which all non-leaf nodes are filled at every level from left to right except perhaps the last one. A binary search tree is a tree where value stored in the left child node is less than value stored in the parent node and the value stored in the right child node is greater than the value stored in the parent node for all parent nodes.

Figure 1 shows a full binary tree that is also a binary search tree.

Figure 1: Full Binary Search Tree

You are to read a string of numbers then process and print it as a full binary search tree.

Input: The input will contain several test cases. The first line will indicate the number of test cases. Each test case is a string of numbers separated by commas terminated by a 0. We assume that the numbers will be any number from 1 to 99. The string may or may not be arrange and will not contain any duplicate values.

Output: The output shows a full binary search of the string, printed as a triangular shape as shown below.


Sample Input:

2
20, 10, 50, 30, 25, 15, 0
20, 10, 60, 25, 40, 30, 70, 0


Output for the Sample Input:

Case 1:
25
15 50
10 20 30

Case 2:
30
20 60
10 25 40 70

Poster (ACM ICPC Philippines 2007)

Note: Click on image to see a larger view.

Message of Contest Director (ACM ICPC Philippines 2007)

MESSAGE

Welcome to the First Philippine National Inter-Collegiate Programming Competition (ACM ICPC Philippines 2007) hosted by De La Salle Canlubang and organized by the Computing Society of the Philippines (CSP) in cooperation with the Association for Computing Machinery (ACM).

Fifty teams from 24 schools are vying for the top spot in the ACM ICPC 2007 to be held on Saturday, October 20, 2007 at De La Salle Canlubang in Laguna, Philippines.

Each competing team consists of 3 college/university students. During the contest, each team will try to outsmart each other by solving 6 problems in 3 hours using a computer. The team with the most number of problems solved at the fastest time wins the competition.

The top spots at stake are: First Place (Champion), 2nd Place, and 3rd Place. The top team will be given financial assistance to participate in the 2007 ACM ICPC Asia-Singapore regional contest on December 13-14, 2007. In the Singapore contest, the top teams (usually three) will qualify to the 2008 ACM ICPC World Finals to be held in Alberta, Canada in April 2008.

The ACM ICPC Philippines 2007 is a prestigious event that aims to raise the awareness of the public about the important role of Information Technology in the development of our country and our society. Its objective of bringing together bright and talented young people from different regions of the country to take part in a grueling friendly competition, like a mental olympiad, is very noble.

To all contestants, alternates, coaches, and observers: I hope that you will take advantage of this opportunity to meet and interact with fellow competitors. Thanks to my fellow judges, co-organizers, volunteers and sponsors for making the ACM ICPC Philippines 2007 a success.


Rafael P. Saldaña, Ph.D.
Director
ACM ICPC Philippines 2007

Message of CSP President (ACM ICPC Philippines 2007)

MESSAGE

My warmest congratulations to the participants of the First Philippine National Inter-Collegiate Programming Competition (ACM ICPC Philippines 2007).

The holding of the the ACM ICPC Philippines 2007 is in line with one of the objectives of the Computing Society of the Philippines (CSP), i.e., to contribute in the improvement of computing science education, especially at the tertiary level.

We at CSP are privileged to organize the national programming competion in partnership with the prestigiojus Association for Computing Machinery (ACM).

On behalf of CSP, I would like to thank Dr. Rafael Saldaña for his project leadership and Dr. Arnulfo Azcarraga for facilitating the local organization at De La Salle Canlubang. I also would like to thank De La Salle Canlubang for hosting the event and all the staff and volunteers involved in the ACM ICPC Philippines 2007.

Again, congratulations to all and best wishes!

Jaime DL. Caro, Ph.D.
President
Computing Society of the Philippines (CSP)

Program of Activities (ACM ICPC Philippines 2007)

ACM ICPC Philippines 2007
First Philippine National Inter-Collegiate Programming Competition
October 20, 2007
Hosted by De La Salle Canlubang
Organized by the Computing Society of the Philippines (CSP)
in cooperation with the Association for Computing Machinery (ACM)

PROGRAM

9 - 11 a.m. Registration

11 - 12 noon Opening Session

Invocation
Philippine National Anthem
Welcome Remarks

- Br. Joaquin S. Martinez, FSC, D. Min.
President, De La Salle Canlubang

- Dr. Jaime Caro
President, Computing Society of the Philippines

- Dr. Rafael Saldaña
Director, ACM ICPC Philippines 2007

- Introduction of Participants

Master of Ceremonies: Dr. Arnulfo Azcarraga, Dean, De La Salle Canlubang

12:00 - 1:00 p.m. LUNCH

1:00 - 1:30 Contest Orientation/Instructions

1:30 - 4:30 CONTEST (for contestants)

For Coaches, Observers, and Seminar Participants:

1:30 - 3:00 p.m. Talks on Best Practices in Computer Programming

Speakers: Mr. Allan Espinosa and Mr. Christoper Rigor

3:00 - 3:30 p.m. SNACKS

3:30 - 5:00 p.m. Talk on Best Practices in Mentoring Students for National and International Programming Competitions. Speaker: Dr. Pablo Manalastas

5:00 p.m. Awarding Ceremony/ Distribution of Certificates

Rules of the ACM ICPC Philippines 2007

RULES OF THE FIRST PHILIPPINE NATIONAL INTER-COLLEGIATE
PROGRAMMING COMPETION (ACM ICPC PHILIPPINES 2007)


1.0 Language of the Contest

1.1 The language of the Contest is English.
1.2 All written contest materials will be in English.

2.0 Team Composition

2.1 A team consists of three (3) bonafide students of a higher institution recognized by the Commission on Higher Education (CHED).
2.2 For the national competition, the student must be an undergraduate student of a four or five-year course.
2.3 The student contestant must be enrolled during the current schoolyear (SY 2007-2008) and must have at least a half-time load.
2.4 A representative of the sponsoring institution of higher education, typically a faculty member, must serve as or designate the team coach.
2.5 The coach certifies the eligibility of contestants and serves as the official point-of-contact with the team prior to and during contest activities.
2.6 A team may only have one official coach.
2.7 A team is not eligible to compete in the regional contest until the contest director has accepted the team’s registration..
2.8 Teams failing to comply with any of these requirements will be ruled ineligible to compete.
2.9 Only registered alternates may be substituted for contestants.
2.10 Such substitutions must be entered in the Official Registration List by the contest director before the contest begins.
2.11 To be eligible for the ACM ICPC Asia-Regional Contests, the student contestant must satisfy the eligibility rules published in the ACM ICPC website (http://icpc.baylor.edu/)

3.0 Contest Attendance and Attire

3.1 All team members must attend the following contest activities:
3.1.1 Opening Ceremony
3.1.2 Contest Proper
3.1.3 Awarding Ceremony
3.2 The coach is expected to attend or be available by phone during contest activities.
3.3 Failure to attend any of the designated contest events may result in automatic disqualification and forfeiture of any awards and prizes.
3.4 Team members and their coaches should wear proper attire during the contest.
3.5 The following are not considered proper attire: wearing sleeveless shirts, short pants, slippers (or flip-flops).
3.6 During the contest proper, team members and coaches shall wear the color-coded t-shirts issued to them during onsite registration.
3.7 Failure to wear proper attire may result in automatic disqualification and forfeiture of any awards and prizes.

4.0 Conduct of the Contest

4.1 Solutions to problems submitted for judging are called runs. Each run is judged as accepted or rejected by a judge, and the team is notified of the results.
4.2 Notification of accepted runs may be suspended at an appropriate time to keep the final results secret. A general announcement to that effect will be made during the contest. Notification of rejected runs will continue until the end of the contest.
4.3 A contestant may submit a claim of ambiguity or error in a problem statement by submitting a clarification request to a judge. If the judges agree that an ambiguity or error exists, a clarification will be issued to all contestants.
4.4 Contestants are not to converse with anyone except members of their team and personnel designated by the regional contest director.
4.5 Systems support staff may advise contestants on system-related problems such as explaining system error messages.
4.6 While the contest is scheduled three hours, the contest director has the authority to alter the length of the contest in the event of unforeseen difficulties.
4.7 Should the contest duration be altered, every attempt will be made to notify contestants in a timely and uniform manner.
4.8 A team may be disqualified by the contest director for any activity that jeopardizes the contest such as dislodging extension cords, unauthorized modification of contest materials, distracting behavior, wearing improper attire, and other improper activities or behavior.
4.9 Six problems will be posed. So far as possible, problems will avoid dependence on detailed knowledge of a particular applications area or particular contest language.

5.0 Contest Computing Environment

5.1 The programming languages of the contest will include C/C++ and Java.
5.2 Each team will use a single workstation.
5.3 The regional contest director is responsible for determining that teams have reasonably equivalent computing resources.
5.4 The following are the computer hardware specifications:
Pentium 4 PC
5.5 The operating system is Microsoft Windows XP
5.6 Keyboard substitution will not be allowed.
5.7 Network shared printers will be made available during the contest proper.

6.0 Team Notebooks
6.1 A team is allowed to bring into the contest area, three copies of a team notebook, one copy for each contestant.
6.2 The notebook must be a three-ring binder that can hold 8.5" x 11” letter-size pages. Each notebook should have the name of the school and the name of the team prominently indicated on its front cover.
6.3 The notebook must have four sections, each section starting with a tabbed divider, labeled NOTES, HANDOUTS, REFERENCE, and WORK.
6.3.1 NOTES -- contains at most four (4) pages of single-sided hand-written notes.
6.3.2 HANDOUTS -- contains only those handouts provided by the Asia-Manila ICPC staff. These handouts may include hand-written comments and corrections.
6.3.3 REFERENCE -- contains up to twenty-five pages of printed notes, single spaced, single sided, in 12 point font of the team's choice, with one-inch margins on all sides. These notes must be the same for all three members of the team.
6.3.4 WORK -- contains a reasonable number, but not more than 100 pages, of blank bond paper and graphing paper, all letter-size, for the team member to use as scratch papers during the contest.
6.4 The notebook may have a plastic pouch containing pencils, pens, erasers, ruler, compass, protractor, and triangles.
6.5 The team members may not bring a calculator to the contest, but the team may use the calc.exe program that is provided by Windows XP.
6.6 Each team member may bring a dictionary for translation purposes. The only marking allowed on the dictionary is the identity of the owner.

7.0 Scoring
7.1 A problem is solved when it is accepted by the judges.
7.2 The judges are solely responsible for accepting or rejecting submitted runs.
7.3 In consultation with the judges, Contest Director determines the winners of the contest.
7.4 The contest director and judges are empowered to adjust for or adjudicate unforeseen events and conditions.
7.5 The decisions of the judges are final.
7.6 Teams are ranked according to the most problems solved.
7.7 For the purposes of awards, teams who solve the same number of problems are ranked by least total time.
7.8 The total time is the sum of the time consumed for each problem solved.
7.9 The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submittal of the accepted run plus 20 penalty minutes for every rejected run for that problem regardless of submittal time.
7.10 There is no time consumed for a problem that is not solved.
7.11 It is the responsibility of the Contest Director to specify any additional tie-breakers.
7.12 The tie-breaker policies must be announced to contestants before the contest begins.

8.0 Certificates and Awards
8.1. Certificates of Achievement will be given to all qualified participants and their coaches.
8.2 Individual medals will be given to team members who will win the following awards:
8.2.1 1st Place (Champion)
8.2.2 2nd Place
8.2.3 3rd Place
8.2.4 Trophies will be given to teams who will win the following awards:
8.2.4.1 1st Place
8.2.4.2 2nd Place
8.2.4.3 3rd Place

9.0 Complaints, Appeals, and Remedies
9.1 If irregularities or misconduct are observed during the contest, team members or coaches should bring them to the attention of the Contest Director immediately so that action may be taken as soon as possible.
9.2. The decision of the Board of Judges regarding awarding of prizes is final.

10. Minor Changes/ Corrections

10.1 Minor changes or corrections (if there any) to this document shall be announced before the start of the Contest Proper and shall be posted on notice boards within the Contest venue.

FOR YOUR GUIDANCE.

(Sgd.) Rafael P. Saldaña, Ph.D.
Contest Director
ACM ICPC Philippines 2007
October 20, 2007

ACM ICPC Philippines 2007 Media Release (Updated)

Computing Society of the Philippines (CSP)
(http://www.csp.org.ph/)
Tel./Fax.: (02) 7090907
E-mail: computingsoc@gmail.com

.

-------------------------------------------
MEDIA RELEASE. October 22, 2007
-------------------------------------------

ACM ICPC Philippines: 200 participants. 50 Teams.
24 Schools. 6 Problems. 3 Hours. 1 Champion.


Fifty teams from 24 schools competed for the top spot
in the First Philippine National Inter-Collegiate
Programming Competition (ACM ICPC Philippines 2007)
held last Saturday, October 20, 2007 at De La Salle
University – Canlubang Campus in Laguna.

This event was organized by the Computing Society of
the Philippines (CSP) in cooperation with the
Association for Computing Machinery (ACM). The host
school was De La Salle Canlubang and the contest
director was Dr. Rafael Saldaña, immediate past
president of the CSP and ACM ICPC Asia-Manila Site
director.

Each competing team consisted of 3 students. During
the contest, each team tried to outsmart each other in
solving 6 problems in 3 hours using a computer. The
team with the most number of problems solved at the
fastest time won the competition.

The problems ranged from “easy” to “difficult” and
included computer science topics such as data
structures, combinatorics, graph algorithms, and
computational methods.

The top spots at stake were: First Place (Champion),
2nd Place, and 3rd Place. The top team (or teams) will
be given financial assistance (subject to availability
of funds) to participate in the 2007 ACM ICPC
Asia-Singapore regional contest on December 13-14,
2007. In the Singapore Contest, the top teams (usually
3) will qualify to the 2008 ACM ICPC World Finals to
be held in Alberta, Canada in April 2008.

Below are the results of the ACM ICPC Philippines
2007:

TOP TEN TEAMS

CHAMPION (1st Place): "U.P. Fighting Morons", University of the
Philippines-Diliman. Members: Marte Raphael Soliza,
Ralph Rainier Pineda, and Reginald Eli
Deinla.Registered Coach: Mr. Eric R. Tambasacan.
(Associate Coach: Dr. Pablo Manalastas). Number of
problems solved: 5, Time: 365 minutes.

SECOND PLACE: "cxxC", Ateneo de Manila University.
Members: James Choa, Wilhansen Li, John Patrick
Manalo. Registered Coach: Dr. Pablo Manalastas.
(Associate Coaches: Mr. Jal de Vera, Mr. Ramon Akie
Mejiea, Mr. Eric Vidal Tan, Dr. John Paul Vergara -
members of coaching team). Number of Problems solved:
3. Time: 148 minutes.

THIRD PLACE: "Heaven", University of the
Philippines-Los Baños. Members: Jeremiah Pascual,
Reinald Pugoy, Maverick Crisostomo. Coach: Mr. Rainier
Alexis L. Rapera. Number of Problems solved: 3. Time:
151 minutes.

FOURTH PLACE: "Team Automata", Ateneo de Manila
University. Members: Ivan John Clement, Jason
Christian Gaguan, Maria Clarisse Ligunas. Number of
problems solved: 3. Time: 196 minutes.

FIFTH PLACE: "Team 43", University of the
Philippines-Diliman. Members: Ralph Justin Arce,
Vanessa Rose Castro, and James Wyson. Number of
problems solved: 3. Time: 234 minutes.

SIXTH PLACE: "DLSU-2", De La Salle University
(Manila). Members: Brian Paul Samson, Christian Valeen
Chiu, Jeric Bryle Dy. Number of problems solved: 3.
Time: 291 minutes.

SEVENTH PLACE: "Excessive Output", Ateneo de Manila
University. Members: Jejomar Alexis Dimayuga, Thomas
Dy, Danna Songco Aduna. Number of problems solved: 3.
Time: 355 minutes.

EIGHT PLACE: "DLSU-1", De La Salle University
(Manila). Members: Jhovee Gerard Yap, Fu Yuen So,
Robert Joseph Carag. Coach: Mr. Danniel Alcantara.
Number of problems solved: 2. Time: 36 minutes.

NINTH PLACE: "Team 45", University of the
Philippines-Diliman. Members: John Kristofferson
Sanchez, Wigi Vei Oliveros, Pio Ryan Lumongsod. Number
of problems solved: 2. Time: 51 minutes.

TENTH PLACE: "eTeam", Ateneo de Manila University.
Members: Richard Locsin, Liza Vila, Byron Wang. Number
of problems solved: 2. Time 65 minutes.


TOP FIVE SCHOOLS:

RANK/ SCHOOL

1. University of the Philippines-Diliman
2. Ateneo de Manila University
3. University of the Philippines-Los Banos
4. De La Salle University
5. FEU-East Asia College

The ACM International Collegiate Programming Contest
(ICPC) provides college students with opportunities to
interact with students from other universities and to
sharpen and demonstrate their problem-solving,
programming, and teamwork skills. The contest provides
a platform for ACM, industry, and academia to
encourage and focus public attention on the next
generation of computing professionals as they pursue
excellence.

From thousands of teams competing in regional contests
held from September to December 2007 world-wide,
ninety teams will advance to the World Finals. Awards,
prizes, scholarships, and bragging rights will be at
stake for some of the world's finest university
students of the computing sciences and engineering.

The 2008 ACM-ICPC World Finals will be held April
6-10, 2008, at the Fairmont Banff Springs Hotel in
Alberta, Canada, hosted by the University of Alberta
celebrating its 100th anniversary.

The following are the members of 2007 ACM ICPC
Philippines Board of Judges:

Dr. Rafael Saldaña (Ateneo de Manila University) -
Chair
Dr. Henry Adorna (University of the Philippines -
Diliman) - Member
Dr. Eliezer Albacea (University of the Philippines -
Los Baños) - Member
Dr. Jaime Caro (University of the Philippines-Diliman)
- Member
Dr. Caslon Chua (De La Salle University - Manila) -
Member
Dr. Nelson Marcos (De La Salle University - Manila) -
Member
Dr. Raymond Todd Melton (Ateneo de Manila University)
- Member

The schools that participated in the ACM ICPC
Philippines 2007 are as follows (with the
corresponding number of teams):

1. AMA Computer College – Legazpi City (1 team)
2. Asia-Pacific College (2 teams)
3. Ateneo de Davao University ( 1 team)
4. Ateneo de Manila University (7 teams)
5. Ateneo de Naga University (2 teams)
6. Camarines Norte State College (1 team)
7. De La Salle Canlubang (3 teams)
8. De La Salle University – Manila (2 teams)
9. Emilio Aguinaldo College (1 team)
10. FEU-East Asia College (4 teams)
11. Lyceum of Batangas (1 team)
12. Manuel Enverga University Foundation (2 teams)
13. Mapua Institute of Technology (3 teams)
14. MSU – Iligan Institute of Technology (1 team)
15. Naga College Foundation (1 team)
16. Polytechnic University of the Philippines (1 team)
17. San Pedro College of Business Administration (1
team)
18. San Sebastian College (1 team)
19. Technological Institute of the Phils. – Manila (2
teams)
20. Technological Institute of the Phils. – Quezon
City (2 teams)
21. University of the Immaculate Conception – Davao (2
teams)
22. University of Saint Louis – Tuguegarao (1 team)
23. University of the Philippines – Diliman (6 teams)
24. University of the Philippines - LosBanos (2 teams)

A related activity organized by the CSP was the
seminar on “Best Practices in Computer Programming and
Mentoring Students for National and International
Programming Competitions” which was held in De La
Salle Canlubang on October 20, 2007. Invited speakers
included: Mr. Allan Espinosa, Mr. Christopher Rigor,
and Dr. Pablo Manalastas – all members of the
Philippine team that has competed in the ACM ICPC
World Finals.

For more information, contact:

THE SECRETARIAT
ACM ICPC Philippines 2007
Tel./Fax. (02) 7090907
Mobile: 0928-5043121
E-mail: computingsoc@gmail.com

Or visit the contest website:
http://icpc2007manila.blogspot.com/

or Dr. Saldaña's blog:
http://raffysaldana.blogspot.com/

ACM ICPC Asia Programming Contest

The ACM (Association for Computing Machinery) International Collegiate Programming Contest (ICPC) is a two-tiered competition. Teams first compete in Regional Contests, then the top teams from each regional contest site around the world will be selected to compete in the ACM ICPC World Finals.

The Ateneo de Manila University has hosted two Asia Programming Contests (the ACM ICPC Asia-Manila Site) in the past (in 2005 and in 2006) with myself as the Regional Contest Director.

In Asia, the regional sites for 2007 are as follows:

Beijing (China)
Changchun (China)
Chengdu (China)
Amritapuri (India)
Danang (Vietnam)
Dhaka (Bangladesh)
Kanpur (India)
Nanjing (China)
Seoul (South Korea)
Singapore (Singapore)
Taipei (Taiwan)
Tehran (Iran)
Tokyo (Japan)

For the Asia-Singapore site, the following are the relevant information:

The 2007 ACM Asia Programming Contest - Singapore

hosted by
School of Computing, National University of Singapore
http://www.comp.nus.edu.sg/

Asia Singapore On-Site Regional Contest
December 13-14, 2007

---- National / Provincial Contests ----

The Indonesia National Collegiate Programming Contest
hosted by Bina Nusantara University, Jakarta, IndonesiaContest
Date: June 16, 2007

........

The Philippine National Inter-Collegiate Programming Competition
hosted by De La Salle University - Canlubang, Philippines
Organized by the Computing Society of the Philippines
Contest Date: Oct 20, 2007

........

The ACM-ICPC Malaysia al-Khawarizmi Programming Contest
hosted by International Islamic University Malaysia, Kuala Lumpur
Contest Date: December 5-6, 2007

-----

Asia Singapore On-Site Regional Contest
hosted by National University of Singapore
Date of Contest: 13 - 14 December 2007

The contest draws students from colleges and universities throughout Asia. Winners selected from regional contests on six continents will advance to the ACM Programming Contest World Finals to compete for bragging rights and scholarships.

Registration is conducted from March 19, 2007 to October 31, 2007.
Advance dRegistration ends Sep 30, 2007.

Coaches new to this regional must setup a new coach account to make team reservations at the Coach Registration Site.

Coaches who already registered at this regional may make, edit, or cancel team reservations at the Coach Account Site. This includes coaches who had teams compete in this regional last year.
(Registration works best with Internet Explorer or Mozilla Firefox. Cookies must be enabled and JavaScript enabled.)

Fees:

Advance registration fee: US$100/S$160
Normal registration fee: US$130/S$200 Register three teams from one university, each team pay: US$100/S$160

Fees Cover:
T-shirt
Food & Board
Certificate of participation
Contest bag

Billing:

Bank Draft to be drawn in a Singapore local bank made payable to "National University of Singapore". Send the draft to Dr. Tan Sun Teck, School of ComputingNational University of SingaporeComputing 1, Law LinkSingapore 117590

More Information:

Visit the regional contest home page
Add yourself to the mailing list
View the team roster

From:

Dr. Rafael P. Saldaña
Director
ACM ICPC Philippines
10/25/07

(Source: http://icpc.baylor.edu/)