K-means clustering is one of the most popular cluster analysis techniques\, and Windows Azure is Microsoft'\;s cloud computing platform. With the rapidly growing volume of data\, cloud computing is a possible solution for analyzing large data sets. The goal of this project is to implement parallel k-means clustering on Windows Azure and evaluate the performance by utilizing different numbers of virtual machines (1&ndash\;8) in order to calculate new centroids.
Committee
Dr. Yi Pan (chair)
Dr. Raj Sunderraman
Information management (IM) is the collection and management of information from one or more sources and the distribution of that information to one or more audiences. This sometimes involves those who have a stake in\, or a right to\, that information. Management means the organization of and control over the structure\, processing\, and delivery of information. I have tried to develop an online testing system for the National SafeCare Training and Research Center (NSTRC)\, which is part of Georgia State University'\;s College of Health and Human Sciences. END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T193254Z DTSTART;VALUE=DATE-TIME:20120712T180000Z DTEND;VALUE=DATE-TIME:20120712T193000Z UID:http://www.cs.gsu.edu/?q=node/611 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/611 SUMMARY:Row Compression and Nested Product Decomposition of a Hierarchical Representation of Quasiseparable Matrices DESCRIPTION:
This research introduces a row compression and nested product decomposition of an n ×\; n hierarchical representation of a rank structured matrix A which extends the compression and nested product decomposition of quasiseparable matrices. The row compression is comprised of a sequence of small Householder transformations which are formed from the low-rank off-diagonal blocks of the hierarchical representation of a rank structured matrix. END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T193254Z DTSTART;VALUE=DATE-TIME:20120716T170000Z DTEND;VALUE=DATE-TIME:20120716T180000Z UID:http://www.cs.gsu.edu/?q=node/617 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/617 SUMMARY:A Source Initiated On-Demand Energy Efficient Algorithm for Multi-Path Routing in Wireless Ad-Hoc Networks DESCRIPTION:
The development and use of wireless networks continues to be a growing trend. Routing in wireless networks has proved to be a challenging issue since wireless nodes and links are prone to failures and resource starvation. Multipath routing is a routing scheme where data can be sent through multiple paths to protect the data against node or link failures. In this work\, we present a distributed wireless multipath routing scheme that discovers energy-efficient paths to send data from the source to the destination in a wireless network. END:VEVENT END:VCALENDAR