Filters








4,300 Hits in 1e+01 sec

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees [chapter]

Bernhard Scholz, Johann Blieberger
Lecture Notes in Computer Science  
We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n 2 ) andÕ(m).  ...  The algorithms use a new compact data structure for representing reducible flow graphs called Annotated Decomposition Trees.  ...  Acknowledgement We would like to thank Bernd Burgstaller, Shirley Goldrei, and Wei-ying Ho for their useful comments and for proof-reading the manuscript.  ... 
doi:10.1007/978-3-540-71229-9_14 dblp:conf/cc/ScholzB07 fatcat:bhe2fmwoy5fsxlupx6ugpkn27q

Throughput-oriented kernel porting onto FPGAs

Alexandros Papakonstantinou, Deming Chen, Wen-Mei Hwu, Jason Cong, Yun Liang
2013 Proceedings of the 50th Annual Design Automation Conference on - DAC '13  
The proposed framework enables efficient performance porting without manual code tweaking or annotation by the user.  ...  In this work we propose a code optimization framework which analyzes and restructures CUDA kernels that are optimized for GPU devices in order to facilitate synthesis of high-throughput custom accelerators  ...  Decomposition may also benefit COMP task latency by eliminating data fetch latency through data prefething.  ... 
doi:10.1145/2463209.2488747 dblp:conf/dac/PapakonstantinouCHCL13 fatcat:rvlq5hjbbzaklltsqua26lvjue

A Debugging Scheme for Declarative Equation Based Modeling Languages [chapter]

Peter Bunus, Peter Fritzson
2001 Lecture Notes in Computer Science  
We also present our view of the issues and solutions based on a proposed framework for debugging declarative equation based languages.  ...  Program analysis solutions for program understanding and for static debugging of declarative equation based languages, based on bipartite graph decomposition, are presented in the paper.  ...  Algorithm 3 : 3 Annotation based equation set reduction Input Data: A reduced equation set taken from the output of Algorithm 2 applied on G.  ... 
doi:10.1007/3-540-45587-6_18 fatcat:xsspad35jrdx3im6nbz4gi5veq

VCIP 2020 Index

2020 2020 IEEE International Conference on Visual Communications and Image Processing (VCIP)  
CSCNet: A Shallow Single Column Network fo Crowd Counting Huang, Tiejun Motion Estimation for Spike Camera Data Sequence via Spike Interval Analysis Huang, Tiejun Optical Flow Estimation Between  ...  Wu, Qingbo A New Bounding Box based Pseudo Annotatio Generation Method for Semantic Segmentation Wu, Qingbo Mono is Enough: Instance Segmentation from Single Annotated Sample Wu, Xinju Sparse  ... 
doi:10.1109/vcip49819.2020.9301896 fatcat:bdh7cuvstzgrbaztnahjdp5s5y

Assurance via workflow+ modelling and conformance [article]

Zinovy Diskin, Nicholas Annable, Alan Wassyng, Mark Lawford
2019 arXiv   pre-print
Precise dataflow modelling signifies a crucial distinction of (WP+)-based and GSN-based assurance, in which the data layer is mainly implicit.  ...  These workflows are based on precise data modelling as in functional block diagrams, but their distinctive feature is the presence of relationships between the output data of a process and its input data  ...  ,Process 3b.1 takes a pair (H,PS) consisting of a hazard H and a PS intended to mitigate H, uses this data to conduct a fault tree analysis, and outputs the Real Probability of H occuring with PS in place  ... 
arXiv:1912.09912v1 fatcat:42uwwgh74feoziqemt4uhqkneq

Automatic Generation of Optimized Workflow for Distributed Computations on Large-Scale Matrices [chapter]

Farida Sabry, Abdelkarim Erradi, Mohamed Nassar, Qutaibah M. Malluhi
2014 Lecture Notes in Computer Science  
Efficient evaluation of distributed computation on large-scale data is prominent in modern scientific computation; especially analysis of big data, image processing and data mining applications.  ...  In this paper, we propose a locality-aware workflow-based solution for evaluation of large-scale matrix expressions in a distributed environment.  ...  This publication was made possible by a grant from the Qatar National Research Fund; award number NPRP 09-622-1-090.  ... 
doi:10.1007/978-3-662-45391-9_6 fatcat:emdhhzkfwnh25kw4jm7ww4naj4

Automated techniques for higher-order program verification

Naoki KOBAYASHI, Luke ONG, David Van HORN
2013 Progress in Informatics  
Classical control flow analysis has been recently revisited to yield more precise and/or efficient methods than Shivers' k-CFA.  ...  The aim of the workshop was to bring together researchers on automated techniques for higherorder program verification and analyses, and provide them with an opportunity to exchange new research results  ...  against the base data source.  ... 
doi:10.2201/niipi.2013.10.9 fatcat:xqfyvx6m25d4jcodwl373vlxlq

Scanning the Issue

Azim Eskandarian
2020 IEEE transactions on intelligent transportation systems (Print)  
Multiple targets can be tracked simultaneously within a unified framework without explicit data association between observations and tracking targets.  ...  Initially, points of interest (POIs) are divided by the proposed colored R-tree (RC-tree)-based algorithm into the bounded areas for each station.  ...  Besides, there are three large-scale data sets that annotate both vehicles and license plates, where one is a private data set and the other two are re-annotated from the public data sets.  ... 
doi:10.1109/tits.2020.3015408 fatcat:4yuvdgqw3fd4zp5kj7sjvkxhea

A modular and extensible macroprogramming compiler

Timothy W. Hnat, Tamim I. Sookoor, Pieter Hooimeijer, Westley Weimer, Kamin Whitehouse
2010 Proceedings of the 2010 ICSE Workshop on Software Engineering for Sensor Network Applications - SESENA '10  
Developing of a robust macroprogramming compiler framework poses a unique challenge because users need to create optimized function decompositions, in a modular way, such that they can be composed with  ...  Our results show that the introduction of new decompositions and compiler optimizations can be accomplished with a small number of lines of code and typically written in a matter of hours.  ...  Once a control flow graph is constructed, dependency analysis will be used to eliminate variables that are not part of an actuation.  ... 
doi:10.1145/1809111.1809126 dblp:conf/icse/HnatSHWW10 fatcat:3x2xkxwivjc77a7kpc34jfiua4

Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism

Qi Wang, Meixian Chen, Yu Liu, Zhenjiang Hu
2013 Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing - FHPC '13  
For large scale graphs that have billions of edges or vertices, these problems are hard to be computed directly even using popular data-intensive frameworks like MapReduce or Pregel that are deployed on  ...  In this paper, we propose a novel programming framework which provides a user-friendly programming interface and automatic in-black-box parallelization.  ...  As a tree decomposition of a graph is an instance of the tree data structure, our parallelization approach for graph problems is based on both tree decomposition and tree parallelization.  ... 
doi:10.1145/2502323.2502331 dblp:conf/icfp/WangCLH13 fatcat:3ypmn7swrrho7nplv23xbfgjle

BUSINESS PROCESS MODEL ABSTRACTION BASED ON SYNTHESIS FROM WELL-STRUCTURED BEHAVIORAL PROFILES

SERGEY SMIRNOV, MATTHIAS WEIDLICH, JAN MENDLING
2012 International Journal of Cooperative Information Systems  
Furthermore, we demonstrate that the activities can be grouped according to the data flow of the model in a meaningful way, and that this grouping does not directly coincides with a structural decomposition  ...  flow between them.  ...  The cut results in a new tree. The leaves of this tree become activities of the abstract process model.  ... 
doi:10.1142/s0218843012400035 fatcat:moqjgjotgnfohciq7kw4yik2je

Robust Vehicle Detection and Counting Algorithm Employing a Convolution Neural Network and Optical Flow

Ahmed Gomaa, Moataz M. Abdelwahab, Mohammed Abo-Zahhad, Tsubasa Minematsu, Rin-ichiro Taniguchi
2019 Sensors  
The proposed algorithm detects moving vehicles based on a background subtraction method using CNN.  ...  Then, the vehicle's robust features are refined and clustered by motion feature points analysis using a combined technique between KLT tracker and K-means clustering.  ...  Thus, a new framework for vehicle counting is suggested in this paper based on the collaboration process between collected detection information using convolutional neural networks and tracking information  ... 
doi:10.3390/s19204588 fatcat:nkieplgsbfcjdh24clfdhz5qga

EFFICIENT AND ROBUST PREDICTION ALGORITHMS FOR PROTEIN COMPLEXES USING GOMORY-HU TREES

A. MITROFANOVA, M. FARACH-COLTON, B. MISHRA
2008 Biocomputing 2009  
We model the number of edge-disjoint paths as a network flow and efficiently represent it in a Gomory-Hu tree.  ...  Two-Hybrid (Y2H) Protein-Protein interaction (PPI) data suffer from high False Positive and False Negative rates, thus making searching for protein complexes in PPI networks a challenge.  ...  Our main results are as follows: Algorithmic Results: We devise and implement a novel algorithm based on max-flow and their representations through the classical Gomory-Hu tree data structures.  ... 
doi:10.1142/9789812836939_0021 fatcat:aqvkcnuscfhmjkt7so5vvhjjni

Traceability of Flow Information

Hanbing Li, Isabelle Puaut, Erven Rohou
2014 Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14  
In this paper, we propose a framework to trace and maintain flow information from source code to machine code to benefit from optimizations, yet improving the WCET estimates.  ...  Flow information, should it be produced automatically or be inserted manually from annotations, is typically inserted at source code level.  ...  Acknowledgments The research was funded by W-SEPT 5 , a collaborative research project focusing on identification and traceability of semantic information for worst-case execution time estimation.  ... 
doi:10.1145/2659787.2659805 dblp:conf/rtns/LiPR14 fatcat:h2t3e5lgmnaatlsoqa7sl74zke

Ecological stoichiometry as a foundation for omics-enabled biogeochemical models of soil organic matter decomposition

Emily B. Graham, Kirsten S. Hofmockel
2021 Biogeochemistry  
a consistent framework for interpreting molecular data, and further distilling this information into tractable SOM decomposition models.  ...  State-of-science SOM decomposition models in both fields have advanced largely separately, but they agree on a need to move beyond seminal pool-based models.  ...  This research was supported by the US Department of Energy Office of Biological and Environmental Research (BER) and is a contribution to the Scientific Focus Area 'Phenotypic response of the soil microbiome  ... 
doi:10.1007/s10533-021-00851-2 fatcat:gfyktrsxx5dafjapr2g7pwuj7e
« Previous Showing results 1 — 15 out of 4,300 results