Folksonomy is really taking off. Here be tag clouds, then, courtesy of TagCloud Beta.
The overview:
Essentially, TagCloud searches any number of RSS feed you specify, extracts keywords from the content and lists them according to prevalence within the RSS feeds.
Coupled with del.icio.us tags, the rendered clouds look real nifty. My tags look a bit weird, but hey, it’s beta after all. Have fun.
Update: I’ve taken them down. The tag cloud looks butt-ugly.
Polytechnic University of the Philippines Center for Institutional Non-Traditional Study Program and Expanded Tertiary Education Equivalency and Accreditation Program
3rd Floor NALRC, Mabini Campus, Sta. Mesa, Manila
+63 (44) 333 7409 * pebre_ac[at]yahoo[dot]com
Contents of Comprehensive Curriculum Vitae and List of Required Supporting Documents
- Letter of application to the University President (Dr. Samuel M. Salvador) through the Director (Dr. Theresita V. Atienza), CINTSP-ETEEAP. Recommendation of three notable persons in area of specialization.
- Educational background
- Original transcript of records (with two photocopies)
- Honorable dismissal from the school last attended
- Work experience (minimum of five years)
- Service record or certificate of employment
- Appointment and/or designation with level of position and job description and responsibilities
- Other proofs of work experience
- Innovation, invention, research and publication
- Application for or actual patent or copyright
- Manuscript or publication of researches
- Sample of book, workbook, module, manual, monograph, article or creative work
- Instructional / audiovisual material developed
- Copy of unpublished research
- Other proofs
- Expert service, training and active participation in professional development activity
- Certificate or contract of consultancy and/or advisorship
- Training certificates
- Certification or plaque as coordinator, lecturer, resource person, guest speaker, etc.
- Special order
- Other proofs of expert service
- Conferences, seminars, workshops, colloqiums or forums attended
- Certificate of attendance or appearance
- Receipt of payments for attendance
- Special order
- Other proofs of attendance
- Officership / Membership in relevant organization
- Certificate of membership. receipt or payment of membership fee or ID
- Other proofs of membership
- Community outreach
- Written assignment in organized community project duly assigned by authorized official
- Project information
- Other proofs of involvement
- Awards / Recognition
- Certificate, plaque, trophy or medal
- Other proofs
- Scholarship / Grant
- Contract
- Authority to travel
- Other proofs
- Civil Service Eligibility
- Rating card
- Certification of eligibility signed by authorized official
- Other proofs
- Latest picture, 2″x2″ (colored with white background), two pieces
- Course description of subjects taken from previous school (for evaluation purposes)
Here are some interesting papers spewed out by Google Labs. A few abstracts are below.
We have designed and implemented the Google File System, a scalable distributed file system for large distributed data-intensive applications. It provides fault tolerance while running on inexpensive commodity hardware, and it delivers high aggregate performance to a large number of clients.
…
The file system has successfully met our storage needs. It is widely deployed within Google as the storage platform for the generation and processing of data used by our service as well as research and development efforts that require large data sets. The largest cluster to date provides hundreds of terabytes of storage across thousands of disks on over a thousand machines, and it is concurrently accessed by hundreds of clients.
Amenable to extensive parallelization, Google’s Web search application lets different queries run on different processors and, by partitioning the overall index, also lets a single query use multiple processors. To handle this workload, Google’s architecture features clusters of more than 15,000 commodity class PCs with fault-tolerant software. This architecture achieves superior performance at a fraction of the cost of a system built from fewer, but more expensive, high-end servers.
Previous studies of the web graph structure have focused on the graph structure at the level of individual pages. In actuality the web is a hierarchically nested graph, with domains, hosts and web sites introducing intermediate levels of affiliation and administrative control. To better understand the growth of the web we need to understand its macro-structure, in terms of the linkage between web sites. In this paper we approximate this by studying the graph of the linkage between hosts on the web. This was done based on snapshots of the web taken by Google in Oct 1999, Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed graph, with hosts as nodes and weighted edges representing the count of hyperlinks between pages on the corresponding hosts. We demonstrate how such a “hostgraph” can be used to study connectivity properties of hosts and domains over time, and discuss a modified “copy model” to explain observed link weight distributions as a function of subgraph size. We discuss changes in the web over time in the size and connectivity of web sites and country domains. We also describe a data mining application of the hostgraph: a related host finding algorithm which achieves a precision of 0.65 at rank 3.
More research publications here. [Via Google Blogscoped.]