Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Filters
























5,162 Hits in 6.5 sec

A systematic approach to constructing families of incremental topology control algorithms using graph transformation

Roland Kluge, Michael Stein, Gergely Varró, Andy Schürr, Matthias Hollick, Max Mühlhäuser
2017 Journal of Software and Systems Modeling  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (7.5 MB)
https://web.archive.org/web/20200924033805/https://arxiv.org/pdf/1805.05026v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

2018 pre-print arXiv:1805.05026v1 fatcat:ltkptiej2nahzbjo7ankg3n2ay
Valid and high-quality topologies are characterized using declarative graph constraints; TC algorithms are specified using programmed graph transformation.  ...  Finally, we evaluate a subset of the specified TC algorithms using a new tool integration of the graph transformation tool eMoflon and the Simonstrator network simulation framework.  ...  Acknowledgements The authors would like to thank Lukas Neumann for his contributions to the evaluation study.  ... 
doi:10.1007/s10270-017-0587-8 fatcat:iijpdkjjxrdo3mauh4rgtlcxyy
Multiple Versions
Citation

Roland Kluge, Michael Stein, Gergely Varró, Andy Schürr, Matthias Hollick, Max Mühlhäuser. "A systematic approach to constructing families of incremental topology control algorithms using graph transformation." Journal of Software and Systems Modeling 18.1 (2017)

Introduction to the STAF 2015 special section

Jasmin Blanchette, Francis Bordeleau, Alfonso Pierantonio, Nikolai Kosmatov, Gabriele Taentzer, Manuel Wimmer
2018 Journal of Software and Systems Modeling  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (324.0 kB)
https://web.archive.org/web/20190502140959/https://link.springer.com/content/pdf/10.1007%2Fs10270-018-0686-1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

The fourth contribution A systematic approach to constructing families of incremental topology control algorithms using graph transformation by Roland Kluge, Michael Stein, Gergely Varró, Andy Schürr,  ...  Kluge et al. generalize their previously published constructive approach for topology control algorithms to support the specification of families of such algorithms.  ... 
doi:10.1007/s10270-018-0686-1 fatcat:ilcphfxxyng5dcsksvan6vsiyu
Citation

Jasmin Blanchette, Francis Bordeleau, Alfonso Pierantonio, Nikolai Kosmatov, Gabriele Taentzer, Manuel Wimmer. "Introduction to the STAF 2015 special section." Journal of Software and Systems Modeling 18.1 (2018)

Topology-Driven Generative Completion of Lacunae in Molecular Data [article]

Dmitry Yu. Zubarev, Petar Ristoski
2022 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.3 MB)
https://web.archive.org/web/20220803150908/https://arxiv.org/pdf/2208.00063v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

We introduce an approach to the targeted completion of lacunae in molecular data sets which is driven by topological data analysis, such as Mapper algorithm.  ...  The approach enables addition of links and vertices to the skeletonized representations of the data, such as Mapper graph, and falls in the broad category of network completion methods.  ...  One has to construct a family of Mapper graphs to capture evolution of topological features over multiple scales in the same exhaustive manner as PH does.  ... 
arXiv:2208.00063v1 fatcat:tj5qxodcpzbwzmj43mpvkjduay
Citation

Dmitry Yu. Zubarev, Petar Ristoski. "Topology-Driven Generative Completion of Lacunae in Molecular Data." arXiv (2022)

Parallelizing CAD

Bryan Catanzaro, Kurt Keutzer, Bor-Yiing Su
2008 Proceedings of the 45th annual conference on Design automation - DAC '08  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (424.2 kB)
https://web.archive.org/web/20160827193247/http://catanzaro.name/papers/DAC-2008.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL. The file type is application/pdf.

We believe that an ad hoc approach to parallelizing CAD applications will not lead to satisfactory results: neither in terms of return on engineering investment nor in terms of the computational efficiency  ...  Our initial results indicate that parallel patterns exist in a broad range of CAD problems.  ...  Floorplanning: Graph Algorithms: The sequence pair method [23] transforms the sequence pair into a constraint graph, and then reconstructs the floorplanning topology.  ... 
doi:10.1145/1391469.1391475 dblp:conf/dac/CatanzaroKS08 fatcat:gyirvtvsf5bh3l5l7fevugj4mm
Citation

Bryan Catanzaro, Kurt Keutzer, Bor-Yiing Su. "Parallelizing CAD." Proceedings of the 45th annual conference on Design automation - DAC '08 (2008) 12-17

The Algorithms of Distributed Learning and Distributed Estimation about Intelligent Wireless Sensor Network

Fuxiao Tan
2020 Sensors  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (874.9 kB)
https://web.archive.org/web/20200306072904/https://res.mdpi.com/d_attachment/sensors/sensors-20-01302/article_deploy/sensors-20-01302.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

information to constructs a distributed learning algorithms.  ...  First, based on algebraic graph, three basic theoretical frameworks for distributed learning and distributed parameter estimation of cooperative strategy are surveyed: increment strategy, consensus strategy  ...  Conflicts of Interest: The author declare no conflict of interest.  ... 
doi:10.3390/s20051302 pmid:32121025 pmcid:PMC7085642 fatcat:wthw2dib5beufl5djyev3fdzva
DOAJ
Citation

Fuxiao Tan. "The Algorithms of Distributed Learning and Distributed Estimation about Intelligent Wireless Sensor Network." Sensors 20.5 (2020) 1302

Transforming Graph Representations for Statistical Relational Learning [article]

Ryan A. Rossi, Luke K. McDowell, David W. Aha, Jennifer Neville
2012 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.1 MB)
https://web.archive.org/web/20191022063500/https://arxiv.org/pdf/1204.0033v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

transformation designed to improve the performance of these algorithms.  ...  In this article, we examine a range of representation issues for graph-based relational data.  ...  These algorithms use some model to represent a family of graphs, and present a way to generate multiple samples from this family.  ... 
arXiv:1204.0033v1 fatcat:32zwr7gadfbo5kvsdh57w3gtci
Citation

Ryan A. Rossi, Luke K. McDowell, David W. Aha, Jennifer Neville. "Transforming Graph Representations for Statistical Relational Learning." arXiv (2012)

Transforming Graph Data for Statistical Relational Learning

R. A. Rossi, L. K. McDowell, D. W. Aha, J. Neville
2012 The Journal of Artificial Intelligence Research  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.1 MB)
https://web.archive.org/web/20170502045327/http://www.dtic.mil/dtic/tr/fulltext/u2/a570256.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

In this article, we examine and categorize techniques for transforming graph-based relational data to improve SRL algorithms.  ...  We motivate our taxonomy through detailed examples and use it to survey competing approaches for each of these tasks. We also dis- cuss general conditions for transforming links, nodes, and features.  ...  The majority of this work was completed at the Naval Research Laboratory, where Ryan Rossi was supported by an ASEE/ONR NREIP summer internship in 2010 and by a NSF Graduate Research Fellowship (at Purdue  ... 
doi:10.1613/jair.3659 fatcat:tumtadmqgven3jevn6ywcqiuka
DOAJ Szczepanski
Citation

R. A. Rossi, L. K. McDowell, D. W. Aha, J. Neville. "Transforming Graph Data for Statistical Relational Learning." The Journal of Artificial Intelligence Research (2012) 363-441

Robust Geometric Computation [chapter]

Chee K. Yap, Vikram Sharma
2008 Encyclopedia of Algorithms  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (329.7 kB)
https://web.archive.org/web/20190309001502/http://pdfs.semanticscholar.org/fbc5/a024efb9c1121bc10e6927cf7231ed326feb.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

One basic goal of this field is to provide a systematic transformation of a generic algorithm A into a general algorithm A ′ .  ...  The idea is to use a form of randomized incremental construction. 3. Give a optimal algorithm for the guaranteed precision evaluation problem GVAL(Ω) for, say, Ω = Ω 2 .  ... 
doi:10.1007/978-0-387-30162-4_349 fatcat:h3xf7abcyzdazhvqpwszvkd7ca
Citation

Chee K. Yap, Vikram Sharma. "Robust Geometric Computation." Encyclopedia of Algorithms (2008) 788-790

Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

Nimish Sane, Hojin Kee, Gunasekaran Seetharaman, Shuvra S. Bhattacharyya
2011 Journal of Signal Processing Systems  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (257.2 kB)
https://web.archive.org/web/20170923053910/http://www.dtic.mil/get-tr-doc/pdf?AD=ADA557274

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

We augment the dataflow interchange format (DIF) language -a language for specifying DSP-oriented dataflow graphs -with constructs for supporting topological patterns, and we show how topological patterns  ...  Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it  ...  The material is based upon work funded by the US Air Force Research Laboratory (AFRL-FA87501110049), Laboratory for Telecommunication Sciences, National Radio Astronomy Observatory, US National Science  ... 
doi:10.1007/s11265-011-0610-1 fatcat:zmxakgcs2famfeemsw2q2wrbku
Citation

Nimish Sane, Hojin Kee, Gunasekaran Seetharaman, Shuvra S. Bhattacharyya. "Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs." Journal of Signal Processing Systems 65.2 (2011) 229-244

Motion Planning [chapter]

Lydia E. Kavraki, Steven M. LaValle
2016 Springer Handbook of Robotics  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (2.0 MB)
https://web.archive.org/web/20180205091216/http://www.cs.columbia.edu:80/~allen/S18/motion_planning_springer.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL. The file type is application/pdf.

Sampling-based planners are general techniques applicable to a wide set of problems and have been successful in dealing with hard planning instances.  ...  This chapter first provides a formulation of the geometric path planning problem in Sect. 7.2 and then introduces sampling-based planning in Sect. 7.3.  ...  Rapidly Exploring Dense Trees The important idea with this family of techniques is that the algorithm must incrementally explore the properties of the C-space.  ... 
doi:10.1007/978-3-319-32552-1_7 fatcat:y5ak5kusybghtgh26uroc2f3gm
Citation

Lydia E. Kavraki, Steven M. LaValle. "Motion Planning." Springer Handbook of Robotics (2016) 139-162

Inferring Meaningful Communities from Topology-Constrained Correlation Networks

Jose Sergio Hleap, Christian Blouin, Kay Hamacher
2014 PLoS ONE  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (558.0 kB)
https://web.archive.org/web/20171010113924/http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0113438&type=printable

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

In structured simulation constrained by topology, this novel approach performs better than the optimization of modularity alone.  ...  Here it is shown that topological constraints in correlation graphs induce over-fragmentation of community structures.  ...  Beiko, Conor Mehan, and the members of Dr. Beiko's Lab in Dalhousie University for some helpful suggestions. The members of the Blouin Lab for helpful comments and critical review of this manuscript.  ... 
doi:10.1371/journal.pone.0113438 pmid:25409022 pmcid:PMC4237410 fatcat:odiozztljngz7kt7sjp3smt2ei
DOAJ
Citation

Jose Sergio Hleap, Christian Blouin, Kay Hamacher. "Inferring Meaningful Communities from Topology-Constrained Correlation Networks." PLoS ONE 9.11 (2014) e113438

Exploring multiple radios and multiple channels in wireless mesh networks [Accepted from Open Call

Xiaoyan Hong, Bo Gu, Mohammad Hoque, Lei Tang
2010 IEEE wireless communications  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (246.9 kB)
https://web.archive.org/web/20170706030447/http://hong.cs.ua.edu/papers/2010-wicom-multichannelsurvey-Hong.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

A K-connectivity constrained topology-control-based approach to channel assignment is presented in [17] .  ...  The routing scheme includes a tree construction mechanism similar to call admission control.  ...  BIOGRAPHIES X I A O Y A N H O N G [M] is an associate p rofessor in the Department of Computer Science at the University of Alabama.  ... 
doi:10.1109/mwc.2010.5490982 fatcat:ebcvq4kf2vggtcrsstjqowkihm
Citation

Xiaoyan Hong, Bo Gu, Mohammad Hoque, Lei Tang. "Exploring multiple radios and multiple channels in wireless mesh networks [Accepted from Open Call." IEEE wireless communications 17.3 (2010) 76-85

Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions

Rida T. Farouki, Joel Hass
2007 Journal of Computational and Applied Mathematics  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (647.4 kB)
https://web.archive.org/web/20170924182017/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/19c/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDM3NzA0MjcwNjAwNjkweA%3D%3D.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL. The file type is application/pdf.

A graph isotopic to the envelope curve is constructed by computing its characteristic points. The edges of this graph are in one-to-one correspondence with a set of monotone envelope segments.  ...  Algorithms are developed, based on topological principles, to evaluate the boundary and "internal structure" of the Minkowski sum of two planar curves.  ...  Construct graph G describing topological structure of envelope curve . Using the curve description algorithm, construct a planar graph G that is isotopic to the exact envelope curve for (u) ⊕ (v).  ... 
doi:10.1016/j.cam.2006.11.006 fatcat:xqlpmdnsgzaxpn5qodho3qg33q
Szczepanski
Citation

Rida T. Farouki, Joel Hass. "Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions." Journal of Computational and Applied Mathematics 209.2 (2007) 246-266

INCREMENTAL COMPILATION OF BAYESIAN NETWORKS BASED ON MAXIMAL PRIME SUBGRAPHS

M. JULIA FLORES, JOSE A. GÁMEZ, KRISTIAN G. OLESEN
2011 International Journal of Uncertainty Fuzziness and Knowledge-Based Systems  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (650.0 kB)
https://web.archive.org/web/20190225140706/http://pdfs.semanticscholar.org/6370/cee996c4c55f6a41324887fe75c97e549549.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL. The file type is application/pdf.

When we use the term Incremental Compilation or IC we refer to the possibility of modifying a network and avoiding a complete recompilation to obtain the new (and different) join tree (JT).  ...  But even further, for the task of building a model, which is in many occasions an iterative process, there is a clear lack of flexibility.  ...  The authors are indebted to the anonymous reviewers for their useful comments and suggestions.  ... 
doi:10.1142/s0218488511006952 fatcat:btlzi74lxnhabdovimeapbcts4
Citation

M. JULIA FLORES, JOSE A. GÁMEZ, KRISTIAN G. OLESEN. "INCREMENTAL COMPILATION OF BAYESIAN NETWORKS BASED ON MAXIMAL PRIME SUBGRAPHS." International Journal of Uncertainty Fuzziness and Knowledge-Based Systems 19.02 (2011) 155-191

Building Highly Detailed Synthetic Electric Grid Data Sets for Combined Transmission and Distribution Systems

Hanyue Li, Jessica L. Wert, Adam B. Birchfield, Thomas J. Overbye, Tomas Gomez San Roman, Carlos Mateo Domingo, Fernando Postigo, Pablo Duenas, Tarek Elgindy, Bryan Palmintier
2020 IEEE Open Access Journal of Power and Energy  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (3.2 MB)
https://web.archive.org/web/20201009235253/https://ieeexplore.ieee.org/ielx7/8784343/8891891/09216129.pdf?tp=&arnumber=9216129&isnumber=8891891&ref=

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

Such data sets have important applications, such as in the study of the wide-area interactions of distributed energy resources, in the validation of advanced control schemes, and in network resilience  ...  An example test case, syn-austin-TDgrid-v03, is shown for a 307,236-customer case located in central Texas, with 140 substations, 448 feeders, and electric line data at voltages ranging from 120 V to 230  ...  Reactive Power Planning The approach from [15] is used in this paper to move incrementally from a DC power flow solution at the end of the transmission planning step, to a full AC power flow solution  ... 
doi:10.1109/oajpe.2020.3029278 fatcat:u2kb4mnqnve7vetsodl2ds6uk4
DOAJ
Citation

Hanyue Li, Jessica L. Wert, Adam B. Birchfield, Thomas J. Overbye, Tomas Gomez San Roman, Carlos Mateo Domingo, Fernando Postigo, Pablo Duenas, Tarek Elgindy, Bryan Palmintier. "Building Highly Detailed Synthetic Electric Grid Data Sets for Combined Transmission and Distribution Systems." IEEE Open Access Journal of Power and Energy (2020) 1-1

« Previous Showing results 1 — 15 out of 5,162 results