This one-sheet handout provides a list of six discussion questions to address …
This one-sheet handout provides a list of six discussion questions to address at the initial planning stages for organizations interested in incorporating OER into their programs, grants, or activities. These questions are applicable to OER projects across academic disciplines and levels.
Los modelos de datos son mecanismos que permiten la abstracción y representación …
Los modelos de datos son mecanismos que permiten la abstracción y representación de un dominio, mediante un conjunto de reglas y símbolos pertenecientes a un lenguaje de modelado que es conforme al modelo. Un modelo puede definirse como la abstracción que permite representar los diferentes elementos pertenecientes a un dominio del negocio, sus relaciones y asociaciones, conforme sucedería en el mundo real.
Distributed algorithms are algorithms designed to run on multiple processors, without tight …
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.
This course covers abstractions and implementation techniques for the design of distributed …
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.
Dive into Systems is a free, online textbook that serves as a …
Dive into Systems is a free, online textbook that serves as a gentle introduction to computer systems, computer organization, and parallel computing. The book is intended for an audience that has only a CS1 background. It guides readers through a vertical slice of a computer to develop an understanding of a variety of systems topics, including:
- how a computer runs a program, from a program expressed in a high-level language to low-level binary representation and circuits
- programming in C and Assembly, assuming a CS1 background
- introduction to operating systems and the systems costs that affect program performance (the memory hierarchy, caching, and code optimization)
- introduction to parallel computing with shared memory and pthreads
Dive into Systems is designed to be present topics in as independent manner as possible so that it can be used as a primary textbook for a wide range of introductory-level computer systems courses, or as a supplemental background textbook for upper-level courses that cover Operating Systems, Computer Architecture, Compilers, Networks, Databases, and Parallel Computing.
The tutorial that the "DjangoGirls" initiative is using for all of its …
The tutorial that the "DjangoGirls" initiative is using for all of its workshops. It's a very beginner-friendly tutorial with introductions to the command line, Python, Django, HTML and CSS. No previous programming experience is required.
Once participants have finished the tutorial, they will have a small working web application: their own blog. The tutorial will show them how to put it online, so others will see their work.
The tutorial is available in English, French, Chinese and Ukrainian. "beta" versions of translations to other languages are also available. (The English version is considered the "original" and is usually the most maintained, complete and up-to-date one.)
In the year 1970’s when relational database came into picture, data schema …
In the year 1970’s when relational database came into picture, data schema to be worked upon were reasonably elemental and simple wherein the data items were to be arranged as a set of formally described tables with rows and columns. But with the need to store volumes and variety of data (unstructured) in recent years, non-relational database technologies (document-oriented, graph based, column based, key-value and hybrid) have emerged to address the requirement that allow data to be grouped together more naturally and logically. One of the most popular ways of storing data is a document-oriented database, basically employed for storing, managing and retrieval of semi-structured data where each record and its associated data is considered of as a “document”. A document-oriented database is also termed as a document store or simple document, is one of the kind of NoSQL database.
Este trabalho explora a emulação do sistema operacional Arch Linux em um …
Este trabalho explora a emulação do sistema operacional Arch Linux em um ambiente virtualizado usando o VirtualBox. A emulação permite a execução de sistemas operacionais em hardware que não é nativo, proporcionando uma plataforma para testes, desenvolvimento e aprendizado.
The unifying theme of this course is best captured by the title …
The unifying theme of this course is best captured by the title of our main reference book: “Recursive Methods in Economic Dynamics”. We start by covering deterministic and stochastic dynamic optimization using dynamic programming analysis. We then study the properties of the resulting dynamic systems. Finally, we will go over a recursive method for repeated games that has proven useful in contract theory and macroeconomics. We shall stress applications and examples of all these techniques throughout the course.
The course covers the basic models and solution techniques for problems of …
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.
The course addresses dynamic systems, i.e., systems that evolve with time. Typically …
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.
This course provides an introduction to nonlinear deterministic dynamical systems. Topics covered include: …
This course provides an introduction to nonlinear deterministic dynamical systems. Topics covered include: nonlinear ordinary differential equations; planar autonomous systems; fundamental theory: Picard iteration, contraction mapping theorem, and Bellman-Gronwall lemma; stability of equilibria by Lyapunov’s first and second methods; feedback linearization; and application to nonlinear circuits and control systems.
No restrictions on your remixing, redistributing, or making derivative works. Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make derivative works.
Most restrictive license type. Prohibits most uses, sharing, and any changes.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based educators, or other custom arrangements. Go to the resource provider to see their individual restrictions.
