This lecture covers several mathematical subjects that are widely used in machine learning, which particularly include general topology, functional analysis, and measure theory.
MLPI Lecture 2: Monte Carlo Methods (Basics)Dahua Lin
This lecture covers the basics of Monte Carlo methods, including Monte Carlo integration, Transform sampling, Rejection sampling, Importance sampling, Markov chain theory, and Markov Chain Monte Carlo (MCMC).
Lecture 5: Variational Estimation and InferenceDahua Lin
This lectures covers estimation of graphical models, Expectation-maximization, mean field methods, and variational EM. It also provides a unified perspective of these methods based on information geometry.
MLPI Lecture 4: Graphical Model and Exponential FamilyDahua Lin
This lecture covers the basics of graphical models, exponential families, conjugate priors, as well as guidelines for formulating graphical models for practical problems.
This document provides an overview of a graduate level machine learning course. It will be taught in a topic-driven format with introductory lectures, paper readings, homework, and in-class discussions. Students will present on a paper or subject at the end of the course. The course will cover foundational machine learning theories and tools to help students develop their own models and algorithms, rather than focusing on teaching specific algorithms like support vector machines. Topics will include Markov chain Monte Carlo, exponential family distributions, generalized linear models, empirical risk minimization, proximal optimization methods, graphical models, variational inference, and handling big data.
MLPI Lecture 3: Advanced Sampling TechniquesDahua Lin
This lecture covers several advanced MCMC sampling techniques, including collapsed Gibbs sampling, Slice Sampler, Parallel tempering, and Hamiltonian Monte Carlo, as well as several softwares for generic sampling.
This document summarizes Moses Mugisha's talk on esoteric data structures. It begins with an overview of simple and complex data structures that will be covered, including arrays, hash tables, bit vectors, heaps, stacks, linked lists, skip lists, tries, and sorted maps. It then discusses why data structures are important for algorithm efficiency and code organization. The bulk of the document dives into detailed explanations and examples of each data structure, covering their implementations, time and space complexities, and applications. Key points are made about asymptotic analysis, caching, collisions, bloom filters, tries, and using skip lists to implement a sorted map.
Generating Natural-Language Text with Neural NetworksJonathan Mugan
Automatic text generation enables computers to summarize text, to have conversations in customer-service and other settings, and to customize content based on the characteristics and goals of the human interlocutor. Using neural networks to automatically generate text is appealing because they can be trained through examples with no need to manually specify what should be said when. In this talk, we will provide an overview of the existing algorithms used in neural text generation, such as sequence2sequence models, reinforcement learning, variational methods, and generative adversarial networks. We will also discuss existing work that specifies how the content of generated text can be determined by manipulating a latent code. The talk will conclude with a discussion of current challenges and shortcomings of neural text generation.
LESSON 3B. FOCUS: FOR LOOPS, NESTED LOOPS, TASKS AND CHALLENGES.
Introduction to, with examples, For loops. Challenges and tasks included with solutions (predict the output). Compare ‘while’ and ‘for’ loops. Use the break statement and explore how it works in different scenarios. Learn about Nested Loops. Learn about the need for initialisation (set starting value). Create your own for loops. Create the beginnings of an arithmetic quiz using a random function and for loops. Big ideas discussion: Is the universe digital. A program? Introducing Gottfried Leibniz and Konrad Zuse. Includes a suggested videos, ‘Big ideas’ discussion, and HW/research projects section.
This document discusses point pattern analysis, which involves finding and explaining patterns in maps of point locations. It introduces key concepts like point patterns, windows, kernel density estimation, and nearest neighbor analysis. Kernel density estimation creates a smooth surface showing the density of points across an area. Nearest neighbor analysis examines the cumulative distribution of distances to each point's nearest neighbor, and can identify clustered, uniform, or random patterns. Significance is tested using simulations.
This document outlines the OpenRepGrid project which aims to create open source software for analyzing repertory grid data using the R programming language. It discusses the motivation for the project due to limitations of existing proprietary software. The OpenRepGrid R package provides functionality for importing, analyzing, and visualizing repertory grid data. The document demonstrates several analysis methods available in OpenRepGrid and discusses plans to develop graphical user interfaces and community participation to further expand the software's capabilities.
We've all wondered how to use Machine Learning with Go, but what about turning the tables for once? What can Machine Learning do *for* Go? During this presentation, we will discover how different Machine Learning models can help us write better go by predicting from our next character to our next bug!
Francesc’s talk will cover the basics of what Machine Learning techniques can be applied to source code, specifically:
- [embeddings over identifiers] (https://bit.ly/2HEcQhg)
- structural embeddings over source code, answering the question of how similar two fragments of code are,
- recurrent neural networks for code completion,
- future direction of the research.
While the topic is advanced, the level of mathematics required for this talk will be kept to a minimum. Rather than getting stuck in the details, we'll discuss the advantages and limitations of these techniques, and their possible implications to our developer lives.
This document discusses convolutional neural networks (CNNs) for graph-structured data. CNNs are traditionally designed for Euclidean data like images but not irregular graph data. The key ideas are:
1) Define convolution on graphs using graph spectral theory by representing signals in the graph Fourier domain.
2) Coarsen graphs using a balanced cut model to extract hierarchical patterns.
3) Perform fast graph pooling using a binary tree of coarsened graphs for downsampling.
This allows generalizing CNNs to any graph data with the same computational efficiency as standard CNNs. Related works on graph CNNs are also discussed.
The document discusses machine learning and provides an itinerary for a tour through some favorite machine learning results, directions, and open problems. The itinerary includes stops to discuss batch learning algorithms and sample complexity, online learning, strong complexity results using SQ and Fourier analysis, and current practical issues in machine learning. The tour guide aims to emphasize connections between machine learning and other areas of theory of computation.
This document provides an introduction to the C programming language. It explains that C allows programmers to write code using functions and keywords rather than billions of 1s and 0s. It then discusses some basic C concepts like #include, main(), printf(), variables, data types, if/else statements, for loops, and functions. The document is meant to explain the basic building blocks of a C program to a beginner reader.
Speaking 'Development Language' (Or, how to get your hands dirty with technic...Julie Meloni
Slides from an internal workshop at George Washington University Library on 12 June 2012. The goal of this workshop was to increase the number of people who can “work” on technical issues in the library. Topics were grouped into three main parts: "Development Lifecycle & Where You Fit In", "Computer Programming Basics", and "Python in Particular".
This document discusses ramping up DevOps for Big Data developers using Apache Mesos and Spark. It provides an overview of Mesos and its principles as a cluster manager and resource manager. It then discusses Spark and its advantages over Hadoop, including its speed, flexibility, and fault tolerance. The document also covers automating deployment of Mesos, HDFS and Spark using tools like Ansible, Packer and Tinc. It discusses ongoing work to further integrate Mesos and Spark.
Introduction to functional programming (In Arabic)Omar Abdelhafith
Functional programming is a declarative programming paradigm where programs are built around mathematical functions and immutable data transformation (1). Key aspects include using pure functions that always return the same output for the same input and avoid side effects, immutable data that does not change state, representing everything as expressions rather than statements, and treating functions as data that can be passed into other functions or returned from them (2). These characteristics allow functional programs to be deterministic, avoid bugs from mutable state, and more easily write parallel and distributed programs (3).
The OpenRepGrid project – Software tools for the analysis and administration...Mark Heckmann
In the workshop participants are introduced to the OpenRepGrid project. Part of the project is an open source software for the analysis of repertory grid data. The software currently comes in two flavors: As an online analysis tool and as an add-on package for the R program. The workshop gives an introduction to the software, its development philosophy and outlines the set of currently implemented features. Moreover, it is demonstrated how researchers may extend software features to suit their needs and actively contribute to its development. Further information about OpenRepGrid can be found on the program’s website under www.openrepgrid.org.
Erik Bernhardsson is the CTO at Better, a small startup in NYC working with mortgages. Before Better, he spent five years at Spotify managing teams working with machine learning and data analytics, in particular music recommendations.
Abstract Summary:
Nearest Neighbor Methods And Vector Models: Vector models are being used in a lot of different fields: natural language processing, recommender systems, computer vision, and other things. They are fast and convenient and are often state of the art in terms of accuracy. One of the challenges with vector models is that as the number of dimensions increase, finding similar items gets challenging. Erik developed a library called “Annoy” that uses a forest of random tree to do fast approximate nearest neighbor queries in high dimensional spaces. We will cover some specific applications of vector models with and how Annoy works.
From Lisp to Clojure/Incanter and RAn Introductionelliando dias
This document provides a comparison between the statistical computing languages R and Clojure/Incanter. It discusses the histories and philosophies behind Lisp, Fortran, R and Clojure. Key differences noted are that Clojure runs on the Java Virtual Machine, allowing it to leverage Java libraries, while R is primarily written in C and Fortran. Incanter is presented as a Clojure-based platform for statistical computing and graphics that is more immature than R but allows easier access to Java capabilities. Basic syntax comparisons are provided.
This document summarizes the key steps in the locality sensitive hashing (LSH) algorithm for finding similar documents:
1. Documents are converted to sets of shingles (sequences of tokens) to represent them as high-dimensional data points.
2. MinHashing is applied to generate signatures (hashes) for each document such that similar documents are likely to have the same signatures. This compresses the data into a signature matrix.
3. LSH uses the signature matrix to hash similar documents into the same buckets with high probability, finding candidate pairs for further similarity evaluation and filtering out dissimilar pairs from consideration. This improves the computation efficiency over directly comparing all pairs.
This document provides an outline and overview of a presentation on Python programming. The outline includes sections on what Python is, why Python, an introduction to Python, Python programming tips and tricks, more on Python, and the scientific module. Under each section, there are bullet points explaining key aspects of Python like its design, uses, basic syntax, data structures, functions, classes, modules, and popular scientific programming libraries like NumPy.
This document discusses best practices for exception handling, logging, and diagnostics. It emphasizes that exceptions are a communication mechanism, and logging is used to convey exception information. Proper exception handling involves cleanup, logging at key points, and either propagating the exception, attempting recovery, or requesting user action. Throwing informative exceptions, adding context data, and avoiding loss of stack traces are also recommended.
Presentation of the main IR models
Presentation of our submission to TREC KBA 2014 (Entity oriented information retrieval), in partnership with Kware company (V. Bouvier, M. Benoit)
PPT ON INTRODUCTION TO AI- UNIT-1-PART-2.pptxRaviKiranVarma4
The document discusses different types of agents and problem solving by searching. It describes four types of agent programs: simple reflex agents, model-based reflex agents, goal-based agents, and utility-based agents. It also covers formulating problems, searching strategies, problem solving by searching, measuring performance of searches, types of search strategies including uninformed and informed searches, and specific search algorithms like breadth-first search, uniform cost search, depth-first search, and depth-limited search.
LESSON 3B. FOCUS: FOR LOOPS, NESTED LOOPS, TASKS AND CHALLENGES.
Introduction to, with examples, For loops. Challenges and tasks included with solutions (predict the output). Compare ‘while’ and ‘for’ loops. Use the break statement and explore how it works in different scenarios. Learn about Nested Loops. Learn about the need for initialisation (set starting value). Create your own for loops. Create the beginnings of an arithmetic quiz using a random function and for loops. Big ideas discussion: Is the universe digital. A program? Introducing Gottfried Leibniz and Konrad Zuse. Includes a suggested videos, ‘Big ideas’ discussion, and HW/research projects section.
This document discusses point pattern analysis, which involves finding and explaining patterns in maps of point locations. It introduces key concepts like point patterns, windows, kernel density estimation, and nearest neighbor analysis. Kernel density estimation creates a smooth surface showing the density of points across an area. Nearest neighbor analysis examines the cumulative distribution of distances to each point's nearest neighbor, and can identify clustered, uniform, or random patterns. Significance is tested using simulations.
This document outlines the OpenRepGrid project which aims to create open source software for analyzing repertory grid data using the R programming language. It discusses the motivation for the project due to limitations of existing proprietary software. The OpenRepGrid R package provides functionality for importing, analyzing, and visualizing repertory grid data. The document demonstrates several analysis methods available in OpenRepGrid and discusses plans to develop graphical user interfaces and community participation to further expand the software's capabilities.
We've all wondered how to use Machine Learning with Go, but what about turning the tables for once? What can Machine Learning do *for* Go? During this presentation, we will discover how different Machine Learning models can help us write better go by predicting from our next character to our next bug!
Francesc’s talk will cover the basics of what Machine Learning techniques can be applied to source code, specifically:
- [embeddings over identifiers] (https://bit.ly/2HEcQhg)
- structural embeddings over source code, answering the question of how similar two fragments of code are,
- recurrent neural networks for code completion,
- future direction of the research.
While the topic is advanced, the level of mathematics required for this talk will be kept to a minimum. Rather than getting stuck in the details, we'll discuss the advantages and limitations of these techniques, and their possible implications to our developer lives.
This document discusses convolutional neural networks (CNNs) for graph-structured data. CNNs are traditionally designed for Euclidean data like images but not irregular graph data. The key ideas are:
1) Define convolution on graphs using graph spectral theory by representing signals in the graph Fourier domain.
2) Coarsen graphs using a balanced cut model to extract hierarchical patterns.
3) Perform fast graph pooling using a binary tree of coarsened graphs for downsampling.
This allows generalizing CNNs to any graph data with the same computational efficiency as standard CNNs. Related works on graph CNNs are also discussed.
The document discusses machine learning and provides an itinerary for a tour through some favorite machine learning results, directions, and open problems. The itinerary includes stops to discuss batch learning algorithms and sample complexity, online learning, strong complexity results using SQ and Fourier analysis, and current practical issues in machine learning. The tour guide aims to emphasize connections between machine learning and other areas of theory of computation.
This document provides an introduction to the C programming language. It explains that C allows programmers to write code using functions and keywords rather than billions of 1s and 0s. It then discusses some basic C concepts like #include, main(), printf(), variables, data types, if/else statements, for loops, and functions. The document is meant to explain the basic building blocks of a C program to a beginner reader.
Speaking 'Development Language' (Or, how to get your hands dirty with technic...Julie Meloni
Slides from an internal workshop at George Washington University Library on 12 June 2012. The goal of this workshop was to increase the number of people who can “work” on technical issues in the library. Topics were grouped into three main parts: "Development Lifecycle & Where You Fit In", "Computer Programming Basics", and "Python in Particular".
This document discusses ramping up DevOps for Big Data developers using Apache Mesos and Spark. It provides an overview of Mesos and its principles as a cluster manager and resource manager. It then discusses Spark and its advantages over Hadoop, including its speed, flexibility, and fault tolerance. The document also covers automating deployment of Mesos, HDFS and Spark using tools like Ansible, Packer and Tinc. It discusses ongoing work to further integrate Mesos and Spark.
Introduction to functional programming (In Arabic)Omar Abdelhafith
Functional programming is a declarative programming paradigm where programs are built around mathematical functions and immutable data transformation (1). Key aspects include using pure functions that always return the same output for the same input and avoid side effects, immutable data that does not change state, representing everything as expressions rather than statements, and treating functions as data that can be passed into other functions or returned from them (2). These characteristics allow functional programs to be deterministic, avoid bugs from mutable state, and more easily write parallel and distributed programs (3).
The OpenRepGrid project – Software tools for the analysis and administration...Mark Heckmann
In the workshop participants are introduced to the OpenRepGrid project. Part of the project is an open source software for the analysis of repertory grid data. The software currently comes in two flavors: As an online analysis tool and as an add-on package for the R program. The workshop gives an introduction to the software, its development philosophy and outlines the set of currently implemented features. Moreover, it is demonstrated how researchers may extend software features to suit their needs and actively contribute to its development. Further information about OpenRepGrid can be found on the program’s website under www.openrepgrid.org.
Erik Bernhardsson is the CTO at Better, a small startup in NYC working with mortgages. Before Better, he spent five years at Spotify managing teams working with machine learning and data analytics, in particular music recommendations.
Abstract Summary:
Nearest Neighbor Methods And Vector Models: Vector models are being used in a lot of different fields: natural language processing, recommender systems, computer vision, and other things. They are fast and convenient and are often state of the art in terms of accuracy. One of the challenges with vector models is that as the number of dimensions increase, finding similar items gets challenging. Erik developed a library called “Annoy” that uses a forest of random tree to do fast approximate nearest neighbor queries in high dimensional spaces. We will cover some specific applications of vector models with and how Annoy works.
From Lisp to Clojure/Incanter and RAn Introductionelliando dias
This document provides a comparison between the statistical computing languages R and Clojure/Incanter. It discusses the histories and philosophies behind Lisp, Fortran, R and Clojure. Key differences noted are that Clojure runs on the Java Virtual Machine, allowing it to leverage Java libraries, while R is primarily written in C and Fortran. Incanter is presented as a Clojure-based platform for statistical computing and graphics that is more immature than R but allows easier access to Java capabilities. Basic syntax comparisons are provided.
This document summarizes the key steps in the locality sensitive hashing (LSH) algorithm for finding similar documents:
1. Documents are converted to sets of shingles (sequences of tokens) to represent them as high-dimensional data points.
2. MinHashing is applied to generate signatures (hashes) for each document such that similar documents are likely to have the same signatures. This compresses the data into a signature matrix.
3. LSH uses the signature matrix to hash similar documents into the same buckets with high probability, finding candidate pairs for further similarity evaluation and filtering out dissimilar pairs from consideration. This improves the computation efficiency over directly comparing all pairs.
This document provides an outline and overview of a presentation on Python programming. The outline includes sections on what Python is, why Python, an introduction to Python, Python programming tips and tricks, more on Python, and the scientific module. Under each section, there are bullet points explaining key aspects of Python like its design, uses, basic syntax, data structures, functions, classes, modules, and popular scientific programming libraries like NumPy.
This document discusses best practices for exception handling, logging, and diagnostics. It emphasizes that exceptions are a communication mechanism, and logging is used to convey exception information. Proper exception handling involves cleanup, logging at key points, and either propagating the exception, attempting recovery, or requesting user action. Throwing informative exceptions, adding context data, and avoiding loss of stack traces are also recommended.
Presentation of the main IR models
Presentation of our submission to TREC KBA 2014 (Entity oriented information retrieval), in partnership with Kware company (V. Bouvier, M. Benoit)
PPT ON INTRODUCTION TO AI- UNIT-1-PART-2.pptxRaviKiranVarma4
The document discusses different types of agents and problem solving by searching. It describes four types of agent programs: simple reflex agents, model-based reflex agents, goal-based agents, and utility-based agents. It also covers formulating problems, searching strategies, problem solving by searching, measuring performance of searches, types of search strategies including uninformed and informed searches, and specific search algorithms like breadth-first search, uniform cost search, depth-first search, and depth-limited search.
An upper limit to the lifetime of stellar remnants from gravitational pair pr...Sérgio Sacani
Black holes are assumed to decay via Hawking radiation. Recently we found evidence that spacetime curvature alone without the need for an event horizon leads to black hole evaporation. Here we investigate the evaporation rate and decay time of a non-rotating star of constant density due to spacetime curvature-induced pair production and apply this to compact stellar remnants such as neutron stars and white dwarfs. We calculate the creation of virtual pairs of massless scalar particles in spherically symmetric asymptotically flat curved spacetimes. This calculation is based on covariant perturbation theory with the quantum f ield representing, e.g., gravitons or photons. We find that in this picture the evaporation timescale, τ, of massive objects scales with the average mass density, ρ, as τ ∝ ρ−3/2. The maximum age of neutron stars, τ ∼ 1068yr, is comparable to that of low-mass stellar black holes. White dwarfs, supermassive black holes, and dark matter supercluster halos evaporate on longer, but also finite timescales. Neutron stars and white dwarfs decay similarly to black holes, ending in an explosive event when they become unstable. This sets a general upper limit for the lifetime of matter in the universe, which in general is much longer than the HubbleLemaˆ ıtre time, although primordial objects with densities above ρmax ≈ 3×1053 g/cm3 should have dissolved by now. As a consequence, fossil stellar remnants from a previous universe could be present in our current universe only if the recurrence time of star forming universes is smaller than about ∼ 1068years.
Eric Schott- Environment, Animal and Human Health (3).pptxttalbert1
Baltimore’s Inner Harbor is getting cleaner. But is it safe to swim? Dr. Eric Schott and his team at IMET are working to answer that question. Their research looks at how sewage and bacteria get into the water — and how to track it.
Astrobiological implications of the stability andreactivity of peptide nuclei...Sérgio Sacani
Recent renewed interest regarding the possibility of life in the Venusian clouds has led to new studies on organicchemistry in concentrated sulfuric acid. However, life requires complex genetic polymers for biological function.Therefore, finding suitable candidates for genetic polymers stable in concentrated sulfuric acid is a necessary firststep to establish that biologically functional macromolecules can exist in this environment. We explore peptidenucleic acid (PNA) as a candidate for a genetic-like polymer in a hypothetical sulfuric acid biochemistry. PNA hex-amers undergo between 0.4 and 28.6% degradation in 98% (w/w) sulfuric acid at ~25°C, over the span of 14 days,depending on the sequence, but undergo complete solvolysis above 80°C. Our work is the first key step towardthe identification of a genetic-like polymer that is stable in this unique solvent and further establishes that con-centrated sulfuric acid can sustain a diverse range of organic chemistry that might be the basis of a form of lifedifferent from Earth’s
Anti fungal agents Medicinal Chemistry IIIHRUTUJA WAGH
Synthetic antifungals
Broad spectrum
Fungistatic or fungicidal depending on conc of drug
Most commonly used
Classified as imidazoles & triazoles
1) Imidazoles: Two nitrogens in structure
Topical: econazole, miconazole, clotrimazole
Systemic : ketoconazole
Newer : butaconazole, oxiconazole, sulconazole
2) Triazoles : Three nitrogens in structure
Systemic : Fluconazole, itraconazole, voriconazole
Topical: Terconazole for superficial infections
Fungi are also called mycoses
Fungi are Eukaryotic cells. They possess mitochondria, nuclei & cell membranes.
They have rigid cell walls containing chitin as well as polysaccharides, and a cell membrane composed of ergosterol.
Antifungal drugs are in general more toxic than antibacterial agents.
Azoles are predominantly fungistatic. They inhibit C-14 α-demethylase (a cytochrome P450 enzyme), thus blocking the demethylation of lanosterol to ergosterol the principal sterol of fungal membranes.
This inhibition disrupts membrane structure and function and, thereby, inhibits fungal cell growth.
Clotrimazole is a synthetic, imidazole derivate with broad-spectrum, antifungal activity
Clotrimazole inhibits biosynthesis of sterols, particularly ergosterol an essential component of the fungal cell membrane, thereby damaging and affecting the permeability of the cell membrane. This results in leakage and loss of essential intracellular compounds, and eventually causes cell lysis.
This presentation explores the application of Discrete Choice Experiments (DCEs) to evaluate public preferences for environmental enhancements to Airthrey Loch, a freshwater lake located on the University of Stirling campus. The study aims to identify the most valued ecological and recreational improvements—such as water quality, biodiversity, and access facilities by analyzing how individuals make trade-offs among various attributes. The results provide insights for policy-makers and campus planners to design sustainable and community-preferred interventions. This work bridges environmental economics and conservation strategy using empirical, choice-based data analysis.
Transgenic Mice in Cancer Research - Creative BiolabsCreative-Biolabs
This slide centers on transgenic mice in cancer research. It first presents the increasing global cancer burden and limits of traditional therapies, then introduces the advantages of mice as model organisms. It explains what transgenic mice are, their creation methods, and diverse applications in cancer research. Case studies in lung and breast cancer prove their significance. Future innovations and Creative Biolabs' services are also covered, highlighting their role in advancing cancer research.
Dendritic cells are immune cells with unique features of their own. They possess the ability of cross-presentation. They can bridge the innate and adaptive arms of the immune system. Their crucial role in the immune response has implicated them in autoimmune diseases and cancer. Kosheeka delivers dendritic cells from diverse species to assist in your research endeavors. Our team provides high-quality dendritic cells with assured viability, purity, and functionality.
Location of proprioceptors in labyrinth, muscles, tendons of muscles, joints, ligaments and fascia, different types of proprioceptors include muscle spindle, golgi tendon organ, pacinian corpuscle, free nerve endings, proprioceptors in labyrinth, nuclear bag fibers, nuclear chain fibers, nerve supply to muscle spindle, sensory nerve supply, motor nerve supply, functions of muscle spindle include stretch reflex, dynamic response, static response, physiologic tremor, role of muscle spindle in the maintenance of muscle tone, structure and nerve supply to golgi tendon organ, functions of golgi tendon organs include role of golgi tendon organ in forceful contraction, role in golgi tendon organ, role of golgi tendon organ in lengthening reactions, pacinian corpuscle and free nerve endings,
Location of reticular formation, organization of reticular formation, organization of reticular formation include raphe group, paramedian group, lateral group, medial group, intermediate group, connections of reticular formation include afferent as well as efferent connections, divisions of reticular formation include midbrain reticular formation, medullary reticular formation ad well as pontine reticular formation, nuclei of reticular formation include nucleus reticularis pontis oralis, nucleus reticularis pontis caudalis, locus ceruleus nucleus, subcerulus reticular nucleus, tegmenti pontis reticular nucleus, pendulo pontine reticular nucleus and nucleus reticular cuneiformis, functions of reticular formation include ascending reticular activating system, descending reticular system, mechanism of action of ascending reticular activating system, descending reticular activating system include descending facilitatory reticular system and descending inhibitory reticular system.