CIRCUMSOLAR ENERGETIC PARTICLE DISTRIBUTION ON 2011 NOVEMBER 3
نویسندگان
چکیده
منابع مشابه
project PN - II - ID - PCE - 2011 - 3 - 0045 November 2011 - November 2015
• The members of the research team of this project [Lucian Beznea, Oana Lupaşcu, Gabriela Marinoschi, and Ioan R. Ionescu (Project Coordinator)] started the activity in this project in November 2011 and they worked continuously during the years 2012, 2013, 2014 and 2015. A main step of the research was to find a mathematical framework (the equations for the shallow flow of a visco-plastic fluid...
متن کاملASGO's Second Biennial Meeting, November 3-5 2011
logic Oncology (ASGO) 1st Biennial Meeting Tokyo in 2009, the ASGO 2nd Biennial Meeting was held in the Ritz Carlton Hotel, Seoul from the 3 to 5 November 2011 and again, it was a resounding success. It saw active participation from 15 Asian countries as well as 5 non Asian countries (USA, UK, Canada, Germany, and Eritrea). The total number of registrants was 622 with a total of 226 abstract su...
متن کاملSpaceborne Energetic Particle Instrumentation
The primary thrust of the APL space research program is to develop an understanding of the behavior and ultimate sources of the magnetic and electric fields, plasmas, and energetic particles that permeate the cosmos. We now know, for example, that the solar wind-a fully ionized hydrogen gas moving outward from the sun through the solar system at speeds of many hundreds of kilometers per second-...
متن کاملNotes on Complexity Theory Last updated : November , 2011 Lecture 25
Randomization provides unconditional benefits in many settings; examples include cryptography (where random keys are used to provide protection against an adversary) and distributed computing (where randomness can be used as a means to break symmetry between parties). Randomness also appears to help in algorithm design. But is it possible that, from a complexity-theoretic perspective, randomnes...
متن کاملNotes on Complexity Theory Last updated : November , 2011 Lecture 21
Work on interactive proof systems motivates further exploration of non-interactive proof systems (e.g., the class NP). One specific question is: how many bits of the proof does the verifier need to read? Note that in the usual certificate-based definition of NP, the deterministic “verifier” reads the entire certificate, and correctness and soundness hold with probability 1. If we allow the veri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Astrophysical Journal
سال: 2015
ISSN: 1538-4357
DOI: 10.1088/0004-637x/799/1/55