2016-09-01

How to reverse global warming (2:24) by Todd Murphy


source: brainsci 2016年8月30日
How to reverse Global Warming. Not stop it or slow it down, but how to restore our planet to the ideal temperature.
I do not claim to be a space engineer, but the concept seems simple enough that it will be worth investigating.
Share with your NASA friends.
The comments section of this page is not a forum for debating whether or not Global Warming is real, or its causes. There are many online places where these points will be on-topic. I advocate the use of anything that will reduce greenhouse gasses, though this page is about the use of reflective technologies. P lease use your own YouTube pages to advocate other methods, and know that I wish you all possible success with your ideas.
Comments are moderated.

The Cognitive Status of Theories (Ernest Nagel in 1960)


source: Philosophical Overdose     2016年7月31日
Ernest Nagel's Howison lecture at UC Berkeley, where he discusses the cognitive status of scientific theories and related issues regarding scientific realism and instrumentalism. Ernest Nagel was a prominent philosopher of science of the 20th century. Along with Rudolf Carnap, Hans Reichenbach, and Carl Hempel, he is sometimes seen as one of the major figures of logical positivism. His most famous work was The Structure of Science: Problems in the Logic of Scientific Explanation.
This talk was given at the University of California Berkeley in 1960, as part of the Howison lecture series.

工程數學-微分方程: 丁建均 / 臺大

# 播放清單 (請按影片左上角點選取影片觀看)

source: 臺大科學教育發展中心     2012年10月2日

第1講:Chap. 1 Introduction to Differential Equations 1:19:53
第2講:Sections 2-1 and 2-6, Solution Curves and A Numerical Method 50:09
第3講:Chapter 2 First Order Differential Equation 1 1:29:00
第4講:Chapter 2 First Order Differential Equation 2 52:51
第5講:Chapter3 Modeling with First-Order Differential Equations 1:27:28
第6講: 48:02
第7講: 1:29:16
第8講:Chapter 4 Higher Order Differential Equations 54:12
第9講:Section 4-2 Reduction of Order 44:02
第10講:Sections 4-3 and 4-4 Solving the Linear and Constant Coefficient DE 1:36:50
第11講:Section 4-5 Annilator Approach 58:06
第12講:Sections 4-6 and 4-7 Variation of Parameters and Cauchy-Euler Equation 1:31:16
第13講:Section 5-1 Applications of Linear DE 35:37
第14講、Sections 4-9 and 4-10 Systems of Linear DEs; Nonlinear DEs 1:33:22
第15講、Section 5-3 Nonlinear Models 44:08
第16講、Chap. 8 Systems of Linear First-Order Differential Equations 50:12
第17講、Chap. 6 Series Solutions of Linear Equations 1:35:15
第18講、Section 6-2 Solutions about Ordinary Points 56:07
第19講、 Sections 6-3 and 6-4 Solutions About Singular Points 1:57:52
第20講、Chap. 7 The Laplace Transform 52:11
第21講、 Sections 7-2 and 7-3 Inverse Laplace Transforms(I) 1:49:05
第22講、Section 7-4 Properties of Laplace Transforms (II) 59:26
第23講、Sections 7-5 and 7-6 The Dirac Delta Function and Systems of Linear DEs 1:11:37
第24講 Section 11-1 Orthogonal Functions 52:19
第25講、Sections 11-2 and 11-3 Fourier Series, Fourier Cosine and Sine Series 1:48:04
第26講、Section 11-3 Fourier Cosine and Sine Series 52:07
第27講、Sections 14-3 and 14-4 Fourier Integral and Fourier Transforms 1:40:38
第28講、Section 14-4 Fourier Transforms 51:34
第29講、Sections 12-1,12-2,12-4 Separation of Variables for Solving Partial ...... 1:44:07
第30講、Section 12-5 Laplace's Equation 41:09

Why Doesn't the U.S. Have a Multi-Party Political System? | George Musser


source: Big Think    2016年8月26日
Princeton professor Sean Wilentz explains why America has such a staunch two-party system, which was never part of the Framers' plan. Wilentz's new book is "The Politicians and the Egalitarians: The Hidden History of American Politics" (http://goo.gl/eZNJVT).
Read more at BigThink.com: http://bigthink.com/videos/sean-wilen...

Transcript - The two party system is inevitable in America. The framers designed a constitution that they thought would be without political parties. They didn't like political parties. They thought political parties were divisive. They thought political parties would ruin the commonwealth as they saw it. They didn't like them, and yet they designed a system in which parties very quickly arose and we're never going to go away. And the reason is simple that in a country as large, as diverse with so many clashing interests as the United States it's going to become necessary to find a focus, to find a focus for your political actions. Parties have become that focus. They very quickly became that focus.

Now, the question is why don't we have a multiparty system? Why aren't we more like Italy say or even France or a European parliamentary system? Well that's the answer is that we're not a parliamentary system. Because we have a system that we do and because it's based on the idea of first past the post, in other words the person who gets the most amount of votes will win the election, they're not going to have proportional representation. If you get ten percent of the votes you're not going to get ten percent of the power you're going to get nothing. On that account then the pressure is very, very strong for there to be eventually a two party system. Third parties can come in and they can have a tremendous amount of influence in shaping the major parties, but as a great historian once said third parties are like bees, they sting and then they die. So they make their sting, but because a third-party will always almost inevitably help the party they're most unlike, as you saw with say the Nader campaign in 2000 who got elected, they have their effect but then they very quickly disappear. So I think the two parties, it's not so much that I have some metaphysical or ontological love for two parties as a thing, it's rather that's the way the American constitutional system works. Now, if you change the constitutional system, of course, that would change as well, but it's embedded in the way that our government was set up in 1787/'88 and it continues that way to this day.

Joel Peterson: "The 10 Laws of Trust" | Talks at Google


source: Talks at Google     2016年7月29日
Joel Peterson is the Chairman of JetBlue and a professor at the Stanford Graduate School of Business. Formerly the Managing Partner of Trammell Crow, one of the nation’s leading real estate developers as well as the chairman of Peterson Partners, an investment firm he founded in the early 1990s.
Joel Peterson joins Talks at Google in NYC to talk about his most recent book “The 10 Laws of trust”.
In The 10 Laws of Trust, JetBlue chairman Joel Peterson explores how a culture of trust gives companies an edge in the 21st century.

Torture to Combat Terrorism? It Doesn't Work, but Good Cop Bad Cop Does | Juliet Kayyem


source: Big Think      2016年7月29日
A homeland security expert speaks on the utter failure of post-9/11 torture practices, and whether counter-terrorism 'tough' talk is a presidential quality. Kayyem's book is "Security Mom: An Unclassified Guide to Protecting Our Homeland and Your Home" (http://goo.gl/b0KGO3).
Read more at BigThink.com: http://bigthink.com/videos/juliette-k...

Transcript - I’ve been a woman and a mother in national security. If I got a dollar for every time someone said more aggressive in a meeting I would be retired. I would be a very rich woman. More aggressive, tougher is not a policy. It’s sort of crazy talk. What does it even mean? And what we have to remember is we are not under anything close to an existential threat right now. We have a risk. It is heightened because of what is going on in the world. But like don’t lose your head. I mean if you want to be president I think your number one job requirement is you cannot lose your head every time something goes wrong. You have to sort of brace for it, accept it, learn from it and move on. And so on the learning part any person who has been in national security and any professional interrogator will tell you information garnered from torture, waterboarding or the extreme interrogation tactics that were used in the early days after 9/11 didn’t work. It got us nothing. It got us nowhere. It got us a bunch of detainees who we can’t even put through a criminal court because we’ve tortured them, right. Because we don’t want that evidence to come out.
This is what it’s gotten us. And so, you know, it’s not only sort of un-American. It’s just – it doesn’t work. It’s like talking to a five year old. You’re like okay, two plus two does not equal five. Like two plus two equals four. And anyone who has been in the interrogation world knows that success in interrogation of a hostile person, right, is generally a good cop, bad cop scenario, right. It’s someone that they feel comfortable with because they feel that they are under stress in the environment that they’re in that they start to talk to. This toughness talk masks any policy and that’s dangerous. But it also – and this is what worries me is it once again perpetuates this mythology that, you know, a tough counter terrorism policy will keep us 100 percent safe from terrorism. And if terrorism happens it means you were too soft. That just can’t be. As I said before it’s like you tell me what country is – whether it’s the toughest country in the world – Israel for example or the least open country in the world – China or Myanmar for example that doesn’t have violence perpetuated by people who want to have a political influence. You take the spectrum, it’s happening and that’s okay. I mean and it’s like just accept it, it’s a risk. And then respond, brace and everything else for it.

V. Babu: Gas Dynamics and Propulsion (IIT Madras)

# playlist of the 40 videos (click the up-left corner of the video)

source: nptelhrd   2014年6月3日
Mechanical - Gas Dynamics and Propulsion by Prof. V. Babu, Department of Mechanical Engineering, IIT Madras. For more details on NPTEL visit http://nptel.ac.in

01 Introduction 49:24
02 Introduction / Fundamental Ideas 47:50
03 Fundamental Ideas 48:00
04 Fundamental Ideas 42:52
05 Fundamental Ideas / Normal Shock Waves 53:21
06 Normal Shock Waves 52:44
07 Normal Shock Waves / Rayleigh Flow 49:06
08 Rayleigh Flow 45:52
09 Rayleigh Flow 53:19
10 Rayleigh Flow / Fanno Flow 47:46
11 Fanno Flow 48:20
12 Fanno Flow 45:55
13 Fanno Flow / Quasi One Dimensional Flows 48:47
14 Quasi One Dimensional Flows 48:23
15 Quasi One Dimensional Flows 48:29
16 Quasi One Dimensional Flows 47:50
17 Quasi One Dimensional Flows 50:15
18 Quasi One Dimensional Flows 43:32
19 Quasi One Dimensional Flows 47:13
20 Oblique Shock Waves 48:06
21 Oblique Shock Waves 52:00
22 Oblique Shock Waves 51:20
23 Oblique Shock Waves / Prandtl Meyer Waves 44:06
24 Prandtl Meyer Waves 46:09
25 Prandtl Meyer Waves 52:05
26 Propulsion - an Introduction 42:20
27 Components of the Gas Turbine Engine 48:48
28 Components of the Gas Turbine Engine 45:29
29 Components of the Gas Turbine Engine 45:50
30 Components of the Gas Turbine Engine 47:24
31 Components of the Gas Turbine Engine / Thermodynamic Analysis of the Engine 50:46
32 Thermodynamic Analysis of the Engine 44:57
33 Thermodynamic Analysis of the Engine 49:54
34 Calculations for Thrust and Fuel Consumption 50:54
35 Calculations for Thrust and Fuel Consumption 48:18
36 Calculations for Thrust and Fuel Consumption / Emerging Trends 50:28
37 Emerging Trends / Ramjets 47:27
38 Ramjets 47:33
39 Ramjets / Scramjets 49:01
40 Scramjets 42:50

Suresh Govindarajan: Classical Field Theory (IIT Madras)

# playlist of the 39 videos (click the up-left corner of the video)

source: nptelhrd    2013年11月27日
Physics - Classical Field Theory by Prof. Suresh Govindarajan, Department of Physics, IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in

Lec-01 48:18
Lec-02 50:08
Lec-03 51:15
Lec-04 50:54
Lec-05 52:13
Lec-06 51:58
Lec-07 50:07
Lec-08 55:59
Lec-09 56:20
Lec-10 54:46
Lec-11 50:37
Lec-12 49:21
Lec-13 51:17
Lec-14 53:55
Lec-15 47:28
Lec-16 50:41
Lec-17 53:11
Lec-18 51:30
Lec-19 51:45
Lec-20 53:30
Lec-21 54:17
Lec-22 50:29
Lec-23 51:00
Lec-24 52:59
Lec-25 1:04:49
Lec-26 51:09
Lec-27 51:55
Lec-28 51:21
Lec-29 54:11
Lec-30 51:24
Lec-31 50:47
Lec-32 51:39
Lec-33 51:25
Lec-34 51:21
Lec-35 55:11
Lec-36 56:05
Lec-37 50:02
Lec-38 54:04
Lec-39 54:17

Parallel Computing by Subodh Kumar (IIT Delhi)

# click the upper-left icon to select videos from the playlist

source: nptelhrd    2013年11月13日
Computer Science - Parallel Computing by Dr. Subodh Kumar, Department of Computer Science and Engineering, IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

01 Introduction 36:20
02 Parallel Programming Paradigms 1:02:04
03 Parallel Architecture 57:03
04 Parallel Architecture (case studies) 55:00
05 Open MP 53:30
06 Open MP(Contd.) 54:18
07 Open MP(Contd..) 50:39
08 Open MP&PRAM Model of Computation  51:38
09 PRAM 1:02:24
10 Models of Parallel Computation,Complexity 53:02
11 Memory Consistency 59:20
12 Memory Consistency & Performance Issues 58:10
13 Parallel Program Design 59:18
14 Shared Memory & Message Passing 51:18
15 MPI 49:48
16 MPI(Contd.) 1:12:00
17 MPI(Contd..) 50:22
18 Algorithmic Techniques 47:04
19 Algorithmic Techniques(Contd.) 29:48
20 Algorithmic Techniques(Contd..) 49:03
21 CUDA 57:31
22 CUDA(Contd.) 29:33
23 CUDA(Contd..) 1:24:45
24 CUDA(Contd...) 1:00:01
25 CUDA(Contd....) 51:27
26 CUDA(Contd.....) 1:04:09
27 CUDA(Contd......) 53:19
28 Algorithms,Merging & Sorting 46:59
29 Algorithms,Merging & Sorting(Contd.) 58:14
30 Algorithms,Merging & Sorting(Contd..) 52:19
31 Algorithms,Merging & Sorting(Contd...) 53:18
32 Algorithms,Merging & Sorting(Contd....) 1:03:36
33 Lower Bounds Lock Free Synchronization,Load Stealing 55:58
34 Lock Free Synchronization,Graph Algorithms 42:22

High Performance Computing by Matthew Jacob (IISC Bangalore)

# click the upper-left icon to select videos from the playlist

source: nptelhrd     2011年9月13日
Computer Science - High Performance Computing by Prof. Matthew Jacob, Department of Computer Science and Automation, IISC Bangalore. For more details on NPTEL visit http://nptel.iitm.ac.in

Mod-01 Lec-01 Programs and Data 54:20
Mod-01 Lec-02 Data Representation 55:31
Mod-02 Lec-03 Registers and Memory 55:51
Mod-02 Lec-04 Instructions, Addressing Modes 46:42
Mod-02 Lec-05 A RISC Instruction Set 54:27
Mod-02 Lec-06 A RISC Instruction Set (contd) 52:01
Mod-02 Lec-07 Function Call and Return 56:28
Mod-02 Lec-08 Function Call and Return (contd) 53:01
Mod-02 Lec-09 Instruction Execution 52:11
Mod-02 Lec-10 Instruction Execution (contd) 54:59
Mod-03 Lec-11 Software organization 54:56
Mod-03 Lec-12 System Calls 51:51
Mod-03 Lec-14 Virtual memory (contd) 51:46
Mod-03 Lec-15 Virtual Memory (cont) 50:20
Mod-04 Lec-16 Process 53:42
Mod-04 Lec-17 Process scheduling 53:57
Mod-04 Lec-18 Process lifetime 56:14
Mod-04 Lec-19 Interprocess communication 56:13
Mod-04 Lec-20 Concurrent programming 55:41
Mod-05 Lec-21 Pipelining 53:10
Mod-05 Lec-22 Pipeline hazards 52:42
Mod-05 Lec-23 Pipeline hazards (contd) 52:32
Mod-05 Lec-24 Pipeline hazards (contd.) 55:51
Mod-06 Lec-25 Cache memory 53:50
Mod-06 Lec-26 Memory hierarchy 54:27
Mod-06 Lec-27 Cache operation 56:32
Mod-06 Lec-28 Cache operation (contd) 53:05
Mod-06 Lec-29 Cache aware programming 56:11
Mod-06 Lec-30 Cache aware programming (contd) 53:28
Mod-06 Lec-31 More on cache 54:50
Mod-07 Lec-32 Measuring time 53:10
Mod-07 Lec-33 Program Profiling 53:03
Mod-08 Lec-34 Secondary storage 53:26
Mod-08 Lec-35 Files and disks 55:18
Mod-08 Lec-36 Directories 52:53
Mod-08 Lec-37 Protection and Performance 42:05
Mod-09 Lec-38 Parallel architecture 55:14
Mod-09 Lec-39 Cache coherence 54:14
Mod-09 Lec-40 MPI programming 56:05
Mod-09 Lec-41 MPI programming (contd) 56:36

The Philosophers of Atlantis with Jason Reza Jorjani


source: New Thinking Allowed   2016年8月25日
Jason Reza Jorjani is a philosopher and faculty member at the New Jersey Institute of Technology. He is author of Prometheus and Atlas.
Here he reviews the writings about ancient Atlantis that appear in the philosophical literature. He focuses on Plato, Francis Bacon, Rudolf Steiner, and Colin Wilson. When taken as a whole, this literature is suggestive of an advanced civilization that may have existed about ten thousand years ago. Its inhabitants possessed a consciousness very different from that of modern humans. Jorjani speculates that various archeological mysteries can be resolved if one treats these philosophical accounts as embodying some remnants of actual history. He suggests that we are still haunted by the memory of Atlantis and that this may account, in part, for the resistance toward parapsychology today.
New Thinking Allowed host, Jeffrey Mishlove, PhD, is author of The Roots of Consciousness, Psi Development Systems, and The PK Man. Between 1986 and 2002 he hosted and co-produced the original Thinking Allowed public television series. He is the recipient of the only doctoral diploma in "parapsychology" ever awarded by an accredited university (University of California, Berkeley, 1980). He is a past vice-president of the Association for Humanistic Psychology; and is the recipient of the Pathfinder Award from that Association for his contributions to the field of human consciousness exploration. He is also past-president of the non-profit Intuition Network, an organization dedicated to creating a world in which all people are encouraged to cultivate and apply their inner, intuitive abilities.
(Recorded on June 25, 2016)

Linear Programming (2011) by Barbaros Tansel at Bilkent University

# click the upper-left icon to select videos from the playlist

source: Bilkent Online Courses     2014年8月15日
IE513 Linear Programming:
Theory, algorithms, and computational aspects of linear programming. Formulation of problems as linear programs. Development of simplex algorithm, geometry of simplex method, duality theory, and economic interpretations. Sensitivity analysis. Variants of simplex method..

Lecture 1: Brief history of linear programming and introductory example 38:18
Lecture 2: Example continued with solution and general form of linear programming in canonical maximization form 52:32
Lecture 3: General form linear programming and matrix forms, two formulation examples 53:26
Lecture 4: Examples of linear programming formulation 44:30
Lecture 5: Examples of linear programming formulation (cont) 49:21
Lecture 6: Conversions of constraints and variables. Requirements space 50:37
Lecture 7: Fourier-Motzkin elimination to solve linear inequality systems 50:17
Lecture 8: Convex sets and convex functions 48:50
Lecture 9: Convexity, hyperplanes, half-spaces. 49:23
Lecture 10: Convex hulls, extreme points, vertices 46:23
Lecture 11: Subspaces, affine subspaces 48:10
Lecture 12: Extreme points of polyhedra, basic and basic feasible solutions 51:04
Lecture 13: Equivalence of basic feasible solutions, extreme points and vertices 51:27
Lecture 14: Adjacent basic solutions, polyhedra in standard form and basic solutions for standard form. 43:05
Lecture 15: Adjacent basic solutions, degeneracy, existence of extreme points, rays, directions of convex sets. 50:37
Lecture 16: Directions and unbounded LPs, extreme directions, representation theorem 50:08
Lecture 17: Optimality of extreme points and unboundedness, simplex method example 49:14
Lecture 18: Simplex method example in dictionary form, equation form and tabular form 51:25
Lecture 19: Simplex method explained in terms of basis matrices 49:54
Lecture 20: Simplex Method in matrix form 54:52
Lecture 21: Simplex tableau in matrix form, alternative optima, unbounded solution 50:10
Lecture 22: Finding a starting basic feasible solution 49:06
Lecture 23: 2-Phase Method to find an initiating basic feasible solution 40:16
Lecture 24: Degeneracy and resolution of cycling 48:45
Lecture 25: Revised Simplex method 50:29
Lecture 26: Revised simplex and simplex for bounded variables 48:46
Lecture 27: Simplex for bounded variables 48:28
Lecture 28: Simplex for bounded variables and duality 46:29
Lecture 29: Duality (cont'd) 48:11
Lecture 30: Duality theorems  41:04
Lecture 31: Example and economical interpretation 43:30
Lecture 32: Dual simplex method 37:27
Lecture 33: Sensitivity analysis 49:55
Lecture 34: Range analysis and parametric costs 52:41
Lecture 35: Parametric right hand sides and decomposition 50:28
Lecture 36: Decomposition (cont'd) 47:04
Lecture 37: Decomposition (cont'd) 46:50
Lecture 38: Introduction to minimum cost network flow problems 49:29
Lecture 39: Minimum cost network flows (cont'd) 50:00
Lecture 40: Minimum cost network flows (cont'd) 48:37
Lecture 41: Network simplex method for lower and upper bounded minimum cost network flow problems 1:06:38