A revisiting of assessment for learning strategies that best support the learning of all students. Building from the work of Dylan Wiliam and John Hattie. (the appie session)
OpenSplice DDS v5.1 introduces a new set of features that further its applicability to Ultra-Large Scales Systems, Dependable Systems and Resource Constrained Systems. This presentation provides an overview of the new key features included in v5.1
A revisiting of assessment for learning strategies that best support the learning of all students. Building from the work of Dylan Wiliam and John Hattie. (the appie session)
OpenSplice DDS v5.1 introduces a new set of features that further its applicability to Ultra-Large Scales Systems, Dependable Systems and Resource Constrained Systems. This presentation provides an overview of the new key features included in v5.1
A Similarity Measure for Large Color Differencesnmoroney
Hundreds of large color differences, of magnitude 20 DeltaE00, were generated and used in a visual sorting experiment. The process of generating these color differences and two specific experiments are described in detail. The results show that small color difference metrics, such as DeltaE00, do not consistently model the visually sorted differences for large differences. A new similarity measure, based on a cosine similarity between categorical vectors of colors, is described and used to more consistently model large color differences. This similarity metric can be used to better characterize large color errors during reproduction, for image processing operations such as segmentation or as a feature for content retrieval. The new measure can also be applied to visual phenomena, such as categorical perception, in which within category color differences are perceived as smaller than across category differences.
Desktop, Embedded and Mobile Apps with Vortex CaféAngelo Corsaro
In the past few years we have been experiencing an amazing proliferation of mobile and embedded platforms. Contemporary developers are increasingly faced with the challenge of writing applications that can run on desktop, mobile (e.g. Android), and on low-cost embedded platforms (e.g. Raspberry-Pi and Beaglebone). This is causing a rejuvenated interest in the Java platform as the mean to achieve the holy grail of write-once and run-everywhere. With the availability of Java environments supporting almost any kind of device in several different form factors, the missing element to the picture is an effective way of enabling communication between them.
Vortex Café is a pure Java implementation of the OMG Data Distribution Service (DDS) that enables seamless, efficient and timely data sharing across many-core machines, mobile and embedded devices.
This presentation will (1) introduce the main abstractions provided by Vortex Café, (2) provide an overview of its architecture and explain how it exploits Staged Event Driven Architectures to optimize its runtime depending of the target hardware, (3) provide an overview of the typical performance delivered by Vortex Café, and (3) get you started developing distributed Java and Scala applications with Vortex Café.
Efficient Memory-Reference Checks for Real-time JavaAngelo Corsaro
The scoped-memory feature is central to the Real-Time Specifica- tion for Java. It allows greater control over memory management, in particular the deallocation of objects without the use of a garbage collector. To preserve the safety of storage references associated with Java since its inception, the use of scoped memory is con- strained by a set of rules in the specification. While a program’s adherence to the rules can be partially checked at compile-time, un- decidability issues imply that some—perhaps, many—checks may be required at run-time. Poor implementations of those run-time checks could adversely affect overall performance and predictabil- ity, the latter being a founding principle of the specification.
In this paper we present efficient algorithms for managing scoped memories and the checks they impose on programs. Implementa- tions and results published to date require time linear in the depth of scope nesting; our algorithms operate in constant time. We de- scribe our approach and present experiments quantifying the gains in efficiency.
Distributed Systems can be thought of as a collection of computations evolving a distributed state in response to stimuli. These stimuli can be events triggered by certain states or by external entities, such as physical entities like sensors, operators, etc.
The Data Distribution Service (DDS) provides first-class support for representing distributed states as well as asynchronous event distribution. Recently, OpenSplice DDS has added a new feature that simplifies synchronous interactions by means of a Remote Method Invocation (RMI) infrastructure implemented directly over DDS.
In this presentation we will first explain the difference between state, events and commands and how these concepts can be used to structure distributed systems. Then we will show the key idioms for implementing distributed state, events and commands with OpenSplice DDS.
A Similarity Measure for Large Color Differencesnmoroney
Hundreds of large color differences, of magnitude 20 DeltaE00, were generated and used in a visual sorting experiment. The process of generating these color differences and two specific experiments are described in detail. The results show that small color difference metrics, such as DeltaE00, do not consistently model the visually sorted differences for large differences. A new similarity measure, based on a cosine similarity between categorical vectors of colors, is described and used to more consistently model large color differences. This similarity metric can be used to better characterize large color errors during reproduction, for image processing operations such as segmentation or as a feature for content retrieval. The new measure can also be applied to visual phenomena, such as categorical perception, in which within category color differences are perceived as smaller than across category differences.
Desktop, Embedded and Mobile Apps with Vortex CaféAngelo Corsaro
In the past few years we have been experiencing an amazing proliferation of mobile and embedded platforms. Contemporary developers are increasingly faced with the challenge of writing applications that can run on desktop, mobile (e.g. Android), and on low-cost embedded platforms (e.g. Raspberry-Pi and Beaglebone). This is causing a rejuvenated interest in the Java platform as the mean to achieve the holy grail of write-once and run-everywhere. With the availability of Java environments supporting almost any kind of device in several different form factors, the missing element to the picture is an effective way of enabling communication between them.
Vortex Café is a pure Java implementation of the OMG Data Distribution Service (DDS) that enables seamless, efficient and timely data sharing across many-core machines, mobile and embedded devices.
This presentation will (1) introduce the main abstractions provided by Vortex Café, (2) provide an overview of its architecture and explain how it exploits Staged Event Driven Architectures to optimize its runtime depending of the target hardware, (3) provide an overview of the typical performance delivered by Vortex Café, and (3) get you started developing distributed Java and Scala applications with Vortex Café.
Efficient Memory-Reference Checks for Real-time JavaAngelo Corsaro
The scoped-memory feature is central to the Real-Time Specifica- tion for Java. It allows greater control over memory management, in particular the deallocation of objects without the use of a garbage collector. To preserve the safety of storage references associated with Java since its inception, the use of scoped memory is con- strained by a set of rules in the specification. While a program’s adherence to the rules can be partially checked at compile-time, un- decidability issues imply that some—perhaps, many—checks may be required at run-time. Poor implementations of those run-time checks could adversely affect overall performance and predictabil- ity, the latter being a founding principle of the specification.
In this paper we present efficient algorithms for managing scoped memories and the checks they impose on programs. Implementa- tions and results published to date require time linear in the depth of scope nesting; our algorithms operate in constant time. We de- scribe our approach and present experiments quantifying the gains in efficiency.
Distributed Systems can be thought of as a collection of computations evolving a distributed state in response to stimuli. These stimuli can be events triggered by certain states or by external entities, such as physical entities like sensors, operators, etc.
The Data Distribution Service (DDS) provides first-class support for representing distributed states as well as asynchronous event distribution. Recently, OpenSplice DDS has added a new feature that simplifies synchronous interactions by means of a Remote Method Invocation (RMI) infrastructure implemented directly over DDS.
In this presentation we will first explain the difference between state, events and commands and how these concepts can be used to structure distributed systems. Then we will show the key idioms for implementing distributed state, events and commands with OpenSplice DDS.
Welcome to the Program Your Destiny course. In this course, we will be learning the technology of personal transformation, neuroassociative conditioning (NAC) as pioneered by Tony Robbins. NAC is used to deprogram negative neuroassociations that are causing approach avoidance and instead reprogram yourself with positive neuroassociations that lead to being approach automatic. In doing so, you change your destiny, moving towards unlocking the hypersocial self within, the true self free from fear and operating from a place of personal power and love.