Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Siddharth Tiwary"'
Autor:
Siddharth Tiwary, Rainer Dick
Publikováno v:
European Physical Journal C: Particles and Fields, Vol 81, Iss 12, Pp 1-6 (2021)
Abstract Antisymmetric tensor fields are a compelling prediction of string theory. This makes them an interesting target for particle physics because antisymmetric tensors may couple to electromagnetic dipole moments, thus opening a possible discover
Externí odkaz:
https://doaj.org/article/d16cd785d4bf45f4a2ca6eeb1321f0d1
Autor:
Siddharth Tiwary, Naveen Kumar
Publikováno v:
Physical Review Research, Vol 3, Iss 4, p 043190 (2021)
We present results on the evolution of jets (electrons-positrons and photons) formed in colliding two ultraintense laser pulses with varying frequencies and amplitudes. We focus on the nonlinear dynamics of the seeded electrons in the superposition o
Externí odkaz:
https://doaj.org/article/e646b172ff34404b99a7a3d42932346f
Autor:
Naveen Kumar, Siddharth Tiwary
Publikováno v:
Physical Review Research
We present results on the evolution of jets (electrons-positrons and photons) formed in colliding two ultraintense laser pulses with varying frequencies and amplitudes. We focus on the nonlinear dynamics of the seeded electrons in the superposition o
Autor:
Siddharth Tiwary
Publikováno v:
European Journal of Physics. 41:025101
While undergraduate texts describe the change, ΔS in entropies, from time t = 0 to , they do not speak about exactly how, , the change in entropy up to time t, looks. Here, a 'derivation' of the continuous version of Shannon entropy (for position),
Publikováno v:
Runtime Verification ISBN: 9783642298592
RV
RV
Futures are a program abstraction that express a simple form of fork-join parallelism. The expression future (e) declares that e can be evaluated concurrently with the future 's continuation. Safe -futures provide additional deterministic guarantees,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1669160e827a44d60b7fb854269b8f48
https://doi.org/10.1007/978-3-642-29860-8_6
https://doi.org/10.1007/978-3-642-29860-8_6
Publikováno v:
GECCO
We consider a formulation of the biobjective soft graph coloring problem so as to simultaneously minimize the number of colors used as well as the number of edges that connect vertices of the same color. We solve this problem using well-known multiob