Filters








145,248 Hits in 7.6 sec

Lifting the Veil: Drawing insights about design teams from a cognitively-inspired computational model

Christopher McComb, Jonathan Cagan, Kenneth Kotovsky
2015 Design Studies  
Novel design methodologies are often evaluated through studies involving human designers, but such studies can incur a high personnel cost.  ...  Simulation results are compared directly to the results from human designers. The CISAT model is also used to identify the most beneficial characteristics in the cognitive study.  ...  A previous version of this paper has also been submitted to the Design Theory and Methodology Conference at ASME IDETC 2015 .  ... 
doi:10.1016/j.destud.2015.06.005 fatcat:ka5nbm3wabei5pte7nga3fab5i

Modeling the impact of changing patient transportation systems on peri-operative process performance in a large hospital: insights from a computer simulation study

Danny Segev, Retsef Levi, Peter F. Dunn, Warren S. Sandberg
2012 Health Care Management Science  
Prior Presentations None Summary Statement A generalized model of patient transport indicated that relatively few transporters and elevators are needed for optimal performance for delivering patients,  ...  Panel a: One elevator and varying the number of transporters from one to ten. Panel b: Two elevators and varying the number of transporters from one to ten.  ...  Additionally, our contribution has value as a case study because of the managerial insight it provided, as will be elucidated in the Discussion.  ... 
doi:10.1007/s10729-012-9191-1 pmid:22350687 fatcat:onnuii6a4bgsng4cf75egthnfm

Organization of the core respiratory network: Insights from optogenetic and modeling studies

Jessica Ausborn, Hidehiko Koizumi, William H. Barnett, Tibin T. John, Ruli Zhang, Yaroslav I. Molkov, Jeffrey C. Smith, Ilya A. Rybak, Joseph Ayers
2018 PLoS Computational Biology  
(B) Confocal fluorescence microscopy images of a subregion within the pre-BötC in a fixed coronal section from the VGAT-tdTomato mouse line, showing VGAT-Cre dependent tdTomato labeling (red) and GABA  ...  We address these issues with a combination of optogenetic experiments and modeling studies.  ...  [47] study and for useful comments and suggestions.  ... 
doi:10.1371/journal.pcbi.1006148 pmid:29698394 pmcid:PMC5940240 fatcat:wvxbiuvk5fhonjhgtif7s6cks4

Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design

Matthias Müller-Hannemann, Alexander Schwartz, Technische Universität Berlin
2021
We present a case study on the design of an implementation of a fundamental combinatorial optimization problem: weighted b-matching.  ...  This study was motivated by the practical need for an efficient b-matching solver as a subroutine in our approach to a mesh refinement problem in computer-aided design (CAD).  ...  The authors wish to thank Donald Miller, Joseph Pekny, and his student Paul Bunch for providing us with an executable of their b-matching code.  ... 
doi:10.14279/depositonce-14578 fatcat:ntoasdgtx5fdjagfcwk5yvg6fa

Algorithms for storytelling

Deept Kumar, Naren Ramakrishnan, Richard F. Helm, Malcolm Potts
2006 Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '06  
We outline an efficient storytelling implementation that embeds the CARTwheels redescription mining algorithm in an A Ã search procedure, using the former to supply next move operators on search branches  ...  Three application case studies are presented: a study of word overlaps in large English dictionaries, exploring connections between gene sets in a bioinformatics data set, and relating publications in  ...  Do the stories discovered by our algorithm shed domain-specific insights?  ... 
doi:10.1145/1150402.1150475 dblp:conf/kdd/KumarRHP06 fatcat:2mmzmwpyonemlf2h5epgol7zza

Algorithms for Storytelling

D. Kumar, N. Ramakrishnan, R.F. Helm, M. Potts
2008 IEEE Transactions on Knowledge and Data Engineering  
We outline an efficient storytelling implementation that embeds the CARTwheels redescription mining algorithm in an A Ã search procedure, using the former to supply next move operators on search branches  ...  Three application case studies are presented: a study of word overlaps in large English dictionaries, exploring connections between gene sets in a bioinformatics data set, and relating publications in  ...  Do the stories discovered by our algorithm shed domain-specific insights?  ... 
doi:10.1109/tkde.2008.32 fatcat:4dxvrm5b4vdcjfljm2wphba42y

Certifying algorithms

R.M. McConnell, K. Mehlhorn, S. Näher, P. Schweitzer
2011 Computer Science Review  
A certifying algorithm is an algorithm that produces, with each output, a certificate or witness (easy-to-verify proof) that the particular output has not been compromised by a bug.  ...  A user of a certifying algorithm inputs x, receives the output y and the certificate w, and then checks, either manually or by use of a program, that w proves that y is a correct output for input x.  ...  However, even a sound proof for the correctness of an algorithm is far from a guarantee that an implementation of it is correct.  ... 
doi:10.1016/j.cosrev.2010.09.009 fatcat:lapencdbozbklferou45leawtm

Neuroscience-inspired online unsupervised learning algorithms [article]

Cengiz Pehlevan, Dmitri B. Chklovskii
2019 arXiv   pre-print
Our approach is based on optimizing principled objective functions containing a term that matches the pairwise similarity of outputs to the similarity of inputs, hence the name - similarity-based.  ...  Gradient-based online optimization of such similarity-based objective functions can be implemented by NNs with biologically plausible local learning rules.  ...  This work was in part supported by a gift from the Intel Corporation.  ... 
arXiv:1908.01867v2 fatcat:6eih5oqttjgvnaycqs5uc2laje

Statistical Physics and Algorithms

Dana Randall, Markus Bläser, Christophe Paul
2020 Symposium on Theoretical Aspects of Computer Science  
The field of randomized algorithms has benefitted greatly from insights from statistical physics. We give examples in two distinct settings.  ...  We briefly describe these two settings to demonstrate how computing and statistical physics together provide powerful insights that apply across multiple domains.  ...  Each configuration σ has energy determined by a Hamiltonian H(σ) and a corresponding weight w(σ) = e −B·H(σ) , where B = 1/T is inverse temperature.  ... 
doi:10.4230/lipics.stacs.2020.1 dblp:conf/stacs/Randall20 fatcat:kpwoi2oafng6vecu5tereuzg3u

Scaling algorithms for network problems

Harold N. Garbow
1985 Journal of computer and system sciences (Print)  
A scaling algorithm for maximum weight matching on a bipartite graph runs in O(n3% log N) time.  ...  Scaling gives a simple maximum value flow algorithm that matches the best known bound (Sleator and Tarjan's algorithm) when log N = O(log n).  ...  Robert Tarjan for insightful advice that resulted in new algorithms and better presentation, and Dr. Ann Bateson for many perceptive comments.  ... 
doi:10.1016/0022-0000(85)90039-x fatcat:vzbvscuvtvc5zmmplfgvqergom

Scaling algorithms for network problems

Harold N. Gabow
1983 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)  
A scaling algorithm for maximum weight matching on a bipartite graph runs in O(n3% log N) time.  ...  Scaling gives a simple maximum value flow algorithm that matches the best known bound (Sleator and Tarjan's algorithm) when log N = O(log n).  ...  Robert Tarjan for insightful advice that resulted in new algorithms and better presentation, and Dr. Ann Bateson for many perceptive comments.  ... 
doi:10.1109/sfcs.1983.68 dblp:conf/focs/Gabow83 fatcat:tugysfkhs5apbi6bat6zsp6ieq

A distributed-memory approximation algorithm for maximum weight perfect bipartite matching [article]

Ariful Azad, Aydın Buluc, Xiaoye S. Li, Xinliang Wang, Johannes Langguth
2018 arXiv   pre-print
This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known.  ...  We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that  ...  We therefore send a request to the process that owns the matched edge {m j , j}.Algorithm 4 Step B 1: for all processes (c, d): do 2: for all A-requests(mj, mi, w({i, j}) from (a, b) do 3: if {mj, mi}  ... 
arXiv:1801.09809v1 fatcat:cj4xlurazjfwxm6ywdzqrqekhu

Supervised Sentiment Analysis Algorithms

Marianela Denegri Coria, Juan Carlos Morales Arevalo, Jorge Luis Hilario Rivas, Orge Rubén Hilario Cárdenas, Ustina Isabel Prado Juscamaita
2021 Zenodo  
Main focus of this paper is on the recent trends of research and studies for sentiment classification, taking into consideration the accuracy of different algorithmic techniques that can be implemented  ...  Sentiment or opinion analysis based on a domain is done using several algorithms. Machine learning is a concept among this area.  ...  It is found that implementation of supervised algorithms depends on the focus area and type of conclusive opinion needed. A study of accuracy is done on various supervised algorithms.  ... 
doi:10.5281/zenodo.5918329 fatcat:erzup2uccjgxlablunchytnike

A multithreaded algorithm for network alignment via approximate matching

Arif M. Khan, David F. Gleich, Alex Pothen, Mahantesh Halappanavar
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
We investigate substituting a parallel, half-approximation for maximum weight matching instead of an exact computation.  ...  This rounding requires solving a bipartite maximum weight matching problem at each iteration in order to avoid missing high quality solutions.  ...  Let N = (|V A | + |V B |). Currently, the best known algorithm for computing an optimal edge-weighted matching has complexity O(|E L |N + N 2 log N ) [20] .  ... 
doi:10.1109/sc.2012.8 dblp:conf/sc/KhanGPH12 fatcat:besb76g6cfbwlj5ppakwgr45fy

JGraphT – A Java library for graph data structures and algorithms [article]

Dimitrios Michail and Joris Kinable and Barak Naveh and John V Sichi
2020 arXiv   pre-print
A computational study is conducted to evaluate the performance of JGraphT versus a number of similar libraries.  ...  Besides classic graph algorithms such as shortest-paths and spanning-tree algorithms, the library contains numerous advanced algorithms: graph and subgraph isomorphism; matching and flow problems; approximation  ...  Clearly, a project like JGraphT could not exist without contributions from independent contributors.  ... 
arXiv:1904.08355v2 fatcat:vzv6n26i4fcohga7r5ww7exgay
« Previous Showing results 1 — 15 out of 145,248 results