Global Arc

Independent research or investigation resulting in a substantial formal report in the student's area of interest under the supervision of a faculty member. Open to sophomores and juniors.

Independent research or investigation resulting in a substantial formal report in the student's area of interest under the supervision of a faculty member. Open to sophomores and juniors.

This course showcases how networks are widespread in society, technology, and nature, via a mix of theory and applications. It demonstrates the importance of understanding network effects when making decisions in an increasingly connected world. Topics include an introduction to graph theory, game theory, social networks, information networks, strategic interactions on networks, network models, network dynamics, information diffusion, and more. Prerequisite: ORF 309 or permission of instructor. Two lectures, one precept.

Electronic commerce, traditionally the buying and selling of goods using electronic technologies, extends to essentially all facets of human interaction when extended to services, particularly information. The course focuses on both the software and the hardware aspects of traditional aspects as well as the broader aspects of the creation, dissemination and human consumption electronic services. Covered will be the physical, financial and social aspects of these technologies. Two 90-minute lectures, one 50-minute precept.

An introduction to popular statistical approaches in regression and time series analysis. Topics will include theoretical aspects and practical considerations of linear, nonlinear, and nonparametric modeling (kernels, neural networks, and decision trees). Prerequsites: ORF 245 and ORF 309 or instructor's permission. Two lectures, one lab, and one precept.

Major methods of statistics as applied to the engineering and physical sciences. The central theme is the construction of empirical models, the design of experiments for elucidating models, and the applications of models for forecasting and decision making under uncertainty. Three lectures. Prerequisite: 245 or equivalent.

This is an introduction to the stochastic models inspired by the dynamics of resource sharing. Topics discussed include: early motivating communication systems (telephone and computer networks); modern applications (call centers, healthcare operations, and urban planning for smart cities); and key formulas (from Erlang blocking and delay to Little's law). We also review supporting stochastic theories like equilibrium Markov chains along with Markov, Poisson and renewal processes. Prerequisite: ORF 309 or equivalent.

An introduction to the uses of simulation and computation for analyzing stochastic models and interpreting real phenomena. Topics covered include generating discrete and continuous random variables, stochastic ordering, the statistical analysis of simulated data, variance reduction techniques, statistical validation techniques, nonstationary Markov chains, and Markov chain Monte Carlo methods. Applications are drawn from problems in finance, manufacturing, and communication networks. Students will be encouraged to program in Python. Office hours will be offered for students unfamiliar with the language. Prerequisites: ORF 245 and ORF 309.

The management of complex systems through the control of physical, financial and informational resources. The course focuses on developing mathematical models for resource allocation, with an emphasis on capturing the role of information in decisions. The course seeks to integrate skills in statistics, stochastics and optimization using applications drawn from problems in dynamic resource management which tests modeling skills and teamwork. Prerequisites: ORF 245, ORF 307 and ORF 309, or equivalents. Two lectures, one precept.

An introduction to stochastic dynamic programming and stochastic control. The course deals with discrete and continuous-state dynamic programs, finite and infinite horizons, stationary and nonstationary data. Applications drawn from inventory management, sequential games, stochastic shortest path, dynamic resource allocation problems. Solution algorithms include classical policy and value iteration for smaller problems and stochastic approximation methods for large-scale applications. Prerequisites: 307 and 309.