engineerng divide
play

ENGINEERNG DIVIDE SHAREEN HERTEL, PH.D. SCIENCE AND ENGINEERING FOR - PowerPoint PPT Presentation

Jun 19, 2023 •362 likes •458 views

BRIDGING THE HUMAN RIGHTS & ENGINEERNG DIVIDE SHAREEN HERTEL, PH.D. SCIENCE AND ENGINEERING FOR SOCIAL GOOD FEBRUARY 9-11, 2018 @ GEORGIA TECH WHY THE DIVIDE? Human rights field: dominated by law, social science & humanities

  1. BRIDGING THE HUMAN RIGHTS & ENGINEERNG DIVIDE SHAREEN HERTEL, PH.D. “SCIENCE AND ENGINEERING FOR SOCIAL GOOD” FEBRUARY 9-11, 2018 @ GEORGIA TECH

  2. WHY THE DIVIDE? • Human rights field: dominated by law, social science & humanities scholars • Engineering profession: guided by “Code of Ethics” (not HR -specific norms) Source: Software Engineering Ethics Institute; Itl HR Law Archives

  3. WHY UNIVERSITY OF CONNECTICUT? • Pioneer in interdisciplinary HR research & teaching • Strong track record of practice-based research • Strong institutional commitment to: • Vendor supply chain management • Environmental sustainability Source: Sierra Club; UConn

  4. INSTITUTIONALIZATION OF HUMAN RIGHTS & SUSTAINABILITY PRACTICE • Office of Environmental Policy: • https://envpolicy.uconn.edu/ • President’s Committee on Corporate Social Responsibility • https://csr.uconn.edu/ • Vendor Code of Conduct • https://policy.uconn.edu/2013/02/12/vendor-code-of-conduct/

  5. EXISTING UCONN HUMAN RIGHTS CURRICULUM • 200 undergrad Human Rights Majors/Minors annually • University-wide • STEM track opens HR Minor to ENGR and other STEM students • https://humanrights.uconn.edu/wp-content/uploads/sites/767/2018/01/Advising-Tracks- HRTS-ENGR-1.2.18.pdf • 25+ grad students earn “HR Certificate” annually • UConn Law; School of Social Work; School of Education; College of Liberal Arts & Science

  6. ONGOING COLLABORATIVE RESEARCH • NSF PIRE Grant (Ethiopia water project) • Provost Grant on Business & HR (global supply chains) Source: UConn Engineering; UConn School of Business

  7. NEXT STEPS • Integrate STEM and HR more fully in grad curriculum Source: UConn Human Rights Institute; UConn Law; UConn School of ENGR

  8. QUESTIONS? • Contact: • Shareen.Hertel@uconn.edu or 860 486 4129 • With thanks to: • National Center for Science and Civic Engagement; Georgia Institute of Technology; Stony Brook University; and the SUNY Louis Stokes Alliance for Minority Participation

Recommend

Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems.

Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems.

Divide-and-conquer paradigm Divide-Conquer-Glue Algorithms Divide-and-conquer. Divide up problem into several subproblems. Mergesort and Counting Inversions Solve each subproblem recursively. Combine solutions to subproblems into

563 views • 6 slides
Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into

Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into

Chapter 2 Divide and conquer 1 The main idea for the divide and conquer is trying to divide a problem into several subproblems, which are similar to the original problem but smaller. Solving the subproblems recursively and combining these

934 views • 58 slides
of Change What is Happening to Our Planet? Ecological divide (1.5) Social-- economic divide

of Change What is Happening to Our Planet? Ecological divide (1.5) Social-- economic divide

Sustainable Development and Management of Change What is Happening to Our Planet? Ecological divide (1.5) Social-- economic divide (2.5) Inner cultural or spiritual divide (3) Scharmer, C. O., & Kaufer, K. (2013). Leading from the

522 views • 19 slides
Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide

Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide

Divide-Conquer-Glue Algorithms Divide-and-conquer. Mergesort and Counting Inversions Divide up problem into several subproblems. Solve each subproblem

379 views • 6 slides
Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy:

Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy:

Divide and Conquer Algorithms Divide-and-Conquer The most-well known algorithm design strategy: 1. Divide instance of problem into two or more smaller instances 2. Solve smaller instances recursively 3. Obtain solution to original (larger)

861 views • 54 slides
CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences

CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences

CS 240A : Divide-and-Conquer with Cilk++ Divide & Conquer Paradigm Solving recurrences Sorting: Quicksort and Mergesort Thanks to to Charles E. E. Leiserson for some of th these slides 1 Work and Span (Recap) T P = execution

642 views • 36 slides
The Digital Divide By Ellie Honerman The Digital Divide The situation in which some people

The Digital Divide By Ellie Honerman The Digital Divide The situation in which some people

The Digital Divide By Ellie Honerman The Digital Divide The situation in which some people have access to modern information technology while others do not. The underlying assumption motivating the term is that people who use cell

444 views • 22 slides
Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into

Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into

Divide and conquer Philip II of Macedon Divide and conquer 1) Divide your problem into subproblems 2) Solve the subproblems recursively, that is, run the same algorithm on the subproblems (when the subproblems are very small, solve them from

1.39k views • 116 slides
CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

1 CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage.

142 views • 10 slides
CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer.

1 CS Lunch Mary Allen Wilkes Wednesday 12:15 Kendade 307 2 Divide and Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage.

411 views • 13 slides
Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve

Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve

Divide and Conquer Summary Divide Identify one or more subproblems Conquer Solve some or all of those subproblems Combine Use the subproblems solutions to find large solution Generic Divide and Conquer Solution def

398 views • 18 slides
Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle

Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle

Chapter 1 Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle Important algorithm design method Examples from Informatik 2: Sorting: Mergesort, Quicksort Binary search can be considered

339 views • 22 slides
Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each

Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each

Divide-and-Conquer Divide-and-conquer. Break up problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution. Most common usage. Break up problem of size n into two equal parts of

145 views • 10 slides
Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide

Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide

Divide and Conquer Algorithms and Recurrence Relations Debdeep Mukhopadhyay IIT Madras Divide & Conquer Algorithms Many types of problems are solvable by reducing a problem of size n into some number a of independent subproblems, each

680 views • 15 slides
Divide and Conquer Divide the problem into several subproblems of equal size. Recursively

Divide and Conquer Divide the problem into several subproblems of equal size. Recursively

Divide and Conquer Divide the problem into several subproblems of equal size. Recursively solve each subproblem in parallel. Merge the solutions to the various subproblems into a solution for the original problem. Dividing the problem is

674 views • 28 slides
Crossing the digital divide Source: von Frank, V. (2013, Summer) . Crossing the Digital Divide.

Crossing the digital divide Source: von Frank, V. (2013, Summer) . Crossing the Digital Divide.

Title Body Crossing the digital divide Source: von Frank, V. (2013, Summer) . Crossing the Digital Divide. Tools for Learning Schools 8(4). (p.p. 1-3). Download the article and accompanying tools This presentation is a supplement to the full

326 views • 10 slides
Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort

Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort

Outline and Reading Divide-and-conquer paradigm (5.2) Divide-and-Conquer Review Merge-sort (4.1.1) Recurrence Equations (5.2.1) Iterative substitution 7 2 9 4 2 4 7 9 Recursion trees 7 2 2 7 9 4 4 9

846 views • 4 slides
Algorithmic Paradigms Divide and Conquer Idea: Divide problem instance into smaller sub-instances

Algorithmic Paradigms Divide and Conquer Idea: Divide problem instance into smaller sub-instances

Algorithmic Paradigms Divide and Conquer Idea: Divide problem instance into smaller sub-instances of the same problem, solve these recursively, and then put solutions together to a solution of the given instance. Examples: Mergesort, Quicksort,

654 views • 15 slides
Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial

Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial

CS 270 Algorithms Oliver Kullmann Week 2 Growth of Functions Divide-and- Divide and Conquer Conquer Min-Max- Problem Tutorial Growth of Functions 1 Divide-and-Conquer 2 Min-Max-Problem Tutorial 3 CS 270 General remarks

547 views • 39 slides
Portable Application Drives To Cross the Digital Divide Timothy Kaar Assistant Professor of

Portable Application Drives To Cross the Digital Divide Timothy Kaar Assistant Professor of

Portable Application Drives To Cross the Digital Divide Timothy Kaar Assistant Professor of Graphic Design Elgin Community College NISOD 2006 What is the digital divide? According to the Wikipedia, the digital divide is the gap between

1.1k views • 58 slides
Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer

Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer

Plan for Today Finish recurrences Inversion Counting Closest Pair of Points Divide and Conquer Divide-and-conquer. Divide problem into several parts. Solve each part recursively. Combine solutions to sub-problems into overall solution.

828 views • 39 slides
Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming

Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming

Divide and Conquer Algorithm Design Techniques Greedy Divide and Conquer Dynamic Programming Network Flows Algorithm Design Divide and Greedy Conquer Formulate problem ? ? Design algorithm less work more work Prove correctness more

282 views • 12 slides
Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and

Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and

Divide and Conquer CSE 421 Algorithms Richard Anderson Lecture 12 Recurrences and Divide and Conquer Recurrence Examples T(n) = aT(n/b) + f(n) T(n) = 2 T(n/2) + cn O(n log n) T(n) = T(n/2) + cn O(n) More useful facts:

305 views • 3 slides
The Racial Wealth Divide in 2043 Homeownership Parity and the Racial Wealth Divide Housing

The Racial Wealth Divide in 2043 Homeownership Parity and the Racial Wealth Divide Housing

Doug Ryan Director of Affordable Homeownership Prosperity Now Solutions for Affordable Housing NHC 2017 National Housing Policy Convening November 29, 2017 The Racial Wealth Divide in 2043 Homeownership Parity and the Racial Wealth Divide

274 views • 10 slides

More recommend