A Formal Semantics for Weak References

A weak reference is a reference to an object that is not followed by the pointer tracer when garbage collection is called. That is, a weak reference cannot prevent the object it references from being garbage collected. Weak references remain a troublesome programming feature largely because there is not an accepted, precise semantics that describes their behavior (in fact, we are not aware of any formalization of their semantics). The trouble is that weak references allow reachable objects to be garbage collected, therefore allowing garbage collection to influence the result of a program. Despite this difficulty, weak references continue to be used in practice for reasons related to efficient storage management, and are included in many popular programming languages (Standard ML, Haskell, OCaml, and Java). We give a formal semantics for a calculus called λweak that includes weak references and is derived from Morrisett, Felleisen, and Harper’s λgc. λgc formalizes the notion of garbage collection by means of a rewrite rule. Such a formalization is required to precisely characterize the semantics of weak references. However, the inclusion of a garbage-collection rewrite-rule in a language with weak references introduces non-deterministic evaluation, even if the parameter-passing mechanism is deterministic (call-by-value in our case). This raises the question of confluence for our rewrite system. We discuss natural restrictions under which our rewrite system is confluent, thus guaranteeing uniqueness of program result. We define conditions that allow other garbage collection algorithms to co-exist with our semantics of weak references. We also introduce a polymorphic type system to prove the absence of erroneous program behavior (i.e., the absence of “stuck evaluation”) and a corresponding type inference algorithm. We prove the type system sound and the inference algorithm sound and complete.

Extending snBench to Support Hierarchical and Configurable Scheduling

It is useful in systems that must support multiple applications with various temporal requirements to allow application-specific policies to manage resources accordingly. However, there is a tension between this goal and the desire to control and police possibly malicious programs. The Java-based Sensor Execution Environment (SXE) in snBench presents a situation where such considerations add value to the system. Multiple applications can be run by multiple users with varied temporal requirements, some Real-Time and others best effort. This paper outlines and documents an implementation of a hierarchical and configurable scheduling system with which different applications can be executed using application-specific scheduling policies. Concurrently the system administrator can define fairness policies between applications that are imposed upon the system. Additionally, to ensure forward progress of system execution in the face of malicious or malformed user programs, an infrastructure for execution using multiple threads is described.

A cycle route planner mobile-app for Dublin city

In a road network, cyclists are the group exposed to the maximum amount of risk. Route choice of a cyclist is often based on level of expertise, perceived or actual road risks, personal decisions, weather conditions and a number of other factors. Consequently, cycling tends to be the only significant travel mode where optimised route choice is not based on least-path or least-time. This paper presents an Android platform based mobile-app for personalised route planning of cyclists in Dublin. The mobile-app, apart from its immediate advantage to the cyclists, acts as the departure point for a number of research projects and aids in establishing some critical calibration values for the cycling network in Dublin. 

Desarrollo de situaciones de aprendizaje en un escenario a distancia incorporando objetos virtuales de aprendizaje

Al introducir las nuevas tecnologías a los escenarios escolares se provocan reacciones (Chevallard, 1992) debido a que altera la armonía del Sistema Didáctico (el cual está compuesto por tres componentes; estudiantes, profesor y el saber). La relación entre los componentes del sistema didáctico se modifican debido a que existe un instrumento mediador que participa transformando las prácticas. Este proceso de integración requiere establecer las condiciones de equilibrio del Sistema Didáctico, al replantear el dominio del conocimiento, al caracterizar la interacción entre los estudiantes y el profesor, al ubicar el papel de la tecnología en el currículo, Laborde, (2001) y desde la perspectiva socioepistemológica, (Cantoral, 2004; Castañeda, 2004) explicar cómo se modifican las prácticas y cómo se construyen nuevos escenarios para el estudio de las matemáticas. Este trabajo de investigación propone describir las prácticas asociadas al estudio de la derivada en un ambiente tecnológico en las que se ponen en juego diversas situaciones interrelacionadas utilizando objetos java. Estos objetos, cuyo escenario natural de aplicación es en la red de Internet, se caracterizan por la disponibilidad de manipulación.

¿Cómo evaluar expresiones matemáticas en el computador?

En este artículo se muestra una forma de programar un evaluador de expresiones matemáticas en JAVA. El programa se construye paso a paso y se explican detalladamente las partes más importantes del mismo. El evaluador consta de dos partes o módulos, el primero se encarga de convertir la expresión digitada a notación postfija que es más sencilla para el computador; el segundo es el que evalúa la expresión que se obtuvo en un valor específico. Para poder comprender y reescribir este programa se necesita tener conocimientos básicos en la programación en JAVA, sin embargo, se explicará el uso de varias primitivas utilizadas y de algunos conceptos básicos de programación.

SOFT – generating highly flexible object code from XML specifications

Many code generation tools exist to aid developers in carrying out common mappings, such as from Object to XML or from Object to relational database. Such generated code tends to possess a high binding between the Object code and the target mapping, making integration into a broader application tedious or even impossible. In this paper we suggest XML technologies and the multiple inheritance capabilities of interface based languages such as Java, offer a means to unify such executable specifications, thus building complete, consistent and useful object models declaratively, without sacrificing component flexibility.

RAGE Architecture for Reusable Serious Gaming Technology Components

For seizing the potential of serious games, the RAGE project - funded by the Horizon-2020 Programme of the European Commission - will make available an interoperable set of advanced technology components (software assets) that support game studios at serious game development. This paper describes the overall software architecture and design conditions that are needed for the easy integration and reuse of such software assets in existing game platforms. Based on the component-based software engineering paradigm the RAGE architecture takes into account the portability of assets to different operating systems, different programming languages and different game engines. It avoids dependencies on external software frameworks and minimizes code that may hinder integration with game engine code. Furthermore it relies on a limited set of standard software patterns and well-established coding practices. The RAGE architecture has been successfully validated by implementing and testing basic software assets in four major programming languages (C#, C++, Java and Typescript/JavaScript, respectively). A demonstrator implementation of asset integration with an existing game engine was created and validated. The presented RAGE architecture paves the way for large scale development and application of cross-engine reusable software assets for enhancing the quality and diversity of serious gaming.

Operational monitoring and forecasting of bathing water quality through exploiting satellite Earth observation and models: The AlgaRisk demonstration service

Coastal zones and shelf-seas are important for tourism, commercial fishing and aquaculture. As a result the importance of good water quality within these regions to support life is recognised worldwide and a number of international directives for monitoring them now exist. This paper describes the AlgaRisk water quality monitoring demonstration service that was developed and operated for the UK Environment Agency in response to the microbiological monitoring needs within the revised European Union Bathing Waters Directive. The AlgaRisk approach used satellite Earth observation to provide a near-real time monitoring of microbiological water quality and a series of nested operational models (atmospheric and hydrodynamic-ecosystem) provided a forecast capability. For the period of the demonstration service (2008–2013) all monitoring and forecast datasets were processed in near-real time on a daily basis and disseminated through a dedicated web portal, with extracted data automatically emailed to agency staff. Near-real time data processing was achieved using a series of supercomputers and an Open Grid approach. The novel web portal and java-based viewer enabled users to visualise and interrogate current and historical data. The system description, the algorithms employed and example results focussing on a case study of an incidence of the harmful algal bloom Karenia mikimotoi are presented. Recommendations and the potential exploitation of web services for future water quality monitoring services are discussed.

The UMIST database for astrochemistry 1999

We report a new version of the UMIST database for astrochemistry. The previous (1995) version has been updated and its format has been revised. The database contains the rate coefficients, temperature ranges and - where available - the temperature dependence of 4113 gas-phase reactions important in astrophysical environments. The data involve 396 species and 12 elements. We have also tabulated permanent electric dipole moments of the neutral species and heats of formation. A new table lists the photo process cross sections (ionisation, dissociation, fragmentation) for a few species for which these quantities have been measured. Data for Deuterium fractionation are given in a separate table. Finally, a new online Java applet for data extraction has been created and its use is explained in detail. The detailed new datafiles and associated software are available on the World Wide Web at http://www.rate99.co.uk.

Systematic Usage of Embedded Modelling Languages in Automated Model Transformation Chains

Annotation of programs using embedded Domain-Specific Languages (embedded DSLs), such as the program annotation facility for the Java programming language, is a well-known practice in computer science. In this paper we argue for and propose a specialized approach for the usage of embedded Domain-Specific Modelling Languages (embedded DSMLs) in Model-Driven Engineering (MDE) processes that in particular supports automated many-step model transformation chains. It can happen that information defined at some point, using an embedded DSML, is not required in the next immediate transformation step, but in a later one. We propose a new approach of model annotation enabling flexible many-step transformation chains. The approach utilizes a combination of embedded DSMLs, trace models and a megamodel. We demonstrate our approach based on an example MDE process and an industrial case study.

Wrapping Legacy Applications into Grid Services: A Case Study of a Three Services Approach

In this paper, the support for legacy application, which is one of the important advantages of Grid computing, is presented. The ability to reuse existing codes/applications in combination with other Web/Internet technologies, such as Java, makes Grid computing a good choice for developers to wrap existing applications behind Intranet or the Internet. The approach developed can be used for migrating legacy applications into Grid Services, which speeds up the popularization of Grid technology. The approach is illustrated using a case study with detailed description of its implementation step by step. Globus Toolkit is utilized to develop the system.

TAZ Expression as a Prognostic Indicator in Colorectal Cancer

The Hippo pathway restricts the activity of transcriptional coactivators TAZ (WWTR1) and YAP. TAZ and YAP are reported to be overexpressed in various cancers, however, their prognostic significance in colorectal cancers remains unstudied. The expression levels of TAZ and YAP, and their downstream transcriptional targets, AXL and CTGF, were extracted from two independent colon cancer patient datasets available in the Gene Expression Omnibus database, totaling 522 patients. We found that mRNA expressions of both TAZ and YAP were positively correlated with those of AXL and CTGF (p<0.05). High level mRNA expression of TAZ, AXL or CTGF significantly correlated with shorter survival. Importantly, patients co-overexpressing all 3 genes had a significantly shorter survival time, and combinatorial expression of these 3 genes was an independent predictor for survival. The downstream target genes for TAZ-AXL-CTGF overexpression were identified by Java application MyStats. Interestingly, genes that are associated with colon cancer progression (ANTXR1, EFEMP2, SULF1, TAGLN, VCAN, ZEB1 and ZEB2) were upregulated in patients co-overexpressing TAZ-AXL-CTGF. This TAZ-AXL-CTGF gene expression signature (GES) was then applied to Connectivity Map to identify small molecules that could potentially be utilized to reverse this GES. Of the top 20 small molecules identified by connectivity map, amiloride (a potassium sparing diuretic,) and tretinoin (all-trans retinoic acid) have shown therapeutic promise in inhibition of colon cancer cell growth. Using MyStats, we found that low level expression of either ANO1 or SQLE were associated with a better prognosis in patients who co-overexpressed TAZ-AXL-CTGF, and that ANO1 was an independent predictor of survival together with TAZ-AXL-CTGF. Finally, we confirmed that TAZ regulates Axl, and plays an important role in clonogenicity and non-adherent growth in vitro and tumor formation in vivo. These data suggest that TAZ could be a therapeutic target for the treatment of colon cancer.

A Generic Reference Software Architecture for Load Balancing over Mirrored Web Servers: NaSr Case Study

With the rapid expansion of the internet and the increasing demand on Web servers, many techniques were developed to overcome the servers' hardware performance limitation. Mirrored Web Servers is one of the techniques used where a number of servers carrying the same "mirrored" set of services are deployed. Client access requests are then distributed over the set of mirrored servers to even up the load. In this paper we present a generic reference software architecture for load balancing over mirrored web servers. The architecture was designed adopting the latest NaSr architectural style [1] and described using the ADLARS [2] architecture description language. With minimal effort, different tailored product architectures can be generated from the reference architecture to serve different network protocols and server operating systems. An example product system is described and a sample Java implementation is presented.

LIBERO:A framework for autonomic management of multiple non-functional concerns

We describe a lightweight prototype framework (LIBERO) designed for experimentation with behavioural skeletons-components implementing a well-known parallelism exploitation pattern and a rule-based autonomic manager taking care of some non-functional feature related to pattern computation. LIBERO supports multiple autonomic managers within the same behavioural skeleton, each taking care of a different non-functional concern. We introduce LIBERO-built on plain Java and JBoss-and discuss how multiple managers may be coordinated to achieve a common goal using a two-phase coordination protocol developed in earlier work. We present experimental results that demonstrate how the prototype may be used to investigate autonomic management of multiple, independent concerns. © 2011 Springer-Verlag Berlin Heidelberg.

Introduction to Wireless Intrusion Detection Systems

The IDS (Intrusion Detection System) is a common means of protecting networked systems from attack or malicious misuse. The development and rollout of an IDS can take many different forms in terms of equipment, protocols, connectivity, cost and automation. This is particularly true of WIDS (Wireless Intrusion Detection Systems) which have many more opportunities and challenges associated with data transmission through an open, shared medium.
The operation of a WIDS is a multistep process from origination of an attack through to human readable evaluation. Attention to the performance of each of the processes in the chain from attack detection to evaluation is imperative if an optimum solution is to be sought. At present, research focuses very much on each discrete aspect of a WIDS with little consideration to the operation of the whole system. Taking a holistic view of the technology shows the interconnectivity and inter-dependence between stages, leading to improvements and novel research areas for investigation.
This chapter will outline the general structure of Wireless Intrusion Detection Systems and briefly describe the functions of each development stage, categorised into the following 6 areas:
• Threat Identification,
• Architecture,
• Data Collection,
• Intrusion Detection,
• Alert Correlation,
• Evaluation.
These topics will be considered in broad terms designed for those new to the area. Focus will be placed on ensuring the readers are aware of the impact of choices made at early stages in WIDS development on future stages.