Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Average Run Length (2)
- Change Detection (2)
- Control Charts (2)
- Filtered Derivative (2)
- Moving Average (2)
-
- Analytic Hierarchy Process (1)
- Assessment Framework (1)
- Assessment and Evaluation (1)
- Bit Serial (1)
- Calcium (1)
- Concurrency (1)
- FPGA (1)
- Floating Point (1)
- HFSS (1)
- Haskell (1)
- Hubbard Brook Experimental Forest (1)
- Hypothesis Tests of Intervals (1)
- Matching (1)
- Microstrip circuit (1)
- Networks (1)
- Operating Characteristic Curve (1)
- Parallelism (1)
- Peer-to-Peer (1)
- Portfolio Analysis (1)
- Quarter-wave transformer (1)
- R & D Assessment (1)
- Risk Curve (1)
- Software Transactional Memory (1)
- Soil (1)
- Soil solution (1)
Articles 1 - 9 of 9
Full-Text Articles in Engineering
Design Of S-Band Transition Based On Microstrip Quarter-Wave Transformers, Bashir Souid, Josh Merchant, Michael Rice, Mahmoud El Sabbagh
Design Of S-Band Transition Based On Microstrip Quarter-Wave Transformers, Bashir Souid, Josh Merchant, Michael Rice, Mahmoud El Sabbagh
Electrical Engineering and Computer Science - All Scholarship
In this technical report, the design of a high-frequency matching circuit is presented. This circuit is a transformer comprising a cascade of multisections of quarter-wavelength transmission lines. The transformer, also referred to as matching circuit, is implemented based on microstrip technology. The matching circuit is required to perform as a transition from a 10-Ω load to a 50-Ω source. Moreover, this transition is specified to have a return loss more than 20 dB over the entire S-band from 2 GHz to 4 GHz. Analytical model developed and verified by full-wave simulation results indicates that the design of a quarter-wavelength transformer …
A Bit Serial Approach To Massively Parallel Floating Point Operations On An Fpga, Duane Marcy, Fred Schlereth, Parija Kshirsagar, Anvith Katte Mahabalagiri
A Bit Serial Approach To Massively Parallel Floating Point Operations On An Fpga, Duane Marcy, Fred Schlereth, Parija Kshirsagar, Anvith Katte Mahabalagiri
Electrical Engineering and Computer Science - All Scholarship
In this paper we discuss the pros and cons of bit serial arithmetic for performing mathematical operations for signal processing and scientific computations on an FPGA. We describe our formulation of the architecture for such massively parallel systems, the advantage being that it requires no parallel programming in the traditional sense. We describe a pseudo floating point bit serial circuit which is less complex than full precision floating point and show that it is suitable for many applications. We conclude with several application examples and show that a bit serial implementation can be competitive with a high speed parallel implementation.
A New Statistical Procedure For Validation Of Simulation And Stochastic Models, Robert G. Sargent
A New Statistical Procedure For Validation Of Simulation And Stochastic Models, Robert G. Sargent
Electrical Engineering and Computer Science - All Scholarship
We describe a new statistical procedure for validating simulation and analytic stochastic models using hypothesis testing when the amount of model accuracy is specified. This procedure provides for the model to be accepted if the difference between the system and the model outputs are within the specified ranges of accuracy. The system must be observable to allow data to be collected for validation.
The Investment Comparison Tool (Ict): A Method To Assess Research And Development Investments, Tiffany A. Sargent, Robert G. Sargent
The Investment Comparison Tool (Ict): A Method To Assess Research And Development Investments, Tiffany A. Sargent, Robert G. Sargent
Electrical Engineering and Computer Science - All Scholarship
This paper presents a software tool (the Investment Comparison Tool), a methodology (the Investment Comparison Methodology), and a decision support system (the Investment Comparison System) to aid decision makers with Research and Development Investment allocations. The Investment Comparison System (ICS) can be used vertically within an organization and horizontally across organizations at multiple portfolio investment levels. The ICS is applicable to any R&D environment ranging from Industry Research Environments to Federal Agencies. The ICS described in this paper is comprised of a system architecture, databases, Group Decision Making (GDM) methods, an Investment Comparison Tool (ICT) that includes various algorithms, and …
Strong (X)Html Compliance With Haskell's Flexible Type System, Paul G. Talaga, Steve J. Chapin
Strong (X)Html Compliance With Haskell's Flexible Type System, Paul G. Talaga, Steve J. Chapin
Electrical Engineering and Computer Science - All Scholarship
We report on the embedding of a domain specific language, (X)HTML, into Haskell and demonstrate how this superficial non-context-free language can be represented and rendered to guarantee World Wide Web Consortium (W3C) compliance. Compliance of web content is important for the health of the Internet, accessibility, visibility, and reliable search. While tools exist to verify web content is compliant according to the W3C, few systems guarantee that all produced content is compliant. We present CH-(X)HTML, a library for generating compliant (X)HTML content by using Haskell to encode the nontrivial syntax of (X)HTML set forth by the W3C. Any compliant document …
P2pstm: A Peer-To-Peer Software Transactional Memory, Phil Pratt-Szeliga, Jim Fawcett
P2pstm: A Peer-To-Peer Software Transactional Memory, Phil Pratt-Szeliga, Jim Fawcett
Electrical Engineering and Computer Science - All Scholarship
Peer-to-Peer network topologies are such that there is no centralized server in a distributed system but rather each peer is part server and part client. This idea was originally popularized with peer-to-peer file sharing. If one were to distribute computation on a peer-to-peer network topology, consistency of shared data among peers is a problem. Software Transactional Memory (STM) is a lock free mechanism of assuring consistency of memory among threads of execution that has favorable performance over locked methods when the number of threads is large. This paper presents a method to use STM methods with a peer-to-peer network architecture …
Chemical Changes In Soil And Soil Solution After Calcium Silicate Addition To A Northern Hardwood Forest, Youngil Cho, Charles T. Driscoll, Chris E. Johnson, Thomas G. Siccama
Chemical Changes In Soil And Soil Solution After Calcium Silicate Addition To A Northern Hardwood Forest, Youngil Cho, Charles T. Driscoll, Chris E. Johnson, Thomas G. Siccama
Civil and Environmental Engineering
Liming has been used to mitigate effects of acidic deposition in forest ecosystems. This study was designed to examine the effects of calcium (Ca) supply on the spatial patterns and the relations between soil and soil solution chemistry in a base-poor forest watershed. Watershed 1 at the Hubbard Brook Experimental Forest in New Hampshire, USA was experimentally treated with wollastonite (CaSiO3) in October, 1999. Exchangeable Ca (Ex-Ca), soil pHs (in 0.01 M CaCl2), effective cation exchange capacity (CECe), and effective base saturation (BSe) increased, while exchangeable acidity (Ex-Acid) decreased …
Average Run Length Of Two-Span Moving Sum Algorithms, Swarnendu Kar, Kishan G. Mehrotra, Pramod Varshney
Average Run Length Of Two-Span Moving Sum Algorithms, Swarnendu Kar, Kishan G. Mehrotra, Pramod Varshney
Electrical Engineering and Computer Science - All Scholarship
Among the various procedures used to detect potential changes in a stochastic process the moving sum algorithms are very popular due to their intuitive appeal and good statistical performance. One of the important design parameters of a change detection algorithm is the expected interval between false positives, also known as the average run length (ARL). In this paper, we have derived closed form expressions of ARL for two special cases - namely the two-span moving sum and filtered derivative algorithms. We have assumed that the random variables are uniformly distributed.
Approximation Of Average Run Length Of Moving Sum Algorithms Using Multivariate Probabilities, Swarnendu Kar, Kishan Mehrotra, Pramod Varshney
Approximation Of Average Run Length Of Moving Sum Algorithms Using Multivariate Probabilities, Swarnendu Kar, Kishan Mehrotra, Pramod Varshney
Electrical Engineering and Computer Science - All Scholarship
Among the various procedures used to detect potential changes in a stochastic process the moving sum algorithms are very popular due to their intuitive appeal and good statistical performance. One of the important design parameters of a change detection algorithm is the expected interval between false positives, also known as the average run length (ARL). Computation of the ARL usually involves numerical procedures but in some cases it can be approximated using a series involving multivariate probabilities. In this paper, we present an analysis of this series approach by providing sufficient conditions for convergence and derive an error bound. Using …