Fig 2 - uploaded by Alexander Penev
Content may be subject to copyright.
![Refactoring/Obfuscation. The scheme (Figure 2) represents the i th ( [0; ]) i n ∈ element of Figure 1. Lets assume that i M is the source code of the program. The proposed scheme works well for transformation processes such as source code refactoring [16]. If one defines a predicate , P that satisfies the definition of refactoring and apply transformation](profile/Alexander-Penev/publication/274704916/figure/fig3/AS:668578089029649@1536412846526/Refactoring-Obfuscation-The-scheme-Figure-2-represents-the-i-th-0-i-n-element.png)
Refactoring/Obfuscation. The scheme (Figure 2) represents the i th ( [0; ]) i n ∈ element of Figure 1. Lets assume that i M is the source code of the program. The proposed scheme works well for transformation processes such as source code refactoring [16]. If one defines a predicate , P that satisfies the definition of refactoring and apply transformation
Source publication
This paper presents a framework, SolidOpt, which helps the automated and dynamic lifelong optimization of software systems. Usually, optimizations are a virtue of the (optimizing) compilers. We suggest moving out the optimization facilities and making them more accessible even to end-users during the entire program life cycle. In order to achieve b...
Similar publications
We present a new method for generating general object candidates for
cluttered RGB-D scenes. Starting from an over-segmentation of the
image, we build a graph representation and define an object
candidate as a subgraph that has maximal internal similarity as well
as minimal external similarity. These candidates are created by
successively adding se...
The main objective of this paper is to summarize development concerning structural analysis of engineering networks. Indeed structural analysis of these networks allows to understand networks functioning and to indentify strength and weakness of these networks. This paper presents different graph representation, the main structural indicators used...
Citations
... When we changing the model, the visualization algorithm is triggered. The action of the algorithm is as follows: [12], CUDAfy.NET [13], Cloo [14], Bridge.NET [15], Cling [11], etc.). This stage may require additional compilation for the target platform by using its optimizing compilers; 4. Stage "Execute" -the native compiled code is executed, which generates the final image. ...
This article discusses the visualization approach applied to the experimental geometric modeling system F-Rep Designer 2.0. This system uses the Functional Representation (F-Rep) scheme in order to describe the model. In our approach the scene/model, the ray tracing algorithm, the shading model, and all that is necessary for the visualization are compiled into executable code for the selected target platform (CPU, GPGPU, etc.), and the execution of this code generates the final image. This is done through a multistep process, as the changes of the model lead to an optimized process of change in the various intermediate representations wherever possible.
