Title: An RStudio Addin to Insert BibTex Citation in Rmarkdown
Description: Contain an RStudio addin to insert BibTex citation in Rmarkdown documents with a minimal user interface.
Imports: shiny (>= 0.13), miniUI (>= 0.1.1), rstudioapi (>= 0.5),

Title: Visualization of structure and contents of a database
Description: Input: a csv-file for each database table and a
controlfile describing relations between tables. Output: An

Title: Track Flows of Water Through an Urban System
Authors@R: person("Laura", "Erban", email = "erban.laura@epa.gov",
Description: Retrieves data and estimates unmeasured flows of water through the
urban network. Any city may be modeled with preassembled data, but data for
US cities can be gathered via web services using this package and dependencies
Imports: dataRetrieval, dplyr, EcoHydRology, geoknife, graphics,
grDevices, lubridate, reshape2, stats, tgp, utils, xts, zoo

Title: Optimized one-dimensional clustering algorithm
Author: Joe Song <joemsong@cs.nmsu.edu> and Haizhou Wang
Description: An alternative way to do one-dimensional clustering. Which
will gurantee the smallest "within sum of distance square"

Title: Optimal distance-based clustering for one-dimensional data
Description: This package contains a function to cluster
one-dimensional data optimally using dynamic programming to
minimize the sum of squares of within cluster distances.  It
provides an alternative to the heuristic k-means algorithm

Description: This package implements a dynamic programming algorithm to
cluster one-dimensional data optimally, by minimizing the sum
of squares of within-cluster distances.  As an alternative to
the heuristic k-means algorithm, the algorithm guarantees
optimality and repeatability of clustering.

Description: This package implements a dynamic programming algorithm to perform optimal one-dimensional k-means clustering, by minimizing the sum of squares of within-cluster distances. As an alternative to the standard heuristic k-means algorithm, this algorithm guarantees optimality and repeatability.