text:
<< Week of November 26 >>

## Sunday, November 26, 2017

### Fall 2017 Architecture Sustainability Colloquium

Colloquium | August 25 – December 1, 2017 every day | 112 Wurster Hall

College of Environmental Design

FRIDAYS - AUG 25 through DEC 1. CHECK THE SCHEDULE FOR SPEAKERS. Bay Area Leaders discuss topics in sustainability.

## Monday, November 27, 2017

### Fall 2017 Architecture Sustainability Colloquium

Colloquium | August 25 – December 1, 2017 every day | 112 Wurster Hall

College of Environmental Design

FRIDAYS - AUG 25 through DEC 1. CHECK THE SCHEDULE FOR SPEAKERS. Bay Area Leaders discuss topics in sustainability.

### PF Lunch Seminar:

Seminar | November 27 | 12-2 p.m. | 648 Evans Hall

Elina Tuominen; Krista Ruffini; Evan Rose & Yotam Shem-Tov

Elina Tuominen - "Income inequality, redistributive preferences, and the extent of redistribution: An empirical application of optimal tax approach" (with Matti Tuomala and Hannu Tanninen)

Krista Ruffini - "School nutrition and student discipline: Effects of schoolwide free lunch"

Evan Rose & Yotam Shem-Tov -

by November 20.

### Reducing Damage Concentration with a Strongback System: SEMM Seminar with Dual Presentations

Seminar | November 27 | 12-1 p.m. | 502 Davis Hall

Barbara Simpson, Department of Civil & Environmental Engineering, UC Berkeley

This presentation will present the numerical and experimental results of a “strongback” system, a modification of the conventional braced frame that utilizes a vertical steel truss or “spine” to delay or prevent weak-story behavior.

### Simulation-Based Data-Driven Damage Detection for Highway Bridge Systems: SEMM Seminar with Dual Presentations

Seminar | November 27 | 12-1 p.m. | 502 Davis Hall

Xiao Liang, Department of Civil & Environmental Engineering, UC Berkeley

This presentation explores data-driven structural health monitoring (SHM) algorithms utilizing the robust nonlinear time history analysis.

### Graduate Student Seminar

Seminar | November 27 | 12-1:30 p.m. | 489 Minor Hall

Kaleb Asfaha; Katharina Foote

### Combinatorics Seminar: On the connectivity of three-dimensional tilings

Seminar | November 27 | 12:10-1 p.m. | 939 Evans Hall

Caroline Klivans, Brown University

Department of Mathematics

In this talk, I will discuss domino tilings of three dimensional manifolds. In particular, I will focus on the connected components of the space of tilings of such regions under local moves. Using topological techniques we introduce two parameters of tilings: the flux and the twist. Our main result characterizes when two tilings are connected by local moves in terms of these two parameters. (I...   More >

### Latino Mass Mobilization: Immigration, Racialization, and Activism

Colloquium | November 27 | 12:45-2 p.m. |  Philip Selznick Seminar Room

2240 Piedmont Avenue, Berkeley, CA

Chris Zepeda-Millán, Assistant Professor of Ethnic Studies and Chair of the Center for Research on Social Change, UC Berkeley

Lecture by Chris Zepeda-Millán, Assistant Professor of Ethnic Studies and Chair of the Center for Research on Social Change

### String-Math Seminar: Periodic Monopoles and Q-opers

Seminar | November 27 | 2-3 p.m. | 402 LeConte Hall

Vasily Pestun, IHES

Department of Mathematics

I will discuss quantization of integrable system of periodic monopoles, or equivalently group valued Higgs bundles on a curve, and construction of q-oper Lagrangian variety in the special coordinates.

### Seminar 211, Economic History: Taxing Unwanted Populations: Fiscal Policy and Conversions in Early Islam

Seminar | November 27 | 2-4 p.m. | 597 Evans Hall

Mohamed Saleh, Toulouse School of Economics and Stanford University

Department of Economics

Co-authored with Jean Tirole

### Seminar 231, Public Finance: Taxing Unwanted Populations: Fiscal Policy and Conversions in Early Islam

Seminar | November 27 | 2-4 p.m. | 597 Evans Hall | Note change in location

Mohamed Saleh, Toulouse School of Economics and Stanford University

Department of Economics

Joint with Economic History
Co-authored with Jean Tirole

### BLISS Seminar: Blind Deconvolution Methods for Short Message Communications

Seminar | November 27 | 3-4 p.m. | 540 Cory Hall

Philipp Walk, Caltech

Blind deconvolution is a challenging problem in signal processing having a long history. We will present new deconvolution algorithms which perform stable and efficient without using any stochastic assumptions on the signals and only demand a coprime zero structure. For the next generation of wireless networks such blind deconvolution methods are crucial to provide a sporadic short message...   More >

### Arithmetic Geometry and Number Theory RTG Seminar: On certain special values of L-functions associated to elliptic curves and real quadratic fields

Seminar | November 27 | 3:10-5 p.m. | 891 Evans Hall

Chung Pang Mok, Purdue University

Department of Mathematics

We study certain normalized special values of L-functions associated to elliptic curves and real quadratic fields. Under certain hypothesis, we are able to show that these are squares of rational numbers. This result is used to improve on a theorem of Bertolini-Darmon on rationality of Stark-Heegner points over genus fields of real quadratic fields.

Seminar Format: The seminar consists of two...   More >

### Dissertation Talk: Scalable Systems and Algorithms for Genomic Variant Analysis

Presentation | November 27 | 3:30-4:30 p.m. | 400 Cory Hall

Frank Austin Nothaft, UC Berkeley

### Geometric Representation Theory Seminar: Microlocal mirror symmetry and a new coherent theory on open manifolds

Seminar | November 29 | 11 a.m.-12:30 p.m. | 732 Evans Hall

Dmitry Vaintrob, IAS

Department of Mathematics

I will talk about my recent proof of a mirror symmetry statement for microlocal Fukaya categories associated to an $n$-dimensional symplectic cylinder, $T^*(S^1)^n$. Along the way I will define a remarkable new category of coherent sheaves, which I call the log-coherent category (a close cousin of the parabolic coherent category), associated to an open algebraic variety $U$ with choice of...   More >

### “Diagnosing Disease on a Microchip: Scaling Up Micro- and Nano-Scale Diagnostics”

Seminar | November 29 | 12-1 p.m. | 290 Hearst Memorial Mining Building

David Issadore, Assistant Professor of Bioengineering, University of Pennsylvania

Bioengineering (BioE)

The transformative growth in microelectronics in the latter half of the 20th century was fueled fundamentally by the ability to simultaneously miniaturize and integrate complex circuits onto monolithic chips. The impact of this growth has been profound– computing is pervasive and portable, communication is instant and global, and information is ubiquitously gathered and shared. My research aims...   More >

### MVZ LUNCH SEMINAR: Dale Clayton "On the origin of species: Experimental coevolutionary diversification in feather lice"

Seminar | November 29 | 12-1 p.m. | Valley Life Sciences Building, 3101 Grinnell Miller Library

Dale Clayton

Museum of Vertebrate Zoology

MVZ Lunch is a graduate level seminar series (IB264) based on current and recent vertebrate research. Professors, graduate students, staff, and visiting researchers present on current and past research projects. The seminar meets every Wednesday from 12- 1pm in the Grinnell-Miller Library. Enter through the MVZ's Main Office, 3101 Valley Life Sciences Building, and please let the receptionist...   More >

### Decoding the computations of high-level auditory neurons

Seminar | November 29 | 12 p.m. | 560 Evans Hall

Joel Kaardal, Salk Institute

Characterizing the computations performed by high-level sensory regions of the brain remains enigmatic due to the many nonlinear signal transformations that separate the input sensory stimuli from the neural responses. In order to produce interpretable models of these computations, dimensionality reduction techniques can be employed to obtain a description of the neural computation in terms of a...   More >

### Plant and Microbial Biology Plant Seminar: "The hidden life of the genome: Leveraging novel technologies to extract function from sequence"

Seminar | November 29 | 12-1 p.m. | 101 Barker Hall

Ronan O'Malley, Joint Genome Institute

### EH&S 403 Training Session

Course | November 29 | 1:30-2:30 p.m. | 370 University Hall

Jason Smith, UC Berkeley Office of Environment, Health, & Safety

This session briefly covers the UC Berkeley specific radiation safety information you will need to start work. In addition, dosimeter will be issued, if required.

### Topology Seminar (Introductory Talk): Computational complexity in geometric topology

Seminar | November 29 | 2-3 p.m. | 740 Evans Hall

Eric Samperton, University of California, Davis

Department of Mathematics

I’ll give an overview of what is known about the computational complexity of problems in geometric topology. I will introduce the necessary complexity theory as we go, and focus especially on 3-dimensional problems.

### Regularity and strict positivity of densities for the nonlinear stochastic heat equation

Seminar | November 29 | 3:10-4 p.m. | 1011 Evans Hall

Le Chen, University of Nevada, Las Vegas

Department of Statistics

In this talk, I will present some recent progress in understanding the existence, regularity and strict positivity of the (joint-) density of the solution to a semilinear stochastic heat equation. The talk will consists two parts. In the first part, I will show that under a mild cone condition for the diffusion coefficient, one can establish the smooth joint density at multiple points. The tool...   More >

### Allan C. Wilson Memorial Lecture: Genetic conflicts: beyond the usual suspects

Seminar | November 29 | 3:30-4:30 p.m. | 100 Genetics & Plant Biology Building

Harmit Malik, Fred Hutchinson Cancer Research Center

Allan C. Wilson Memorial Lectures

### New Insights into Hydrophobic Interactions Encoded by Chemical Nanopatterns

Colloquium | November 29 | 4-6 p.m. | 180 Tan Hall

Nicholas L. Abbott, University of Wisconsin-Madison

The structuring of water near non-polar molecular fragments or surfaces mediates cohesive interactions (so-called hydrophobic interactions) that underlie a broad range of biophysical, colloidal and materials-related phenomena. Substantial progress has been made during the past decade towards understanding hydrophobic interactions in simple model systems, but in most biological and technological...   More >

### Mining scientific articles with Public Library of Science (PLoS)

Seminar | November 29 | 4-8 p.m. | 190 Doe Library

Elizabeth Seiver

For this week's special session, Elizabeth Seiver will present a tutorial and mini-hackathon to mine the text and data from scientific articles in the Public Library of Science (PLoS).

### EECS Colloquium: Challenges and Opportunities with Multi-Camera multimedia

Colloquium | November 29 | 4-5 p.m. | Soda Hall, 306 (HP Auditorium)

Klara Nahrstedt, University of Illinois Urbana-Champaign

Multi-camera content delivery systems are becoming an integral part of our video consumption, enabling advanced teleimmersive interactions in arts and sciences, 360-degree video viewing of YouTube content, and enhanced broadcasting experience of live events. However, multi-camera content systems generate high volume, variety and velocity data that present multiple orders of magnitude higher...   More >

### A critical role of the transcription factor, Sox9, in early adipose development

Seminar | November 29 | 4-5 p.m. | 114 Morgan Hall

Olga Gulyaeva, UC Berkeley

### Causal Inference in the Presence of Interference

Seminar | November 29 | 4-5 p.m. | 1011 Evans Hall

Michael Hudgens, UNC-Chapel Hill

Department of Statistics

A fundamental assumption usually made in causal inference is that of no interference between individuals (or units), i.e., the potential outcomes of one individual are assumed to be unaffected by the treatment assignment of other individuals. However, in many settings, this assumption obviously does not hold. For example, in infectious diseases, whether one person becomes infected depends on who...   More >

### Topology Seminar (Main Talk): Coloring invariants of knots are often intractable

Seminar | November 29 | 4-5 p.m. | 3 Evans Hall

Eric Samperton, University of California, Davis

Department of Mathematics

Given a finite group $G$, we get an invariant of a knot $K$ by counting the number of $G$-colorings of $K$, i.e., the number of homomorphisms $\pi_1(S^3 \setminus K) \to G$. When $G$ is the dihedral group of order 6, this invariant is basically the number of Fox 3-colorings of $K$. We will show that when $G$ is non-abelian simple, the coloring invariant is #P-complete.

I discussed a similar...   More >

### Applied Math Seminar: GPU Accelerated Incompressible Flow Solvers

Seminar | November 29 | 4-5 p.m. | 891 Evans Hall

Tim Warburton, Virginia Tech

Department of Mathematics

My research team at Virginia Tech recently started to develop a new multi-GPU accelerated incompressible flow solver using high-order discontinuous Galerkin discretizations as part of the LLNL/ANL Center for Efficient Exascale Discretizations funded by the DOE Exascale Computing Project. I will discuss how GPU memory and processor architecture has influenced the design of the flow solver. In...   More >

### Representation Theory and Mathematical Physics Seminar: Integration of poly-Poisson structures

Seminar | November 29 | 4-5 p.m. | 939 Evans Hall

Ivan Contreras, University of Illinois, Urbana Champaign

Department of Mathematics

Poly-Poisson geometry can be traced back to de-Donder and Weyl in 1930's. This approach leads to a poly-symplectic formulation of Lagrangian field theories, with several applications to mechanics. In this talk we address the problem of integration of poly-Poisson manifolds via Lagrangian field theories with boundary, which is a natural extension of the Poisson sigma model. Joint work with N....   More >

## Thursday, November 30, 2017

### The Evolution of Evaluation to Fit an Imperfect World

Seminar | November 30 | 250 Sutardja Dai Hall

Avigdor Gal

RISE Lab

The evolution of data accumulation, management, analytics, and visualization has led to the coining of the term big data, which challenges the task of data integration. This task, common to any matching problem in computer science involves generating alignments between structured data in an automated fashion. Historically, set-based measures, based upon binary similarity matrices...   More >

### Fall 2017 Architecture Sustainability Colloquium

Colloquium | August 25 – December 1, 2017 every day | 112 Wurster Hall

College of Environmental Design

FRIDAYS - AUG 25 through DEC 1. CHECK THE SCHEDULE FOR SPEAKERS. Bay Area Leaders discuss topics in sustainability.

### Identifying and Addressing Workplace Bullying

Workshop | November 30 | 9 a.m.-3 p.m. | University Hall, Room 24

Sara Thacker, Staff Ombuds Office

Staff Ombuds Office

Bullying can take many forms, some of which are obvious and others of which, though more indirect, can be equally destructive to working relationships. Participants will learn about how to recognize bullying behavior; how to distinguish bullying from incivility; what climates encourage bullying; the impact of workplace bullying; options for how bystanders can effectively respond; and constructive...   More >

### TS-04 Improving Safety at Intersections

Course | November 29 – December 1, 2017 every day | 10 a.m.-12 p.m. |  Online

Nazir Lalani, PE, President, Traffex Engineers, Inc

About 65 percent of all crashes in urban areas and 40 percent of those in rural areas occur at or near intersections or driveways. Safety improvements at these locations have always been a priority and pose a challenge for most transportation agencies in California.

### JPMorgan Tech Talk: Deep Basket - An Application of Deep Learning in Portfolio Construction

Seminar | November 30 | 12-1 p.m. | 290 Hearst Memorial Mining Building

College of Engineering

Come learn more about how JPMorgan's Quantitative Research team is using Machine Learning! They will also be holding a recruiting event later in the day.

### Politically Engaged Science: A Brownbag Lunch Series

Seminar | September 14 – December 21, 2017 every Thursday with exceptions | 12-1 p.m. | 103 Mulford Hall

This series challenges the notion that science and politics should not mix. Building on the March for Science and the People's Climate March, we'll discuss how research in the public interest can make an impact in a political environment dominated by corporate interests, from the major parties to the media.

Weekly discussions will focus on case studies of activist scientists, political...   More >

### Oliver E. Williamson Seminar

Seminar | November 30 | 12-1:30 p.m. | C330 Haas School of Business

Nicholas Ryan, Professor, Yale University

Haas School of Business

The Oliver E. Williamson Seminar on Institutional Analysis, named after our esteemed colleague who founded the seminar, features current research by faculty, from UCB and elsewhere, and by advanced doctoral students. The research investigates governance, and its links with economic and political forces. Markets, hierarchies, hybrids, and the supporting institutions of law and politics all come...   More >

### Post-transcriptional gene regulation in the aging brain: stress, cellular identity, diversity and disruption

Seminar | November 30 | 12:30-1:30 p.m. | 2040 Valley Life Sciences Building

Peter Sudmant, Massachusetts Institute of Technology

### How to Email a Professor to Get a Positive Response: Workshop

Workshop | November 30 | 1-2 p.m. | 9 Durant Hall

Leah Carroll

Office of Undergraduate Research

Do you need to email a professor you've never met before to ask for their help, but you don't know where to start? Have you ever written a long email to a professor, only to receive no response, or not the one you hoped? If so, this workshop is for you! We will discuss how to present yourself professionally over email to faculty and other professionals ...   More >

### Reconstructing Historical Locations in the 1795 Louisiana Slave Conspiracy

Seminar | November 30 | 1:10-2 p.m. | 103 Mulford Hall

Patty Frontiera

Geospatial Innovation Facility

This week’s speaker is Patty Frontiera, who will be discussing her work on the “Louisiana Slave Conspiracies” digital humanities project. This is a multidisciplinary research project dedicated to preserving, digitizing, transcribing, translating, and analyzing manuscripts from three Louisiana slave conspiracies. The LSC team is building a digital archive that will present these French and Spanish...   More >

### Seminar 251, Labor Seminar: "Changes in Nutrient Intake at Retirement"

Seminar | November 30 | 2-3:30 p.m. | 648 Evans Hall

Mel Stephens, University of Michigan

Center for Labor Economics

### Seminar 218, Psychology and Economics: Changes in Nutrient Intake at Retirement

Seminar | November 30 | 2:10-3:30 p.m. | 648 Evans Hall

Mel Stephens, University of Michigan

Department of Economics

Joint with Labor seminar

* Please note change in time due to joint event

### Information seeking and randomization in human exploration and exploitation

Seminar | November 30 | 3:30-4:30 p.m. | 101 Life Sciences Addition

Robert Wilson, University of Arizona, Department of Psychology

This seminar is partially sponsored by NIH

### Cognitive Neuroscience/Neurobiology Colloquium: Information Seeking and Randomization in Human Exploration and Exploitation

Colloquium | November 30 | 3:30-5 p.m. | 101 Life Sciences Addition

Bob Wilson, University of Arizona

Department of Psychology

### Seminar 242, Econometrics: Topic Forthcoming

Seminar | November 30 | 4-6 p.m. | 648 Evans Hall

Yu Wei Hsieh, University of Southern California USC

Department of Economics

### Mathematics Department Colloquium: Algebraic Structures on Polytopes

Colloquium | November 30 | 4:10-5 p.m. | 60 Evans Hall

Federico Ardila, San Francisco State University

Department of Mathematics

Generalized permutahedra are a beautiful family of polytopes with a rich combinatorial structure and strong connections to optimization. We study their algebraic structure: we prove they are the universal family of polyhedra with a certain “Hopf monoid" structure. This construction provides a unifying framework to organize and study many combinatorial families:

1. It uniformly answers open...   More >

### Book Talk Series: Another Kind of Madness: A Journey Through the Stigma and Hope of Mental Illness

Reading - Nonfiction | November 30 | 4:10-5:30 p.m. | 227 Haviland Hall

Stephen Hinshaw

Library

Stephen Hinshaw, professor of Psychology (UC Berkeley) and Psychiatry (UC San Francisco) will discuss his newest book, "Another Kind of Madness", chronicling his father’s recurring mental illness and the doctor-enforced silence surrounding it, plus the crucial need to combat stigma. Books will be for sale, courtesy of Mrs. Dalloway's.

*The Library attempts to offer programs in accessible,...   More >

### JPMorgan Recruiting Event: Quantitative Research - Machine Learning Program

Career Fair | November 30 | 5-6 p.m. | 330 Blum Hall

College of Engineering

Come meet JPMorgan employees, learn about the firm and their opportunities with the Quantitative Research - Machine Learning Program!

### GraphXD Seminar: Data-Driven Methods for Learning Sparse Graphical Models

Seminar | November 30 | 5:30-7 p.m. | 1011 Evans Hall

Somayeh Sojoudi, EECS, Mechanical Engineering

Learning models from data has a significant impact on many disciplines, including computer vision, medical imaging, social networks, neuroscience and signal processing. In the network inference problem, one may model the relationships between the network components through an underlying inverse covariance matrix. Learning this graphical model is often challenged by the fact that only a small...   More >

### Rise of the Female Imam: Gender Reform in Islam

Panel Discussion | November 30 | 6-7:30 p.m. | 340 Stephens Hall

Rabi'a Keeble, Founder, Qal’bu Maryam Women’s Mosque, Berkeley; Sherin Khankan, Imam, Mariam Mosque, Copenhagen; Amina Wadud, Research Scholar, Starr King School for the Ministry, Berkeley

Mairaj Syed, Associate Professor of Religious Studies, UC Davis

Join the CMES for a thought-provoking conversation on local and global gender reform in Islam, featuring founders of women mosques in California and Denmark and prominent scholars of Islamic studies.

## Friday, December 1, 2017

### canceled - Colloquium: Claire Chase

Colloquium | December 1 | 125 Morrison Hall | Canceled

Department of Music

Presented by Cal Performances in association with the Department of Music at UC Berkeley.

Claire Chase is a soloist, collaborative artist, curator and advocate for new and experimental music. Over the past decade she has given the world premieres of hundreds of new works for the flute in performances throughout the Americas, Europe and Asia, and she has championed new music throughout the...   More >

### Fall 2017 Architecture Sustainability Colloquium

Colloquium | August 25 – December 1, 2017 every day | 112 Wurster Hall

College of Environmental Design

FRIDAYS - AUG 25 through DEC 1. CHECK THE SCHEDULE FOR SPEAKERS. Bay Area Leaders discuss topics in sustainability.

### Botanical Illustration: Winter / Holiday

Workshop | November 30 – December 1, 2017 every day | 10 a.m.-4 p.m. |  UC Botanical Garden

Botanical Garden

This two-day class will introduce you to the fascinating world of Botanical Art. Catherine Watters will teach you to observe, measure and draw plants in great detail and with botanical accuracy. Students will work with graphite, colored pencil and watercolors. All levels are welcome.

$190,$175 members

or by calling 510-664-9841, or by emailing gardenprograms@berkeley.edu

### TS-04 Improving Safety at Intersections

Course | November 29 – December 1, 2017 every day | 10 a.m.-12 p.m. |  Online

Nazir Lalani, PE, President, Traffex Engineers, Inc

About 65 percent of all crashes in urban areas and 40 percent of those in rural areas occur at or near intersections or driveways. Safety improvements at these locations have always been a priority and pose a challenge for most transportation agencies in California.

$290.00 ### Europe and the Euro: The way ahead Panel Discussion | December 1 | 11 a.m.-12:30 p.m. | N270 Haas School of Business Barry Eichengreen, UC Berkeley; Gabriele Giudice, European Commission; Gérard Roland, UC Berkeley Ten years after the crisis struck the European economy, wind seems to be back in Europe’s sails. How can the European Union exploit this window of opportunity to strengthen the Economic and Monetary Union, increase the resilience of individual economies and relaunch economic and social convergence between its Member States? RSVP by emailing Viviana Padelli at vpadelli@berkeley.edu by December 1. ### Labor Lunch Seminar: "$15 Minimum Wage Policies: Early Evidence."

Seminar | December 1 | 12-1 p.m. | 648 Evans Hall

Carl Nadler, IRLE

Center for Labor Economics

### Dancing for Fun and Fitness (BEUHS605)

Workshop | December 1 | 12:10-1 p.m. | 251 Hearst Gymnasium

Nadia Qabazard

Be Well at Work - Wellness

Fit some fun and fitness into your day with these free, beginner dance classes. Zumba will be on 9/8 and 12/1, Samba will be on 10/6 and Polynesian/Hula will be on 11/3. No partner required. Comfortable clothing and athletic shoes recommended.

### Solid State Technology and Devices Seminar: Antenna-LED for on-chip optical communication

Seminar | December 1 | 1-2 p.m. | Cory Hall, 521 Cory (Hogan Room)

Seth A. Fortuna, UC Berkeley

Using an optical antenna, it is now possible to make spontaneous emission faster than stimulated emission. This alludes to the exciting possibility of an LED faster than the LASER. Such an antenna-coupled LED (or simply antenna-LED) is well-suited as a light source for on-chip optical communication where small size, fast speed, and high efficiency are needed to achieve the promised benefit of...   More >

### Ground Penetrating Radar for Archaeology

Workshop | December 1 | 1-5 p.m. | 101 2251 College (Archaeological Research Facility)

Scott Byram, Research Associate, Archaeological Research Facility, UC Berkeley

Archaeological Research Facility

At 1pm the workshop will begin at the UC Faculty Club lawn where subsurface features are being mapped.

### Student Probability/PDE Seminar: Large Deviation Principle for random graphs II

Seminar | December 1 | 2:10-3:30 p.m. | 891 Evans Hall

Fraydoun Rezakhanlou, UC Berkeley

Department of Mathematics

### BLC Fellows Forum

Presentation | December 1 | 3-5 p.m. | Dwinelle Hall, B-4 (Classroom side)

FAll 2017 BLC Fellows, UC Berkeley

Berkeley Language Center

Teaching French Listening Comprehension and Cultural Awareness through Regional Variation
Elyse Ritchey, GSR, French
At the university level, French language instruction in the US traditionally includes a course on phonetics and pronunciation. While the major aim of such courses is to improve students’ speaking and listening competence, they also emphasize speaking ‘correctly’ using...   More >

### MENA Salon

Workshop | December 1 | 3-4 p.m. | 340 Stephens Hall

Every Friday in the semester, the CMES hosts an informal weekly coffee hour and guided discussion of current events in the Middle East and North Africa, open to all and free of charge. Check the calendar the Monday before the Salon for the current week's topic.

### Dissertation Talk: Meta Learning for Control

Presentation | December 1 | 4-5 p.m. | 730 Sutardja Dai Hall

Yan Duan, UC Berkeley

Dissertation talk on meta learning for control: policy learning algorithms that can themselves generate algorithms that are highly customized towards a certain domain of tasks.

### Hydrogenase- and ACS-Inspired Bioorganometallic Chemistry

Seminar | December 1 | 4-5 p.m. | 120 Latimer Hall

Prof. Marcetta Darensbourg, Department of Chemistry, Texas A&M University

College of Chemistry

Enzyme active sites such as the [FeFe]- and [NiFe]-H2ases, as well as Carbon Monoxide Dehydrogenase and Acetyl coA Synthase, ACS, have inspired chemists to use well-established principles and synthetic tools of organometallic chemistry in the development of biomimetics. The usual purpose of such studies is to understand how first-row transition metals are rendered by nature into molecular...   More >

### Logic Colloquium: What is ordinary mathematics?

Colloquium | December 1 | 4:10-5 p.m. | 60 Evans Hall

Marianna Antonutti, Munich Center for Mathematical Philosophy

Department of Mathematics

The term “ordinary mathematics” is used to denote a collection of areas that are, in some sense, central to the practice of most working mathematicians, typically taken to contain such fields as number theory, real and complex analysis, geometry, and algebra. This notion has been taken for granted by both philosophers and logicians; for example, reverse mathematics is often described as the...   More >

### QB3 Postdoc Seminar: Examining Eph/ephrin signaling pathways that regulate adult neurogenesis and migration of hippocampal stem cells

Seminar | December 1 | 4:30-5:30 p.m. | 177 Stanley Hall

Kira Mosher (David Schaffer lab)

Approximately two decades ago, the longstanding dogma that the adult CNS is incapable of generating new neurons was overturned with the acceptance that adult neurogenesis truly occurs in mammals. With this understanding also came excitement that in maintaining some level of plasticity in adulthood, diseased brains may be capable of regeneration. While adult neurogenesis has become an important...   More >


text:
NZ Level 8 (NZC) Level 3 (NCEA) [In development]
Forward and Backward Scanning
Lesson

Let’s start off with the “making tea” example from the last chapter. We have a directed, weighted network that looks like this:

Imagine you and a friend are on a team, racing to make tea as fast as you can. One of you is going to boil the water while the other is going to add the tea to the pot. Unfortunately, your friend takes twice as long as you to do any task. Which job should you take?

If you put the water in the kettle ($20$20s) and wait for it to boil ($30$30s), your friend has $20+30=50$20+30=50s to put the tea in the pot. It will take them $2\times15=30$2×15=30s, so by the time the water is ready they’ve had plenty of time.

But if they put water in the kettle ($2\times20=40$2×20=40s) and wait for it to boil ($30$30s), it doesn’t matter that it only took you $15$15s to put the tea in the pot - overall it takes more than a minute to get to the same place.

There is a path through the whole network called the critical path, which looks like this:

It goes from start to finish, highlighting the tasks where delays are costly. Any delay in any task along this path means a delay overall, so the best and fastest people should do these jobs.

Now in this “making tea” example the critical path was easy to spot. The “book tour” example is a little more complicated:

Twelve tasks in all - which tasks are the most critical, where delays are costly and should have your best people on it? Which tasks allow for a little leeway? To figure that out, we are going to do a forward and backward scan. Start by putting a little box both above and below each vertex (you can put just one for the Start and Finish):

Some places will get you to draw a line inside the vertex, or not use boxes at all, or something else entirely - how you do it isn’t important, what we need are two places to put numbers at each vertex.

We put a $0$0 in the Start box and move along each task, adding up how long it would take to start the next task as we go, and writing it in the top box for each vertex. If there is only one arrowhead pointing at a vertex, just take the number at the previous vertex and add the task time to get the new number. Here are the first seven boxes filled in:

• we can start $C$C after $1$1 day (we have to wait for $A$A),
• start both $D$D and $E$E after $1+7=8$1+7=8 days (we have to wait for $A$A and then wait for $C$C),
• and start $G$G after $8+7=15$8+7=15 days (wait for $A$A and then $C$C and then $E$E).

• we can start $F$F after $4$4 days (wait for $B$B),
• start both $J$J and $K$K after $4+12=16$4+12=16 days (wait for $B$B and then $F$F),
• and start $M$M after $16+12=28$16+12=28 days (wait for $B$B and then $F$F and then $K$K).

Now the remaining vertices have more than one arrowhead pointing at them. This means that more than one task is a dependency, so they all need to be completed before we continue. Let’s zoom in on the top part of the diagram.

It takes $8$8 days to get ready for $D$D, then $15$15 days to do it, so the first dependency is going to be ready after $23$23 days. At the same time, it takes $15$15 days to get ready for $G$G, and then $10$10 days to do it, so the second dependency is going to be ready after $25$25 days. Since they both need to be ready before moving on, we write the largest number, $25$25, in the box to indicate how long it takes before we can get started on $H$H.

We do this for the rest of the mergers all the way to the finish - picking the largest sum along all the tasks before it.

The numbers in these boxes are the earliest start times for each activity - as long as everything goes to plan, each task can start on the day sitting above the vertex that it is drawn from. We can also tell that it will take $41$41 days for everything to be ready - again, if all goes to plan. Our forward scan is complete!

Now, we start our backwards scan. This will tell us the latest start times for each task. The idea is very similar, but this time we start with the number on the right and subtract the task duration instead of adding. If there is only one edge coming out of the vertex we are heading towards, we simply subtract the task time. Here are the first four boxes from the backwards scan filled in:

When two or more edges emerge from the same vertex, we want to pick the smallest number. Let’s zoom in on the bottom branch:

We need to finish $J$J by day $32$32, and it takes $16$16 days to do it, so the latest we can start task J is day $16$16. Similarly, we need to finish $K$K by day $36$36, and it takes $12$12 days to do it, so the latest we can start task $K$K is day $24$24. We write the smallest of the differences we found in the box and continue along.

By the end of this process the numbers on the bottom are the latest start times for each activity - if this amount of time has passed and the task hasn’t begun, the whole project will be delayed.

To summarize the tricky cases when you’re forward scanning, look for vertices with groups of arrows going into them:

And when you’re backward scanning look out for vertices that have groups of arrows coming out of them:

Outcomes

M8-5

Develop network diagrams to find optimal solutions, including critical paths.

91576

Use critical path analysis in solving problems

format: plain


text:
Subjects -> MATHEMATICS (Total: 1118 journals)     - APPLIED MATHEMATICS (92 journals)    - GEOMETRY AND TOPOLOGY (23 journals)    - MATHEMATICS (819 journals)    - MATHEMATICS (GENERAL) (45 journals)    - NUMERICAL ANALYSIS (26 journals)    - PROBABILITIES AND MATH STATISTICS (113 journals) MATHEMATICS (819 journals)                  1 2 3 4 5 | Last

1 2 3 4 5 | Last

Similar Journals
 Acta Applicandae MathematicaeJournal Prestige (SJR): 0.675 Citation Impact (citeScore): 1Number of Followers: 2      Hybrid journal (It can contain Open Access articles) ISSN (Print) 0167-8019 - ISSN (Online) 1572-9036 Published by Springer-Verlag  [2654 journals]
• On a Two-Dimensional Riemann Problem for Hyperbolic System of Nonlinear
Conservation Laws

Abstract: Abstract This paper is concerned with the four-wave Riemann problem for a two-dimensional hyperbolic system of nonlinear conservation laws derived from a quasi-linear wave equation. The self-similar form of this system is of mixed type. The four-wave Riemann problem in the self-similar plane consists of interactions of four planar elementary waves (exterior waves), which contain rarefaction waves, shocks and contact discontinuities. The Riemann problem is classified into sixteen genuinely different nontrivial cases. The structures of solutions for four rarefaction waves, four shocks and two nonadjacent rarefaction waves plus two nonadjacent shocks are constructed completely. For the rest cases, the solutions are roughly analyzed. For each case, the corresponding numerical solutions are illustrated via contour plots. Comparing with the compressible Euler equations and related models, one of the highlights for this paper is that the interactions of two rarefaction waves, two shocks, as well as a rarefaction wave and a shock in hyperbolic domains are clarified.
PubDate: 2021-10-13

• Fractional Landweber Iterative Regularization Method for Identifying the
Unknown Source of the Time-Fractional Diffusion Problem

Abstract: Abstract In this paper, we study an inverse problem to determine an unknown source term in the time-fractional diffusion equation with variable coefficients in a general bound domain. This problem is ill-posed, i.e., the solution (if it exists) does not depend continuously on the data. We introduce the fractional Landweber iterative regularization method to solve inverse source problem. Based on an a conditional stability result, error convergent estimates between the exact solution and the regularization solution by using an a priori regularization parameter choice rule and an a posteriori regularization parameter choice rule are also given. Some numerical experiments prove that the fractional Landweber method provides better numerical result than the classical Landweber method under the same iterative steps.
PubDate: 2021-10-12

• One Dimensional Reduction of a Renewal Equation for a Measure-Valued
Function of Time Describing Population Dynamics

Abstract: Abstract Despite their relevance in mathematical biology, there are, as yet, few general results about the asymptotic behaviour of measure valued solutions of renewal equations on the basis of assumptions concerning the kernel. We characterise, via their kernels, a class of renewal equations whose measure-valued solution can be expressed in terms of the solution of a scalar renewal equation. The asymptotic behaviour of the solution of the scalar renewal equation, is studied via Feller’s classical renewal theorem and, from it, the large time behaviour of the solution of the original renewal equation is derived.
PubDate: 2021-10-06

• Stability of Wave Networks on Elastic and Viscoelastic Media

Abstract: Abstract In this paper, we study the component configuration issue of the line-shaped wave networks which is made of two viscoelastic components and an elastic component and the viscoelastic parts produce the infinite memory and damping and distributed delay. The structural memory of viscoelastic component results in energy dissipative and the damping memory arouses the instability, and the elastic component is energy conservation, such a hybrid effects lead to complex dynamic behaviour of network. Our purpose of the present paper is to find out stability condition of such a network, in particular, the configuration condition of the wave network under which the network is exponentially stable. At first, using a resolvent family approach, we prove the well-posed of the wave network systems under suitable assumptions on the memory kernel $$g(s)$$ , the damping coefficient $$\mu _{1}$$ and delay distributed kernel $$\mu _{2}(s)$$ . Next, using the Lyapunov function method, we seek for a structural condition of the wave networks under which the wave networks are exponentially stable. By constructing new functions we obtain the sufficient conditions for the exponential stability of the wave networks, the structural conditions are given as inequalities.
PubDate: 2021-10-04

• Asymptotics of Weak Solution to a Chemotaxis-Navier-Stokes System with

Abstract: Abstract This paper studies a coupled chemotaxis-Navier-Stokes model with arbitrary superlinear dampening logistic term \begin{aligned} \left \{ \textstyle\begin{array}{l} n_{t}+u\cdot \nabla n=\Delta n-\nabla \cdot (n\nabla c)+ rn-\mu n^{ \alpha }, \\ c_{t}+u\cdot \nabla c=\Delta c-nc, \\ u_{t}+(u\cdot \nabla )u=\Delta u+\nabla P+n\nabla \Phi , \quad \nabla \cdot u=0 \end{array}\displaystyle \right .\quad \quad (\star ) \end{aligned} in a bounded domain $$\Omega \subset \mathbb{R}^{3}$$ with smooth boundary, under homogeneous Neumann boundary conditions for $$n$$ and $$c$$ , and homogeneous Dirichlet boundary condition for $$u$$ . Here $$\Phi \in C^{1+\beta }(\overline{\Omega })$$ , $$r \ge 0$$ , $$\mu >0$$ and $$\alpha >1$$ . It is shown in Wang (Math. Models Methods Appl. Sci. 30(06):1217–1252, 2020) that (⋆) possesses at least one global weak solution for $$1<\alpha < 2$$ and the solution becomes sufficiently smooth after finite time if we require $$\frac{6}{5}\le \alpha < 2$$ . The present work proves the eventual smoothness property holds for $$1<\alpha <2$$ .
PubDate: 2021-09-27

• Correction to: Can Fluid Interaction Influence the Critical Mass for
Taxis-Driven Blow-up in Bounded Planar Domains'

PubDate: 2021-09-24

• Existence of Invariant Densities and Time Asymptotics of Conservative
Linear Kinetic Equations on the Torus Without Spectral Gaps

Abstract: Abstract This work deals with general linear conservative neutron transport semigroups without spectral gaps in $$L^{1}(\mathcal{T}^{n}\times \mathbb{R} ^{n})$$ where $$\mathcal{T}^{n}$$ is the $$n$$ -dimensional torus. We study the mean ergodicity of such semigroups and their strong convergence to their ergodic projections as time goes to infinity. Systematic functional analytic results are given.
PubDate: 2021-09-17

• Global Strong Solutions to Cauchy Problem of 1D Non-resistive MHD
Equations with No Vacuum at Infinity

Abstract: Abstract In this paper, we study the Cauchy problem of 1D non-resistive compressible magnetohydrodynamics (MHD) equations. We established the global existence and uniqueness of strong solutions for large initial data, where the initial density and initial magnetic field approach non-zero constants at infinity, but the initial vacuum of the density inside the region can be permitted. The analysis is based on the Caffarelli-Kohn-Nirenberg weighted inequality and the technique of mathematical frequency decomposition to get the upper bound of the density, and no more artificial conditions are needed to obtain the upper bound estimate of magnetic field $$b$$ .
PubDate: 2021-09-14

• Quantization of Edge Currents Along Magnetic Interfaces: A K $K$ -Theory
Approach

Abstract: Abstract The purpose of this paper is to investigate the propagation of topological currents along magnetic interfaces (also known as magnetic walls) of a two-dimensional material. We consider tight-binding magnetic models associated to generic magnetic multi-interfaces and describe the $$K$$ -theoretical setting in which a bulk-interface duality can be derived. Then, the (trivial) case of a localized magnetic field and the (non trivial) case of the Iwatsuka magnetic field are considered in full detail. This is a pedagogical preparatory work that aims to anticipate the study of more complicated multi-interface magnetic systems.
PubDate: 2021-09-09

• Controllability of Impulsive Fractional Integro-Differential Evolution
Equations

Abstract: Abstract In this paper, we are concerned with the controllability for a class of impulsive fractional integro-differential evolution equation in a Banach space. Sufficient conditions of the existence of mild solutions and approximate controllability for the concern problem are presented by considering the term $$u'(\cdot )$$ and finding a control $$v$$ such that the mild solution satisfies $$u(b)=u_{b}$$ and $$u'(b)=u'_{b}$$ . The discussions are based on Mönch fixed point theorem as well as the theory of fractional calculus and $$(\alpha ,\beta )$$ -resolvent operator. Finally, an example is given to illustrate the feasibility of our results.
PubDate: 2021-08-31

• Traveling Wave Solutions in a Nonlocal Dispersal SIR Epidemic Model with
General Nonlinear Incidence

Abstract: Abstract In this paper, for a class of nonlocal dispersal SIR epidemic models with nonlinear incidence, we study the existence of traveling waves connecting the disease-free equilibrium with endemic equilibrium. We obtain that the existence of traveling waves depends on the minimal wave speed $$c^{*}$$ and basic reproduction number $$\mathcal{R}_{0}$$ . That is, if $$\mathcal{R}_{0}>1$$ and $$c> c^{*}$$ then the model has a traveling wave connecting the disease-free equilibrium with endemic equilibrium. Otherwise, if $$\mathcal{R}_{0}>1$$ and $$0< c< c^{*}$$ , then there does not exist the traveling wave connecting the disease-free equilibrium with endemic equilibrium. The numerical simulations verify the theoretical results. Our results improve and generalize some known results.
PubDate: 2021-08-31

• Infinitely Many Solutions for Semilinear Strongly Degenerate Elliptic
Differential Equations with Lack of Symmetry

Abstract: Abstract In this paper, we study the existence of multiple solutions for the boundary value problem \begin{aligned} -\Delta _{\gamma } u =& f(x,u) + g(\theta ,x,u) \ \text{ in }\ \ \Omega , \\ u =&\ 0 \hspace{2.6cm}\text{ on }\ \partial \Omega , \end{aligned} where $$\Omega$$ is a bounded domain with smooth boundary in $$\mathbb{R}^{N} \ (N \ge 2)$$ , where $$f(x,\cdot )$$ is odd, $$g(\theta ,x, \xi )$$ is a non-symmetric, perturbative term and $$\Delta _{\gamma }$$ is the strongly degenerate elliptic operator of the type $$\Delta _{\gamma }: =\sum _{j=1}^{N}\partial _{x_{j}} \left ( \gamma _{j}^{2} \partial _{x_{j}} \right ), \quad \partial _{x_{j}}: = \frac{\partial }{\partial x_{j}},\quad \gamma : = (\gamma _{1}, \gamma _{2}, \ldots, \gamma _{N}).$$ By using a perturbation method introduced by Bolle (J. Differ. Equ. 152:274-288, 1999), we prove the existence of multiple solutions in spite of the lack of symmetry of the problem.
PubDate: 2021-08-29

• Existence of Solutions to Steady MHD System with Multiply Connected
Boundary

Abstract: Abstract In this paper, we study the inhomogeneous boundary value problem for the steady MHD system of a viscous incompressible fluid in an arbitrary bounded multiply connected domain. We prove the existence of generalized solutions of the steady MHD system with some smallness conditions on the boundary values.
PubDate: 2021-08-27

• A Connection Between a Question of Bermond and Bollobás and Ramanujan
Graphs

Abstract: Abstract If we let $$n(k, d)$$ denote the order of the largest undirected graphs of maximum degree $$k$$ and diameter $$d$$ , and let $$M(k,d)$$ denote the corresponding Moore bound, then $$n(k,d) \leq M(k,d)$$ , for all $$k \geq 3$$ , $$d \geq 2$$ . While the inequality has been proved strict for all but very few pairs $$k$$ and $$d$$ , the exact relation between the values $$n(k,d)$$ and $$M(k,d)$$ is unknown, and the uncertainty of the situation is captured by an open question of Bermond and Bollobás who asked whether it is true that for any positive integer $$c>0$$ there exist a pair $$k$$ and $$d$$ , such that $$n(k, d)\leq M(k,d)-c$$ . We present a connection of this question to the value $$2\sqrt{k-1}$$ , which is also essential in the definition of the Ramanujan graphs defined as $$k$$ -regular graphs whose second largest eigenvalue (in modulus) does not exceed $$2 \sqrt{k-1}$$ . We further reinforce this surprising connection by showing that if the answer to the question of Bermond and Bollobás were negative and there existed a $$c > 0$$ such that $$n(k,d) \geq M(k,d) - c$$ , for all $$k \geq 3$$ , $$d \geq 2$$ , then, for any fixed $$k$$ and all sufficiently large even $$d$$ ’s, the largest undirected graphs of degree $$k$$ and diameter $$d$$ would have to be Ramanujan graphs. This would imply a positive answer to the open question whether infinitely many non-bipartite $$k$$ -regular Ramanujan graphs exist for any degree $$k$$ .
PubDate: 2021-08-24

• Influence of Flux Limitation on Large Time Behavior in a Three-Dimensional
Chemotaxis-Stokes System Modeling Coral Fertilization

Abstract: Abstract In this paper, we consider the following system $$\left \{ \textstyle\begin{array}{ll} n_{t}+u\cdot \nabla n&=\Delta n-\nabla \cdot (n\mathcal{S}( \nabla c ^{2}) \nabla c)-nm, \\ c_{t}+u\cdot \nabla c&=\Delta c-c+m, \\ m_{t}+u\cdot \nabla m&=\Delta m-mn, \\ u_{t}&=\Delta u+\nabla P+(n+m)\nabla \Phi ,\qquad \nabla \cdot u=0 \end{array}\displaystyle \right .$$ which models the process of coral fertilization, in a smoothly three-dimensional bounded domain, where $$\mathcal{S}$$ is a given function fulfilling $$\mathcal{S}(\sigma ) \leq K_{\mathcal{S}}(1+\sigma )^{- \frac{\theta }{2}},\qquad \sigma \geq 0$$ with some $$K_{\mathcal{S}}>0$$ . Based on conditional estimates of the quantity $$c$$ and the gradients thereof, a relatively compressed argument as compared to that proceeding in related precedents shows that if $$\theta >0,$$ then for any initial data with proper regularity an associated initial-boundary problem under no-flux/no-flux/no-flux/Dirichlet boundary conditions admits a unique classical solution which is globally bounded, and which also enjoys the stabilization features in the sense that \begin{aligned} &\ n(\cdot ,t)-n_{\infty }\ _{L^{\infty }(\Omega )}+\ c(\cdot ,t)-m_{ \infty }\ _{W^{1,\infty }(\Omega )} +\ m(\cdot ,t)-m_{\infty }\ _{W^{1, \infty }(\Omega )}\\ &\quad{}+\ u(\cdot ,t)\ _{L^{\infty }(\Omega )}\rightarrow 0 \quad \text{as}~t\rightarrow \infty \end{aligned} with $$n_{\infty }:=\frac{1}{ \Omega }\left \{ \int _{\Omega }n_{0}-\int _{ \Omega }m_{0}\right \} _{+}$$ and $$m_{\infty }:=\frac{1}{ \Omega }\left \{ \int _{\Omega }m_{0}-\int _{ \Omega }n_{0}\right \} _{+}$$ .
PubDate: 2021-08-06

• Exponential Stability in Mean Square of Stochastic Functional Differential
Equations with Infinite Delay

Abstract: Abstract A novel approach to the exponential stability in mean square of stochastic functional differential equations and neutral stochastic functional differential equations with infinite delay is presented. Consequently, some new criteria for the exponential stability in mean square of the considered equations are obtained. Lastly, some examples are investigated to illustrate the theory.
PubDate: 2021-07-29

• On the Classification of Solutions to a Weighted Elliptic System Involving
the Grushin Operator

Abstract: Abstract We investigate here the following weighted degenerate elliptic system \begin{aligned} &-\Delta _{s} u =\Big(1+\ \mathbf{x}\ ^{2(s+1)}\Big)^{ \frac{\alpha }{2(s+1)}} v^{p}, \quad -\Delta _{s} v= \Big(1+\ \mathbf{x}\ ^{2(s+1)}\Big)^{\frac{\alpha }{2(s+1)}}u^{\theta }, \\ &\quad u,v>0 \quad \mbox{in }\; \mathbb{R}^{N}:=\mathbb{R}^{N_{1}}\times \mathbb{R}^{N_{2}}, \end{aligned} where $$\Delta _{s}=\Delta _{x}+ x ^{2s}\Delta _{y}$$ , is the Grushin operator, $$s$$ , $$\alpha \geq 0$$ and $$1< p\leq \theta$$ . Here $$\ \mathbf{x}\ =\Big( x ^{2(s+1)}+ y ^{2}\Big)^{\frac{1}{2(s+1)}} \; \mbox{and}\quad \mathbf{x}:=(x, y)\in \mathbb{R}^{N}:=\mathbb{R}^{N_{1}} \times \mathbb{R}^{N_{2}}.$$ In particular, we establish some new Liouville-type theorems for stable solutions of the system, which recover and considerably improve upon the known results (Duong and Phan in J. Math. Anal. Appl. 454(2):785–801, 2017; Hajlaoui et al. in Discrete Contin. Dyn. Syst. 37:265–279, 2017).
PubDate: 2021-07-29

• Asymptotic Expansions and Strategies in the Online Increasing Subsequence
Problem

Abstract: Abstract We study two closely related problems in the online selection of increasing subsequence. In the first problem, introduced by Samuels and Steele (Ann. Probab. 9(6):937–947, 1981), the objective is to maximise the length of a subsequence selected by a nonanticipating strategy from a random sample of given size $$n$$ . In the dual problem, recently studied by Arlotto et al. (Random Struct. Algorithms 49:235–252, 2016), the objective is to minimise the expected time needed to choose an increasing subsequence of given length $$k$$ from a sequence of infinite length. Developing a method based on the monotonicity of the dynamic programming equation, we derive the two-term asymptotic expansions for the optimal values, with $$O(1)$$ remainder in the first problem and $$O(k)$$ in the second. Settling a conjecture in Arlotto et al. (Random Struct. Algorithms 52:41–53, 2018), we also design selection strategies to achieve optimality within these bounds, that are, in a sense, best possible.
PubDate: 2021-07-26

• Particle Dynamics with Elastic Collision at the Boundary: Existence and
Partial Uniqueness of Solutions

Abstract: Abstract We consider the dynamics of point particles which are confined to a bounded, possibly nonconvex domain $$\Omega$$ . Collisions with the boundary are described as purely elastic collisions. This turns the description of the particle dynamics into a coupled system of second order ODEs with discontinuous right-hand side. The main contribution of this paper is to develop a precise solution concept for this particle system, and to prove existence of solutions. In this proof we construct a solution by passing to the limit in an auxiliary problem based on the Yosida approximation. In addition to existence of solutions, we establish a partial uniqueness theorem, and show by means of a counterexample that uniqueness of solutions cannot hold in general.
PubDate: 2021-07-26

• Behavior of Riemann Solutions of Extended Chaplygin Gas Under the Limiting
Condition

Abstract: Abstract For this paper, we first obtain the Riemann solutions for the one-dimensional non-isentropic Euler equations of extended Chaplygin gas. The solutions are composed of shock waves, contact discontinuity and rarefaction waves. Furthermore, the behavior of these solutions under the limiting conditions are considered. As a certain parameter tends to zero, we find that the Riemann solutions of the one-dimensional non-isentropic Euler equations for extended Chaplygin gas can be transformed into the solutions of the generalized Chaplygin gas unidirectional. Finally, we are done to verify that the theoretical analysis is accurate by using numerical simulation.
PubDate: 2021-07-22

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762


text:
# Article

Ufa Mathematical Journal
Volume 14, Number 3, pp. 86-96

# About one differential game of neutral type with integral restrictions in Hilbert space

Mukhsinov Y.M.

DOI:10.13108/2022-14-3-86

In the theory of differential games, when the game is defined in a finite-dimensional space, the fundamental works belong to academicians L.S. Pontryagin and N.N. Krasovskii. The works by N.N. Krasovskii and his students are mostly devoted to position games. In works by L.S. Pontryagin and his students the differential game is considered separately from the point of views of the pursuer and the evader and this unavoidably relates the differential game with two different problems. It is topical to study the games in finite-dimensional spaces since many important problems on optimal control under the conditions of a conflict or uncertainty governed by distributed systems, the motion of which is described by integro-differential equations and partial differential equations, can be studied as differential games in appropriate Banach spaces. In the present work, in a Hilbert space, we consider a pursuit problem in the Pontryagin sense for a quasilinear differential game, when the dynamics of the game is described by a functional-differential equation of neutral type in the form of J. Hale with a linear closed operator and on the control of the players integral restrictions are imposed. We prove an auxiliary lemma and four theorems on sufficient conditions ensuring the solvavility of the pursuit problem. In the lemma we show that the corresponding inhomogeneous Cauchy problem for the considered game has a solution in the sense of J. Hale. In the theorems we employ a construction similar to the Pontryagin first direct method and the idea by M.S. Nikolskii and D. Zonnevend on dilatation of time $J(t)$ and describe the sets of initial positions, from which the termination of the pursuit is possible.


text:
# Should we have the tags "algorithm-request" and "model-request"?

There are many questions on our site that of the form (for example, this one)

Which algorithm/model can potentially solve this task X successfully?

This question is a bit problematic, because, unless you already solved the same or a similar problem, the best answer will probably be only an "educated guess" of the algorithm/model that would be appropriate to solve task X. For example, if someone is dealing with images, then convolutional neural networks may be a good first choice, but, who knows, maybe CNNs are not the best solution for this specific task, so this educated "suggestion/recommendation/guess" (which is not necessarily an "opinion") may not actually be appropriate, although, initially, it looks reasonable. So, this type of question is problematic because of what I just said, but it's a recurrent one, and, often, people need some guidance in order to solve a problem.

Assuming that this type of question is on-topic here, should we have the tags

for this type of question?

This would allow users to have the list of all such questions in one place, so that they can eventually search for a question that they also have before asking a duplicate one.

Or maybe we should use the existing tag for these questions too? I think that references are papers, books or any other source of information that can support something (e.g. a claim, quote, etc.), as the dictionary puts it

reference: the use of a source of information in order to ascertain something:

So, I don't think that algorithms and models are "references", so we shouldn't use that tag for these questions.

This question is related to this one.

• Yep I think such tags make sense
– Dennis Soemers Mod
Jan 27 at 18:33
• @DennisSoemers In this case, which tag would you use? I think that in this case all of these 3 tags would be potentially applicable.
– nbro Mod
Jan 28 at 11:58
• Hrmmm I'd guess model-request, if that also covers things like architectures and not just requests for already-trained models with their trained parameters. Otherwise... algorithm-request?
– Dennis Soemers Mod
Jan 28 at 18:03
• @DennisSoemers Yes, I guess model-request, but sometimes it's not very clear, that's why I was wondering about your take on this one.
– nbro Mod
Jan 28 at 18:44


text:
## Each side of a square is increasing at a rate of 4 cm/s. At what rate (in cm2/s) is the area of the square increasing when the area of the s

Question

Each side of a square is increasing at a rate of 4 cm/s. At what rate (in cm2/s) is the area of the square increasing when the area of the square is 25 cm2

in progress 0
6 months 2021-07-28T14:36:20+00:00 1 Answers 3 views 0

The area of the square is increasing at a rate of 40 square centimeters per second.

Step-by-step explanation:

The area of the square (), in square centimeters, is represented by the following function:

(1)

Where is the side length, in centimeters.

Then, we derive (1) in time to calculate the rate of change of the area of the square (), in square centimeters per second:

(2)

Where is the rate of change of the side length, in centimeters per second.

If we know that and , then the rate of change of the area of the square is:

The area of the square is increasing at a rate of 40 square centimeters per second.


text:
How to run a regression analysis in python on a nonlinear, strange dataset

I can't figure out what type of regression analysis or extrapolation technique to use in order to come up with an equation for the data I have plotted.

For a school project, I've been testing diodes by connecting them to a temperature switch that shuts off the circuit once the temperature reaches around 250 degrees Celsius. I plotted the data, and I wanted to extrapolate it and get an equation that I could use to predict future diode temperatures. However, I have tried all sorts of extrapolation techniques and none of them accurately fits the data. For example

extrapolation1

as well as this:

extrapolation2

I've tried extrapolation/regressions in both R Studio and python, but I simply cannot get an accurate enough equation for either. Is there anything I could improve in my code, or maybe is there another technique I could use?

This is the code I used to get the first graph:

import numpy as np
import pandas as pd
from scipy.optimize import curve_fit

df = pd.read_csv("JB WELD DIODE REG.csv")
def func(x, a, b, c,d):
return a*np.sin(b*x-c)+d
x = (df.time)/10**2
y= (df.diode)/10**2

popt, pcov = curve_fit(func, x, y)
popt

plt.plot(x, func(x, *popt), 'r-',
label='fit: a=%5.3f, b=%5.3f, c=%5.3f, d=%5.3f' %tuple(popt)
)
plt.plot(x, y)

migrated from stackoverflow.comDec 26 '18 at 7:38

This question came from our site for professional and enthusiast programmers.

• If you post a link to the data file, I can run the data through my Python open source "function finder" at zunzun.com and see what candidate equations it suggests. It has hundreds of known, named equations to search through. – James Phillips Dec 26 '18 at 11:20
• What's on the X axis? Time? – HakunaMaData Dec 26 '18 at 12:55
• Why doesn't the temperature fall all the way to room temperature.. is that because you're not letting the diode cool down? Also, Why did the temperature start from close to zero in the beginning? It is important as you could model this as noise and ignore parts of the curves. – HakunaMaData Dec 26 '18 at 13:02


text:
# Probability graph will have some nodes with full-mesh connectivity.

There is a graph with $$n$$ nodes. This makes for $$n \choose 2$$ edges. We know for sure $$l$$ of these $$n \choose 2$$ edges are present and the rest are absent. What is the probability that for some $$k<\min(l,n)$$ (in fact we should have $${k \choose 2} \leq l$$), there will be a sub-graph with full-mesh connectivity between those $$k$$ nodes (meaning every one of those $$k$$ nodes is connected to every other one of them). For example, when $$n=5$$, $$k=3$$ and $$l=3$$, I think there are $$5 \choose 3$$ ways of forming graphs where $$3$$ nodes form a full-mesh and $$10 \choose 3$$ ways of having three edges connected in general ($${5 \choose 2 } =10$$). So this probability should become: $$\frac{5 \choose 3}{10 \choose 3}$$. I'm particularly interested in the cases where $$n=7$$ and $$k=4$$.

My attempt: first, we choose $$k$$ nodes nodes that are going to form a full mesh. Number of ways of doing this is - $$n \choose k$$. Now, we have remaining $$u = l - {k \choose 2}$$ of the edges which are present. Overall, there are $$v = {n \choose 2}-{k \choose 2}$$ edges (present or absent) remaining. So the probability should become:

$$\frac{{v \choose u}{n \choose k}}{{n \choose 2} \choose l}$$

I feel I might be double-counting some cases. Is there anyway to verify this formula independently or even a simple pair of second eyes will help.

• Are you assuming a uniform distribution over all graphs of size $n$ with $l$ links? – d.k.o. Feb 10 at 23:53
• That is correct. – Rohit Pandey Feb 10 at 23:54
• Sorry, that was a typo. Just fixed. – Rohit Pandey Feb 11 at 0:00

As Ross notes, it's a complicated computation in general. Let's try your example with $$n=7$$, $$k=4$$, $$l=10$$. For each $$4$$-element subset $$S$$ of $$[1..n]$$ let $$A(S)$$ be the event that $$S$$ is a clique (which is the actual graph-theory term for what you call a "full mesh"). For each of the $${7 \choose 4}$$ sets of $$4$$ vertices, $$\mathbb P(A(S)) = {15 \choose 4}/{21 \choose 10} = \frac{5}{1292}$$. Given that $$S$$ is a clique, that has $$6$$ edges, leaving just $$4$$ more edges. In particular, you can't have two edge-disjoint $$4$$-cliques, or even two that share a single edge (i.e. two vertices). You could have two $$4$$-cliques sharing three vertices (say $$\{a,b,c,d\}$$ and $$\{b,c,d,e\}$$). Either $$a$$ and $$e$$ are also joined, so this is a $$5$$-clique (which has not just two but $$5$$ $$4$$-cliques), or they are not. The first case accounts for all $$10$$ edges, while in the second case there is one other edge which could be any of $$11$$ possibilities. Thus the probability of $$5$$ $$4$$-cliques is $${7 \choose 5}/{21 \choose 10} = 1/16796$$. The probability of $$2$$ $$4$$-cliques is $${7 \choose 3}{4 \choose 2}\cdot 11/{21 \choose 10} = 55/8398$$. The expected number of $$4$$-cliques is $${7 \choose 4} {15 \choose 4}/{21 \choose 10} = 175/1292$$, so the probability of $$1$$ $$4$$-clique must be $$\frac{175}{1292} - 2 \cdot \frac{55}{8398} - 5 \cdot \frac{1}{16796} = \frac{1025}{8398}$$

• Thanks, trying to follow this. Where did the 15 in $15 \choose 4$ come from? – Rohit Pandey Feb 11 at 0:49
• Given a set of $4$ vertices, to select a configuration which makes this a $4$-clique you take all $6$ edges joining these $4$ vertices plus $4$ of the $21 - 6 = 15$ other possible edges. – Robert Israel Feb 11 at 0:56
• Do you think it might be possible to write code for this where I can pass in $n$, $k$ and $l$, or is manual inspection of each case (value of $l$) the only option? Also, you say "probability of 1 4-clique". You really mean any one 4-clique, correct? Or exactly one? – Rohit Pandey Feb 11 at 1:30
• I mean exactly $1$. – Robert Israel Feb 11 at 3:39
• "At least one" in the case at hand is $1$, $2$ or $5$, so you just add those probabilities. – Robert Israel Feb 11 at 5:15

Your approach is a good one but you double count cases where there are two different sets of $$k$$ vertices with a full mesh. I think it will be a difficult inclusion/exclusion calculation because you might just have a full mesh on $$k+1$$ vertices, you might have a full mesh on $$k+1$$ with one or a few edges missing, or you might have two disjoint sets of $$k$$ vertices.

• Thanks, so it sounds like there is no easy closed form to this one. – Rohit Pandey Feb 11 at 0:06
• For your $n=7,k=4$ it may not be so bad. You don't have enough other vertices to make a disjoint set. You need $6$ edges for a full mesh on four. To make a second full mesh would require three edges out of four from one remaining vertex. If $l$ is not too much bigger than $6$ the chance of another full mesh will be small. – Ross Millikan Feb 11 at 0:11
• Hmm, I see.. overall I need to estimate the probability there will be a 4-mesh when each edge has reliability (probability of working) $q$. I was thinking of looping over $l$ from $6$ to $21$. So it will probably get ugly for higher values of $l$. – Rohit Pandey Feb 11 at 0:16


text:
# Contributing¶

The Odin II team welcomes outside help from anyone interested. To fix issues or add a new feature submit a PR or WIP PR following the provided guidelines.

## Creating a Pull Request (PR)¶

Important Before creating a Pull Request (PR), if it is a bug you have happened upon and intend to fix make sure you create an issue beforehand.

Pull requests are intended to correct bugs and improve Odin’s performance. To create a pull request, clone the vtr-verilog-to-routing repository and branch from the master. Make changes to the branch that improve Odin II and correct the bug. Important In addition to correcting the bug, it is required that test cases (benchmarks) are created that reproduce the issue and are included in the regression tests. An example of a good test case could be the benchmark found in the “Issue” being addressed. The results of these new tests need to be regenerate. See regression tests for further instruction. Push these changes to the cloned repository and create the pull request. Add a description of the changes made and reference the “issue” that it corrects. There is a template provided on GitHub.

### Creating a “Work in progress” (WIP) PR¶

Important Before creating a WIP PR, if it is a bug you have happened upon and intend to fix make sure you create an issue beforehand.

A “work in progress” PR is a pull request that isn’t complete or ready to be merged. It is intended to demonstrate that an Issue is being addressed and indicates to other developers that they don’t need to fix it. Creating a WIP PR is similar to a regular PR with a few adjustments. First, clone the vtr-verilog-to-routing repository and branch from the master. Make changes to that branch. Then, create a pull request with that branch and include WIP in the title. This will automatically indicate that this PR is not ready to be merged. Continue to work on the branch, pushing the commits regularly. Like a PR, test cases must be included through the use of benchmarks. See regression tests for further instruction.

### Formating¶

Odin II shares the same contributing philosophy as VPR. Most importantly PRs will be rejected if they do not respect the coding standard: see VPRs coding standard

To correct any code formatting issues flagged by the CI system, simply run make format to adapt the newly added code to VPR’s coding standard. If you have made alterations to python scripts, you would probably need to run make format-py and ./dev/pylint_check.py from the VTR root directory to correct the python code formatting and check for lint errors.

## Odin II’s Flow¶

Odin II functions by systematically executing a set of steps determined by the files and arguments passed in. The figure below illustrates the flow of Odin II if a Verilog File is passed, with an optional FPGA Architecture Specification File. The simulator is only activated if an Input Vector file is passed in which creates the Output Vector File.

.. graphviz :: digraph G { 0 [label=”Verilog HDL File”,shape=plaintext]; 2 [label=”Input Vector File”,shape=plaintext]; 3 [label=”Output Vector File”,shape=diamond]; 4 [label=”FPGA Architecture Specification File”,shape=plaintext]; 5 [label=”Build Abstract Syntax Tree”,shape=box]; 6 [label=”Elaborate AST”,shape=box]; 7 [label=”Build Netlist”,shape=box]; 8 [label=”Partial Mapping”,shape=box]; 10 [label=”Simulator”,shape=box]; 11 [label=”Output Blif”,shape=diamond];

0 -> 5 -> 6 -> 7 -> 8
7->10 [color=purple]
4->8  [style=dotted] [color=purple]
8->11
4->10 [style=dotted] [color=purple]
2->10 [color=purple]
10->3 [color=purple]

}

Currently, BLIF files being passed in are only used for simulation; no partial mapping takes place. The flow is depicted in the figure below.

.. graphviz :: digraph G { 0 [label=”Input Blif File”,shape=plaintext]; 1 [label=”Read Blif”,shape=box]; 3 [label=”Build Netlist”,shape=box]; 4 [label=”Output Blif”,shape=diamond]; 5 [label=”Simulator”,shape=box]; 6 [label=”FPGA Architecture Specification File”,shape=box]; 7 [label=”Input Vector File”,shape=plaintext]; 8 [label=”Output Vector File”,shape=diamond];

0->1->3
3->5 [color=purple]
3->4
5->8 [color=purple]
7->5 [color=purple]
6->5 [style=dotted] [color=purple]

}

### Building the Abstract Syntax Tree (AST)¶

Odin II uses Bison and Flex to parse a passed Verilog file and produce an Abstract Syntax Tree for each module found in the Verilog File. The AST is considered the “front-end” of Odin II. Most of the code for this can be found in verilog_bison.y, verilog_flex.l and parse_making_ast.cpp located in the ODIN_II/SRC directory.

### AST Elaboration¶

In this step, Odin II parses through the ASTs and elaborates specific parts like for loops, function instances, etc. It also will simplify the tree and rid itself of useless parts, such as an unused if statement. It then builds one large AST, incorporating each module. The code for this can mostly be found in ast_elaborate.cpp located in the ODIN_II/SRC directory.

NOTE

These ASTs can be viewed via graphviz using the command -A. The file(s) will appear in the main directory.

### Building the Netlist¶

Once again, Odin II parses through the AST assembling a Netlist. During the Netlist creation, pins are assigned and connected. The code for this can be found in netlist_create_from_ast.cpp located in the ODIN_II/SRC directory.

NOTE

The Netlist can be viewed via graphviz using the command -G. The file will appear in the main directory under net.dot.

### Partial Mapping¶

During partial mapping, Odin II maps the logic using an architecture. If no architecture is passed in, Odin II will create the soft logic and use LUTs for mapping. However, if an architecture is passed, Odin II will map accordingly to the available hard blocks and LUTs. It uses a combination of soft logic and hard logic.

### Simulator¶

The simulator of Odin II takes an Input Vector file and creates an Output Vector file determined by the behaviour described in the Verilog file or BLIF file.

## Useful tools of Odin II for Developers¶

When making improvements to Odin II, there are some features the developer should be aware of to make their job easier. For instance, Odin II has a -A and -G command that prints the ASTs and Netlist viewable with GraphViz. These files can be found in the ODIN_II directory. This is very helpful to visualize what is being created and how everything is related to each other in the Netlist and AST.

Another feature to be aware of is make test. This build runs through all the regression tests and will list all the benchmarks that fail. It is important to run this after every major change implemented to ensure the change only affects benchmarks it was intended to effect (if any). It sheds insight on what needs to be fixed and how close it is to being merged with the master.


text:
# At which level does a Glamour bard cast the Command spell when they activate Mantle of Majesty? [duplicate]

At level 6, Glamour bards gain the Mantle of Majesty feature (XGtE, p. 14):

At 6th level, you gain the ability to cloak yourself in a fey magic that makes others want to serve you. As a bonus action, you cast command, without expending a spell slot, and you take on an appearance of unearthly beauty for 1 minute or until your concentration ends (as if you were concentrating on a spell). During this time, you can cast command as a bonus action on each of your turns, without expending a spell slot.

However it doesn't really mention at what level you cast command at. Do you use it as a level 1 spell, or at the highest spell slot you can cast at your level?

## marked as duplicate by Rubiksmoose♦ dnd-5e StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); May 12 at 15:02

As ordi's answer pointed out, the Sage Advice Compendium says a spell you can cast without a slot is cast at its lowest level, in this case 1st level.

The Sage Advice Compendium goes on to say that if the special ability allowing you to cast the spell without a spell slot allowed you to upcast it, it would say so.

From the Sage Advice Compendium (v2.3):

What level is a spell if you cast it without a spell slot?

Such a spell is cast at its lowest possible level, which is the level that appears near the top of its description. Unless you have a special ability that says otherwise, the only way to increase the level of a spell is to expend a higher-level spell slot when you cast it. (p 13)

In addition, The Player's Handbook supports this position. Under Casting a Spell at a Higher Level it says:

When a spellcaster casts a spell using a slot that is of a higher level than the spell, the spell assumes the higher level for that casting.

Since the bard can't use a spell slot to cast Command, they can't upcast it.

Special abilities that let you cast spells without using spell slots are always cast at the lowest level unless it specify otherwise according to the Sage Advice Compendium.

Also, monsters use the same rule for Innate Spellcasting.


text:
## Communications in Physics

The object of Communications in Physics is the publication of new theoretical and experimental research works in all fields of physics.

### Announcements

#### Welcome Message

Dear Colleagues,

2015 has marked the most important event for Vietnamese physicists, the Prime Minister of Vietnamese Government approved  Program of Development in the Field of Physics by2020 in Decision 380/QD - TTg, dated on March 24, 2015. The Program has opened excellent occasions to enhance science and technology potential in the field of physics in Vietnam combining high quality training with basic research and application-oriented basic research, to promote research capacity of university lecturers attracting and training talented young physicists, to develop some modern research directions which are strengths of Vietnam in order to quickly achieve advance level in the region and the world as well as effectively apply physical achievement to production and actual life. The physics of Vietnam must be strived to be ranked equally to that of advanced countries in the region by 2020. One of the Program's missions and solutions is to enhance information, publication and communication works in physics by strengthening and developing specialized physics journals of Vietnam with international level. Obviously,  Program of Development in the Field of Physics by 2020 has offered a new chance to improve our journal Communications in Physics.

Communications in Physics (ISSN 0886 - 3166) founded by the Vietnam Academy of Science and Technology has published quarterly in English since 1991 new results of theoretical and experimental research works in all fields of physics. Communications in Physics has been highly evaluated in the regional and international scientific communities.

It is a great honor and a privilege for me to be appointed as Editor-in-Chief of  Communications in Physics. I well understand the enormous responsibility and high expectations upon me in leading Communications in Physics to become a highly qualified scientific journal as an international one. It will be a daunting task, but I am fully confident that we will rise up to those expectations with the dedicated efforts and co-operations of international and Vietnamese physicists and all the Editorial Board members.

I am very grateful to all the authors for their active and continued contributions to make Communications in Physics even more improved and meaningful. With best regards and wishes./.

March 19, 2016

Prof. Nguyen Dai Hung
Editor-in-Chief, CIP

Posted: 2016-08-04 More...

### Vol 27, No 3 (2017)

#### Papers

 Yield Ratios of the Isomeric Pair $$^{179m,g}$$W Produced in the $$^{nat}$$W(g,xn)$$^{179m,g}$$W Reactions with 50-65 MeV Bremsstrahlung PDF Nguyen Van Do, Pham Duc Khue, Nguyen Thi Xuan, Bui Van Loat, Nguyen Thi Hien, Guinyun Kim 181
 Radiation Dose Estimation of Cement Samples Used in Lao PDR PDF Sonexay Xayheungsy, Le Hong Khiem, Le Dai Nam 193
 Edge Effects of Truncated Dirac Solitons in Binary Waveguide Arrays PDF Tran Xuan Truong, Nguyen Minh Hue, Phung Dinh Hoat 205
 Population Distribution of Vibrational Levels of the 2$$^1\Pi$$ State of NaLi PDF Nguyen Tien Dung 215
 Fabrication of Electrochemical Electrodes Based on Platinum and $$\text{ZnO}$$ Nanofibers for Biosensing Applications PDF Dang Thi Thanh Le, Nguyen Van Hoang, Nguyen Van Hieu, Vu Quang Khue, Tran Quang Huy 221
 Fabrication and Evaluation of the Photocatalytic, Antibacterial Activity of Ag–TiO$$_2$$ Thin Film PDF Nu Quynh Trang Ton, Thi Ngoc Tu Le, Dang Trai Nguyen, Thi Hanh Thu Vu 233
 Preparation of NiPt Alloys by Galvanic Replacement Reaction on Ni Films for Direct Ethanol Fuel Cell PDF Pham Van Vinh 245
 Fabrication and magnetic properties of sintered SrFe12O19-NiFe2O4 nanocomposites Tran Thi Viet Nga, To Thanh Loan 255
 Relaxation Rate and Mobility of a Two-Dimensional Electron Gas in MgZnO/ZnO Heterostructures Including Exchange and Correlation Effects Vo Van Tai, Nguen Quoc Khanh


text:
Please rate my essay. : Analytical Writing Assessment (AWA)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 24 Jan 2017, 06:52

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Author Message
Intern
Joined: 16 May 2013
Posts: 30
Followers: 0

Kudos [?]: 31 [0], given: 13

Show Tags

26 Jul 2013, 12:07
The following appeared in the editorial section of a local newspaper.
This past winter, 200 students from Waymarsh State College traveled to the state capitol building to protest against proposed cuts in funding for various state college programs. The other 12,000 Waymarsh students evidently weren’t so concerned about their education: they either stayed on campus or left for winter break. Since the group who did not protest is far more numerous, it is more representative of the state’s college students than are the protesters. Therefore the state legislature need not heed the appeals of the protesting students.
Discuss how well reasoned... etc.

The argument states that only 200 students from Waymarsh State college travelled to the state Capitol to protest the proposed plan to cut funds for various state college programs while the rest of the 12,000 students either stayed back on campus or left for winter break. The argument further concludes that since majority of the students did not protest , the state legislature need not heed to the appeals of the protesting student. The argument is poorly reasoned and is based on questionable assumptions and premises. It lacks statistical data without which the argument in unconvincing.
First, the author assumes that only the only the 200 odd students, protesting the cuts , are the only ones who are concerned about the education. It may be that the student body in Waymarsh State College has selected these students to represent the body consisting of all the students and voice their opinion against the cuts.
Second, the author fails to state if all the college programs or only a selected few programs in Waymarsh high school would be affected as a part of these cuts. It could be that students from the programs directly affected from the cuts are the ones protesting in front of the State Capitol. Such a situation would justify the decision of the remaining students not to take part in the protest.
The argument could be strengthened if the author could provide evidence that the student protesting outside the state capitol do not share the views of the 12000 student that stayed back or went for winter break.
As it stands , the argument is not well reasoned and would not stand without the support of evidence.
Intern
Joined: 11 Jan 2013
Posts: 16
Followers: 0

Kudos [?]: 2 [0], given: 0

Show Tags

27 Jul 2013, 00:23
Hi,

I would give your essay a 3.5 or a 4. First off, you make a good point in your second paragraph that the argument assumes that only the protesters are concerned about the cuts. But you need to develop your point more fully then you do and introduce additional reasoning that illustrates why it is problematic to assume that the protesters are the only ones who care because they showed up. For instance, the fact that the students had to travel to the State Capitol (involves transportation, time off work, etc.), or that the protest was during Winter Break also indicates that many students who might oppose the increase might not have been able to attend.

Second, your third paragraph is not really relevant or making a strong point that challenges the argument's main claim. You need to be addressing the assumption that not attending the protest means students are not concerned about their education. But even more importantly, you need to be challenging the idea that even if only 5 students cared about the cuts and protested, that the state legislature should be basing their actions and decisions on whether a group represents the majority or not. Simply because a group may represent the majority opinion does not mean that the opinion of the majority is valid and should be followed. The opposite also holds true: a minority view should not be dismissed as invalid simply based on quantity.

Hope this helps,
_________________

Susan Feldman, Ph.D.
GMAT AWA & Verbal Tutor
Peak Performance Test Prep

Intern
Status: Yes. It was I who let the dogs out.
Joined: 03 Dec 2012
Posts: 42
H: B
GMAT Date: 08-31-2013
Followers: 1

Kudos [?]: 38 [0], given: 27

Show Tags

27 Jul 2013, 21:33
koolgmat wrote:
The following appeared in the editorial section of a local newspaper.
This past winter, 200 students from Waymarsh State College traveled to the state capitol building to protest against proposed cuts in funding for various state college programs. The other 12,000 Waymarsh students evidently weren’t so concerned about their education: they either stayed on campus or left for winter break. Since the group who did not protest is far more numerous, it is more representative of the state’s college students than are the protesters. Therefore the state legislature need not heed the appeals of the protesting students.
Discuss how well reasoned... etc.

The argument states that only 200 students from Waymarsh State college travelled to the state Capitol to protest the proposed plan to cut funds for various state college programs while the rest of the 12,000 students either stayed back on campus or left for winter break. The argument further concludes that since majority of the students did not protest , the state legislature need not heed to the appeals of the protesting student. The argument is poorly reasoned and is based on questionable assumptions and premises. It lacks statistical data without which the argument in unconvincing.
First, the author assumes that only the only the 200 odd students, protesting the cuts , are the only ones who are concerned about the education. It may be that the student body in Waymarsh State College has selected these students to represent the body consisting of all the students and voice their opinion against the cuts.
Second, the author fails to state if all the college programs or only a selected few programs in Waymarsh high school would be affected as a part of these cuts. It could be that students from the programs directly affected from the cuts are the ones protesting in front of the State Capitol. Such a situation would justify the decision of the remaining students not to take part in the protest.
The argument could be strengthened if the author could provide evidence that the student protesting outside the state capitol do not share the views of the 12000 student that stayed back or went for winter break.
As it stands , the argument is not well reasoned and would not stand without the support of evidence.

Read the Official Sample Analysis of an Argument Question on the MBA.com Website at http://www.mba.com/the-gmat/test-structure-and-overview/analytical-writing-assessment-section/sample-analysis-of-an-argument-question.aspx

You can also purchase the GMAT Write 1 and Write 2 at http://www.vantageonlinestore.com/home.php?cat=299. for Essay writing and feedback.

http://www.vantageonlinestore.com/product.php?productid=16440&cat=299&page=1
GMAT Write™ 1
This web-based essay writing practice tool offers you real GMAT writing prompts along with feedback on how well your essays demonstrate your ability to think critically and communicate ideas.
Each practice essay will be scored in real time with the same automated essay-scoring engine used by the official GMAT® exam.
Upon submitting each essay, you will receive feedback on how well your essays—
•Identify and analyze significant flaws in the argument
•Support your critique using relevant supporting reasons and/or examples
•Develop a clearly organized and coherent response
•Demonstrate control of language, including diction, syntax, and conventions of standard written English

With each $29.99 subscription you purchase, you’ll receive two unique essay prompts and have the chance to write four essays, two for each prompt. After completing the essays, you will receive immediate results that show you how you would likely score on the writing exams and how you could improve your scores. This practice tool will help you prepare for the GMAT exam, for business school, and for your career. http://www.vantageonlinestore.com/product.php?productid=16441&cat=299&page=1 GMAT Write™ 2 This web-based essay writing practice tool offers you real GMAT writing prompts along with feedback on how well your essays demonstrate your ability to think critically and communicate ideas. Each practice essay will be scored in real time with the same automated essay-scoring engine used by the official GMAT® exam. Upon submitting each essay, you will receive feedback on how well your essays— •Identify and analyze significant flaws in the argument •Support your critique using relevant supporting reasons and/or examples •Develop a clearly organized and coherent response •Demonstrate control of language, including diction, syntax, and conventions of standard written English With each$29.99 subscription you purchase, you’ll receive two unique essay prompts and have the chance to write four essays, two for each prompt.
After completing the essays, you will receive immediate results that show you how you would likely score on the writing exams and how you could improve your scores.

Current Analytical Writing Assessment Topics
You may download the complete list of current Analytical Writing Assessment (AWA) Analysis of an Argument Topics used during the administration of the GMAT exam at
http://www.mba.com/~/media/Files/mba/NEWTheGMAT/AnalysisofanArgument100606.pdf.

The Elements of Style by William Strunk Jr.
https://en.wikipedia.org/wiki/The_Elements_of_Style
William Strunk, Jr. (1 July 1869 – 26 September 1946), was a professor of English at Cornell University and author of the The Elements of Style (1918), which, after being revised and enlarged by his former student E. B. White, became a highly influential guide to English usage during the late 20th century.

http://www.amazon.com/Elements-Style-Fourth-William-Strunk/dp/020530902X/ref=sr_1_1/186-8560226-2308145?s=books&ie=UTF8&qid=1375054689&sr=1-1
The Elements of Style, Fourth Edition [Paperback]
William Strunk Jr. (Author), E. B. White (Author), Roger Angell (Foreword)

You can read the book online at http://www.bartleby.com/141/
The University of Amsterdam has the made the earlier edition of the book available in pdf at http://www.cs.vu.nl/~jms/doc/elos.pdf.
_________________

Yogi Bhajan: If you want to learn a thing, read that; if you want to know a thing, write that; if you want to master a thing, teach that.
This message transmitted on 100% recycled electrons.

Similar topics Replies Last post
Similar
Topics:
1 Please rate my essay 0 16 Dec 2015, 17:49
Please rate my essay 1 12 Oct 2013, 10:18
1 Please rate my essay 4 14 Sep 2013, 10:07
Please, rate my essay 1 22 Jan 2013, 19:08
Please rate my essay 0 01 Aug 2012, 21:27
Display posts from previous: Sort by