## Portfolio item number 1

Short description of portfolio item number 1

Short description of portfolio item number 1

Short description of portfolio item number 2

We propose the probabilistic temporal network that we can encode this uncertainty into the network by giving each edge a probability of being ”available” during each time slot. Interesting questions include routing and cascading in such network. Our idea of this probabilistic networks is inspired by the temporal network models, in which edges have some kind of time-relevant labeling. In this paper we focus on the routing problem in a simple probabilistic temporal network where each edge have uniform independent probability of being ”available” in each time slot.

Download __here__

Web & Mobile Tool for Optimally Reallocating Bikes.

Download __here__

Simulated the bikes’ distribution in a bike-sharing system over time with a delay model

Large Question-and-Answer (Q&A) platforms support diverse knowledge curation on the Web. While researchers have studied user behaviour on such platforms in a variety of contexts, there is relatively little insight into important by-products of user behaviour that also encode knowledge. Here, we analyse and model the macroscopic structure of tags applied by users to annotate and catalogue questions, using a collection of 168 Stack Exchange websites that span a diversity of sizes and topics. We study the distribution of tag frequencies and also the structure of ‘co-tagging’ networks where nodes are tags and links connect tags that have been applied to the same question. We find striking similarity in tagging structure across Stack Exchange communities, even though each community evolves independently (albeit under similar guidelines). Our findings thus provide evidence that social tagging behaviour is largely driven by the Stack Exchange platform itself and not by the individual Stack Exchange communities. We also develop a simple generative model that creates random bipartite graphs of tags and questions. Our model accounts for the tag frequency distribution but does not explicitly account for co-tagging correlations. Even under these constraints, we demonstrate empirically and theoretically that our model can reproduce a number of the statistical properties that characterize co-tagging networks.

Download __here__

Recent work (Garriga-Alonso et al., 2018) has shown deep convolutional neural networks(DNNs) can be approximated by a shallow Gaus-sian processes (GP) with much fewer parameters.A lot of features in modern convolutional neuralnetwork (CNN) have not been considered in thiswork. In this paper, to extend the flexibility ofthe transformation from modern neural networkarchitecture to shallow Gaussian process, a frame-work for DNNs is introduced. An average poolingoperation and a concatenation operation are de-rived to support densely-connection structures tofit in Garriga-Alonso et al.’s architecture by trans-forming them into simple matrix multiplication.The newly derived DenseNet-GP significantly re-duce the time for calculating the kernel matrixfor the GP while having comparable accuracy inclassifying images in CIFAR10.

Download __here__

The behavior of low-precision training in distributed computing environments.

Download __here__

Using the parameters of this model as estimated from the Top 200 data, we apply a clustering algorithm to identify songs with similar features and performance.

Download __here__

For course __CS 6850 The Structure of Information Networks __ taught by Prof. __Jon Kleinberg __

We propose the probabilistic temporal network that we can encode this uncertainty into the network by giving each edge a probability of being ”available” during each time slot. Interesting questions include routing and cascading in such network. Our idea of this probabilistic networks is inspired by the temporal network models, in which edges have some kind of time-relevant labeling. In this paper we focus on the routing problem in a simple probabilistic temporal network where each edge have uniform independent probability of being ”available” in each time slot.

Download __here__

With Prof. __David Shmoys __

Web & Mobile Tool for Optimally Reallocating Bikes.

Download __here__

With Prof. __Jamol Pender __

Simulated the bikes’ distribution in a bike-sharing system over time with a delay model

With Prof. __Austin R. Benson __

Large Question-and-Answer (Q&A) platforms support diverse knowledge curation on the Web. While researchers have studied user behaviour on such platforms in a variety of contexts, there is relatively little insight into important by-products of user behaviour that also encode knowledge. Here, we analyse and model the macroscopic structure of tags applied by users to annotate and catalogue questions, using a collection of 168 Stack Exchange websites that span a diversity of sizes and topics. We study the distribution of tag frequencies and also the structure of ‘co-tagging’ networks where nodes are tags and links connect tags that have been applied to the same question. We find striking similarity in tagging structure across Stack Exchange communities, even though each community evolves independently (albeit under similar guidelines). Our findings thus provide evidence that social tagging behaviour is largely driven by the Stack Exchange platform itself and not by the individual Stack Exchange communities. We also develop a simple generative model that creates random bipartite graphs of tags and questions. Our model accounts for the tag frequency distribution but does not explicitly account for co-tagging correlations. Even under these constraints, we demonstrate empirically and theoretically that our model can reproduce a number of the statistical properties that characterize co-tagging networks.

Download __here__

For course __ORIE 6741 Bayesian Machine Learning __ taught by Prof. __Andrew Wilson __

Recent work (Garriga-Alonso et al., 2018) has shown deep convolutional neural networks(DNNs) can be approximated by a shallow Gaus-sian processes (GP) with much fewer parameters.A lot of features in modern convolutional neuralnetwork (CNN) have not been considered in thiswork. In this paper, to extend the flexibility ofthe transformation from modern neural networkarchitecture to shallow Gaussian process, a frame-work for DNNs is introduced. An average poolingoperation and a concatenation operation are de-rived to support densely-connection structures tofit in Garriga-Alonso et al.’s architecture by trans-forming them into simple matrix multiplication.The newly derived DenseNet-GP significantly re-duce the time for calculating the kernel matrixfor the GP while having comparable accuracy inclassifying images in CIFAR10.

Download __here__

For course __CS 6787 Advanced Machine Learning Systems __ taught by Prof. __Christopher De Sa __

The behavior of low-precision training in distributed computing environments.

Download __here__

With Prof. __Jamol Pender __

Using the parameters of this model as estimated from the Top 200 data, we apply a clustering algorithm to identify songs with similar features and performance.

Download __here__

** Published:**

This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!

** Published:**

This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.

Prof. __Walker White__, Cornell University, 2017

Prof. __Arpita Ghosh__, Cornell University, 2018

Prof. __Kilian Weinberger__, Cornell University, 2018

Prof. __Robert Kleinberg__, Cornell University, 2019

Prof. __Nathan Kallus__, Cornell University, 2019