107 research outputs found
Proyecto plantas medicinales - Universidad del Valle
<p>Proyecto plantas medicinales.</p>
<p>Jorge H. Ramírez</p>
<p>Universidad del Valle</p>
<p>--</p>
<p>Dec 10, 2014.</p>
<p>Co-author added: Atanas Atanasov. University of Vienna. </p>
<p> </p
Академичната рецепция на концепцията на Емил Щайгер в България
My goal is to present the reception of several writings by Emil Staiger in the Bulgarian academic environment. Also – to pose a more general question – do approaches to these writings imply credibility?The publications I discuss are by Rossitza Dimtshewa, Nikola Georgiew, Atanas Natew.
Keywords: Emil Staiger; reception in Bulgaria; reliability; Rossitza Dimcheva; Nikola Georgiev; Atanas Nate
El Sistema Financiero Digital: los nuevos agentes
84 p.Durante las últimas décadas, las nuevas tecnologías han irrumpido prácticamente
en todos los sectores de la actividad económica y uno de los más favorecidos ha
sido el sector financiero. La innovación es constante y la transformación en este
sector no ha hecho más que comenzar. Sin duda, estos cambios presentarán
muchos beneficios, pero, a la vez, muchos retos. El objetivo de este trabajo será
analizarlos y crear una imagen global del sistema que está por venir. Para ello,
nos centramos en analizar cómo están afrontando las entidades clásicas el
cambio. Además, investigamos sobre el origen y la posición de los nuevos agentes
del sector. Finalmente damos paso a explicar los beneficios y retos de las nuevas
tecnologías. Con todo ello, extraemos las principales conclusiones del análisis y
tratamos de proporcionar un concepto holístico de todos los cambios.During the last few decades, new technologies have broken into almost all sectors
of economic activity and one of the most benefited has been the financial sector.
The innovation is constant and the transformation of the industry has only just
begun. Undoubtedly, these changes will have many benefits, but, at the same
time, will bring on many challenges. The purpose of this document will be to
analyze these benefits and challenges and create a global image of the system
that is to come. For this matter, we focus on analyzing how the classic
organizations are facing the change. In addition, we investigate the origin and
competitive position of new agents in the sector. Finally we give way to explain
the benefits and challenges of new technologies. After the whole analysis, we
extract the main conclusions of the investigation and try to provide a holistic
concept the new digital financial system
Practical Points-to Analysis for Programs Built with Libraries
Traditional whole-program analysis cannot be directly applied to programs that include precompiled libraries. Such programs could be analyzed separately from the included libraries by using precomputed summary information about each library. This paper describes one such separate analysis derived from Andersen’s whole program points-to analysis. The analysis uses a summary which is a compact representation of the points-to effects of all statements in the library. The summary is generated by substituting some of the library variables with placeholder variables. By replacing many variables with the same placeholder, we can reduce the size of the summary and the cost of the separate analysis. We use a substitution which summarizes the library effects without losing precision or exposing the internals of the library. Our experiments show that the cost of computing and storing the summary is practical, and that the substitution technique significantly reduces the cost of the separate analysis.Technical report DCS-TR-41
Points-to and Side-effect Analyses for Programs Built with Precompiled Libraries
Large programs are typically built from separate modules. Traditional whole-program analysis cannot be used in the context of such modular development. In this paper we consider analysis for programs that combine client modules with precompiled library modules. We define separate analyses that allow library modules and client modules to be analyzed separately from each other. Our target analyses are Andersen's points-to analysis and a side-effect analysis based on it. We perform separate points-to and side-effect analyses of a library module by using worst-case assumptions about the rest of the program. We also show how to construct summary information about a library module and how to use it for separate analysis of client modules. We present empirical results showing that the separate points-to analyses are practical even for large modules, and that the cost of constructing and storing library summaries is low. Our work is a step toward incorporating practical points-to and side-effect analyses in realistic compilers and software productivity tools.Technical report DCS-TR-42
HER2-Targeted Therapy—From Pathophysiology to Clinical Manifestation: A Narrative Review
Trastuzumab is the primary treatment for all stages of HER2-overexpressing breast cancer in patients. Though discovered over 20 years ago, trastuzumab-induced cardiotoxicity (TIC) remains a research topic in cardio-oncology. This review explores the pathophysiological basis of TIC and its clinical manifestations. Their understanding is paramount for early detection and cardioprotective treatment. Trastuzumab renders cardiomyocytes susceptible by inhibiting the cardioprotective NRG-1/HER2/HER4 signaling pathway. The drug acts on HER2-receptor-expressing cardiomyocytes, endothelium, and cardiac progenitor cells (see the Graphical Abstract). The activation of immune cells, fibroblasts, inflammation, and neurohormonal systems all contribute to the evolution of TIC. A substantial amount of research demonstrates that trastuzumab induces overt and subclinical left ventricular (LV) systolic failure. Data suggest the development of right ventricular damage, LV diastolic dysfunction, and heart failure with preserved ejection fraction. Further research is needed to define a chronological sequence of cardiac impairments to guide the proper timing of cardioprotection implementation
Points-to analysis for Java based on annotated constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. In this paper we present a points-to analysis for Java based on Andersen’s points-to analysis for C [5]. Andersen’s analysis can be implemented efficiently by using systems of set-inclusion constraints and by employing several techniques for constraint representation and resolution. We extend these techniques to efficiently represent and solve systems of annotated inclusion constraints. The annotations play two roles in our analysis. Method annotations are used to model precisely and efficiently the semantics of virtual calls. Field annotations allow us to distinguish between different fields of an object. In addition, our analysis keeps track of all reachable methods and avoids analyzing irrelevant library code. We evaluate the performance of the analysis on a large set of realistic Java programs. Our experiments show that the analysis runs in practical time and space, and has significant impact on call graph construction, virtual call resolution, synchronization removal, stack-based object allocation, and object read-write information. The results show that our analysis is a realistic candidate for a relatively precise, practical, general-purpose points-to analysis for Java.Technical report DCS-TR-42
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers creates serious problems for optimizing compilers and software engineering tools. Pointers enable indirect memory accesses through pointer dereferences, as well as indirect procedure calls (e.g., through function pointers in C). Such indirect accesses and calls can be disambiguated with pointer analysis. In this paper we evaluate the precision of a pointer analysis by Zhang et al. [17] for the purposes of call graph construction for C programs with function pointers. The analysis uses an inexpensive, almost-linear, flow- and context-insensitive algorithm. To measure analysis precision, we compare the call graph computed by the analysis with the most precise call graph obtainable by a large category of pointer analyses. Surprisingly, for all our data programs the analysis from [17] achieves the best possible precision. This result indicates that for the purposes of call graph construction, even inexpensive analyses can provide very good precision, and therefore the use of more expensive analyses may not be justified.Technical report DCS-TR-44
Points-to analysis for Java using annotated inclusion constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. In this paper we define and evaluate a points-to analysis for Java which extends Andersen’s points-to analysis for C [4]. Andersen’s analysis for C can be implemented efficiently by using systems of set-inclusion constraints and by employing several techniques for constraint representation and resolution. We extend these techniques to efficiently represent and solve systems of annotated inclusion constraints. The annotations play two roles in our analysis. Method annotations are used to model precisely and efficiently the semantics of virtual calls. Field annotations allow us to distinguish the flow of values through different fields of an object. In addition, our analysis keeps track of all methods reachable from the entry point of the program, and avoids analyzing dead library code. We evaluate the performance of the analysis on a large set of realistic Java programs. Our results show that the analysis is practical and therefore will be useful as a relatively precise general-purpose points-to analysis for Java. The experiments also show that the points-to solution has significant impact on call graph construction, virtual call resolution, elimination of unnecessary synchronization, and stack-based object allocation.Technical report DCS-TR-41
Parameterized object sensitivity for points-to and side-effect analyses for Java
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. Improving the precision of practical points-to analysis is important because points-to information has a wide variety of client applications in optimizing compilers and software engineering tools. In this paper we present object sensitivity, a new approach to context-sensitive flow insensitive points-to analysis for Java. The key idea of our approach is to analyze a method separately for each of the objects on which this method is invoked. To ensure flexibility and practicality, we propose a parameterization framework which allows analysis designers to control the cost precision tradeoffs of the object-sensitive analysis. Side-effect analysis determines the memory locations that can be modified by the execution of a program statement. This information is needed for various compiler optimizations and software engineering tools. We present a new form of side-effect analysis for Java which is based on object sensitive points-to analysis. We have implemented one instantiation of our parameterized object-sensitive points-to analysis. We compare this instantiation with a context-insensitive points-to analysis for Java which is based on Andersen’s analysis for C [4]. On a set of 23 realistic Java programs, our experiments show that the two analyses have comparable cost. In some cases the object-sensitive analysis is actually faster than the context sensitive analysis. Our results also show that object sensitivity significantly improves the precision of side-effect analysis, call graph construction, and virtual call resolution. Our empirical results demonstrate that object-sensitive analyses are capable of achieving significantly better precision than context-insensitive ones, while at the same time remaining efficient and practical. Thus, object-sensitive analysis is a better candidate for a relatively precise, practical, general-purpose points-to analysis for Java.Technical report DCS-TR-47
- …
