We\u27re moving into UNLV\u27s new Science and Engineering Building

Our research group is one of the few select groups that is moving into the new, $113-million UNLV Science and Engineering Building. The building is exclusively dedicated to research, and its four stories contain 200,000 square feet of research laboratories, faculty offices, and auditorium space for research symposia. Located on North Campus just northeast of the Biology Building, the building is anticipated to obtain LEED (Leadership in Energy and Environmental Design) certification

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

Mojave Applied Ecology Notes Summer 2010

Survey of monitoring and management for conservation of rare plants, Roadside restoration techniques in Joshua Tree NP, and an update on renewable energy developments in the Southwestern desert

Inherently workload-balanced clustered microarchitecture

The performance of clustered microarchitectures relies on steering schemes that try to find the best trade-off between workload balance and inter-cluster communication penalties. In previously proposed clustered processors, reducing communication penalties and balancing the workload are opposite targets, since improving one usually implies a detriment in the other. In this paper we propose a new clustered microarchitecture that can minimize communication penalties without compromising workload balance. The key idea is to arrange the clusters in a ring topology in such a way that results of one cluster can be forwarded to the neighbor cluster with a very short latency. In this way, minimizing communication penalties is favored when the producer of a value and its consumer are placed in adjacent clusters, which also favors workload balance. The proposed microarchitecture is shown to outperform a state-of-the-art clustered processor. For instance, for an 8-cluster configuration and just one fully pipelined unidirectional bus, 15% speedup is achieved on average for FP programs.Peer ReviewedPostprint (published version

SAMIE-LSQ: set-associative multiple-instruction entry load/store queue

The load/store queue (LSQ) is one of the most complex parts of contemporary processors. Its latency is critical for the processor performance and it is usually one of the processor hotspots. This paper presents a highly banked, set-associative, multiple-instruction entry LSQ (SAMIE-LSQ,) that achieves high performance with small energy requirements. The SAMIE-LSQ classifies the memory instructions (loads and stores) based on the address to be accessed, and groups those instructions accessing the same cache line in the same entry. Our approach relies on the fact that many in-flight memory instructions access the same cache lines. Each SAMIE-LSQ entry has space for several memory instructions accessing the same cache line. This arrangement has a number of advantages. First, it significantly reduces the address comparison activity needed for memory disambiguation since there are less addresses to be compared. It also reduces the activity in the data TLB, the cache tag and cache data arrays. This is achieved by caching the cache line location and address translation in the corresponding SAMIE-LSQ entry once the access of one of the instructions in an entry is performed, so instructions that share an entry can reuse the translation, avoid the tag check and get the data directly from the concrete cache way without checking the others. Besides, the delay of the proposed scheme is lower than that required by a conventional LSQ. We show that the SAMIE-LSQ saves 82% dynamic energy for the load/store queue, 42% for the LI data cache and 73% for the data TLB, with a negligible impact on performance (0.6%)Peer ReviewedPostprint (published version

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

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