Leveraging managed frameworks from modular languages

Managed execution frameworks, such as the.NET Common Language Runtime or the Java Virtual Machine, provide a rich environment for the creation of application programs. These execution environments are ideally suited for languages that depend on type-safety and the declarative control of feature access. Furthermore, such frameworks typically provide a rich collection of library primitives specialized for almost every domain of application programming. Thus, when a new language is implemented on one of these frameworks it becomes necessary to provide some kind of mapping from the new language to the libraries of the framework. The design of such mappings is challenging since the type-system of the new language may not span the domain exposed in the library application programming interfaces (APIs). The nature of these design considerations was clarified in the implementation of the Gardens Point Component Pascal (gpcp) compiler. In this paper we describe the issues, and the solutions that we settled on in this case. The problems that were solved have a wider applicability than just our example, since they arise whenever any similar language is hosted in such an environment.

Avoiding full extension field arithmetic in pairing computations

The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of operations in Fpk dominates the complexity of the operations that occur in the lower degree subfields. Consequently, full extension field operations have the greatest effect on the runtime of Miller’s algorithm. Many recent optimizations in the literature have focussed on improving the overall operation count by presenting new explicit formulas that reduce the number of subfield operations encountered throughout an iteration of Miller’s algorithm. Unfortunately, almost all of these improvements tend to suffer for larger embedding degrees where the expensive extension field operations far outweigh the operations in the smaller subfields. In this paper, we propose a new way of carrying out Miller’s algorithm that involves new explicit formulas which reduce the number of full extension field operations that occur in an iteration of the Miller loop, resulting in significant speed ups in most practical situations of between 5 and 30 percent.

Modular transactional memory

Software transactional memory has the potential to greatly simplify development of concurrent software, by supporting safe composition of concurrent shared-state abstractions. However, STM semantics are defined in terms of low-level reads and writes on individual memory locations, so implementations are unable to take advantage of the properties of user-defined abstractions. Consequently, the performance of transactions over some structures can be disappointing. ----- ----- We present Modular Transactional Memory, our framework which allows programmers to extend STM with concurrency control algorithms tailored to the data structures they use in concurrent programs. We describe our implementation in Concurrent Haskell, and two example structures: a finite map which allows concurrent transactions to operate on disjoint sets of keys, and a non-deterministic channel which supports concurrent sources and sinks. ----- ----- Our approach is based on previous work by others on boosted and open-nested transactions, with one significant development: transactions are given types which denote the concurrency control algorithms they employ. Typed transactions offer a higher level of assurance for programmers reusing transactional code, and allow more flexible abstract concurrency control.

Realisation of ternary sigma-delta modulated arithmetic processing modules

Sigma-delta modulated systems have a number of very appealing properties and are, therefore, heavily used in analog to digital converters, amplifiers, and modulators. This paper presents new results which indicate that they may also have significant potential for general purpose arithmetic processing.

Effect of modular neck variation on bone and cement mantle mechanics around a total hip arthroplasty stem

Background Total hip arthroplasty carried out using cemented modular-neck implants provides the surgeon with greater intra-operative flexibility and allows more controlled stem positioning. Methods In this study, finite element models of a whole femur implanted with either the Exeter or with a new cemented modular-neck total hip arthroplasty (separate, neck and stem components) were developed. The changes in bone and cement mantle stress/strain were assessed for varying amounts of neck offset and version angle for the modular-neck device for two simulated physiological load cases: walking and stair climbing. Since the Exeter is the gold standard for polished cemented total hip arthroplasty stem design, bone and cement mantle stresses/strains in the modular-neck finite element models were compared with finite element results for the Exeter. Findings For the two physiological load cases, stresses and strains in the bone and cement mantle were similar for all modular-neck geometries. These results were comparable to the bone and cement mechanics surrounding the Exeter. These findings suggest that the Exeter and the modular neck device distribute stress to the surrounding bone and cement in a similar manner. Interpretation It is anticipated that the modular-neck device will have a similar short-term clinical performance to that of the Exeter, with the additional advantages of increased modularity.

Efficient modular exponentiation-based puzzles for denial-of-service protection

Client puzzles are moderately-hard cryptographic problems neither easy nor impossible to solve that can be used as a counter-measure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such as non-parallelisability, deterministic solving time, and linear granularity. We propose an efficient client puzzle based on modular exponentiation. Our puzzle requires only a few modular multiplications for puzzle generation and verification. For a server under denial of service attack, this is a significant improvement as the best known non-parallelisable puzzle proposed by Karame and Capkun (ESORICS 2010) requires at least 2k-bit modular exponentiation, where k is a security parameter. We show that our puzzle satisfies the unforgeability and difficulty properties defined by Chen et al. (Asiacrypt 2009). We present experimental results which show that, for 1024-bit moduli, our proposed puzzle can be up to 30 times faster to verify than the Karame-Capkun puzzle and 99 times faster than the Rivest et al.'s time-lock puzzle.

High-voltage modular power supply using parallel and series configurations of flyback converter for pulsed power applications

To cover wide range of pulsed power applications, this paper proposes a modularity concept to improve the performance and flexibility of the pulsed power supply. The proposed scheme utilizes the advantage of parallel and series configurations of flyback modules in obtaining high-voltage levels with fast rise time (dv/dt). Prototypes were implemented using 600-V insulated-gate bipolar transistor (IGBT) switches to generate up to 4-kV output pulses with 1-kHz repetition rate for experimentation. To assess the proposed modular approach for higher number of the modules, prototypes were implemented using 1700-V IGBTs switches, based on ten-series modules, and tested up to 20 kV. Conducted experimental results verified the effectiveness of the proposed method

MODAM: A MODular Agent-based Modelling framework

Designing the smart grid requires combining varied models. As their number increases, so does the complexity of the software. Having a well thought architecture for the software then becomes crucial. This paper presents MODAM, a framework designed to combine agent-based models in a flexible and extensible manner, using well known software engineering design solutions (OSGi specification [1] and Eclipse plugins [2]). Details on how to build a modular agent-based model for the smart grid are given in this paper, illustrated by an example for a small network.

Beyond the modular film school : Australian film and television schools and their digital transitions

In this chapter we will describe the contemporary variety of practice-oriented training institutions in Australia. We will examine the different ways in which public and private providers are managing the challenges of digitization and convergence. We will consider the logics governing film education this mix of providers pulls into focus, and we will outline some of the challenges providers face in educating, (re)training, and preparing their graduates for life and work beyond the film school. These challenges highlight questions about the accountabilities and responsibilities of practice-oriented film education institutions. This chapter begins with an introductory section that outlines these logics and questions. It explores some of the tensions and dynamics within the spectrum of issues through which we can understand film schools. The chapter then goes on briefly to describe the multifaceted training landscape in Australia, before profiling the leading public provider, the Australian Film, Television and Radio School (AFTRS), as well as the other leading public providers the Victorian College of the Arts, and the Griffith Film School. It concludes with a short section on film education in primary and secondary schools as the education sector prepares for the implementation of a national curriculum in which ‘media arts’ has a new centrality.

Telling bodies, mapping knowledge : recontextualising the dancer’s corporeality using a modular choreographic model

Creative Development: The Body and Light. Within the current cultural climate, the independent choreographer struggles to pursue and establish their artistic career outside the infrastructure of mainstream dance companies. The independent choreographer is challenged to articulate alternative choreographic models without the support of that infrastructure. My research examines that challenge by exploring my own independent choreographic practice through a number of performance-based dance projects. This exploration will be underpinned by theoretical research to enable clarification of the tacit understandings of an embodied practice and the point of intersection between practice and theory so as to articulate alternative choreographic models. As a starting point for that enquiry, an example is provided of how questions that emerge from within the choreographic practice can be discussed in terms of research through an initial investigation exploring light in relation to the moving body and the implications of atmospheres.

Macromolecular engineering via RAFT chemistry : from sequential to modular design

Sequential Design Molecular Weight Range Functional Monomers: Possibilities, Limits, and Challenges Block Copolymers: Combinations, Block Lengths, and Purities Modular Design End-Group Chemistry Ligation Protocols Conclusions