scholarly journals OwnKit: Ownership Inference for Java

2021 ◽  
Author(s):  
◽  
Constantine Dymnikov
Keyword(s):  
Memory Usage ◽  
Ownership Type ◽  
Single Class ◽  
Strong Notion ◽  
Heavy Burden ◽  
Run Time ◽  
Type Information ◽  
Ownership Patterns

<p>Object ownership allows us to statically control run-time aliasing in order to provide a strong notion of object encapsulation. Unfortunately in order to use ownership, code must first be annotated with extra type information. This imposes a heavy burden on the programmer, and has contributed to the slow adoption of ownership. Ownership inference is the process of reconstructing ownership type information based on the existing ownership patterns in code. This thesis presents OwnKit—an automatic ownership inference tool for Java. OwnKit conducts inference in a modular way: by only considering a single class at the time. The modularity makes our algorithm highly scalable in both time and memory usage.</p>

scholarly journals OwnKit: Ownership Inference for Java

2021 ◽  
Author(s):  
◽  
Constantine Dymnikov
Keyword(s):  
Memory Usage ◽  
Ownership Type ◽  
Single Class ◽  
Strong Notion ◽  
Heavy Burden ◽  
Run Time ◽  
Type Information ◽  
Ownership Patterns

<p>Object ownership allows us to statically control run-time aliasing in order to provide a strong notion of object encapsulation. Unfortunately in order to use ownership, code must first be annotated with extra type information. This imposes a heavy burden on the programmer, and has contributed to the slow adoption of ownership. Ownership inference is the process of reconstructing ownership type information based on the existing ownership patterns in code. This thesis presents OwnKit—an automatic ownership inference tool for Java. OwnKit conducts inference in a modular way: by only considering a single class at the time. The modularity makes our algorithm highly scalable in both time and memory usage.</p>

Type-safe run-time polytypic programming

2006 ◽  
Vol 16 (6) ◽  
pp. 681-710 ◽  
Author(s):  
STEPHANIE WEIRICH
Keyword(s):  
Programming Languages ◽  
Prototype Implementation ◽  
Separate Compilation ◽  
Run Time ◽  
Type Information

Polytypic programming is a way of defining type-indexed operations, such as map, fold and zip, based on type information. Run-time polytypic programming allows that type information to be dynamically computed – this support is essential in modern programming languages that support separate compilation, first-class type abstraction, or polymorphic recursion. However, in previous work we defined run-time polytypic programming with a type-passing semantics. Although it is natural to define polytypic programs as operating over first-class types, such a semantics suffers from a number of drawbacks. This paper describes how to recast that work in a type-erasure semantics, where terms represent type information in a safe manner. The resulting language is simple and easy to implement – we present a prototype implementation of the necessary machinery as a small Haskell library.

scholarly journals Asymptotically optimal minimizers schemes

2018 ◽  
Author(s):  
Guillaume Marçais ◽  
Dan DeBlasio ◽  
Carl Kingsford
Keyword(s):  
Asymptotic Behavior ◽  
Lower Bound ◽  
Efficient Algorithm ◽  
Memory Usage ◽  
Theoretical Understanding ◽  
Asymptotically Optimal ◽  
Bioinformatics Tools ◽  
Bioinformatics Software ◽  
Run Time ◽  
Local Schemes

AbstractMotivationThe minimizers technique is a method to sample k-mers that is used in many bioinformatics software to reduce computation, memory usage and run time. The number of applications using minimizers keeps on growing steadily. Despite its many uses, the theoretical understanding of minimizers is still very limited. In many applications, selecting as few k-mers as possible (i.e. having a low density) is beneficial. The density is highly dependent on the choice of the order on the k-mers. Different applications use different orders, but none of these orders are optimal. A better understanding of minimizers schemes, and the related local and forward schemes, will allow designing schemes with lower density, and thereby making existing and future bioinformatics tools even more efficient.ResultsFrom the analysis of the asymptotic behavior of minimizers, forward and local schemes, we show that the previously believed lower bound on minimizers schemes does not hold, and that schemes with density lower than thought possible actually exist. The proof is constructive and leads to an efficient algorithm to compare k-mers. These orders are the first known orders that are asymptotically optimal. Additionally, we give improved bounds on the density achievable by the 3 type of [email protected]@cs.cmu.edu

scholarly journals Analisa Performa RStudio Server Berbasis Cloud Menggunakan Elastic Stack sebagai Sistem Manajemen Metrik

2021 ◽  
Vol 7 (3) ◽  
pp. 450
Author(s):  
Krisna Aditama Ashari ◽  
Is Mardianto ◽  
Dedy Sugiarto
Keyword(s):  
Memory Usage ◽  
Cpu Usage ◽  
Run Time

Reliabilitas atau keandalan merupakan salah satu sifat penting pada sebuah server dalam melayani pengguna. Salah satu cara mengukurnya ialah dengan melakukan uji perfoma. Penelitian ini bertujuan untuk mengetahui kemampuan RStudio Server pada infrastruktur cloud saat digunakan oleh multiuser dengan Elastic Stack sebagai sistem yang menangani pengumpulan, penyimpanan dan visualisasi data metriknya. Tahapan dimulai dengan mengumpulkan data berupa metrik sistem oleh Metricbeat, lalu diproses Logstash dan disimpan menjadi index dalam Elasticsearch, visualisasi data ditampilkan oleh Kibana. Pengujian kinerja server dilakukan dengan menjalankan script R berdurasi 2 menit dan 7 menit secara simultan. Hasil pengujian berupa catatan CPU Usage, Memory Usage dan durasi penyelesaian script selanjutnya di plotting pada R. Hasil analisa dari plotting data menunjukkan jumlah user yang dapat menggunakan Rstudio Server dengan spesifikasi 2 CPU dan RAM 4GB secara optimal ialah maksimal 2 user pada script dengan run time 2 menit dan 7 menit, lebih dari jumlah user itu akan mempengaruhi waktu proses penyelesaian script menjadi tingkat performa sedang hingga berat.

Run Time Type Information in Mercury

1999 ◽  
pp. 224-243 ◽  
Author(s):  
Tyson Dowd ◽  
Zoltan Somogyi ◽  
Fergus Henderson ◽  
Thomas Conway ◽  
David Jeffery
Keyword(s):  
Run Time ◽  
Type Information ◽  
Time Type

Intensional polymorphism in type-erasure semantics

2002 ◽  
Vol 12 (6) ◽  
pp. 567-600 ◽  
Author(s):  
KARL CRARY ◽  
STEPHANIE WEIRICH ◽  
GREG MORRISETT
Keyword(s):  
Data Structures ◽  
Garbage Collection ◽  
Type System ◽  
Implementation Techniques ◽  
Run Time ◽  
Closure Conversion ◽  
Type Information ◽  
Time Type

Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, polymorphic marshalling and attened data structures. To date, languages that support intensional polymorphism have required a type-passing (as opposed to type-erasure) interpretation where types are constructed and passed to polymorphic functions at run time. Unfortunately, type-passing suffers from a number of drawbacks: it requires duplication of run-time constructs at the term and type levels, it prevents abstraction, and it severely complicates polymorphic closure conversion. We present a type-theoretic framework that supports intensional polymorphism, but avoids many of the disadvantages of type passing. In our approach, run-time type information is represented by ordinary terms. This avoids the duplication problem, allows us to recover abstraction, and avoids complications with closure conversion. In addition, our type system provides another improvement in expressiveness; it allows unknown types to be refined in place, thereby avoiding certain beta-expansions required by other frameworks.

scholarly journals On the Interplay of Ownership Patterns, Biodiversity, and Conservation in Past and Present Temperate Forest Landscapes of Europe and North America

2021 ◽  
Author(s):  
Andreas Mölder ◽  
Malin Tiebel ◽  
Tobias Plieninger
Keyword(s):  
Forest Management ◽  
North America ◽  
Ecosystem Management ◽  
Conservation Management ◽  
Time Shift ◽  
Special Focus ◽  
Ownership Type ◽  
Private Forests ◽  
Biodiversity Patterns ◽  
Ownership Patterns

Abstract Purpose of Review Ownership patterns and the associated management characteristics are related to forest structures, biodiversity patterns, and their conservation worldwide. A literature review on this topic is missing so far. We fill this gap with an emphasis on the temperate forests of Europe and North America. Mixed-ownership landscapes are the special focus of the analysis. In a first step, historical effects of ownership patterns on forest structure and biodiversity are elucidated. Second, connections between present-time forest ownership patterns and both forest structural and biodiversity patterns are analyzed. Finally, implications for integrative conservation management are evaluated with a special focus on mixed-ownership forest landscapes. Recent Findings Close linkages between ownership type-specific forest management and particular forest structural and biodiversity patterns are identified for past and current forest landscapes. Both in Europe and North America, publicly and privately owned forests show comparable lines of historical development but with a time shift. Forest reserves and ancient woodland with long ecological continuity appear to be mainly connected with public ownership. A high diversity of management approaches and cultural landscape habitats is characteristic of non-industrial small private forests. In mixed-ownership landscapes, a more diverse mosaic of habitats has developed than in mono-ownership landscapes. Summary We conclude that cross-boundary ecosystem management is crucial for effective conservation in present-day mixed-ownership landscapes. Integrative forest management that considers biodiversity and social-ecological aspects across ownerships is indispensable. We present a framework of implications for conservation management in mixed-ownership forest landscapes that build on each other and may enhance cross-boundary ecosystem management.

Sign in / Sign up

Export Citation Format

Share Document