1,068 research outputs found
Forecasting of Time-Dependent Scour Depth based on Bagging and Boosting Machine Learning Approaches
No full textForecasting the time-dependent scour depth (dst) is very important for the protection of bridge structures. Since scour is the result of a complicated interaction between structure, sediment, and flow velocity, empirical equations cannot guarantee an advanced accuracy, although they would preserve the merit of being straightforward and physically inspiring. In this article, we propose three ensemble machine learning methods to forecast the time-dependent scour depth at piers: extreme gradient boosting regressor (XGBR), random forest regressor (RFR), and extra trees regressor (ETR). These models predict the scour depth at a given time, dst, based on the following main variables: the median grain size, d50, the sediment gradation, σg, the approach flow velocity, U, the approach flow depth y, the pier diameter Dp, and the time t. A total of 555 data points from different studies have been taken for this research work. The results indicate that all the proposed models precisely estimate the time-dependent scour depth. However, the XGBR method performs better than the other methods with R = 0.97, NSE = 0.93, AI = 0.98, and CRMSE = 0.09 at the testing stage. Sensitivity analysis exhibits that the time-dependent scour depth is highly influenced by the time scale
Correction: Kolkiran, A.; Agarwal, G.S. Amplitude Noise Reduction in a Nano-Mechanical Oscillator. Math. Comput. Appl. 2011, 16(1), 290–300
No full textThe authors would like to remove Girish S. Agarwal from the author list of the paper [1]. Aziz Kolkiran will therefore serve as the single author.[...
Identifying, Quantifying, Extracting and Enhancing Implicit Parallelism
No full textThe shift of the microprocessor industry towards multicore architectures has
placed a huge burden on the programmers by requiring explicit parallelization
for performance. Implicit Parallelization is an alternative that could ease the
burden on programmers by parallelizing applications “under the covers” while
maintaining sequential semantics externally. This thesis develops a novel
approach for thinking about parallelism, by casting the problem of
parallelization in terms of instruction criticality. Using this approach,
parallelism in a program region is readily identified when certain conditions
about fetch-criticality are satisfied by the region. The thesis formalizes this
approach by developing a criticality-driven model of task-based
parallelization. The model can accurately predict the parallelism that would be
exposed by potential task choices by capturing a wide set of sources of
parallelism as well as costs to parallelization.
The criticality-driven model enables the development of two key components for
Implicit Parallelization: a task selection policy, and a bottleneck analysis
tool. The task selection policy can partition a single-threaded program into
tasks that will profitably execute concurrently on a multicore architecture in
spite of the costs associated with enforcing data-dependences and with
task-related actions. The bottleneck analysis tool gives feedback to the
programmers about data-dependences that limit parallelism. In particular, there
are several “accidental dependences” that can be easily removed with large
improvements in parallelism. These tools combine into a systematic methodology
for performance tuning in Implicit Parallelization. Finally, armed with the
criticality-driven model, the thesis revisits several architectural design
decisions, and finds several encouraging ways forward to increase the scope of
Implicit Parallelization.not peer reviewedSubmitted by Mayank Agarwal ([email protected]) on 2009-09-11T21:45:52Z
No. of bitstreams: 1
Mayank.Thesis.pdf: 2213453 bytes, checksum: 7a6d436f30952bb5b4a6329ed8edf8bc (MD5)Made available in DSpace on 2009-09-11T21:45:52Z (GMT). No. of bitstreams: 1
Mayank.Thesis.pdf: 2213453 bytes, checksum: 7a6d436f30952bb5b4a6329ed8edf8bc (MD5)
Previous issue date: 2009-05-15unpublishe
Use of transportation relays to improve private fleet management
Get PDFThesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2009.Includes bibliographical references (leaf 53).We explore the use of transportation relays, a somewhat unconventional transportation operations concept, in terms of improving private fleet management. A transportation relay is a shipment that is divided into two legs. With transportation relays, there is more ways to route freight with a private fleet. We use a linear program to find private fleet tours with and without relays for a large retailer. We find that relays increase private fleet use by 17% and reduce total transportation cost by 6%. Inbound relays increase the utilization of private fleet on the inbound lanes while outbound relays shift the private fleet capacity between neighboring DCs. Together, inbound and outbound relays better utilize existing private fleet resources and can be used to justify an investment in a larger private fleet through the purchase of addition tractors and trailers.by John Tsu and Mayank Agarwal.M.Eng.in Logistic
Bijective Proofs of Some <i>n</i>-Color Partition Identities
No full textAbstractUsing a technique of Agarwal and Andrews (1987), bijective proofs of some n-color partition identities discovered recently by the author, are given.</jats:p
DBLP Publications Records and ACM Metadata for SIGWEB Conferences
No full textThe dataset ”DBLP-SIGWEB.zip” is derived from September 17, 2015 snapshot of dblp bibliography database. It contains all publications and authors records (available in dblp data) of 8 ACM SIGWEB conferences (HT, DL, DocEng, WebSci, CIKM, WSDM, UMAP, SIGIR): The dataset also contains the authors, chairs, affiliations and additional metadata information of conferences that are published in ACM digital library.dblp-sigweb.sql file creates 14 tables in mysql. Followings are the list and description of all attributes and tables used in the dataset. Same attributes used in different tables are listed only once.1. Table- papersdblp_key- unique id of each publication in dblp databasecrossref- unique id of each conference in dblp databasedoi- unique doi url to publisher pagepaper_id- unique id of each article in acm digital library (DL)cite_count- number of citations for each article calculated for the papers published in acm DLpages- number of pages for each article in conference proceedingsconf_id- unique id of each conference in acm DLfunding- funding source information of article. NULL- if no funcding source available2. Table- paper_authorsauthor_id- unique id of an author in acm DLaffiliation- affiliation information of author for associated article3. Table- conceptsconcept- concepts in an article- tagged by ACM4. Table- author_tagsauthor_tag- Keywords/tags provided by authors5. cited_bypaper_id- acm DL id of article A to be citedcite_id- unique id of article that has cited article A6. paper_referencesrefer_id- unique id of the articles (published in sigweb conferences) cited in article A.7. Table- conferencesdblp_key- unique id of each conference in dblp databaseyear- year of the conferencepublisher- publisher name of each conference (ACM, Springer, IEEE etc.)title- full name of the conference proceedingdoi- unique doi url to the conference publisher page8. Table- general_chairs, program_chairs, editorsauthor_id- unique id of author (as general chair, program chair or editor of conference conf_id)affiliation- affiliation of author9. authors_affiliation_history, colleaguesauthor_id- unique id of author A in ACM DLposition- index of affiliation- starts from 0affiliation- lists all affiliations of an authorcolleague_id- lists acm IDs of all authors publishing papers in ACM co-authored with A.11. authors_infoauthor_name- full name of author acquired from ACM publisher pageyear_first- year of first article publication in ACMyear_last- year of recent article publication in ACMpub_count- total number of publciations in ACM DLcite_count- total number of citations mentioned in ACM publciationsavg_cite- average number of citation in ACM publications12. affiliations_infoaffiliation- name of the affiliationaffiliation_type- type of affiliatioin (Industry, Academic Institution)city, state, country- geographical location of affiliationlat, lng- geocodes (latitude and longitude) of affiliatio
DBLP Records and Entries for Key Computer Science Conferences
No full textThe dataset ”DBLP-CSR.zip” is derived from September 17, 2015 snapshot of dblp bibliography database. It contains the last 16 years (2000 − 2015) of publications records of 81 Computer Science Research conferences used for a study conducted in our paper Women in Computer Science Research- What is Bibliography Data Telling Us? published in ACM SIGCAS Computers and Society Newsletter, Volume 46, Issue 1, February 2016. Link to the Newsletter Archive: http://dl.acm.org/citation.cfm?id=J198The dataset contains 7 .sql files and a README file providing the description of dataset and attributes. The seven .sql files are primarily named as affiliation_coord.sql, affiliation.sql, author_gender.sql, authors.sql, editor_gender.sql, editor.sql and main.sql.The affiliation_coord.sql, affiliation.sql, authors.sql, editor.sql files create the tables with same name. While main.sql, editor_gender.sql and author_gender.sql create tables with the names general, genedit and genauth old respectively.Followings are the list and description of all attributes used in the dataset. Same attributes used in different tables are listed only once.1. Table- generalk- unique id of each article- primary key in the table.year- the year of publicationconf- abbreviation for conference name (HT for ACM HyperText)crossref- cross reference link to all articles published in a conference in a yearcs, de, se, th- a binary attribute denoting if a conference belongs to these domains (Computer Science, Data Engineering, Software Engineering, Theory)publisher- Name of the conference publisherlink- unique DOI link to the article that re-directs to conference publisher page.2. Table- authorspos- position of author in the paper. 0 denotes first authorname- unique name of author in dblp datasetgender- gender of authors. Hyphen (-) denotes that gender was not determined. Please refer to the paper for more details.prob- probability of a name to be M, F, -.3. Table- editorsk- foreign key for crossref attribute in general tablepos- position of editor in conference. 0 denotes the first editor.4. Table- genauth_old and genedit contain the records of gender information of authors and editors- derived from authors and editors tables.5. Table- affiliation affil- affiliation record of each author publishing in the 81 conferences mentioned above.year- year of publication6. Table- affiliation_coordcountry- country of the author extracted from affiliationcountry_code- code to be used for mapslat, lng- latitude and longitude information of affiliation
Endoilluminator-assisted Descemet membrane endothelial keratoplasty and endoilluminator-assisted pre-Descemet endothelial keratoplasty
No full textSoosan Jacob,1,2 Amar Agarwal,1 Dhivya Ashok Kumar1 1Dr Agarwal’s Eye Hospital and Eye Research Centre, 2Dr Agarwal’s Refractive and Cornea Foundation (DARCF), Chennai, IndiaWe read with great interest the article by Kobayashi et al on the use of endoillumination probe-assisted Descemet membrane endothelial keratoplasty (DMEK) for bullous keratopathy secondary to argon-laser iridotomy.1 We would like to bring to the author’s notice that one of us (SJ) described the use of external endoillumination for DMEK, and the same was published under our names in 2014 as endoilluminator-assisted transcorneal illumination for DMEK,2 with study patients included from January 2013. Read the original article by Kobayashi et al 
R06. Identification of the Cellular Pathways Targeted by Two Antifungal Natural Products Using RNA-Seq Analysis
Get PDFCorresponding author (NCNPR): Ameeta Agarwal, [email protected]://egrove.olemiss.edu/pharm_annual_posters/1005/thumbnail.jp
Computing many faces in arrangements of lines and segments
No full textWe present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previously known ones. pn The main new idea is a simple randomized O(n log n) expected time algorithm for computing root n cells in an arrangement of n lines.A part of this work was done while the first and third authors were visiting Charles University and while the first author was visiting Utrecht University. The first author has been supported by National Science Foundation Grant CCR-93-01259 and an NYI aword. The second author has been supported by Charles University grant No. 351 and Czech Republic Grant GACR 201/93/2167. The third author has been supported by the Netherlands' Organization for Scientific Research (NWO) and partially supported by ESPRIT Basic Research Action No. 7141 (project ALCOM 2:Algorithms and Complexity)
- …
