A Conversation with the Honorable Rosalie Silberman Abella and Dean Matthew Diller

DEAN MATTHEW DILLER: This year we are leading up to our celebration of 100 Years of Women at Fordham Law School. In September 1918, the Fordham Law faculty voted to admit women, and we are planning to celebrate that in style. But tonight perhaps is a bit of a teaser for that. Justice Rosalie Silberman Abella is a woman of firsts. She is the first Jewish woman to sit on the bench of the Supreme Court of Canada, and before the Supreme Court, when she was appointed to the Ontario Family Court in 1976, she became the first Jewish woman judge in Canadian history. At that time, she was also the country’s second youngest judge—and I will just say, younger than thirty. Justice Abella has been awarded thirty-eight honorary degrees and was the first sitting judge elected to be a fellow of the Royal Society of Canada, an organization consisting of Canada’s leading scholars. She was also the first incumbent of the James R. Bullock Visiting Chair in Canadian Studies at the Hebrew University and was the first woman to receive the Distinguished Alumnus Award from the University of Toronto Faculty of Law. I could keep going on with the list of awards. She served as a judge of the Giller Literary Prize, Canada’s most prestigious literary award. In 2003, she was awarded the International Justice Prize of the Peter Gruber Foundation and, the following year, the Walter Tarnopolsky Award for Human Rights by the Canadian Bar Association and the International Commission of Jurists. Just two years ago, the Northwestern School of Law honored Justice Abella as its Global Jurist of the Year. This gives you a sense of the accolades, awards, and accomplishments that Justice Abella has both done and received over the course of her career. Her career has been distinguished by an unflagging commitment to human rights, equality, and justice

Low-complexity distributed issue queue

As technology evolves, power density significantly increases and cooling systems become more complex and expensive. The issue logic is one of the processor hotspots and, at the same time, its latency is crucial for the processor performance. We present a low-complexity FP issue logic (MB/spl I.bar/distr) that achieves high performance with small energy requirements. The MB/spl I.bar/distr scheme is based on classifying instructions and dispatching them into a set of queues depending on their data dependences. These instructions are selected for issuing based on an estimation of when their operands will be available, so the conventional wakeup activity is not required. Additionally, the functional units are distributed across the different queues. The energy required by the proposed scheme is substantially lower than that required by a conventional issue design, even if the latter has the ability of waking-up only unready operands. MB/spl I.bar/distr scheme reduces the energy-delay product by 35% and the energy-delay product by 18% with respect to a state-of-the-art approach.Peer ReviewedPostprint (published version

Compact coalgebras, compact quantum groups and the positive antipode

In this article -that has also the intention to survey some known results in the theory of compact quantum groups using methods different from the standard and with a strong algebraic flavor- we consider compact o-coalgebras and Hopf algebras. In the case of a o-Hopf algebra we present a proof of the characterization of the compactness in terms of the existence of a positive definite integral, and use our methods to give an elementary proof of the uniqueness - up to conjugation by an automorphism of Hopf algebras- of the compact involution appearing in [4]. We study the basic properties of the positive square root of the antipode square that is a Hopf algebra automorphism that we call the positive antipode. We use it -as well as the unitary antipode and the Nakayama automorphism- in order to enhance our understanding of the antipode itself

Some constructions of compact quantum groups

The purpose of this paper is to consider some basic constructions in the category of compact quantum groups --for example de case of extensions, of Drinfeld twists, of matched pairs, of extensions, of linked pairs and of cocycle Singer pairs -- with special emphasis in the finite dimensional situation. We give conditions, in some cases necessary and sufficient, to extend to the new objects the original compact structure. We illustrate the results in the case of matched pairs of groups

Modelling probabilistic cache representativeness in the presence of arbitrary access patterns

Measurement-Based Probabilistic Timing Analysis (MBPTA) is a promising powerful industry-friendly method to derive worst-case execution time (WCET) estimates as needed for critical real-time embedded systems. MBPTA performs several (R) runs of the program on the target platform collecting the execution times in each run. MBPTA builds a probabilistic representativeness argument on whether those events with high impact on execution time, such as cache misses, arise on the runs made at analysis time so that their impact on execution time is captured. So far only events occurring in cache memories have been shown to challenge providing such representativeness argument. In this context, this paper introduces a representativeness validation method (RVS) to assess the probabilistic representativeness of MBPTA’s execution time observations in terms of cache behaviour. RVS resorts to cache simulation to predict worst-case miss scenarios that can appear during the deployment phase. RVS also constructs a probabilistic Worst-Case Miss Count curve based on the miss-counts captured in the R runs. If that curve upperbounds the impact of the predicted cache worst-case scenarios, R is deemed as a sufficient number of runs for which pWCET estimates can be reliably derived. Otherwise, the user is requested to perform more runs until all cache scenarios of interest are captured.Peer ReviewedPostprint (author's final draft

Proceso de formación de profesores en el diseño de Ambientes Virtuales de Aprendizaje incluyentes

El Grupo de Investigación en Enseñanza de las Ciencias Experimentales (GREECE) diseñó e implementó un curso en formación inicial para profesores de ciencias de la Universidad Distrital Francisco José de Caldas (UDFJC), haciendo énfasis en el diseño didáctico para la generación y adaptación de objetos virtuales de aprendizaje (OVA) como parte de un ambiente virtual de aprendizaje (AVA) que tiene como finalidad la inclusión de población sorda y población ciega en procesos de enseñanza aprendizaje. Dentro de la ruta metodológica se trabajan diferentes herramientas pensadas en términos de accesibilidad para las necesidades educativas especiales. Los resultados del curso se hacen tangibles con los nuevos cursos creados en la plataforma ATutor por parte de los estudiantes en formación, contando así con material inclusivo en aras de aportar a otros docentes en aulas diversas