6,798 research outputs found
Experimental design lab data set
No full text<p>Experimental Design Data Lab, Group 1, Sahil Kumar, Fila-04.</p
Techniques & data field training with plants (transects)
No full text<p>Sahil Kumar</p>
<p>Group 1</p>
<p>Continuous </p
Bag-Of-Tasks Scheduling on Related Machines
No full textWe consider online scheduling to minimize weighted completion time on related machines, where each job consists of several tasks that can be concurrently executed. A job gets completed when all its component tasks finish. We obtain an O(K³ log² K)-competitive algorithm in the non-clairvoyant setting, where K denotes the number of distinct machine speeds. The analysis is based on dual-fitting on a precedence-constrained LP relaxation that may be of independent interest
sj-docx-1-pie-10.1177_09544089231158921 - Supplemental material for Evaluating the dynamic characteristics of microwave-casted metal matrix composite material by using experimental modal analysis
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089231158921 for Evaluating the dynamic characteristics of microwave-casted metal matrix composite material by using experimental modal analysis by Sahil Nandwani, Sachit Vardhan, Shashi Bahl, Adarsh Kumar Yadav, Rahul Samyal and Ashok Kumar Bagha in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
Bibliographics for the 983 eprints in the live archives of E-LIS : trends and status report up to 7th July 2004, based on author-self-archiving metadata
No full textThe priority for ideas and philosophy related to "Network Theory" have been traced back and documented by Braun(2004),and credit goes to Karinthy(1929).The IT has empowered to realise it, as the most practical phenomena and it is no more a humour. The OAI (Open Archives Initiatives)and ACIS (Academic Contributor Information System)are progressive in the direction ,which may lead to realise the "Collective Genius" at global level. Focus of present study is on Author-Self-Archiving (A-S-A)Metadata of the 983 Eprints in the Live Archives of the E-LIS (EPrints of Library and Information Science),which were approved till 7th July 2004.The A-S-A Metadata was used for librametric analysis. Self-explanatory bibliographics are illustrated.The highlights include: Conference papers (34%); highest approval, June 2004 (28%); published archives (76%);not refereed (52%); not in public domain (60%); highest self-archiving-author (De Robbio, Antonella).The Nos. of EPrints having single JITA domain specifications were: Theoretical and general aspects of libraries and information(27); Information use and sociology of information(80);Users,literacy and reading(13);Libraries as physical collections(30);Publishing and legal issues(57);Management(13);Industry, profession and education(36);Information sources, supports, channels(113) ; Information treatment for information services, Information functions and techniques (101); Technical services libraries, archives and museums(25); Housing technologies(1); Information technology and library technology(92); and Inter-domainery (395) i.e. having specifications of two or more than two JITA classes
A Unified Shell model for Buoyancy-Driven Turbulence
No full textWe construct a unified shell model for stably stratified and convective turbulence. Shell model simulation of stably stratified flow in turbulent regime exhibit Bolgiano-Obukhbov (BO) scaling in which the kinetic energy spectrum varies as . However, simulation of convective turbulence shows Kolmogorov's spectrum. These results are consistent with the direct numerical simulations of Kumar {\em et al.} [Phys. Rev. E {\bf 90}, 023016 (2014)]. We also observe a dual scaling ( and ) for a limited range of parameters in stably stratified flow
Non-Clairvoyant Precedence Constrained Scheduling
No full textWe consider the online problem of scheduling jobs on identical machines, where jobs have precedence constraints. We are interested in the demanding setting where the jobs sizes are not known up-front, but are revealed only upon completion (the non-clairvoyant setting). Such precedence-constrained scheduling problems routinely arise in map-reduce and large-scale optimization. For minimizing the total weighted completion time, we give a constant-competitive algorithm. And for total weighted flow-time, we give an O(1/epsilon^2)-competitive algorithm under (1+epsilon)-speed augmentation and a natural "no-surprises" assumption on release dates of jobs (which we show is necessary in this context).
Our algorithm proceeds by assigning virtual rates to all waiting jobs, including the ones which are dependent on other uncompleted jobs. We then use these virtual rates to decide on the actual rates of minimal jobs (i.e., jobs which do not have dependencies and hence are eligible to run). Interestingly, the virtual rates are obtained by allocating time in a fair manner, using a Eisenberg-Gale-type convex program (which we can solve optimally using a primal-dual scheme). The optimality condition of this convex program allows us to show dual-fitting proofs more easily, without having to guess and hand-craft the duals. This idea of using fair virtual rates may have broader applicability in scheduling problems
Online Carpooling Using Expander Decompositions
No full textWe consider the online carpooling problem: given n vertices, a sequence of edges arrive over time. When an edge e_t = (u_t, v_t) arrives at time step t, the algorithm must orient the edge either as v_t → u_t or u_t → v_t, with the objective of minimizing the maximum discrepancy of any vertex, i.e., the absolute difference between its in-degree and out-degree. Edges correspond to pairs of persons wanting to ride together, and orienting denotes designating the driver. The discrepancy objective then corresponds to every person driving close to their fair share of rides they participate in.
In this paper, we design efficient algorithms which can maintain polylog(n,T) maximum discrepancy (w.h.p) over any sequence of T arrivals, when the arriving edges are sampled independently and uniformly from any given graph G. This provides the first polylogarithmic bounds for the online (stochastic) carpooling problem. Prior to this work, the best known bounds were O(√{n log n})-discrepancy for any adversarial sequence of arrivals, or O(log log n)-discrepancy bounds for the stochastic arrivals when G is the complete graph.
The technical crux of our paper is in showing that the simple greedy algorithm, which has provably good discrepancy bounds when the arriving edges are drawn uniformly at random from the complete graph, also has polylog discrepancy when G is an expander graph. We then combine this with known expander-decomposition results to design our overall algorithm
Story of the Story-Teller: A Conversation with Ramendra Kumar
No full textRamendra Kumar (Ramen) is an award-winning writer, storyteller and inspirational speaker with 42 books to his name. Ramen’s writings have been published by many of the leading publishers in the county and translated into 30 languages. They have found a place in several textbooks and anthologies. He has written across all genres ranging from picture books to adult fiction, satire, poetry, travelogues, biographies and on issues related to parenting and relationships. He has been invited to literary festivals held in Denmark, Greece, Sharjah, Sri Lanka as well Indian events including the prestigious Jaipur Litfest to conduct storytelling sessions and creative writing workshops. He has also been empanelled by Pearson India Education Services as well as several schools to conduct workshops. He was nominated as a Jury Member for the Best Children’s Author Category of The Times of India’s ‘Women AutHer’ Awards 2020. Many of his stories have been showcased by popular audio streaming, apps both within and outside the country, such as Spotify, Gaatha, Talking Stories Radio – London et al.
An Engineer & an MBA, Ramen was serving as the General Manager (Corporate Communications), SAIL, Rourkela Steel Plant, when he took Voluntary Retirement to pursue his passion, in August 2020. To know more about the writer, you can visit his website www.ramendra.in & his page on Wikipedia. Dr. Sagar Kumar Sharma interviews the author and unfolds the pages of his life.
 
- …
