A connected dominating set (CDS) for a graph G = (V\, E) is a subset V´\; of V such that each node in V &ndash\; V´\; is adjacent to some node in V´\;\, and V´\; is a connected subgraph.
CDS discovering algorithms have proved to be very useful in finding the optimal virtual backbone for routing in wireless ad hoc networks. However\, it is NP-hard to find a minimum connected dominating set (MCDS).
END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T070618Z DTSTART;VALUE=DATE-TIME:20111101T150000Z DTEND;VALUE=DATE-TIME:20111101T160000Z UID:http://www.cs.gsu.edu/?q=node/533 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/533 SUMMARY:Staging of Incremental Data in Data Warehouse Using SSIS DESCRIPTION:A goal of this project is to minimize process time and the amount of data transferred. It provides an efficient ETL workflow and dataflow to get data populated in the staging database so that further ETL can populate an ODS\, dimensional model\, and finally an Analysis Services cube. The design needs to follow current data warehousing standards for efficient reporting and maintenance. The ETL processing will run as many tasks in parallel as possible and should run as quickly as possible to ensure that further ETL and cube processing tasks have time to finish.
END:VEVENT
BEGIN:VEVENT
DTSTAMP;VALUE=DATE-TIME:20130522T070618Z
DTSTART;VALUE=DATE-TIME:20111103T130000Z
DTEND;VALUE=DATE-TIME:20111106T210000Z
UID:http://www.cs.gsu.edu/?q=node/413
URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/413
SUMMARY:8th ACM Conference on Creativity and Cognition
DESCRIPTION:
END:VEVENT
BEGIN:VEVENT
DTSTAMP;VALUE=DATE-TIME:20130522T070618Z
DTSTART;VALUE=DATE-TIME:20111103T173000Z
DTEND;VALUE=DATE-TIME:20111103T193000Z
UID:http://www.cs.gsu.edu/?q=node/534
URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/534
SUMMARY:Maintaining Integrity Constraints in the Semantic Web
DESCRIPTION:
As an expressive knowledge representation language for the Semantic Web\, the Web Ontology Language (OWL) plays an important role in areas like science and commerce. However\, the problem of maintaining integrity constraints arises because OWL employs the open world assumption (OWA) as well as the non-unique name assumption (NUNA). Integrity constraints (ICs) on ontologies have to be enforced\; otherwise\, conflicting results would be derivable from the same knowledge base. END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T070618Z DTSTART;VALUE=DATE-TIME:20111104T143000Z DTEND;VALUE=DATE-TIME:20111104T163000Z UID:http://www.cs.gsu.edu/?q=node/537 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/537 SUMMARY:Search and Data Management in P2P Networks DESCRIPTION:
P2P (peer-to-peer) search is the process of finding relevant documents that meet user information needs in a document collection distributed among a group of peers in a P2P overlay. The main objectives of a good search system include minimum state maintained per peer\, low bandwidth consumption\, high accuracy\, a large number of discovered documents\, and robust and adaptive behavior in dynamic environments. Therefore\, successful data management\, query routing\, and query evaluation as well as result aggregation methods need to be devised to aid in a successful P2P search.
END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T070618Z DTSTART;VALUE=DATE-TIME:20111104T180000Z DTEND;VALUE=DATE-TIME:20111104T193000Z UID:http://www.cs.gsu.edu/?q=node/536 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/536 SUMMARY:HiFi – A Computer Program for Haplotype Imputation from Incomplete Data DESCRIPTION:Computational haplotyping methods are currently limited by inaccuracies\, ambiguities\, and short phasing distance\, and experimental methods are limited by labor\, cost\, and incompleteness. Here\, we report on a computational/experimental integrated method to solve the single-individual haplotyping problem. We implemented this method in software (HiFi) and applied it to resolving the chromosomal haplotypes of 14 individuals. Each genome haplotype was determined in 2.5 minutes completely on all SNPs\, with ~99.7% accuracy.
END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T070618Z DTSTART;VALUE=DATE-TIME:20111111T150000Z DTEND;VALUE=DATE-TIME:20111111T163000Z UID:http://www.cs.gsu.edu/?q=node/486 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/486 SUMMARY:Home Energy Management\: A Multi-Scale Stochastic Optimization Framework DESCRIPTION:
Home energy management (HEM) is a key component in the future smart grid aimed at high efficiency and a greater integration of renewable sources. In this talk\, we consider the problem of optimal control of appliances by an HEM device that serves as an interface with an energy aggregator through real-time pricing and the specification of load profile.
END:VEVENT
BEGIN:VEVENT
DTSTAMP;VALUE=DATE-TIME:20130522T070618Z
DTSTART;VALUE=DATE-TIME:20111112T120000Z
DTEND;VALUE=DATE-TIME:20111115T210000Z
UID:http://www.cs.gsu.edu/?q=node/441
URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/441
SUMMARY:IEEE International Conference on Bioinformatics & Biomedicine 2011
DESCRIPTION:
END:VEVENT
BEGIN:VEVENT
DTSTAMP;VALUE=DATE-TIME:20130522T070618Z
DTSTART;VALUE=DATE-TIME:20111116T183000Z
DTEND;VALUE=DATE-TIME:20111116T193000Z
UID:http://www.cs.gsu.edu/?q=node/539
URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/539
SUMMARY:GSU Hotspots and Crime Alerts on Your Smart Phone
DESCRIPTION:
Modern handheld devices like smart phones and PDAs have become increasingly powerful in recent years. This project aims to be a part of this mobile trend and help users to perform some of their daily activities on their smart phones. This application provides beneficial and useful information about Georgia State University'\;s Downtown campus. It will not only assist current students and staff but also visitors\, particularly those who are not acquainted with the campus. END:VEVENT BEGIN:VEVENT DTSTAMP;VALUE=DATE-TIME:20130522T070618Z DTSTART;VALUE=DATE-TIME:20111122T143000Z DTEND;VALUE=DATE-TIME:20111122T163000Z UID:http://www.cs.gsu.edu/?q=node/540 URL;VALUE=URI:http://www.cs.gsu.edu/?q=node/540 SUMMARY:Di-Sec\: A Distributed Security Framework for Heterogeneous Wireless Sensor Networks DESCRIPTION:
Wireless Sensor Networks (WSNs) are deployed for monitoring in a range of critical domains (e.g.\, health care\, military\, critical infrastructure). Accordingly\, these WSNs should be resilient to attacks. The current approach to defending against malicious threats is to develop and deploy a specific defense mechanism for a specific attack. However\, the problem with this traditional approach to defending sensor networks is that the solution for the jamming attack does not defend against other attacks (e.g.\, Sybil and selective forwarding). END:VEVENT END:VCALENDAR