Courses tagged with "Before 1300: Ancient and Medieval History" (183)

Sort by: Name, Rating, Price
Start time: Any, Upcoming, Recent started, New, Always Open
Price: Any, Free, Paid
Starts : 2002-09-01
13 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

How does the global network infrastructure work and what are the design principles on which it is based? In what ways are these design principles compromised in practice? How do we make it work better in today's world? How do we ensure that it will work well in the future in the face of rapidly growing scale and heterogeneity? And how should Internet applications be written, so they can obtain the best possible performance both for themselves and for others using the infrastructure? These are some issues that are grappled with in this course. The course will focus on the design, implementation, analysis, and evaluation of large-scale networked systems.

Topics include internetworking philosophies, unicast and multicast routing, congestion control, network quality of service, mobile networking, router architectures, network-aware applications, content dissemination systems, network security, and performance issues. Material for the course will be drawn from research papers, industry white papers, and Internet RFCs.

Starts : 2005-09-01
11 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

6.823 is a course in the department's "Computer Systems and Architecture" concentration. 6.823 is a study of the evolution of computer architecture and the factors influencing the design of hardware and software elements of computer systems. Topics may include: instruction set design; processor micro-architecture and pipelining; cache and virtual memory organizations; protection and sharing; I/O and interrupts; in-order and out-of-order superscalar architectures; VLIW machines; vector supercomputers; multithreaded architectures; symmetric multiprocessors; and parallel computers.

Starts : 2009-02-01
16 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information control Information Theory Nutrition

This course covers topics on the engineering of computer software and hardware systems: techniques for controlling complexity; strong modularity using client-server design, virtual memory, and threads; networks; atomicity and coordination of parallel activities; recovery and reliability; privacy, security, and encryption; and impact of computer systems on society. Case studies of working systems and readings from the current literature provide comparisons and contrasts. Two design projects are required, and students engage in extensive written communication exercises.

Starts : 2014-09-01
No votes
MIT OpenCourseWare (OCW) Free Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

6.858 Computer Systems Security is a class about the design and implementation of secure computer systems. Lectures cover threat models, attacks that compromise security, and techniques for achieving security, based on recent research papers. Topics include operating system (OS) security, capabilities, information flow control, language security, network protocols, hardware security, and security in web applications.

Starts : 2008-09-01
11 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course focuses on laws, approximations and relations of continuum electromechanics. Topics include mechanical and electromechanical transfer relations, statics and dynamics of electromechanical systems having a static equilibrium, electromechanical flows, and field coupling with thermal and molecular diffusion. Also covered are electrokinetics, streaming interactions, application to materials processing, magnetohydrodynamic and electrohydrodynamic pumps and generators, ferrohydrodynamics, physiochemical systems, heat transfer, continuum feedback control, electron beam devices, and plasma dynamics.

Acknowledgements

The instructor would like to thank Xuancheng Shao and Anyang Hou for transcribing into LaTeX the problem set solutions and exam solutions, respectively.

Starts : 2012-02-01
9 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.

Starts : 2005-02-01
8 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course features a rigorous introduction to modern cryptography, with an emphasis on the fundamental cryptographic primitives of public-key encryption, digital signatures, pseudo-random number generation, and basic protocols and their computational complexity requirements.

Starts : 2002-09-01
20 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.

Starts : 2010-09-01
No votes
MIT OpenCourseWare (OCW) Free Before 1300: Ancient and Medieval History Infor Information control Information Theory Nutrition

This course relies on primary readings from the database community to introduce graduate students to the foundations of database systems, focusing on basics such as the relational algebra and data model, schema normalization, query optimization, and transactions. It is designed for students who have taken 6.033 (or equivalent); no prior database experience is assumed, though students who have taken an undergraduate course in databases are encouraged to attend.

Starts : 2010-09-01
14 votes
MIT OpenCourseWare (OCW) Free Closed [?] Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course relies on primary readings from the database community to introduce graduate students to the foundations of database systems, focusing on basics such as the relational algebra and data model, schema normalization, query optimization, and transactions. It is designed for students who have taken 6.033 (or equivalent); no prior database experience is assumed, though students who have taken an undergraduate course in databases are encouraged to attend.

Starts : 2015-02-01
17 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information control Information Theory Nutrition

This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

Starts : 2012-02-01
No votes
MIT OpenCourseWare (OCW) Free Closed [?] Before 1300: Ancient and Medieval History Infor Information control Information Theory Nutrition

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing.

Starts : 2007-02-01
16 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

6.777J / 2.372J is an introduction to microsystem design. Topics covered include: material properties, microfabrication technologies, structural behavior, sensing methods, fluid flow, microscale transport, noise, and amplifiers feedback systems. Student teams design microsystems (sensors, actuators, and sensing/control systems) of a variety of types, (e.g., optical MEMS, bioMEMS, inertial sensors) to meet a set of performance specifications (e.g., sensitivity, signal-to-noise) using a realistic microfabrication process. There is an emphasis on modeling and simulation in the design process. Prior fabrication experience is desirable. The course is worth 4 Engineering Design Points.

Starts : 2008-02-01
12 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course examines the role of the engineer as patent expert and as technical witness in court and patent interference and related proceedings. It discusses the rights and obligations of engineers in connection with educational institutions, government, and large and small businesses. It compares various manners of transplanting inventions into business operations, including development of New England and other U.S. electronics and biotechnology industries and their different types of institutions. The course also considers American systems of incentive to creativity apart from the patent laws in the atomic energy and space fields.

Acknowledgment

The instructors would like to thank Joanne Rines and Elijah Ercolino for their efforts in preparing this course.

Starts : 2011-02-01
14 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

Discrete stochastic processes are essentially probabilistic systems that evolve in time via random changes occurring at discrete fixed or random intervals. This course aims to help students acquire both the mathematical principles and the intuition necessary to create, analyze, and understand insightful models for a broad range of these processes. The range of areas for which discrete stochastic-process models are useful is constantly expanding, and includes many applications in engineering, physics, biology, operations research and finance.

Starts : 2005-09-01
13 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This class addresses the representation, analysis, and design of discrete time signals and systems. The major concepts covered include: Discrete-time processing of continuous-time signals; decimation, interpolation, and sampling rate conversion; flowgraph structures for DT systems; time-and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters; linear prediction; discrete Fourier transform, FFT algorithm; short-time Fourier analysis and filter banks; multirate techniques; Hilbert transforms; Cepstral analysis and various applications.

Acknowledgements

I would like to express my thanks to Thomas Baran, Myung Jin Choi, and Xiaomeng Shi for compiling the lecture notes on this site from my individual lectures and handouts and their class notes during the semesters that they were students in the course. These lecture notes, the text book and included problem sets and solutions will hopefully be helpful as you learn and explore the topic of Discrete-Time Signal Processing.

Starts : 2009-09-01
11 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

Distributed algorithms are algorithms designed to run on multiple processors, without tight centralized control. In general, they are harder to design and harder to understand than single-processor sequential algorithms. Distributed algorithms are used in many practical systems, ranging from large computer networks to multiprocessor shared-memory systems. They also have a rich theory, which forms the subject matter for this course.

The core of the material will consist of basic distributed algorithms and impossibility results, as covered in Prof. Lynch's book Distributed Algorithms. This will be supplemented by some updated material on topics such as self-stabilization, wait-free computability, and failure detectors, and some new material on scalable shared-memory concurrent programming.

Starts : 2006-02-01
19 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

This course covers abstractions and implementation techniques for the design of distributed systems. Topics include: server design, network programming, naming, storage systems, security, and fault tolerance. The assigned readings for the course are from current literature. This course is worth 6 Engineering Design Points.

Starts : 2015-09-01
12 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

The course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). We will consider optimal control of a dynamical system over both a finite and an infinite number of stages. This includes systems with finite or infinite state spaces, as well as perfectly or imperfectly observed systems. We will also discuss approximation methods for problems involving large state spaces. Applications of dynamic programming in a variety of fields will be covered in recitations.

Starts : 2011-02-01
9 votes
MIT OpenCourseWare (OCW) Free Computer Sciences Before 1300: Ancient and Medieval History Infor Information environments Information Theory Nutrition

The course addresses dynamic systems, i.e., systems that evolve with time. Typically these systems have inputs and outputs; it is of interest to understand how the input affects the output (or, vice-versa, what inputs should be given to generate a desired output). In particular, we will concentrate on systems that can be modeled by Ordinary Differential Equations (ODEs), and that satisfy certain linearity and time-invariance conditions.

We will analyze the response of these systems to inputs and initial conditions. It is of particular interest to analyze systems obtained as interconnections (e.g., feedback) of two or more other systems. We will learn how to design (control) systems that ensure desirable properties (e.g., stability, performance) of the interconnection with a given dynamic system.

Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.