Physical Sciences and Mathematics | Open Access Articles

The Expected Variation Of Random Bounded Integer Sequences Of Finite Length, Rudolfo Angeles, Don Rawlings, Lawrence Sze, Mark Tiefenbruck

Mathematics

From the enumerative generating function of an abstract adjacency statistic, we deduce the mean and variance of the variation on random permutations, rearrangements, compositions, and bounded integer sequences of finite length.

Go to article

Student Usability Project Recommendations Define Information Architecture For Library Technology, Erika Rogers

Computer Science and Software Engineering

This paper demonstrates how interaction and usability evaluation techniques (e.g., Preece 2002) support the restructuring of information in a number of functional library areas. Senior level computer science students studying human-computer interaction principles worked with library leaders on three different projects: i) a prototype of an interactive data visualization application for more effective collections management; ii) usability recommendations for improving access to the electronic database systems; and iii) design and development of a technology-mediated, Web accessible digital research portal. All three cases started out as quarter-long (8-week) class projects with teams of three to four computer science students whose goals …

Go to article

A User-Centered Content Architecture For An Academic Digital Research Portal, Erika Rogers, Mary M. Somerville, Alissa Randles

Computer Science and Software Engineering

As part of the digital evolution of libraries, librarians are now expected to serve in new roles as knowledge mediators, and to provide much more technologically based support and assistance for students’ progress towards information literacy. This paper describes an ongoing collaborative project between students and library personnel to incorporate usability evaluation, interaction design techniques, and instructional design theories in the design and development of a flexible web-based Research Portal.

Go to article

Intelligent Software Systems In Historical Context, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

The purpose of this chapter is to trace the evolution of intelligent software from data-centric applications that essentially encapsulate their data environment to ontology-based applications with automated reasoning capabilities. It is argued that a distinction may be drawn between human intelligence and component capabilities within a more general definition of intelligence, and that such component capabilities can be embedded in computer software. The primary vehicle in the quest for intelligent software has been the gradual recognition of the central role played by data and information, rather than the logic and functionality of the application. The three milestones in this evolution …

Go to article

Removal Of P-Cresol Sulfate By Hemodialysis, Andres W. Martinez, Natalie S. Recht, Thomas H. Hostetter, Timothy W. Meyer

Chemistry and Biochemistry

Protein-bound solutes are poorly cleared by dialysis. Among the most extensively studied of these solutes is p-cresol, which has been shown to be toxic in vitro. This study examined the form in which p-cresol circulates and quantified its removal by hemodialysis. HPLC analysis of plasma from hemodialysis patients contained a peak whose mobility corresponded to synthetic p-cresol sulfate (PCS) but no detectable unconjugated p-cresol. Treatment with sulfatase resulted in recovery of this peak as p-cresol, confirming its identity. Subsequent studies compared the removal of PCS and another protein-bound solute, indican, to the removal of urea during clinical hemodialysis treatments. …

Go to article

Internal Design Of Uniform Shear Rate Dies, Thomas J. Awe, M. B. M. Eligindi, R. W. Langer, University Of Wisconsin - Eau Claire, Department Of Mathematics

Morehead Electronic Journal of Applicable Mathematics Archives

No abstract provided.

Go to article

An Introduction To Sdr's And Latin Squares, Jordan Bell, Carleton University, School Of Mathematics And Statistics

Morehead Electronic Journal of Applicable Mathematics Archives

No abstract provided.

Go to article

A Survey Of The Quadratic Assignment Problem, With Applications, Clayton W. Commander

Morehead Electronic Journal of Applicable Mathematics Archives

No abstract provided.

Go to article

Implementing Lazy Streams In C++, David Renz, Mike Borowczak

Morehead Electronic Journal of Applicable Mathematics Archives

No abstract provided.

Go to article

Atmospheric Neutron Measurements With The Sontrac Science Model, U Bravar, E O. Fluckiger, Kevin Godin, Zachary C. Hansen, John R. Macri, Mark L. Mcconnell, R S. Miller, M R. Moser, James M. Ryan

Space Science Center

–The SOlar Neutron TRACking (SONTRAC) telescope was originally developed to measure the energy spectrum and incident direction of neutrons produced in solar flares, in the energy range 20 - 250 MeV. While developed primarily for solar physics, the SONTRAC detector may be employed in virtually any application requiring both energy measurement and imaging capabilities. The SONTRAC Science Model (SM) is presently being operated at the University of New Hampshire (UNH) as a ground-based instrument to investigate the energy spectrum, zenith and azimuth angle dependence of the cosmic-ray induced sea-level atmospheric neutron flux. SONTRAC measurements are based on the non-relativistic double …

Go to article

An Empirical Study Of Fault Localization For End-User Programmers, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel

CSE Conference and Workshop Papers

End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been little research on finding ways to help these programmers with the dependability of their software. We have been addressing this problem in several ways, one of which includes supporting end-user debugging activities through fault localization techniques. This paper presents the results of an empirical study conducted in an end-user programming environment to examine the impact of two separate factors in fault localization techniques that affect technique effectiveness. Our results …

Go to article

Performance Analysis Of Sparse Traffic Grooming In Wdm Mesh Networks, Wang Yao, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the …

Go to article

A Controlled Experiment Assessing Test Case Prioritization Techniques Via Mutation Faults, Hyunsook Do, Gregg Rothermel

CSE Conference and Workshop Papers

Regression testing is an important part of software maintenance, but it can also be very expensive. To reduce this expense, software testers may prioritize their test cases so that those that are more important are run earlier in the regression testing process. Previous work has shown that prioritization can improve a test suite’s rate of fault detection, but the assessment of prioritization techniques has been limited to hand-seeded faults, primarily due to the belief that such faults are more realistic than automatically generated (mutation) faults. A recent empirical study, however, suggests that mutation faults can be representative of real faults. …

Go to article

Dcdp: A Novel Data-Centric And Design-Pattern Based Approach To Automatic Loop Transformation And Parallelization For A Shared-Object Environment In Clusters, Xuli Liu, Hong Jiang, Leen-Kiat Soh

CSE Technical Reports

Most of the parallelism associated with scientific/numeric applications exists in the form of loops, and thus transforming loops has been extensively studied in the past, especially in the areas of programming languages and compiler designs. Almost all the existing transformation approaches are control-centric, in which the transformation process starts from partitioning the iteration space, followed by the decomposition of the data space only as a side-effect. Originally designed for shared-memory multi-processors, these control-centric approaches might not be suitable under some circumstances for current loosely-coupled clusters and the Grid with physically distributed memories. In this paper, we introduce a novel data-centric …

Go to article

Utilizing Device Slack For Energy-Efficient I/O Device Scheduling In Hard Real-Time Systems With Non-Preemptible Resources, Hui Cheng, Steve Goddard

CSE Technical Reports

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of online energy-aware I/O scheduling for hard real-time systems based on the preemptive periodic task model with non-preemptible shared resources. We extend the concept of device slack proposed in [2] to support non-preemptible shared resources; and propose an online energy-aware I/O scheduling algorithm: Energy-efficient Device Scheduling with Non-preemptible Resources (EEDS NR). The EEDS NR algorithm …

Go to article

Efficient Test Compaction For Pseudo-Random Testing, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya

CSE Conference and Workshop Papers

Compact set of 3-valued test vectors for random pattern resistant faults are covered in multiple test passes. During a pass, its associated test cube specifies certain bits in the scan chain to be held fixed and others to change pseudo-randomly. We propose an algorithm to find a small number of cubes to cover all the test vectors, thus minimizing total test length. The test-cube finding algorithm repeatedly evaluates small perturbations of the current solution so as to maximize the expected test coverage of the cube. Experimental results show that our algorithm covers the test vectors by test cubes that are …

Go to article

Neighborhood Interchangeability And Dynamic Bundling For Non-Binary Finite Csps, Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder

CSE Conference and Workshop Papers

Neighborhood Interchangeability (NI) identifies the equivalent values in the domain of a variable of a Constraint Satisfaction Problem (CSP) by considering only the constraints that directly apply to the variable. Freuder described an algorithm for efficiently computing NI values in binary CSPs. In this paper, we show that the generalization of this algorithm to non-binary CSPs is not straightforward, and introduce an efficient algorithm for computing NI values in the presence of non-binary constraints. Further, we show how to interleave this mechanism with search for solving CSPs, thus yielding a dynamic bundling strategy. While the goal of dynamic bundling is …

Go to article

Thermodynamics Of Folding And Association Of Lattice-Model Proteins, Troy Cellmer, Dusan Bratko, John M. Prausnitz, Harvey Blanch

Chemistry Publications

Closely related to the “protein folding problem” is the issue of protein misfolding and aggregation. Proteinaggregation has been associated with the pathologies of nearly 20 human diseases and presents serious difficulties during the manufacture of pharmaceutical proteins. Computational studies of multiprotein systems have recently emerged as a powerful complement to experimental efforts aimed at understanding the mechanisms of proteinaggregation. We describe the thermodynamics of systems containing two lattice-model 64-mers. A parallel tempering algorithm abates problems associated with glassy systems and the weighted histogram analysis method improves statistical quality. The presence of a second chain has a substantial effect on single-chain …

Go to article

Kinetics Of Ion-Induced Nucleation In A Vapor-Gas Mixture, Sergey P. Fisenko, David B. Kane, M. Samy El-Shall

Chemistry Publications

A general solution for the steady-state ion-induced nucleation kinetics has been derived, considering the differences between ion-induced nucleation and homogeneous nucleation. This solution includes a new effect for nucleation kinetics, the interaction of charged clusters with vapor molecules. Analytical expressions for the ion-induced nucleation rate have been obtained for the limiting cases of high and low thermodynamic barriers. The physical explanation of the so-called sign effect is proposed based on multipole expansion of an electric field of the cluster ion. This theory gives good agreement with experiments and is used to elucidate experimentally observed phenomena.

Go to article

Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard

CSE Technical Reports

Cluster Computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various workload models and real-time scheduling algorithms have been investigated. The divisible load model, propagated by divisible load theory, models computations that can be arbitrarily divided into independent pieces and provides a good approximation of many real-world applications. However, researchers have not yet investigated the problem of providing performance guarantees to divisible load applications. Two contributions are made in this paper: (1) divisible load theory is extended to compute the minimum number of processors required to meet …

Go to article

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …

Go to article

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …

Go to article

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Usability patterns represent knowledge about known ways to design graphical user interfaces that are usable and meet the needs and expectations of users. There is currently a plethora of usability patterns published in books, private repositories and the World-Wide Web. The dominance of pattern discovery efforts has neglected the emerging need to organize the patterns so they can become a proactive resource for developing interfaces. This paper presents an approach using Semantic Web concepts that turns informal patterns into formal representations capable of supporting systematic design methods. Through this method, loosely coupled pattern collections can be turned into strongly coupled …

Go to article

Crtdh: An Efficient Key Agreement Scheme For Secure Group Communications In Wireless Ad Hoc Networks, Ravi K Balachandran, Byrav Ramamurthy, Xukai Zou, N.V. Vinodchandran

CSE Conference and Workshop Papers

As a result of the growing popularity of wireless networks, in particular ad hoc networks, security over such networks has become very important. In this paper, we study the problem of secure group communications (SGC) and key management over ad hoc networks. We identify the key features of any SGC protocol for such networks. We also propose an efficient key agreement scheme for SGC. The scheme solves two important problems that exist in most current SGC schemes: requirement of member serialization and existence of a central entity. Besides this, the protocol also has many highly desirable properties such as contributory …

Go to article

Ground Water Monitoring Using Smart Sensors, Srikanth Anumalla, Byrav Ramamurthy, David Gosselin

CSE Conference and Workshop Papers

Groundwater resources are the principal source of drinking water for about 50 percent of the United States population. Groundwater resources in Nebraska are under increasing stress as there is a rapid growth in their usage. Water managers need more timely and accurate data to assess ground-water conditions to manage adverse situations such as drought and loss of pumpage in agriculture and domestic water supply. Currently groundwater researchers use stand-alone data logging equipment which is labor intensive and the method is not easily scalable if the number of logging locations increases. Commercially available real-time data monitoring solutions are either prohibitively costly …

Go to article

Survivable Waveband Switching In Wdm Mesh Networks Under Dedicated Path-Protection, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

This paper considers the problem of dedicated path-protection in wavelength-division multiplexed (WDM) mesh networks with waveband switching functionality under shared risk link group (SRLG) constraints. Two dedicated path protection schemes are proposed, namely the PBABL scheme and the MPABWL scheme. The PBABL scheme protects each working waveband-path through a backup waveband-path. The MPABWL scheme protects each working waveband-path by either a backup waveband-path or multiple backup lightpaths. Heuristic algorithms adopting random optimization technique are proposed for both the schemes. The performance of the two protection schemes is studied and compared. Simulation results show that both the heuristics can obtain optimum …

Go to article

Same-Destination-Intermediate Grouping Vs. End-To-End Grouping For Waveband Switching In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy

CSE Conference and Workshop Papers

We investigate waveband switching (WBS) with different grouping strategies in wavelength-division multiplexing (WDM) mesh networks. End-to-end waveband switching (ETEWBS) and same-destination-intermediate waveband switching (SD-IT-WBS) are analyzed and compared in terms of blocking probability and cost savings. First, an analytical model for ETEWBS is proposed to determine the network blocking probability in a mesh network. For SD-IT-WBS, a simple waveband switching algorithm is presented. An analytical model to determine the network blocking probability is proposed for SD-IT-WBS based on the algorithm. The analytical results are validated by comparing with simulation results. Both results match well and show that ETE-WBS slightly outperforms …

Go to article

A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy

CSE Conference and Workshop Papers

Waveband switching (WBS) is an important technique to save switching and transmission cost in wavelength -division multiplexed (WDM) optical networks. A cost-efficient WBS scheme would enable network carriers to increase the network throughput (revenue) while achieving significant cost savings. We identify the critical factors that determine the WBS network throughput and switching cost and propose a novel intermediate waveband switching (IT-WBS) algorithm, called the minimizing-weighted-cost (MWC) algorithm. The MWC algorithm defines a cost for each candidate route of a call. By selecting the route with the smallest weighted cost, MWC balances between minimizing the call blocking probability and minimizing the …

Go to article

Technical Reports (1999 - 2005)

CSE Technical Reports

Authors of Technical Reports (1999-2005):
Choueiry, Berthe
Elbaum, Sebastian
Goddard, Steve
Henninger, Scott
Jiang, Hong
Rothermel, Gregg
Scott, Stephen
Seth, Sharad
Soh, Leen-Kiat
Variyam, Vinodchandran

Go to article

In Situ Screening To Optimize Variables In Organic Reactions, David Berkowitz, Mohua Bose, Sungjo Choi

Chemistry Department: Faculty Publications

A biphasic process for rapid screening of organic reactions comprising monitoring relative rates of parallel organic reactions. The screening process is suitable to determine the efficacy of different reactants, process conditions, and process enhancers such as catalysts or promoters. The biphasic process also allows multiple samples to be analyzed/monitored simultaneously. In addition because enzymes are used to monitor the reaction product in this invention, when that product is chiral and an enantio-discriminating enzyme is used to monitor the product, in addition to the relative rates, enantioselectivities of a set of parallel organic reactions can also be determined. The monitoring is …

Go to article

Full-Text Articles in Physical Sciences and Mathematics

The Expected Variation Of Random Bounded Integer Sequences Of Finite Length, Rudolfo Angeles, Don Rawlings, Lawrence Sze, Mark Tiefenbruck

Mathematics

Student Usability Project Recommendations Define Information Architecture For Library Technology, Erika Rogers

Computer Science and Software Engineering

A User-Centered Content Architecture For An Academic Digital Research Portal, Erika Rogers, Mary M. Somerville, Alissa Randles

Computer Science and Software Engineering

Intelligent Software Systems In Historical Context, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

Removal Of P-Cresol Sulfate By Hemodialysis, Andres W. Martinez, Natalie S. Recht, Thomas H. Hostetter, Timothy W. Meyer

Chemistry and Biochemistry

Internal Design Of Uniform Shear Rate Dies, Thomas J. Awe, M. B. M. Eligindi, R. W. Langer, University Of Wisconsin - Eau Claire, Department Of Mathematics

Morehead Electronic Journal of Applicable Mathematics Archives

An Introduction To Sdr's And Latin Squares, Jordan Bell, Carleton University, School Of Mathematics And Statistics

Morehead Electronic Journal of Applicable Mathematics Archives

A Survey Of The Quadratic Assignment Problem, With Applications, Clayton W. Commander

Morehead Electronic Journal of Applicable Mathematics Archives

Implementing Lazy Streams In C++, David Renz, Mike Borowczak

Morehead Electronic Journal of Applicable Mathematics Archives

Atmospheric Neutron Measurements With The Sontrac Science Model, U Bravar, E O. Fluckiger, Kevin Godin, Zachary C. Hansen, John R. Macri, Mark L. Mcconnell, R S. Miller, M R. Moser, James M. Ryan

Space Science Center

An Empirical Study Of Fault Localization For End-User Programmers, Joseph R. Ruthruff, Margaret Burnett, Gregg Rothermel

CSE Conference and Workshop Papers

Performance Analysis Of Sparse Traffic Grooming In Wdm Mesh Networks, Wang Yao, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

A Controlled Experiment Assessing Test Case Prioritization Techniques Via Mutation Faults, Hyunsook Do, Gregg Rothermel

CSE Conference and Workshop Papers

Dcdp: A Novel Data-Centric And Design-Pattern Based Approach To Automatic Loop Transformation And Parallelization For A Shared-Object Environment In Clusters, Xuli Liu, Hong Jiang, Leen-Kiat Soh

CSE Technical Reports

Utilizing Device Slack For Energy-Efficient I/O Device Scheduling In Hard Real-Time Systems With Non-Preemptible Resources, Hui Cheng, Steve Goddard

CSE Technical Reports

Efficient Test Compaction For Pseudo-Random Testing, Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattacharya

CSE Conference and Workshop Papers

Neighborhood Interchangeability And Dynamic Bundling For Non-Binary Finite Csps, Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder

CSE Conference and Workshop Papers

Thermodynamics Of Folding And Association Of Lattice-Model Proteins, Troy Cellmer, Dusan Bratko, John M. Prausnitz, Harvey Blanch

Chemistry Publications

Kinetics Of Ion-Induced Nucleation In A Vapor-Gas Mixture, Sergey P. Fisenko, David B. Kane, M. Samy El-Shall

Chemistry Publications

Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard

CSE Technical Reports

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Disseminating Usability Design Knowledge Through Ontology-Based Pattern Languages, Scott Henninger, Padmapriya Ashokkumar

CSE Technical Reports

Crtdh: An Efficient Key Agreement Scheme For Secure Group Communications In Wireless Ad Hoc Networks, Ravi K Balachandran, Byrav Ramamurthy, Xukai Zou, N.V. Vinodchandran

CSE Conference and Workshop Papers

Ground Water Monitoring Using Smart Sensors, Srikanth Anumalla, Byrav Ramamurthy, David Gosselin

CSE Conference and Workshop Papers

Survivable Waveband Switching In Wdm Mesh Networks Under Dedicated Path-Protection, Mengke Li, Byrav Ramamurthy

CSE Conference and Workshop Papers

Same-Destination-Intermediate Grouping Vs. End-To-End Grouping For Waveband Switching In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy

CSE Conference and Workshop Papers

A Novel Cost-Efficient On-Line Intermediate Waveband-Switching Scheme In Wdm Mesh Networks, Mengke Li, Wang Yao, Byrav Ramamurthy

CSE Conference and Workshop Papers

Technical Reports (1999 - 2005)

CSE Technical Reports

In Situ Screening To Optimize Variables In Organic Reactions, David Berkowitz, Mohua Bose, Sungjo Choi

Chemistry Department: Faculty Publications