3,132 research outputs found
sj-docx-1-gut-10.1177_26345161231188677 – Supplemental material for Survival Trends and Profiling of Gastric Mixed Adenoneuroendocrine Carcinoma (gMANEC) in the Current Era
No full textSupplemental material, sj-docx-1-gut-10.1177_26345161231188677 for Survival Trends and Profiling of Gastric Mixed Adenoneuroendocrine Carcinoma (gMANEC) in the Current Era by Shreya Gupta, James D. McDonald, Alexander J. Rossi, Jonathan M. Hernandez, Jeremy L. Davis and Andrew M. Blakely in Foregut</p
sj-pptx-2-gut-10.1177_26345161231188677 – Supplemental material for Survival Trends and Profiling of Gastric Mixed Adenoneuroendocrine Carcinoma (gMANEC) in the Current Era
No full textSupplemental material, sj-pptx-2-gut-10.1177_26345161231188677 for Survival Trends and Profiling of Gastric Mixed Adenoneuroendocrine Carcinoma (gMANEC) in the Current Era by Shreya Gupta, James D. McDonald, Alexander J. Rossi, Jonathan M. Hernandez, Jeremy L. Davis and Andrew M. Blakely in Foregut</p
The Computational Complexity of Factored Graphs
No full textWhile graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct representation. An efficient algorithm (with respect to the compressed input size) could then lead to more efficient computations than algorithms taking the explicit, uncompressed object as input. This leads to a natural question: when does knowing the input instance has a more succinct representation make computation easier?
We initiate the study of the computational complexity of problems on factored graphs: graphs that are given as a formula of products and unions on smaller graphs. For any graph problem, we define a parameterized version that takes factored graphs as input, parameterized by the number of (smaller) ordinary graphs used to construct the factored graph. In this setting, we characterize the parameterized complexity of several natural graph problems, exhibiting a variety of complexities. We show that a decision version of lexicographically first maximal independent set is XP-complete, and therefore unconditionally not fixed-parameter tractable (FPT). On the other hand, we show that clique counting is FPT. Finally, we show that reachability is XNL-complete. Moreover, XNL is contained in FPT if and only if NL is contained in some fixed polynomial time
Data for Gupta et al., "Estimating the Meridional Extent of Adiabatic Mixing in the Stratosphere using Age-of-Air", JGR:Atmospheres,
No full textModel data and post-processed data supporting the creation of the manuscript "Estimating the Meridional Extent of Adiabatic Mixing in the Stratosphere using Age-of-Air" submitted to JGR:Atmospheres in August 2022.
1) The netCDF files created through post-processing of full model data in FORTRAN are shared in the /data/ directory. These file contains the zonal mean circulation statistics based on Gupta et al. (2020), age-of-air transport diagnostics based on Linz et al. (2021), and the novel \Gamma-\Theta circulation streamfunction introduced in this study. The /data/ directory also contains MATLAB .mat data files for the transport diagnostics obtained from WACCM. 150 days of actual GFDL-FV3 model data in the northern hemisphere, between 0.1 hPa-500 hPa pressure levels is also provided to support external computations and validation.
2) The Jupyter notebook used for final computation and figures production is provided in .ipynb, .html and .pdf formats in /code/. All the files referred to in the notebook are stored in the /data/ directory.
Corresponding author : Aman Gupta, [email protected], [email protected], [email protected]
Corrigendum: Capital Inflows and House Prices: Aggregate and Regional Evidence from China
No full textIn the paper ‘Capital Inflows and House Prices: Aggregate and Regional Evidence from China’ by H. An, et al., printed in the December 2016 issue, there was a missing acknowledgement section for funding resources.
On page 451, the acknowledgement section should appear after the corresponding information as:
“Correspondence: Rakesh Gupta, Department of Accounting, Finance and Economics, Griffith Business School, Griffith University, Nathan Campus QLD 4111. [email protected]
*This work was financially supported by the Humanities and Social Science Foundation of Ministry of Education of China (16YJA790001).”
The author apologises for this error and any confusion it may have caused.No Full Tex
First person – Akash Gupta
No full textFirst Person is a series of interviews with the first authors of a selection of papers published in Biology Open, helping early-career researchers promote themselves alongside their papers. Akash Gupta is first author on ‘A novel and cost-effective ex vivo orthotopic model for the study of human breast cancer in mouse mammary gland organ culture’, published in BiO. Akash conducted the research described in this article while a PhD Scholar in Rajendra Mehta's lab at IIT Research Institute, Chicago, USA. He is now an assistant research scientist in the lab of Syreeta L. Tilghman at the University of Arizona, Department of Medicine, Tucson, USA, investigating drug efficacy modeling using human organoids culture for the treatment of cancers
Engineering materials : research, applications and advances / author, K.M. Gupta.
No full text"A CRC title."Includes bibliographical references and index.596 p.
Universal Statistical Properties of Inertial-particle Trajectories in Three-dimensional, Homogeneous, Isotropic, Fluid Turbulence
No full textWe obtain new universal statistical properties of heavy-particle trajectories in three-dimensional, statistically steady, homogeneous, and isotropic turbulent flows by direct numerical simulations. We show that the probability distribution functions (PDFs) P(Φ), of the angle Φ between the Eulerian velocity u and the particle velocity v, at a point and time, scales as P(Φ) ∼Φ−, with a new universal exponent ≃ 4
- …
