Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Computer Engineering

A Cost-Benefit Analysis Of A Campus Computing Grid, Preston M. Smith Apr 2011

A Cost-Benefit Analysis Of A Campus Computing Grid, Preston M. Smith

Purdue Polytechnic Masters Theses

Any major research institution has a substantial number of computer systems on its campus, often in the scale of tens of thousands. Given that a large amount of scientific computing is appropriate for execution in an opportunistic environment, a campus grid is an inexpensive way to build a powerful computational resource. What is missing, though, is a model for making an informed decision on the cost-effectives of a campus grid. In this thesis, the author describes a model for measuring the costs and benefits of building a campus computing resource based on the institution’s existing investment in computing hardware.

For …


Development Of Visualization Facility At The Gis And Remote Sensing Core Lab, University Of Nevada, Las Vegas, Haroon Stephen, William J. Smith, Zhongwei Liu Jan 2011

Development Of Visualization Facility At The Gis And Remote Sensing Core Lab, University Of Nevada, Las Vegas, Haroon Stephen, William J. Smith, Zhongwei Liu

Public Policy and Leadership Faculty Presentations

Visualization using advanced computational and graphic equipment has become a standard way of present day research. Availability of low cost and fast processing units, high resolution displays with graphic processing units, and specialized software has brought complex visualization capabilities to an office desktop. Nevertheless, when dealing with large datasets such as, global climate, geospatial, and social data the office desktop falls short and calls for a centralized visualization facility with high end computing and graphics equipment.

Visualization Facility at GIS and Remote Sensing Core Lab would be a useful and important addition to the UNLV IT infrastructure. It would provide …


Diagnosis Of Multiple Scan-Chain Faults In The Presence Of System Logic Defects, Zhen Chen, Sharad C. Seth, Dong Xiang, Bhargab B. Bhattacharya Jan 2011

Diagnosis Of Multiple Scan-Chain Faults In The Presence Of System Logic Defects, Zhen Chen, Sharad C. Seth, Dong Xiang, Bhargab B. Bhattacharya

CSE Conference and Workshop Papers

We present a combined hardware-software based approach to scan-chain diagnosis, when the outcome of a test may be affected by system faults occurring in the logic outside of the scan chain. For the hardware component we adopt the double-tree scan (DTS) chain architecture, which has previously been shown to be effective in reducing power, volume, and application time of tests for stuck-at and delay faults. We develop a version of flush test which can resolve a multiple fault in a DTS chain to a small number of suspect candidates. Further resolution to a unique multiple fault is enabled by the …


Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil Jan 2011

Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.


Towards Nominal Formal Languages, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto Jan 2011

Towards Nominal Formal Languages, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We introduce formal languages over infinite alphabets where words may contain binders.We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.


Generic Trace Logics, Christian Kissig, Alexander Kurz Jan 2011

Generic Trace Logics, Christian Kissig, Alexander Kurz

Engineering Faculty Articles and Research

We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.