seminar presentation uwo

Faculty / Staff Search

Department / unit search.

• System Health Status
• Websites A - Z
• Acuity Star
• Email for Life
• GroupWise Web Access
• Single Sign-On

• Undergraduate
• Resident Research Day
• Research Tools/Tips
• Funding Resources
• Research Contacts
• Research Collaboration
• Research Retreat
• Schulich School of Medicine & Dentistry Research Office
• Research Western

Resident Seminar Presentations

• Resident Academic Half Day
• Resident Trainee Committee
• Resident Manual
• Resident Electives

Faculty members conduct a weekly discussion of patient management problems. Wednesday morning is an academic half day that begins with case discussions and then a formal teaching session supervised by a faculty member.  Each hospital conducts weekly general surgery teaching rounds and bi-weekly morbidity and mortality rounds. Monthly city-wide general surgery grand rounds are held and guest lecturers are invited to present. There are also monthly trauma grand rounds and monthly journal clubs.

Previous Seminar Presentations

Anus Benign Lucy Yang, Dr. Nawar Alkhamesi October 5, 2016

Malignant Disease of the Breast – Part One Scotty Rieder, Steve Latosinsky September 28, 2016

Peds Abdomen Martina Mudri, Andreana Bütter September 7, 2016

Pediatric Trauma Suzana Buac, Neil Merritt July 27, 2016

Surgical Critical Care Lucy Yang, Neil Parry May 18, 2016

Pancreatic Benign James Choi, Roberto Hernandez April 27, 2016

Liver Benign-Part 2 Nathalie Sela, Douglas Quan February 24, 2016

Appendix Sanjay Patel, Muriel Brackstone February 17, 2016

Parathyroid Kerollos Wanis, Daryl Gray February 10, 2016

Liver Benign-Part 1 Farouq Manji, Vivian McAlister February 3, 2016

Trauma Head & Neck Morgan McWilliam, Kelly Vogt January 13, 2016

Bowel Miscellaneous Esther Lau, Julie Ann Van Koughnett December 9, 2015

Perioperative Care Greig McCreery, Tina Mele November 18, 2015

Medical Mistakes Scott Reider, Julie Ann Van Koughnett November 4, 2015

Colitis Suzana Buac, Nawar Alkhamesi October 14, 2015

Benign Rectal Disease Zaid Khot, Chellappa Rajgopal October 7, 2015

Sarcomas Terry Zwiep, Steve Latosinsky September 30, 2015

Endocrine Pancreatic Neoplasms and Palliative Surgery Mostafa El-Beheiry, Ken Leslie September 9, 2015

Pediatric Trauma Patrick Murphy, Neil Merritt September 2, 2015

Colon: Neoplastic Scott Rieder, Patrick Colquhoun August 19, 2015

General Surgery London Health Sciences Centre, Rm. C8-114 London, Ontario, Canada, N6A 5A5 Tel: 519-663-3269 [email protected] Privacy | Web Standards | Terms of Use | Accessibility

London Health Science Centre

St. Joseph's Health Care London

Lawson Health Research Institute

Robarts Research Institute

• Current Students
• Future Students
• Clubs & Associations
• Application Procedure
• Degree Requirements
• Comprehensive Examination
• Graduate Courses
• Funding / Tuition
• AWM Student Chapter
• Grad Student Seminar
• Full-Time Faculty
• Postdoctoral Fellows
• Graduate Students
• Administrative Staff
• Part-Time Faculty
• Affiliated Faculty
• Emeritus Faculty
• Algebraic Geometry and Symplectic Geometry
• Algebra, Number Theory, and Combinatorics
• Computational Mathematics
• Differential Equations and Dynamical Systems
• Mathematical Biology
• Mathematical Pedagogy
• Topology and Homotopy Theory
• Western Mathematics Exposition Competition
• Math Challenge
• Math Kangaroo
• Faculty of Science Outreach
• Contact list Sign-up
• Math Teachers' Enrichment Program
• Math Calendar
• SMSS Calendar
• UWO Calendar
• Faculty of Science Calendar
• Western Connect
• SOGS Event Calendar
• Job Opportunities
• Undergraduate

Graduate Program

Graduate student seminar, practical information.

• Time: Fridays at 3:30 PM
• Location : MC 107
• Organizers : Alan Flatres , Alejandro Santacruz Hidalgo ,  Priya Bucha Jain ,  Shubhankar , and  Udit Mavinkurve

Winter 2024

April 5: curtis wilson.

Title: The Golod-Shafarevich Theorem

Abstract : We introduce the class field tower infinite issue and state its solution, the Golod-Shafarevich theorem. We prove the theorem, and provide a refinement for the graded case. We discuss some examples and finish with an application involving finitely generated infinite torsion groups.

March 29: Yunhai Xiang

Title: An easy tour of Galois cohomology

Abstract : Galois cohomology is a topic that should interest a wide range of audiences: number theorists, algebraic geometers, homotopy theorists, etc. It is a wonderful example of an application of ideas from algebraic topology to study algebra and number theory. In this talk, we will discuss the basics of Galois cohomology, and we demonstrate its power by using it to prove the Mordell-Weil theorem for elliptic curves. If time permits, we might also discuss a little bit about its generalization: étale cohomology.

March 22: Esther Yartey

Title: Structural connectivity across datasets and species reveals community structure in cortex with specific connection features

Abstract : Advancements in neuroimaging technologies, particularly diffusion MRI, now allow reconstructing the long-range fiber connection patterns in the human brain. We study the network whose connection weights are determined by the number of fibers between individual brain regions. We study networks from the Human Connectome Project (HCP) and networks extracted from individual imaging subjects through a data processing pipeline developed in our group. By applying an algorithm to detect highly connected “communities” in these networks, we find a discrete set of communities appear robustly in the human brain. A specific community in the occipital lobe systematically displays high eigenvector centrality (EVC), a measure of the influence of nodes within a network. We explore the variations in these network structures among individuals and in retested subjects to isolate the sources of inter-individual variability. This result consistently appears across nearly all subjects and in a test-retest dataset. Similar community structure also appears in connectomes from macaque and marmoset brains, but the existence of an occipital lobe community with high EVC is specific to human connectomes. Taken together, these results reveal novel organization in the structural connectivity of the brain, derived from a fully data-driven approach, where clear community organization appears. This community organization relates to known functional divisions, such as visual and auditory sensory pathways, but also reveals community structure within higher-order areas, whose functional relevance can be studied in future work.

March 15: Thomas Thorbjornsen

Title: The Synthetic Fundamental Group of the Circle

Abstract : Homotopy type theory is a foundation for mathematics that is well-suited to do homotopy theory. Unlike ZFC, we no longer have access to the law of excluded middle or the axiom of choice. Many mathematicians find it daunting and off-putting to work without these axioms, but great opportunity is created amidst the challenge. In this talk we will investigate how we can do homotopy theory in homotopy type theory. We will construct the fundamental group of the circle by using the tools provided by Martin-Löf type theory, Voevodsky’s univalence axiom, and higher inductive types. In particular, we will look at the underlying language of type theory and its identity types, how fiber bundles are expressed as type families, and the essential role played by the univalence axiom.

March 8: Sayantan Roy Chowdhury

Title: Essential Dimension of Symplectic Sheaves over a curve

Abstract : Essential dimension of an algebraic object captures the minimum number of variables needed to parameterize it. Concrete as it sounds, this invariant is often hard to compute even in the most simplest of cases. In this talk, we will tackle this problem for the moduli space of symplectic sheaves on a curve. We will start out by defining (and drawing pictures) for these objects. Subsequently, we outline a roadmap for estimating the essential dimension of this moduli space enroute deformation theory.

March 1: Marwa Tuffaha

Title: Mutator dynamics cannot be explained by mutation rates alone

Abstract : Mutators, cells with elevated mutation rates, are common in both natural microbial populations and in human cancers. Recent experiments have shown that mutators can invade a population, but the invasion dynamics and probability couldn’t be explained by mutation rates alone. Here we show, analytically and in simulation, that mutation bias (which types of mutations are likely to occur) can play an important role in the emergence of mutators. A mutator that reduces or reverses the historically prevailing mutational bias is shown to have an increased chance of invasion, while chances are reduced when the bias is reinforced. These findings are important when trying to understand natural populations or competition experiments with mutators.

February 16: Tao Gong

Title: What is the space of conjugacy classes?

Abstract : When G is a topological group, G acts on itself by conjugation. This leads to the natural question: what is the quotient space of conjugacy classes? In this talk, we will work out the answer to this question in the special case when G is a connected compact simple Lie group – the space is contractible!

February 9: Michelle Hatzel

Title: Continuation Methods for Numerical Problem Solving

Abstract : Informally, if two functions can be “continuously deformed” from one to the other, this is called a homotopy. Homotopy emerged from theory more than a century ago and was introduced as a numerical method for solving non-linear problems in the 1960s. The basic components of these early continuation algorithms built on earlier path-tracking methods, which exist in today’s “black box” solvers. We will look at the building blocks of continuation algorithms, how they work (or don’t), and how key insights from the 1970s and 1980s contributed to some powerful polynomial-solving software packages.

January 19: Blake Whiting

Title:  Acyclic Models

Abstract : Acyclic models, as it's commonly seen today, is a proof technique used to show when two chain complexes are chain equivalent or have isomorphic homology. It originated as a theorem by Eilenberg and MacLane (1953), where it was immediately used to show the Eilenberg-Zilber theorem (1953). This theorem, proven directly via acyclic models, gives us a Künneth theorem and defines the cup product, which turns cohomology into a graded ring. This talk will be an exposition on (one version of) the acyclic models theorem, as given by Michael Barr in 2002. I will give the necessary definitions to understand Barr's modern formulation of acyclic models, and then prove it. Time permitting, I will also discuss how the Eilenberg-Zilber theorem follows directly from it and potential avenues to generalizing acyclic models.

December 1: Prakash Singh

Title:   The Hofer diameter problem for rational symplectic manifolds

Abstract : In general, Lie groups do not admit bi-invariant metrics, and infinite dimensional Lie groups should not admit such metrics either. But surprisingly, Ham admits one such metric (in fact, unique in a sense), called the 'Hofer metric', discovered by Hofer in the 90s. People have been studying the large-scale geometry properties of this metric for a long time, but such studies were restricted to either 2-dimensions, monotone symplectic manifolds, or to aspherical manifolds. In particular, it is widely conjectured that the hofer diameter is infinite for every closed symplectic manifold, and this conjecture has been settled for the above-mentioned manifolds. I will talk about the diameter problem associated with this metric for some rational ruled manifolds like CP2, S2 x S2, and their blow-ups, using methods from quantum homology and spectral invariants on them. I will prove the conjecture for CP2 and S2 x S2, and I will prove it under a mild assumption (but unproven) for S2 x S2 blown up once.

November 24: Elaine Murphy

Title: The Mathematical Structure of Point Mutations

Abstract : Mutation is the engine of evolution. By considering only single point mutations (SNPs) on DNA sequences, we see a natural group theoretic model of mutations acting on the set of nucleotides. In this talk, we will investigate the implications of this structure for synonymous mutations (mutations that do not change the encoded amino acids) and how this affects the notion of distance between two genetic sequences.

November 17: Manimugdha Saikia

Title: Analytic properties of quantum states associated with complex manifolds

Abstract :   In Quantum Information Theory, there is a rich collection of analytic tools to study tensor product of Hilbert spaces. Geometric quantization attaches Hilbert spaces to symplectic manifolds. Study of these information theoretic measures on these specific Hilbert spaces leads to interesting insights. In our study, we look for invariants, or to what extent the geometry of the space influences the Quantum Information aspects of the Hilbert space and vice versa. In this talk, we shall present our asymptotic result for the average entropy over all the pure states on the (quantum) Hilbert space H_{1,N} \otimes H_{2,N} where H_{1,N}$ and H_{2,N} are the spaces of holomorphic sections of the N-th tensor powers of hermitian ample line bundles on compact complex manifolds. I shall also talk about how certain states associated with product submanifolds become separable.

November 10: Alejandro Santacruz Hidalgo

Title: Hardy's inequality: a brief review, some extensions and applications.

Abstract : In 1915 G.H Hardy needed an estimate for arithmetic means to find a proof of Hilbert's inequality for sequences, a continuous version of that inequality followed in 1925. Since then, extensions have been made in many directions; more general domains, weighted norm inequalities, general measures, among others. In this talk we will review the classic statement of Hardy's original inequality. We will explore some of the extensions of this important inequality and review some of its implications, such as, Sobolev inequalities and boundedness of the Fourier transform in weighted Lorentz spaces.

October 27: Nathan Pagliaroli

Abstract : In this talk I will introduce the notation of a matrix ensemble with a focus on the Gaussian Unitary Ensemble (GUE) as an example. I will introduce its basic properties in connection with map enumeration. In particular, I will outline a proof of the Genus Expansion Formula for moments of the GUE. Time permitting we will discuss the famous Harer-Zagier formula .

October 20: Alan Flatres

Abstract : Altruism can seem at first glance to be counterintuitive: why would I spend my energy and resources for someone else's profit? To elucidate this mystery, in 1964, Hamilton wrote a simple rule that describes the evolutionary trajectory of a trait that is costly for the individual having it but that brings benefits to another individual. This formula sums the cost of bearing this trait and the benefits received by the other individual, weighted by the genetic linkage between the two individuals. Thanks to Hamilton's work, we can better understand the evolution of costly behavior such as cooperative breeding. However, the simplicity of Hamilton's rule makes it hard to apply in nature. Indeed, the diversity of species and their life histories requires extensions of Hamilton's rule to study the evolution of altruism in different contexts. In this talk, I will present Hamilton's rule from its basic form to more complex extensions that help us to understand the evolution of costly behavior in different species.

October 13: Nathan Kershaw

Abstract : Discrete homotopy theory is a relatively new area of mathematics, concerned with applying methods from homotopy theory in topology to the category of graphs. In order to do this, a notion of a product between graphs is required. Classically two products have been considered, the box product and the categorical product. These products lead to two different homotopy theories, namely A-theory and X-theory, respectively. This leads us to the question of why these two products are considered, and if one can define other products to study discrete homotopy theory with instead. In this talk, we will answer this question by fully characterizing all closed symmetric monoidal products on the category of graphs. This talk will be based on joint work with C. Kapulkin (arxiv:2310.00493).

October 6: Oussama Hamza

Abstract : At the beginning of the century, Labute and Minac introduced a criterion, on presentations of pro-p groups, ensuring that the cohomological dimension is two. Groups with presentations satisfying this condition are called mild. For that purpose, they mixed gradations and filtrations techniques, originally introduced by Golod and Shafarevich to construct infinite pro-p groups, with Anick's results on graded algebras.

Recently, Hamza introduced a new criterion on the presentation of finitely presented pro-p groups which allows us to compute their cohomology groups and infer quotients of mild groups of cohomological dimension strictly larger than two. Hamza still used previous techniques and enrich them using Graph and Right Angled Artin Groups/Algebras Theory, Groebner basis, etc.

Hamza applied previous criterion to obtain new Galois groups over p-rational fields with prescribed ramification and splitting and cohomological dimension larger than two.

In this talk, we discuss previous results with their motivations and techniques if time permits.

September 29: Tenoch Morales

Abstract : Evolution is driven by mutations that change the reproductive success of mutant individuals with respect to their unmutated counterparts. These effects on the "fitness" of the organisms can be measured empirically and using mathematical models, which has been increasingly successful in the past decade. In these studies, the effects of the novo mutations in the fitness is measured by a probability distribution, known as the Distribution of Fitness Effects (the DFE). This distribution is predicted to differ for better- or worse-adapted organisms, thus the DFE must change dynamically during the process of adaptation, a fact highlighted in recent studies.

In this work, we analyze the change in the DFE during an adaptive process across a fitness landscape. First, we derive analytical approximations for the DFE and the underlying distributions for the allele's fitness contributions. Then, we compare these results with independent simulations that relax several simplifying assumptions made in the analysis. This computational work confirms that our analytical expressions provide a good approximation to the dynamically changing DFE during adaption.

We observe that as de novo mutations accumulate, the DFE is shaped in two meaningful ways: by increasing the fraction of deleterious mutations and by decreasing the variance of the distribution.

Winter 2023

April 14: reid ciolfi.

Title :  Why is the derivative a non-injective operator?

Abstract : The simplest answer to this question is very well known: it is because the derivative maps all constants to zero. In this talk, we shall not be satisfied with the simplest answer. We will ask a series of additional questions about why and how the derivative maps constants to zero. In order to delve deeper, we shall introduce and briefly motivate the concept of fractional calculus. Armed with this additional structure, and with some of the rich properties of the Gamma function, we will answer our questions to the fullest possible extent. However, we will have to take the Gamma function apart in the process; an integral representation, a product representation, and an exponential representation will each be used in turn. Along the way, we will also discover an eloquent proof of why the exponential function is a fixed point of the derivative, and why Stirling's approximation for the Gamma function is effective.

March 31: Mojgan Ezadian

Title : Quantitative estimates of selection bias in bacterial mutation accumulation experiments

Abstract : Mutation accumulation (MA) experiments play a crucial role in understanding the processes underlying evolution. In microbial populations, MA experiments typically involve a period of population growth between severe bottlenecks, such that a single individual can form a visible colony. In this study, we quantify the impact of positive and negative selection on MA experiments. Our results demonstrate that selective effects can significantly bias the distribution of fitness effects (DFE) and mutation rates estimated from MA experiments in microbes. Furthermore, we propose a straightforward correction for this bias that can be applied to both beneficial and deleterious mutations. The outcomes of this research emphasize the importance of positive selection in microbial MA experiments to obtain a more accurate understanding of fundamental evolutionary parameters.

March 24: Marios Velivasakis 

Title : Representations of the symmetric group and Z-forms  

Abstract : In representation theory, we try to connect groups with invertible matrices (usually over the complex numbers). Our most powerful tool is character theory, i.e., looking at the trace of the corresponding matrices, because it is a full invariant (two representations are equivalent if and only if they have the same character). An interesting question is: “What happens if we consider matrices over smaller fields or even the integers? Do we still have the same invariants?”. In this talk, we will discuss representation theory in general, and how we can produce all representations for the symmetric group combinatorially. In addition, we will talk about what happens if we consider our matrices over the integers and how the standard tools fail to describe these representations.

March 17: Jacqueline Doan

Title : Neural Network Powered Recommender System: Restricted Boltzmann Machine 

Abstract : How did Spotify know our music taste so well? Recommendation algorithms are widely implemented on entertainment platforms like Netflix and Spotify to provide users with a more personalized experience online. Collaborative filtering is the idea that a target user is more likely to like an product if others with the same interests highly rated that product. In order to analyze and process large and sparse data sets often associated with users’ data, Restricted Boltzmann Machine (RBM), a stochastic neural network model, was implemented as a model for users’ ratings of products by Salakhutdinov et al. in 2007.  We will discuss the implementation of RBM and the ethics of recommender systems in this talk.

March 10: Kumar Shukla

Title : Poincaré duality and enumerative geometry

Abstract : How many lines intersect 4 given lines in 3-dimensional space? Poincaré duality gives us a geometric interpretation of the cup product. We can use this to compute the cohomology ring of the Grassmanians. This interpretation is also central to the subject of enumerative geometry. Using Poincaré duality as the starting point, we will give a brief introduction to enumerative geometry and answer some of the classical problems in this subject like the one posed above or the problem of counting the number of lines in a cubic surface.

March 3: Chirantan Mukherjee

Title : Model structure on simplicial categories

Abstract : In the first part of the talk, we review the axioms of model categories and define the Kan-Quillen model structure on simplicial sets. We then move on to define a model structure on the category enriched over simplicial sets. This, further forms a model of (∞, 1)-categories.

February 17: Tao Gong

Title :   Cohomology rings of classifying spaces

Abstract : The classifying space of a Lie group is used to classify the principle bundle, hence computation on cohomology of classifying spaces is quite important. In this lecture, we will focus on cohomology over integers. For a Kac-Moody Lie group of finite type, the homotopy colimit of classifying spaces of parabolic groups is the base space of a sphere bundle, where the total space is exactly the classifying space of the original group. This provides a systematic way of computation. We will see examples of the exceptional Lie group and the projective unitary group.

February 10: Alan Flatres

Title : Evolution of cooperative breeding with group augmentation effects and ecological feedbacks

Abstract : Cooperative breeding occurs when an individual helps to raise the offspring of others. It is typically considered to be costly for helpers who lose or postpone the opportunity of personal fitness gains. This behaviour is widespread, occurring in a variety of different taxa, and ecological settings. Moreover, phylogenetic data suggest that environmental conditions play a role in promoting and hindering cooperative breeding. The complex interplay between environmental constraints and population interaction makes it challenging to model cooperative breeding in a satisfying way. 

In order to better understand the influence of the environment on cooperative breeding while having reasonable computations, we built a coarse-grained model to study the group augmentation effect. That way, this population model allows us to have more complex relations between the environment and the population and thus to understand their role better.

Specifically, by computing the inclusive fitness of this kin selection model, we were able to show that environment-individuals relations, for instance, the probability of establishment, have an influence over the emergence and development of altruistic behaviour in the population.

February 3: Curtis Wilson

Title : Classifying diagram algebras  

Abstract : We introduce the representation theory of quivers with a focus on their indecomposable representations. We provide a nice criterion for an algebra to be indecomposable, and finish by proving the remarkable fact that quiver representations of finite type are exactly those with underlying Dynkin type A, D, and E.

January 27: Shubhankar

Title : Analytic Theory of Polynomials and Polar Convexity

Abstract : Traditionally, polynomials have been treated as objects of algebra. However, over the years people realized their excellent analytic properties and big names like Chebyshev, Weierstrass, Fourier spent a chunk of their careers studying them in this context. Indeed, the study of their extremal properties and critical points is of interest in more than one way. The Gauss-Lucas theorem is one such celebrated result. Polar convexity is a relatively new notion that exploits properties of Möbius transforms and convex analysis to give a new outlook on such analytic problems. The tools, even in their infancy, seem powerful and give promising results. The goal of this talk is to introduce the notion of polar convexity and time-permitting, prove a few of these results.

December 2:  Yanni Zeng

Title : Bifurcation analysis on a predator-prey model with Allee Effect

Abstract : The dynamics of a population is greatly affected by its interaction with other populations. There exist many kinds of interaction among populations, such as competition, predation, parasitism and mutualism. The predator-prey interaction is one of the most fundamental interactions and one of the most fascinating interactions to investigate. In 1931, the concept 'Allee effect' was put forward referring to a decrease in population growth rate at low population density since the growth of the species will also be affected by factors: difficulties in mating, unable to defence as a group, social felicitation of reproduction, etc. We apply bifurcation theory to consider a predator-prey model including the Allee effect and show that the species having a strong Allee effect may affect their predation and hence extinction risk. In this talk, I will introduce the related model and present methods analyzing the complex dynamical behaviors of the models with the Allee effect.

November 25:  Gunjeet Singh

Title : Classification of compact, connected topological surfaces  

Abstract : Topology as an independent subject in mathematics was started by Poincaré at the end of nineteenth century but the notion of surfaces is quite ancient than topology itself. Surfaces were studied extensively by many mathematicians such as Gauss, Riemann, Mobius, Jordan, etc in various contexts like in analysis, differential geometry, etc. Naturally enough, people wanted to classify surfaces. One of the earliest attempts were by Mobius and Jordan in 1860s even after being devoid of the definition of a 'topological surface'. It was only in 1907 when Dehn and Heegaard gave a rigorous enough proof of the statement using 'polygonal presentations' of the surfaces. In this talk, I will present the main ideas of the proof and some interesting and important examples of it.  

The classification theorem says that every compact, connected 2-manifold is homeomorphic either to a sphere, or a connected sum of one or more toriz or a connected sum of projective planes. The proof uses 'polygonal presentations' which are a special class of cell complexes, in which spaces are represented as quotients of polygons (with even number of sides) with their edges identified. 

November 18:  Mahan Moazzeni 

Title : Introduction to Khovanov homology 

Abstract : A knot is a smooth embedding of circle in R3. We are essentially interested in looking at knots, up to an ambient isotopy and see whether knot K1 can be ”distorted” into the other knot, K2. One of the most important problems in knot theory, is the classification problem, which roughly is providing a list of all of the existing knots, up to ambient isotopy. In order to classify them, we need a collection of powerful invariants that recognise each knot from the others. Khovanov Homology (KH) is one of the few topological invariants which at least detects a collection of knots from the other ones. KH is combinatorial in nature and it uses (1 + 1)-topological quantum field theory (TQFT) to move from the category of 1-manifolds to the category of vector spaces in its construction. The construction of KH requires lots of works and kind of ”boring” computations but the result, is one of the most interesting and powerful tools in knot theory that we have, as an instance, KH can detect unknot from any other knots, using KH we can find a combinatorial proof for the celebrated Milnor’s Conjecture without using Seiberg-Witten theory for torus knots. Our main goal for this talk is to introduce the KH rigorously and prove some of its basic properties. If time allows, we will proceed and show some of the interesting results about KH for alternating knots. Our ultimate goal would be to go through the J. Rasmussen’s proof of Milnor’s Conjecture on torus knots using KH, but it requires a lot works. We will most certainly cover the whole idea of his proof. 

October 28:  Tedi Ramaj

Title : Investigating the Spread of an Invasive Weed, Tradescantia fluminensis, via Partial Differential Equation Modelling and Dynamical Systems Techniques 

Abstract : A species is typically defined to be invasive to an ecosystem if it is a non-native species which threatens the ecosystem and its native species. Invasive species may include animals, plants, fungi, and other living organisms. Invasive species have historically been implicated as the one of the greatest drivers of biodiversity loss. We consider the invasion of an ecosystem by invasive plant species, Tradescantia fluminensis (T. fluminensis), an invasive weed which has been implicated in native forest depletion in countries such as Australia, New Zealand, and parts of the United States. We explore the dynamics of T. fluminensis spreading via partial differential equation (PDE) modelling and the application of nonlinear dynamical systems and phase portrait techniques. We propose a competition model, modelling the impact of competition between the invasive weed and a pre-existing native plant species, based on previous models. We are able to use some results from basic existing PDE theory in order to obtain some insights on the biological system. We also explore the existence of travelling wave solutions (TWS) of the PDE systems which represent transitions of the state of the ecosystem.  In this talk, we explore both the mathematical theory necessary to obtain the results and the policy decisions which the results may help guide.

These results have been published in the Bulletin of Mathematical Biology and may be found here in greater detail:  Ramaj, T. On the Mathematical Modelling of Competitive Invasive Weed Dynamics. Bull Math Biol 83, 13 (2021). 

October 14: Alejandro Santacruz Hidalgo

Title : Monotonicity in ordered measure spaces  

Abstract : Monotone functions defined on the real numbers are very simple and straightforward objects to understand, yet a rich theory of monotone (or decreasing) functions has been developed and has proven to provide new insight on seemingly unrelated problems like characterization of weighted Hardy's inequalities or boundedness for the Fourier transform between Lorentz spaces.

In this talk, we will give an introduction to the development of a theory of ordered measures spaces and generalize the theory of monotone functions to this setting. In a general measure space, we assume no order among its elements, instead we rely on a totally ordered collection of measurable sets to carry all the monotonicity properties, with this collection we define what a monotone function is. Next, we explore two different partial orders on the set of decreasing functions and show that there is an optimal upper bound in these partial orders. A collection of function spaces called 'Down spaces' defined by decreasing functions will be introduced and their relationship with the partial orders explained.

October 21: Nathan Pagliaroli

Title : Random matrices and Tutte’s recursion  

Abstract : In the 1950’s, W.T. Tutte found a recursive formula for counting a combinatorial object known as a planar map: a 2-cell embedding of a connected planar graph into the oriented sphere, considered up to orientation preserving homeomorphisms of the sphere. In the 1970’s, maps and Tutte’s Recursion were first used as powerful tools in the context of random matrix theory. Both the theory of maps and random matrix theory have benefited from this connection, with methods of proof lending themselves between these areas.

In this talk I will introduce the concept of maps, their generating functions, and their connection to random matrices, with the goal of deriving Tutte’s recursive formula.

October 7:  Alexandra Busch

Title : Neural sequences in primate prefrontal cortex encode working memory in naturalistic environments  

Abstract : Working memory is the ability to briefly remember and manipulate information after it becomes unavailable to the senses. A specific region of the brain - the lateral prefrontal cortex (LPFC) - has been widely implicated in working memory performance in primates. Despite decades of study, how neurons in LPFC coordinate their activity to hold sensory information in working memory remains controversial. In this talk, I will give a brief overview of the traditional model for working memory, and discuss how it is impacted by recent advances in neural recording techniques and more complex experimental paradigms. I will then focus on results from a recent project in which we analyzed the activity of hundreds of neurons recorded from LPFC of non-human primates during a naturalistic working memory task involving navigation in virtual reality. We found that selective sequential activation across neurons encoded specific items held in working memory. Administration of ketamine distorted neural sequences, selectively decreasing working memory performance. Our results indicate that neurons in the lateral prefrontal cortex causally encode working memory in naturalistic conditions via complex and temporally precise activation patterns.

September 30:  Tenoch Morales 

Title : Using Fitness Landscapes to understand the shifts in mutation biases 

Abstract : Mutations are the engine that drives evolution and adaptation forward in that it generates the variation on which natural selection acts. Although mutations are considered to occur randomly in the genome, we see that in many organisms some types of mutations occur more often than expected under uniformity; these deviations are called mutation biases. 

Even though there is no clear description of the biological mechanisms governing the formation of mutation biases, theoretical and experimental work has shown that a shift in mutation biases during the evolutionary process could grant an adaptive advantage to an organism by increasing the sampling of previously poorly explored types of mutations. 

In this talk, we will explore the most popular Fitness Landscape models, which map the genotypic space of an organism to its adaptive fitness. With these models, we can simulate the evolutionary process of a population as a walk through the genotypic space towards genotypes with higher fitness, which will help us understand the adaptive effect of shifts in mutation biases at different points on the evolutionary path. 

September 23: Jarl Taxerås Flaten

Title: The moduli space of multiplications on a space

Abstract: Since the mid-50s, various topologists have been interested in counting homotopy classes of multiplications (i.e. H-space structures) on certain spaces. For example, there's a unique multiplication on the circle (complex multiplication), and James showed that there are 12 multiplications on the 3-sphere and 120 on the 7-sphere. No other spheres admit a multiplication, barring the 0-sphere.

We present a formula for the moduli space of multiplications on a pointed object of an ∞-topos. By specializing to the ∞-topos of spaces and counting the path components of these moduli spaces, we recover the numbers just mentioned. These results have been shown in Homotopy Type Theory, which I will give a brief introduction to, and have been formalized in the Coq proof assistant, which I will demonstrate with some live-coding.

September 16: Oussama Hamza

Title : Filtrations, arithmetic, and explicit examples in an isotypical context

Abstract : Pro-p groups arise naturally in number theory as quotients of absolute Galois groups over number fields. These groups are quite mysterious. During the 60's, Koch gave a presentation of some of these quotients. Furthermore, around the same period, Jennings, Golod, Shafarevich and Lazard introduced two integer sequences (a_n) and (c_n), closely related to a special filtration of a finitely generated pro-p group G, called the Zassenhaus filtration. These sequences give the cardinality of G, and characterize its topology. For instance, we have the well-known Gocha's alternative (Golod and Shafarevich): There exists an integer n such that a_n=0 (or c_n has a polynomial growth) if and only if G is a Lie group over p-adic fields. In 2016, Minac, Rogelstad and Tan inferred an explicit relation between a_n and c_n. Recently (2022), considering geometrical ideas of Filip and Stix, Hamza got more precise relations in an isotypical context: when the automorphism group of G admits a subgroup of order a prime q dividing p-1. In this talk, we will mostly review some results of Golod, Shafarevic, Koch, Lazard, Minac, Tan and Hamza. We also give several explicit examples in an arithmetical context.

Suggested topics for MSc students

• Evolutionary game theory
• Epidemiological models
• Population dynamics models
• Inclusive fitness analysis
• Using algebra to understand genetic code
• Reedy categories: elegance vs. EZ-ness
• Karoubi envelopes and a proof of the Serre-Swan theorem
• Parallelizability of spheres: an application of topological K-theory
• Brown's representability theorem
• Classification of 2-dimensional topological quantum field theories
• Classification of Riemann surfaces
• Frobenius theorem
• Holomorphic differential equations and existence of their solutions
• Chow's theorem
• Remmert-Stein theorem and analytic sets
• Reeb foliations
• Tychonoff's theorem
• Stone-Cech compactification theorem
• Applications of graph theory in neuroscience
• Small world networks and scale free networks
• Community detection
• Spectral graph theory
• How to find patterns in data
• Gelfand-Naimark theorem
• Von Neumann algebras
• Rearrangement invariant spaces
• Peter-Weyl theorem
• Orlicz spaces

The Department of Mathematics Middlesex College London, Ontario, Canada, N6A 5B7 Tel: 519.661.2111 ext. 88774 [email protected] (undergraduate), [email protected] (grad) Privacy | Web Standards | Terms of Use | Accessibility

Calculus 1000A/B online

Office of the Registrar

Academic Calendar

Intranet Login

• Psychology students adapt to technology for 4th year seminar presentations
• Marketing, Communications and Media Relations

March 31, 2020 Facebook Twitter LinkedIn

Congratulations to the Trauma and Addiction Concurrently Treated (T.A.C.T.) team for winning the 2020 Agnes Penner Prize for the Psychology 4696E class. The group created an idea which demonstrated the greatest potential for applied psychology to benefit society. Taught by King’s professor Dr. Marcie Penner, Psych 4694E is a full-year course for students to apply findings from their psychology research to solve real-world problems. “It’s a course that pushes you outside of your comfort zone, and growth comes from being outside of your comfort zone,” says Allie Verbeem, Psych 4694E student.

The T.A.C.T group created a best-practices document outlining a set of recommendations for trauma and substance-use treatment plans, to address a root cause of addiction. Four King’s Psychology students worked all year to create the winning project: Jack Wright, Third Year Honor Specialization in Psychology, Allie Verbeem, 4th year Double Major in Psychology and Disability Studies, Brandon Vecchiola, Third Year Honor Specialization in Psychology and a Major in English Language and Literature, and Aura Pop, Third Year Honor Specialization in Psychology.

“This [project] is very close to our group’s hearts, so it would mean a lot for this to take off especially in London. We are really hoping for big things,” says Aura Pop. T.A.C.T. will attempt to implement this program in London through partnering with the invited panelists: Scott Courtice, Vanessa Dolishny, Brandon Wilson, Brynn Roberts, and King’s alumni Dr. Nonie Brennan ‘84.

The Psychology for the Common Good—Creating Research-Based Applications class presented their year-long projects to the panel of experts over the video platform Zoom on March 25, 2020.  “Changing our PowerPoint presentation to Zoom gave us a unique opportunity to be adaptable and flexible as a team, and it may have made our presentation stronger,” says Verbeem.

Other projects in the presentation addressed issues of individuals after incarceration, and mental health promotion. CommUNITY, presented their project on a comprehensive, evidence-based system of modular, non-linear weekly support meetings for people returning to society from incarceration. Mental-health Accessibility Practices (M.A.P), presented their project which advocated for more resources, practitioners, and better distribution of funds towards mental health in Ontario.

This year’s recipients join the distinguished past award winners which include the 2015 winners who founded King’s K.A.M.P .

To learn more about King’s Psychology program, please visit https://www.kings.uwo.ca/academics/psychology/ .

Service Disruptions

Due to the London Hydro power outage, the Cardinal Carter Library is closed for the remainder of today. Sorry for the inconvenience.

• Administration
• Photo Gallery
• Future Students
• Current Students

Graduate Students

• In Memoriam
• Collaborative Spaces
• Computer Labs
• Room Reservations
• Academic Advising
• Technical Support / Helpdesk Ticket
• Undergraduate
• Degree Requirements
• Course Descriptions
• Reading Courses
• Thesis Submission
• Student Life
• Own Your Future
• Useful Links
• Vector Institute Collaborative Specialization in AI

MSc in Computer Science [top]

Students must obtain credit in the required number of courses as specified below. All MSc students must attend at least 5 departmental seminars from the Topical Research in Computer Science series ( TRICS ) during their first year in the program.-->

A project normally involves the use of known techniques and concepts in the solution of a well-defined problem.A project report and public oral presentation are required.

A thesis involves a written thesis and the public oral presentation and defence of an original contribution to a particular research area.

For thesis students, thesis preparation and format, public lecture requirements and the procedure for examining the candidate and the thesis are covered in the School of Graduate and Postdoctoral Studies Thesis Regulation Guide. ( http://www.grad.uwo.ca/current_students/thesis_regulations/index.htm ).

Course-Work

Students must complete eight graduate courses as specified below. Please note that this option is not a normal route for entry into the PhD Program.

In both projects and theses, topics are to be chosen so as to allow completion within a reasonable time, given the other degree requirements.

MSc Course of Study

Your course of study is determined by your supervisor in consultation with the Graduate Chair.

Terminology: An MSc graduate course is a 9500, 9600, or 9800 level Computer Science course.

Thesis Option:

• At most one course can be an MSc reading course (9800-level designated as Reading Courses). Each professor has their own assigned number.
• At most one 9500-level course.
• At most one course may be taken outside of the Computer Science subject area.
• Thesis. For more information related to Thesis Guide, please visit http://www.grad.uwo.ca/current_students/thesis_regulations/index.htm

Project Option:

• At most two 9500-level courses.

Course-Work Option

• * Directed Study (Milestone)
• At most two courses at the graduate level may be taken outside the department, with permission of the Graduate Chair.

*Directed Study This course evaluates a student's ability to perform scholarly work and to communicate a result in a written and oral form. This is a one-term supervised research course. This is not intended to be literature survey. A report and public oral presentation are required. All coursework students must take this course. It is not open to thesis or project students.  Students must find a faculty member to supervise this course.

PhD in Computer Science [top]

On enrolment in the PhD program, you and your supervisor will determine an appropriate course of study. If necessary to complete your breadth requirement, you may be required to take some undergraduate courses which must be completed during your first two years in the program

PhD Course of Study

On enrolment in the PhD program, you and your supervisor will determine an appropriate course of study. All PhD students are required to complete the following:

• Four graduate courses (2 credits)
• At most one course can be a cross-listed course with the same evaluation for undergraduates and graduate students (9500-level).
• At least one course must be topic course (9800-level). This does not include a reading course.

In addition, students must complete:

• In depth study.
• Yearly seminar.

The Department accepts students with previous degrees that are not necessarily in Computer Science. It is expected that PhD students must have a body of knowledge about a broad range of topics that are usually taught at an undergraduate level. All PhD students are expected to satisfy the Undergraduate Breadth Requirement . A student may need to take additional courses to do so. At most three additional courses may be requested to satisfy the Undergraduate breadth requirement .

Each incoming PhD student will have their background assessed by the Breadth Assessment Committee to determine any undergraduate courses that may be needed. The assessment is done after admission. It is based on the student's PhD background statement submitted with their application. An interview may be required after the student arrives to further assess the background. The result of the assessment may include requiring the student to take at most three undergraduate courses which must be completed within two years with a mark of at least 70% for each required course. Failure to complete the courses within the specified period may result in the student being asked to withdraw from the program.

PhD Advisory Committee

The Advisory Committee should be appointed as soon as possible within a maximum of one year after registration and must consist of a minimum of three members including the supervisor. The student should be consulted on the composition of the Committee. The student's supervisor acts as Chairperson of the Committee. All members of the Advisory Committee must be members of the School of Graduate and Postdoctoral Studies and must be approved by the Graduate Chair. Changes to the Advisory Committee require approval by the Graduate Chair.

The Advisory Committee reviews the student's progress until graduation and should be available for research/thesis advice.

Undergraduate Breadth Requirement

Undergraduate breadth requirement refers to a body of knowledge about a broad range of topics that are usually taught at an undergraduate level in a Computer Science program. There are several goals in having an Undergraduate breadth requirement for a PhD student. These include the following:

• Ensure that the student is adequately prepared to take graduate courses in Computer Science.
• Ensure that the student has basic knowledge that is likely to be useful for their PhD research or post-PhD research.
• Ensure that the students can communicate with other computer scientists using a common vocabulary.
• Ensure that the student can teach a broad range of courses if and when they become a faculty member in a computer science department.
• Ensure that the student's training reflects well on the Computer Science department at the University of Western Ontario.
• Ensure that the student has a basic knowledge of computer science that is inherently good to have, and/or is a requirement for being able to call oneself a computer scientist.

With regard to (b), we recognize that a student might not use all the Undergraduate breadth requirements in their PhD research. However, we also recognize that it is unpredictable what aspects of the breadth requirement they will need. The goal is to choose a set of topics that is likely to include topics that they need to know about for their research. The proposed Undergraduate breadth requirement consists of the following:

• Knowledge equivalent to CS 3331, i.e. discrete mathematics and automata theory. Topics include sets, functions, relations, proof techniques, finite automata, regular languages, context-free grammars, Turing machines, undecidability.
• Knowledge equivalent to CS 3340, i.e., algorithm analysis and complexity theory. Topics include big O notation, recurrence relations, algorithm design techniques, searching and sorting, trees, string matching and NP-completeness.
• CS 3307, i.e., object-oriented analysis and design;
• CS 3342, i.e., programming languages.
• CS 3305, i.e. operating systems
• CS 3350, i.e. computer architecture

Indepth Study

A PhD Research Topics Survey/Proposal (which we will refer to as TSP for short) is proposed to evaluate a student's proficiency in understanding important research. The intention is that this evaluation be done at a relatively early point in their degree.

Each student must pass the TSP. The purpose of the TSP is to test the student's ability to master a particular research area as well as demonstrate the ability to provide critical analysis of research papers and to generate new ideas. The student must produce a paper that consists of two parts:

• Literature Search: The paper shall demonstrate a deep understanding of the relevant literature for a research topic through an organization of existing concepts.
• Research Proposal: The paper shall identify one or more research directions and/or suggest new approaches to solving problems that could potentially result in significant research contributions.

Evaluation:

• Submission of Paper: The paper shall be submitted before the last day of the term (as stated in the Academic Calendar) corresponding to student's fourth term of enrollment as a PhD student.
• Examination: The examination shall occur no later than the sixth week of the student's fifth term of enrollment as a PhD student.

Extensions can be given due to extenuating circumstances.

If the student fails to complete the proposal by the end of the sixth term and has NOT BEEN GRANTED an extension then the candidate may be asked to withdraw from the PhD program.

If the candidate was fast tracked from the MSc program into the PhD program the paper should be submitted before the last day of the term corresponding to the student's second term of enrolment and the candidate must complete the proposal by the end of the fourth term.

There are several objectives to be achieved:

• To allow the Advisory Committee to guide the research with helpful suggestions;
• To ensure that the student has considered important background material;
• To ensure that the student understands and is able to present a description of a problem based on their understanding of the state-of-the art and its significance.

Yearly Seminar (692)

• Each PhD candidate must present at least TWO publicly announced seminars, at least one in the third year and at least one in the fourth year of their program.
• Presenting a paper in a conference can be counted as a seminar
• Presentation in a course, proposal presentation, and PhD defence presentation, will not be counted toward the yearly seminar requirement.

Thesis preparation and format, public lecture requirements and the procedure for examining the candidate and the thesis are covered in the School of Graduate and Postdoctoral Studies Thesis Regulation Guide. ( http://www.grad.uwo.ca/current_students/thesis_regulations/index.htm )

Department of Computer Science Room 27E, Middlesex College, Western University, London, Ontario, Canada, N6A 5B7 Tel: 519-661-3566 [email protected] Privacy | Web Standards | Terms of Use | Accessibility

• National Politics
• Investigations

County Executive Kaufman's proposals for Fond du Lac campus include community, law enforcement use. What to know.

County executive sam kaufman said he plans to bring the proposals for county board approval in july and a public information meeting is slated for july 1..

Sign up for local business news with our new Fond du Lac Streetwise newsletter

FOND DU LAC – At the end of June, the buildings of the University of Wisconsin Oshkosh Fond du Lac campus will be handed over to Fond du Lac County.

County Executive Sam Kaufman presented the ideas for utilizing the campus before the June 18 county board meeting, outlining opportunities for government, community and public safety usage.

The presentation was not an official county board meeting, so no action was taken, but Kaufman said he plans to bring proposals for county board approval in July.

Additionally, a public information meeting is scheduled for July 1 at the campus for members of the community to ask questions about the proposals.

Here are some highlights from the presentation.

Classroom buildings could be used for municipal offices

The classroom buildings hold an opportunity for county offices, including the Department of Social Services and the finance department, as well as the Aging and Disability Resource Center, senior services and other offices currently at Portland Street, according to Kaufman.

As a result, Kaufman would seek to sell the Portland Street building, which has proved costly to maintain. The departments pay rent for their current spaces, and would continue to do so in the new offices.

Fond du Lac campus closing: Its impact and history in the community lives on

Many existing offices will be usable in the building, but the classrooms would need to be renovated after a space feasibility study.

Kaufman hopes to get county board approval in July and start renovations this fall.

Similarly, the administrative building could house the Land and Water Department, which has been residing on Military Road. The county would then sell the Military Road property if the department moves.

Much of the rest of the admin building has leasing opportunities, including ongoing negotiations with the state for a possible office for the Department of Workforce Development.

Community could benefit from events center, gymnasium

For Prairie Theater — which consists of the theater, library and commons area — Kaufman proposes a community performing arts center, hosting acts in the theater, and conferences and other events in the library area and classrooms.

"I want to be able to expand not only through the theater that the UW has had there, but I want to go through and also be able to now have opportunities for other events: comedy shows, musical events, plays that can take place there," he said. "Something we can market as a highlight to our community to draw people in."

He added a large number of companies have already expressed interest in using the space, and he also hopes to bid out a contract for a vendor to occupy the restaurant in the commons.

The gymnasium could also be adapted for community use as a sports complex, with some additional parking.

Kaufman hopes to fund part of this portion by selling naming rights for the theater and the gymnasium.

Art building could be converted for public safety training

With the way the art building is structured, the cost of renovating it for leasing space would be too high, so Kaufman is proposing conversion into a public safety training facility.

There would be opportunity for local law enforcement to provide training, but also agencies well beyond Fond du Lac.

It could include classroom instruction and simulation settings, such as a street, a bar, an apartment or a jail, and surrounding ponds could provide dive instruction opportunities.

Moraine Park has expressed interest in partnering with the county to benefit its correctional program.

Fond du Lac history: Remember when Galloway-West ranked 'among the giants' in the dairy industry? Its 2009 closure ended a 100-year era.

Senior housing a priority for some of the remaining parcels

Kaufman said three parcels are marked for senior housing, filling a need in the county with townhouses, condos or two-story apartment buildings.

"I wanted to create more areas for seniors than to have an activity center area within the campus itself and an area that would be welcoming to our seniors to know that they are supported in whatever they need," Kaufman said.

This development would put senior housing in close proximity to Senior Services and other resources.

How would this be funded?

Capital improvements and maintenance costs are among financial concerns, and Kaufman said he didn't want to make budget cuts within county departments or burden the taxpayers.

Two lots so far are planned for sale: one is the current rugby field, which would relocate closer to the sports complex, and the other is the parcel behind C.D. Smith.

In addition to rent from the leased spaces and money from selling some of the land, Kaufman plans to ask county board in July for a $1 million allocation from the American Rescue Plan Act funds to help with initial renovations.

Fond du Lac is also eligible for redevelopment funds from a state grant for communities with a closing UW System branch. A total of $20 million is available, and the money would have to be used for projects that would enhance the community's economy in some way, which could include supporting housing, job creation, workforce development or public infrastructure.

Kaufman said he doesn't anticipate needing to allocate any money for the 2025 budget to help pay for the campus.

The full presentation is available to view as a webcast on the county website .

Daphne Lemke is the Streetwise reporter for the Fond du Lac Reporter. Contact her at  [email protected] .

• Bahasa Indonesia
• Eastern Europe
• Moscow Oblast

Elektrostal

Elektrostal Localisation : Country Russia , Oblast Moscow Oblast . Available Information : Geographical coordinates , Population, Area, Altitude, Weather and Hotel . Nearby cities and villages : Noginsk , Pavlovsky Posad and Staraya Kupavna .

Information

Find all the information of Elektrostal or click on the section of your choice in the left menu.

• Update data

Elektrostal Demography

Information on the people and the population of Elektrostal.

Elektrostal Geography

Geographic Information regarding City of Elektrostal .

Elektrostal Distance

Distance (in kilometers) between Elektrostal and the biggest cities of Russia.

Elektrostal Map

Locate simply the city of Elektrostal through the card, map and satellite image of the city.

Elektrostal Nearby cities and villages

Elektrostal Weather

Weather forecast for the next coming days and current time of Elektrostal.

Elektrostal Sunrise and sunset

Find below the times of sunrise and sunset calculated 7 days to Elektrostal.

Elektrostal Hotel

Our team has selected for you a list of hotel in Elektrostal classified by value for money. Book your hotel room at the best price.

Elektrostal Nearby

Below is a list of activities and point of interest in Elektrostal and its surroundings.

Elektrostal Page

• Information /Russian-Federation--Moscow-Oblast--Elektrostal#info
• Demography /Russian-Federation--Moscow-Oblast--Elektrostal#demo
• Geography /Russian-Federation--Moscow-Oblast--Elektrostal#geo
• Distance /Russian-Federation--Moscow-Oblast--Elektrostal#dist1
• Map /Russian-Federation--Moscow-Oblast--Elektrostal#map
• Nearby cities and villages /Russian-Federation--Moscow-Oblast--Elektrostal#dist2
• Weather /Russian-Federation--Moscow-Oblast--Elektrostal#weather
• Sunrise and sunset /Russian-Federation--Moscow-Oblast--Elektrostal#sun
• Hotel /Russian-Federation--Moscow-Oblast--Elektrostal#hotel
• Nearby /Russian-Federation--Moscow-Oblast--Elektrostal#around
• Page /Russian-Federation--Moscow-Oblast--Elektrostal#page
• Terms of Use
• Copyright © 2024 DB-City - All rights reserved
• Change Ad Consent Do not sell my data

Get the Reddit app

A subreddit for those who enjoy learning about flags, their place in society past and present, and their design characteristics

Flag of Elektrostal, Moscow Oblast, Russia

An official website of the United States government

Here's how you know

Official websites use .gov A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS A lock ( Lock A locked padlock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Inaugural Seminar for the National Smell and Taste Center

Agenda (PDF | 175KB)

Join us on July 9 for the inaugural seminar for the new National Smell and Taste Center (NSTC), an NIH-wide effort led by the National Institute on Deafness and Other Communication Disorders (NIDCD). NSTC’s first seminar will include cutting-edge research, panel presentations, and discussions on innovations, challenges, and opportunities for advancing smell and taste research. 

• Keynote speaker: Thomas Hummel, M.D. , Smell & Taste Clinic, Department of Otorhinolaryngology, Carl Gustav Carus University Hospital, Dresden, Germany.
• When: Tuesday, July 9, 2024, 1:00 p.m. – 5:00 p.m., Eastern time. 
• Where: Live on the NIH videocast website . To attend in person on the NIH campus, Bethesda, Maryland, RSVP by July 1 . Seating is limited. 

The videocast will be captioned and recorded for later viewing. American Sign Language interpreting and CART (real-time transcription) services are available upon request. Individuals needing either of these services and/or other reasonable accommodations should contact Joshua Levy, M.D., M.P.H., M.S., NIDCD Clinical Director and NSTC Co-Director , by July 1 to ensure interpreter availability. 

NSTC is dedicated to advancing understanding of the chemical senses (smell and taste) and related disorders through comprehensive research, patient care, and education. NSTC was formed through collaborations among several NIH research laboratories and clinics to address the need to expand work in smell and taste research—a need that captured national attention during the COVID-19 pandemic. NSTC’s mission is to improve the health and quality of life of individuals affected by these sensory disorders. More information about NSTC can be found on the NIDCD website .

*Note: PDF files can be viewed with the free Adobe Reader .

• Games & Quizzes
• History & Society
• Science & Tech
• Biographies
• Animals & Nature
• Geography & Travel
• Arts & Culture
• On This Day
• One Good Fact
• New Articles
• Lifestyles & Social Issues
• Philosophy & Religion
• Politics, Law & Government
• World History
• Health & Medicine
• Browse Biographies
• Birds, Reptiles & Other Vertebrates
• Bugs, Mollusks & Other Invertebrates
• Environment
• Fossils & Geologic Time
• Entertainment & Pop Culture
• Sports & Recreation
• Visual Arts
• Demystified
• Image Galleries
• Infographics
• Top Questions
• Britannica Kids
• Saving Earth
• Space Next 50
• Student Center

Elektrostal

Our editors will review what you’ve submitted and determine whether to revise the article.

Elektrostal , city, Moscow oblast (province), western Russia . It lies 36 miles (58 km) east of Moscow city. The name, meaning “electric steel,” derives from the high-quality-steel industry established there soon after the October Revolution in 1917. During World War II , parts of the heavy-machine-building industry were relocated there from Ukraine, and Elektrostal is now a centre for the production of metallurgical equipment. Pop. (2006 est.) 146,189.