Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Social and Behavioral Sciences (11626)
- Library and Information Science (8974)
- Engineering (6329)
- Physical Sciences and Mathematics (2868)
- Arts and Humanities (2752)
-
- Civil and Environmental Engineering (2550)
- Computer Sciences (2077)
- Education (1983)
- Civil Engineering (1879)
- Life Sciences (1669)
- Comparative Literature (1407)
- Communication (854)
- Medicine and Health Sciences (725)
- Rhetoric and Composition (694)
- Feminist, Gender, and Sexuality Studies (680)
- American Studies (667)
- Film and Media Studies (638)
- Mechanical Engineering (619)
- European Languages and Societies (607)
- Reading and Language (606)
- Critical and Cultural Studies (594)
- Agriculture (585)
- Other Arts and Humanities (585)
- Psychology (552)
- Plant Sciences (546)
- Nanoscience and Nanotechnology (541)
- Theatre and Performance Studies (539)
- Other Film and Media Studies (522)
- Television (509)
- Business (488)
- Keyword
-
- Applied sciences (587)
- Comparative literature (498)
- comparative literature (488)
- Comparative cultural studies (303)
- comparative cultural studies (297)
-
- Education (220)
- Social sciences (205)
- Biological sciences (195)
- Information literacy (170)
- Pure sciences (160)
- Cultural studies (155)
- Simulation (154)
- Vegetables (153)
- cultural studies (152)
- Variety trials (147)
- Literary theory (136)
- literary theory (135)
- Construction (120)
- Optimization (118)
- Health and environmental sciences (117)
- Sustainability (106)
- CFD (95)
- Safety (94)
- Economics (92)
- Problem-based learning (92)
- Zea mays (92)
- Modeling (90)
- Mechanics (87)
- Concrete (86)
- Heat transfer (85)
- Publication Year
- Publication
-
- Against the Grain (7173)
- Purdue Road School (3846)
- International Compressor Engineering Conference (2764)
- International Refrigeration and Air Conditioning Conference (2681)
- Open Access Dissertations (2120)
-
- JTRP Technical Reports (1905)
- Department of Computer Science Technical Reports (1777)
- Open Access Theses (1616)
- CLCWeb: Comparative Literature and Culture (1418)
- Proceedings of the IATUL Conferences (1358)
- Historical Documents of the Purdue Cooperative Extension Service Archive (1121)
- Department of Physics and Astronomy Faculty Publications (1038)
- The Writing Center Journal (1028)
- Charleston Library Conference (939)
- The Summer Undergraduate Research Fellowship (SURF) Symposium (884)
- Department of Electrical and Computer Engineering Technical Reports (747)
- The Journal of Purdue Undergraduate Research (683)
- Society of Engineering Science 51st Annual Technical Meeting Archive (652)
- First Opinions, Second Reactions (609)
- CIB Conferences (503)
- International High Performance Buildings Conference (495)
- LARS Symposia (491)
- Birck and NCN Publications (488)
- Education and Culture (431)
- International Conference on Durability of Concrete Structures (359)
- CTRC Research Publications (353)
- Libraries Faculty and Staff Scholarship and Research (294)
- Midwest Vegetable Trial Reports (288)
- Publications of the Ray W. Herrick Laboratories (286)
- Journal of Southeast Asian American Education and Advancement (274)
- Publication Type
Articles 43321 - 43350 of 50088
Full-Text Articles in Entire DC Network
From The Editors, Jeanette Harris, Joyce Kinkead
From The Editors, Jeanette Harris, Joyce Kinkead
The Writing Center Journal
No abstract provided.
Family Systems Theory And The Form Of Conference Dialogue, Louise Z. Smith
Family Systems Theory And The Form Of Conference Dialogue, Louise Z. Smith
The Writing Center Journal
No abstract provided.
One Woman's Ways Of Knowing, Susan Monroe Nugent
One Woman's Ways Of Knowing, Susan Monroe Nugent
The Writing Center Journal
No abstract provided.
Review: The High School Writing Center, Stephen D. Fields
Review: The High School Writing Center, Stephen D. Fields
The Writing Center Journal
No abstract provided.
From The President, Pamela B. Farrell
From The President, Pamela B. Farrell
The Writing Center Journal
No abstract provided.
Defining Ourselves: Do We Really Want To Use The Word Tutor?, Lex Runciman
Defining Ourselves: Do We Really Want To Use The Word Tutor?, Lex Runciman
The Writing Center Journal
No abstract provided.
Expanded Roles/Expanded Responsibilities: The Changing Nature Of Writing Centers Today, Diana George, Nancy Grimm
Expanded Roles/Expanded Responsibilities: The Changing Nature Of Writing Centers Today, Diana George, Nancy Grimm
The Writing Center Journal
No abstract provided.
The High School Writing Center: The Once And Future Services, James Upton
The High School Writing Center: The Once And Future Services, James Upton
The Writing Center Journal
No abstract provided.
Compiler-Driven Cache Management Using A State Level Transition Model, Chi-Hung Chi
Compiler-Driven Cache Management Using A State Level Transition Model, Chi-Hung Chi
Department of Electrical and Computer Engineering Technical Reports
Cache performance is critical in cache-based supercomputers, where the cache-miss/cache-hit memory reference delay ratio is typically large. Using compile-time analysis, program behavior can be predicted, and cache control directives can be embedded in the generated code. Thus, cache performance can be improved in a way not possible using conventional techniques. Given hardware able to selectively bypass the cache, cache performance can be increased because pollution can be minimized. Cache line replacement can also be controlled by the compiler (rather than by LRU, etc.), further enhancing performance. The research consists of the development of a model and algorithms providing optimal, or …
On The Average-Case Running Time Of The Boyer-Moore Algorithm, Russell W. Quong
On The Average-Case Running Time Of The Boyer-Moore Algorithm, Russell W. Quong
Department of Electrical and Computer Engineering Technical Reports
The Boyer-Moore algorithm (BM) is a fast, compact algorithm for finding all occurrences of a pattern string in a text string. Previous papers have addressed the worst-case running time of BM, which occurs rarely in practice. In this paper, we derive an approximation to Φ (BM) the average number of character probes made by BM. Let M = pattern length, N = text string length, α = the alphabet size, q = 1 /α and q= I — q. By modeling BM as a probabilistic finite automaton, we show that Φ(BM) h when M < α and that Φ(BM ) N q(l + g V ) when M > α. An immediate consequence is that …
Simple Model For Dissipation In Quantum Transport, Supriyo Datta
Simple Model For Dissipation In Quantum Transport, Supriyo Datta
Department of Electrical and Computer Engineering Technical Reports
No abstract provided.
Backtracking Ic Placement Algorithm, Yi Cheng, Robert H. Fujii
Backtracking Ic Placement Algorithm, Yi Cheng, Robert H. Fujii
Department of Electrical and Computer Engineering Technical Reports
A new algorithm for integrated circuit (IC) layout placement is introduced. As in simulated annealing, it allows uphill movements but in a more restrictive manner; thus, the search for an optima is more directed. Experiments on standard cell placement have shown that the average convergence time is faster than the simulated annealing algorithm while achieving similar results.
Robust Techniques For Bearing Estimation In Contaminated Gaussian Noise, R. L. Kashyap, David D. Lee, N. Srinivasa
Robust Techniques For Bearing Estimation In Contaminated Gaussian Noise, R. L. Kashyap, David D. Lee, N. Srinivasa
Department of Electrical and Computer Engineering Technical Reports
The problem of estimating directions-of-arrival (DOA) of radiating sources from measurements provided by a passive array of sensors is frequently encountered in radar, sonar, radio astronomy and seismology. In this study various robust methods for the DOA estimation problem are developed, where the term robustness refers to insensitivity against small deviation in the underlying Gaussian noise assumption. The first method utilizes an eigenvector method and robust reconstruction of the correlation matrix by time series modeling of the array data; Secondly, a decentralized processing scheme is considered for geographically distributed array sites. The method provides reliable estimates even when a few …
On The Existence And Design Of The Best Stack Filter Based Associative Memory, Pao-Ta Yu, Edward J. Coyle
On The Existence And Design Of The Best Stack Filter Based Associative Memory, Pao-Ta Yu, Edward J. Coyle
Department of Electrical and Computer Engineering Technical Reports
The associative memory of a stack filter is defined to be the set of root signals of that filter. If the root sets of two stack filters both contain a desired set of patterns, but one filter’s root set is smaller than the other, then the filter with the smaller root set is said to be better for that set of patterns. Any filter which has the smallest number of roots containing the specified set of patterns is said to be a best filter. The configuration of the family of best filters is described via a graphical approach which specifies …
Simulation Of Heterojunction Bipolar Transistors In Two Dimensions, Paul Emerson Dodd
Simulation Of Heterojunction Bipolar Transistors In Two Dimensions, Paul Emerson Dodd
Department of Electrical and Computer Engineering Technical Reports
This work describes the formulation and, development of a two-- dimensional drift-diffusion simulation program for accurate modeling of heterojunction bipolar transistors (HBT's). The model described is a versatile tool for studying HBT's, allowing the user to determine the terminal characteristics and physical operation of devices. Nonplanar structures can be treated, response to transient conditions can be computed, and the high frequency characteristics of transistors may be projected. The formulation of an electron energy balance equation is presented and included in the model in an attempt to more accurately compute high-field transport characteristics. The model is applied to some common design …
Computer Vandalism And The Law, Eugene H. Spafford
Computer Vandalism And The Law, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
On The Analysis Of The Tail Queue Length And Waiting Time Distributions Of A Gi/Gi/C Queue, John S. Sadowsky, Wojciech Szpankowski
On The Analysis Of The Tail Queue Length And Waiting Time Distributions Of A Gi/Gi/C Queue, John S. Sadowsky, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Computer Virus Primer, Eugene H. Spafford, Kathleen A. Heaphy, David J. Ferbrache
A Computer Virus Primer, Eugene H. Spafford, Kathleen A. Heaphy, David J. Ferbrache
Department of Computer Science Technical Reports
No abstract provided.
A Workload Partitioning Strategy For Pdes By A Generalized Neural Network, Elias N. Houstis, S. K. Kortesis, H. Byun
A Workload Partitioning Strategy For Pdes By A Generalized Neural Network, Elias N. Houstis, S. K. Kortesis, H. Byun
Department of Computer Science Technical Reports
No abstract provided.
The Internet Worm Incident, Eugene H. Spafford
The Internet Worm Incident, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Experimental Facility For Kernel Extensions To Support Distributed Database Systems, Bharat Bhargava, Enrique Mafla, John Riedl
Experimental Facility For Kernel Extensions To Support Distributed Database Systems, Bharat Bhargava, Enrique Mafla, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Fast Parallel Lyndon Factorization With Applications, Alberto Aposiolico, Maxime Crochemore
Fast Parallel Lyndon Factorization With Applications, Alberto Aposiolico, Maxime Crochemore
Department of Computer Science Technical Reports
No abstract provided.
On The Convergence Of The Modified Accelerated Overrelaxation (Maor) Method, A. Hadjidimos, A. Psimarni, A. K. Yeyios
On The Convergence Of The Modified Accelerated Overrelaxation (Maor) Method, A. Hadjidimos, A. Psimarni, A. K. Yeyios
Department of Computer Science Technical Reports
No abstract provided.
Efficient Geometric Algorithms In The Erew-Pram, Danny Z. Chen
Efficient Geometric Algorithms In The Erew-Pram, Danny Z. Chen
Department of Computer Science Technical Reports
No abstract provided.
On The Optimality Of The Counter Scheme For Dynamic Linear Lists, Micha Hofri, Hadas Shachnai
On The Optimality Of The Counter Scheme For Dynamic Linear Lists, Micha Hofri, Hadas Shachnai
Department of Computer Science Technical Reports
No abstract provided.
An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz
An Extended Transaction Model For Multidatabase Systems, Yungho Leu, Ahmed K. Elmagarmid, Marek Rusinkiewicz
Department of Computer Science Technical Reports
No abstract provided.
A Model Ordinance For Erosion Control On Sites With Land Disturbing Activities, Herpicc
A Model Ordinance For Erosion Control On Sites With Land Disturbing Activities, Herpicc
Indiana Local Technical Assistance Program (LTAP) Publications
This model ordinance was developed by a task group composed of a county engineer, a county commissioner, county surveyors, land developers, and representatives of Indiana Department of Transportation, Indiana Department of Natural Resources, Indiana Farm Bureau, Indiana Department of Environmental Management, and Hoosier Heartland RC&D.
The Pseiki Report -- Version 3. Evidence Accumulation And Flow Of Control In A Hierarchical Spatial Reasoning System, K. M. Andress, A. C. Kak
The Pseiki Report -- Version 3. Evidence Accumulation And Flow Of Control In A Hierarchical Spatial Reasoning System, K. M. Andress, A. C. Kak
Department of Electrical and Computer Engineering Technical Reports
A fundamental goal of computer vision research is the development of systems capable of carrying out scene interpretation using knowledge of the expected scene. Here, we describe PSEIKI, a framework for expectation-driven interpretation of image data. PSEIKI performs expectation-driven processing by matching elements, such as edges and regions, detected in an image with model-elements front a supplied expected scene. PSEIRI builds abstraction hierarchies in image data using cues taken from the supplied abstractions in the expected scene. Hypothesized abstractions in the image data are geometrically compared with the known abstractions in the expected scene; the metrics used for these comparisons …