نتایج جستجو برای: data flow graph

تعداد نتایج: 2949094  

2010
Dorit S. Hochbaum

In a generic group decision scenario, the decision makers review alternatives and then provide their own individual ranking. The aggregate ranking problem is to obtain a ranking that is fair and representative of the individual rankings. We argue here that using cardinal pairwise comparisons provides several advantages over score-wise models. The aggregate group ranking problem is then formaliz...

2009
Johannes Kinder Florian Zuleger Helmut Veith

Due to indirect branch instructions, analyses on executables commonly suffer from the problem that a complete control flow graph of the program is not available. Data flow analysis has been proposed before to statically determine branch targets in many cases, yet a generic strategy without assumptions on compiler idioms or debug information is lacking. We have devised an abstract interpretation...

2010
Dorit S. Hochbaum

In a generic group decision scenario, the decision makers review alternatives and then provide their own individual ranking. The aggregate ranking problem is to obtain a ranking that is fair and representative of the individual rankings. We argue here that using cardinal pairwise comparisons provides several advantages over scorewise models. The aggregate group ranking problem is then formalize...

1997
Peter J. Rodgers Robert J. Gaizauskas Kevin Humphreys Hamish Cunningham

We describe GGI, a visual system that allows the user to execute an automatically generated data flow graph containing code modules that perform natural language processing tasks. These code modules operate on text documents. GGI has a suite of text visualisation tools that allows the user useful views of the annotation data that is produced by the modules in the executable graph. GGI forms par...

2000
Bojan Mohar Riste Škrekovski

Let G be a 2-edge-connected graph with o vertices of odd degree. It is well-known that one should (and can) add o 2 edges to G in order to obtain a graph which admits a nowhere-zero 2-flow. We prove that one can add to G a set of ≤ ⌊ o 4⌋, ⌈ 1 2⌊ o 5⌋⌉, and ⌈ 1 2⌊ o 7⌋⌉ edges such that the resulting graph admits a nowhere-zero 3-flow, 4-flow, and 5-flow,

Journal: :IEEE Access 2022

The software engineering community is working to develop reliable metrics improve quality. It estimated that understanding the source code accounts for 60% of maintenance effort. Cognitive informatics important in quantifying degree difficulty or efforts made by developers understand code. Several empirical studies were conducted 2003 assign cognitive weights each possible basic control structu...

2004
Prasanna Desikan Jaideep Srivastava

E-Mail spam detection is a key problem in Cyber Security; and has evoked great interest to the research community. Various classification based and signature based systems have been proposed for filtering spam and detecting viruses that cause spam. However, most of these techniques require content of an email or user profiles, thus involving in high privacy intrusiveness. In this paper, we addr...

2012
Ali Shatnawi

Signal processing applications which are iterative in nature are best represented by data flow graphs (DFG). In these applications, the maximum sampling frequency is dependent on the topology of the DFG, the cyclic dependencies in particular. The determination of the iteration bound, which is the reciprocal of the maximum sampling frequency, is critical in the process of hardware implementation...

Journal: :amirkabir international journal of electrical & electronics engineering 2015
s. azimi h. veisi r. rahmani

industrial-scale r&d it projects depend on many sub-technologies which need to be understood and have their risks analysed before the project can begin for their success. when planning such an industrial-scale project, the list of technologies and the associations of these technologies with each other is often complex and form a network. discovery of this network of technologies is time con...

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Lucja Kot Dexter Kozen

Most standard approaches to the static analysis of programs, such as the popular worklist method, are first-order methods that inductively annotate program points with abstract values. In [6] we introduced a second-order approach based on Kleene algebra. In this approach, the primary objects of interest are not the abstract data values, but the transfer functions that manipulate them. These ele...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید