603 Hits in 3.5 sec

Phase transition in the link weight structure of networks

Piet Van Mieghem, Serena M. Magdalena
2005 Physical Review E  
For connected Erdös-Rényi random graphs G p ͑N͒ and square lattices, we have characterised the phase transition and found that ␣ c Ӎ bN −␤ with ␤ G p ͑N͒ Ϸ 0.63 and ␤ lattice Ϸ 0.62.  ...  If the extreme value index of the link weight distribution ␣ Ͼ ␣ c , transport in the network traverses many links whereas for ␣ Ͻ ␣ c , all transport flows over a critical backbone consisting of N − 1  ...  For ␣ Ͻ ␣ c , most graphs G ഫ spt͑␣͒ are trees with high probability while for ␣ Ͼ ␣ c hardly any graph G ഫ spt͑␣͒ is a tree.  ... 
doi:10.1103/physreve.72.056138 pmid:16383719 fatcat:7dwhppq4ovhvfezvuptm7ultf4

Impact of Mobility on Last Encounter Routing Protocols

Fan Bai, Ahmed Helmy
2007 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
FRESH protocols can be used for resource discovery, routing or node location, and hold great promise for future wireless networks.  ...  To expose the fundamental reason behind these observations, we develop analytical models to analyze FRESH's performance and validate these models via extensive simulations.  ...  Thus, the path obtained is optimal (i.e., closer to the SPT path) at the expense of large search costs.  ... 
doi:10.1109/sahcn.2007.4292858 dblp:conf/secon/BaiH07 fatcat:hwvq6k6grzabrpmlceu6gtivc4

Model Distillation for Revenue Optimization: Interpretable Personalized Pricing [article]

Max Biggs, Wei Sun, Markus Ettl
2021 arXiv   pre-print
It is desirable for this pricing policy to be simple and interpretable, so it can be verified, checked for fairness, and easily implemented.  ...  We present a customized, prescriptive tree-based algorithm that distills knowledge from a complex black-box machine learning algorithm, segments customers with similar valuations and prescribes prices  ...  Due to the lack of open-source code for Kallus Table 1 : 1 Revenue comparison on synthetic datasets Mean revenue Maximum revenue Minimum revenue Data Optimal PT SPT CT PT SPT CT PT SPT CT 1  ... 
arXiv:2007.01903v2 fatcat:2sohdh552zfntpsq7wmjfndoue

Context-Aware Parse Trees [article]

Fangke Ye, Shengtian Zhou, Anand Venkat, Ryan Marcus, Paul Petersen, Jesmin Jahan Tithi, Tim Mattson, Tim Kraska, Pradeep Dubey, Vivek Sarkar, Justin Gottschlich
2020 arXiv   pre-print
We analyze these nuances and present a new tree structure, heavily influenced by Aroma's SPT, called a context-aware parse tree (CAPT).  ...  The simplified parse tree (SPT) presented in Aroma, a state-of-the-art code recommendation system, is a tree-structured representation used to infer code semantics by capturing program structure rather  ...  We believe that analytically deriving the optimal selection of node annotations across all C/C++ code may be untenable.  ... 
arXiv:2003.11118v1 fatcat:5l2nzt5gkzfgdj3rladwnbef3u

A scalable correlation aware aggregation strategy for wireless sensor networks

Yujie Zhu, Ramanuja Vedantham, Seung-Jong Park, Raghupathy Sivakumar
2008 Information Fusion  
In this paper, we first identify that most of the existing upstream routing approaches in WSNs can be translated to a correlation-unaware data aggregation structure -the shortest-path tree.  ...  Although by using a shortest-path tree, some implicit benefits due to correlation are possible, we show that explicitly constructing a correlation-aware structure can result in considerable performance  ...  Different correlations (0 < q < 1) In the extreme case of q = 1, minimum Steiner tree is the optimal aggregation structure, while for q = 0 (no correlation), SPT is the optimal aggregation structure.  ... 
doi:10.1016/j.inffus.2006.09.002 fatcat:qsntanj5ojbmzebf25ude7h66u

Pru p 9, a new allergen eliciting respiratory symptoms in subjects sensitized to peach tree pollen

Miguel Blanca, Laura Victorio Puche, María Garrido-Arandia, Laura Martin-Pedraza, Alejandro Romero Sahagún, José Damian López-Sánchez, Carmen Galán, Antonio Marin, Mayte Villaba, Araceli Díaz-Perales, Maria Luisa Somoza, Davor Plavec
2020 PLoS ONE  
Peach tree (PT) pollen sensitization is highly prevalent in subjects living in areas where this tree is widely cultivated.  ...  None of the allergens responsible for these sensitizations have been identified so far.  ...  The plate model & default calibration were optimized for the MS-MS spectra processing.  ... 
doi:10.1371/journal.pone.0230010 pmid:32191737 fatcat:te3hjpss3zf3xfb6rfj6u555oe

MISIM: A Neural Code Semantics Similarity System Using the Context-Aware Semantics Structure [article]

Fangke Ye, Shengtian Zhou, Anand Venkat, Ryan Marcus, Nesime Tatbul, Jesmin Jahan Tithi, Niranjan Hasabnis, Paul Petersen, Timothy Mattson, Tim Kraska, Pradeep Dubey, Vivek Sarkar (+1 others)
2021 arXiv   pre-print
Code semantics similarity can be used for many tasks such as code recommendation, automated software defect correction, and clone detection.  ...  code semantics similarity system consisting of two core components: (i)MISIM uses a novel context-aware semantics structure, which was purpose-built to lift semantics from code syntax; (ii)MISIM uses an  ...  We also provided an anecdotal analysis illustrating that there may not be one universally optimal CASS configuration.  ... 
arXiv:2006.05265v6 fatcat:cfwx7yqec5g2jezpa3m5omzdjm

Grid-based calculation for perturbation theory of large-scale structure

Atsushi Taruya, Takahiro Nishimichi, Donghui Jeong
2018 Physical Review D  
In particular, the so-called standard perturbation theory (SPT) provides a basis for the analytical computation of the higher-order quantities of large-scale structure.  ...  Here, we present a novel, grid-based algorithm for the SPT calculation, hence named GridSPT, to generate the higher-order density and velocity fields from a given linear power spectrum.  ...  It is thus important to find an optimal cutoff scale.  ... 
doi:10.1103/physrevd.98.103532 fatcat:64m4ca4l2zgrff6vesynxfveay

Visual analytics of manufacturing simulation data

Niclas Feldkamp, Soren Bergmann, Steffen Strassburger
2015 2015 Winter Simulation Conference (WSC)  
Discrete event simulation is an accepted technology for investigating the dynamic behavior of complex manufacturing systems.  ...  Inspired from the idea of visual analytics, we suggest the application of data farming approaches for obtaining datasets of a much broader spectrum of combinations of input and output data.  ...  Simulation based optimization on the other hand tries to find an optimal solution for some set of output values of the simulation by varying selected input parameters and automatically executing repeated  ... 
doi:10.1109/wsc.2015.7408215 dblp:conf/wsc/FeldkampBS15 fatcat:eqrwc523cnh37oqcjy266fpf4q

When every particle matters: a QuEChERS approach to extract microplastics from environmental samples

Kristina Enders, Robin Lenz, Juliana A. Ivar do Sul, Alexander S. Tagg, Matthias Labrenz
2020 MethodsX  
•Publication of protocols of an entire MP extraction (10 μm - 5 mm) pipeline for particle-based analysis of various environmental matrices•Modularity: Optimised quantitative sample preparation adapted  ...  New procedures and technical innovations for density separation of particle-rich matrices are presented, such as a spiral conveyor developed and validated for MP recovery.  ...  Klaus-Jochen Eichhorn (Leibniz-Institute for Polymer Research), as well as Jakob Strand (Aarhus University) for the helpful advice on the development of the pentane protocol for improved spectroscopic  ... 
doi:10.1016/j.mex.2020.100784 pmid:32071889 pmcid:PMC7016028 fatcat:arqmksushfcalh6krnffsdbteq

The Outer Rim Simulation: A Path to Many-Core Supercomputers [article]

Katrin Heitmann, Hal Finkel, Adrian Pope, Vitali Morozov, Nicholas Frontiere, Salman Habib, Esteban Rangel, Thomas Uram, Danila Korytov, Hillary Child, Samuel Flender, Joe Insley (+1 others)
2019 arXiv   pre-print
The simulation results have been used to generate synthetic catalogs for large-scale structure surveys, including DESI and eBOSS, as well as CMB experiments.  ...  A detailed catalog for the LSST DESC data challenges has been created as well. We publicly release some of the Outer Rim halo catalogs, downsampled particle information, and lightcone data.  ...  We thank Jon Woodring for visualization support.  ... 
arXiv:1904.11970v2 fatcat:v34sgs4xbncxreuve5evy6b42m

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Tobias Rupp, Stefan Funke
2021 Algorithms  
Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by  ...  We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing.  ...  Acknowledgments: We like to thank the OpenStreetMap community for making free geodata available for our experiments. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a14060164 fatcat:cwzbxc7twfdxxh2m22zxihj64q

An overview of design and operational issues of kanban systems

M. S. Akturk, F. Erhun
1999 International Journal of Production Research  
Kanban is the Japanese word for visual record or card. In a kanban system, cards are used to authorize production or transportation of a given amount of material.  ...  The kanban system appears to be best suited for discrete part production feeding an assembly line. Kanban system can be either dual-card or single-card.  ...  An algorithm for determining the optimal number of two kinds of kanbans that minimize an expected average cost per period is devised.  ... 
doi:10.1080/002075499189808 fatcat:qhdfp4nbcvcszow2jysfbqjjva

Designing Dispatching Rules to Minimize Total Tardiness [chapter]

Joc Cing Tay, Nhu Binh Ho
2007 Studies in Computational Intelligence  
In this work, we employ suitable parameter and operator spaces for evolving Composite Dispatching Rules using Genetic Programming, with an aim towards greater scalability and flexibility.  ...  We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming.  ...  For instance, the heuristic rules may use the expertise of human experience, such as inserting an operation of a job into an idle time slot by visual inspection of a schedule [15] .  ... 
doi:10.1007/978-3-540-48584-1_4 fatcat:eztoovvnxnb6zbylcjuv4rid5a

Matter bispectrum of large-scale structure: Three-dimensional comparison between theoretical models and numerical simulations

Andrei Lazanu, Tommaso Giannantonio, Marcel Schmittfull, E. P. S. Shellard
2016 Physical Review D  
Using shape and amplitude correlators, we directly compare simulated data with theoretical models over the full three-dimensional domain of the bispectrum, for different redshifts and scales.  ...  literature that predict the one-loop bispectrum: standard perturbation theory, effective field theory, resummed Lagrangian and renormalised perturbation theory, calculating the latter also at two loops for  ...  tree + B SPT 1-loop + k 2 1 + k 2 2 + k 2 3 12π 2 B SPT tree dp P lin (p) . (38) From Eqs  ... 
doi:10.1103/physrevd.93.083517 fatcat:5qbq7xhkabdiha3hehwlboi5ri
« Previous Showing results 1 — 15 out of 603 results