Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (1839)
- Social and Behavioral Sciences (1618)
- Physical Sciences and Mathematics (1351)
- Computer Sciences (1090)
- Library and Information Science (915)
-
- Civil and Environmental Engineering (778)
- Arts and Humanities (765)
- Civil Engineering (632)
- Education (552)
- Comparative Literature (395)
- Life Sciences (343)
- Communication (218)
- Electrical and Computer Engineering (205)
- Rhetoric and Composition (202)
- Medicine and Health Sciences (199)
- Critical and Cultural Studies (176)
- Mechanical Engineering (175)
- American Studies (172)
- Feminist, Gender, and Sexuality Studies (172)
- Nanoscience and Nanotechnology (164)
- Film and Media Studies (157)
- Other Arts and Humanities (157)
- Reading and Language (157)
- European Languages and Societies (152)
- Psychology (140)
- Other Film and Media Studies (137)
- Theatre and Performance Studies (137)
- Television (126)
- Aerospace Engineering (108)
- English Language and Literature (107)
- Keyword
-
- Applied sciences (301)
- Comparative literature (139)
- comparative literature (137)
- Education (88)
- Comparative cultural studies (86)
-
- Social sciences (85)
- comparative cultural studies (84)
- Pure sciences (77)
- Biological sciences (69)
- Physics, Multidisciplinary (55)
- Cultural studies (48)
- Literary theory (46)
- cultural studies (46)
- literary theory (46)
- Astronomy & Astrophysics;; Physics, Particles & Fields (44)
- Health and environmental sciences (43)
- Problem-based learning (42)
- Optimization (40)
- Modeling (39)
- Psychology (38)
- Simulation (38)
- Comparative humanities (32)
- Media studies (32)
- comparative humanities (32)
- media studies (32)
- Construction (31)
- Sustainability (31)
- Communication and the arts (30)
- Concrete (29)
- Safety (29)
- Publication Year
- Publication
-
- Open Access Dissertations (945)
- Department of Computer Science Technical Reports (944)
- Purdue Road School (757)
- Open Access Theses (752)
- JTRP Technical Reports (748)
-
- International Compressor Engineering Conference (709)
- Department of Physics and Astronomy Faculty Publications (652)
- Against the Grain (606)
- International Refrigeration and Air Conditioning Conference (568)
- Department of Electrical and Computer Engineering Technical Reports (406)
- CLCWeb: Comparative Literature and Culture (399)
- The Writing Center Journal (302)
- LARS Symposia (237)
- Proceedings of the IATUL Conferences (213)
- Birck and NCN Publications (160)
- Charleston Library Conference (140)
- Education and Culture (138)
- CTRC Research Publications (127)
- International High Performance Buildings Conference (121)
- CIB Conferences (108)
- LARS Technical Reports (95)
- Interdisciplinary Journal of Problem-Based Learning (84)
- Journal of Aviation Technology and Engineering (83)
- Global Business Languages (80)
- Libraries Faculty and Staff Scholarship and Research (77)
- Department of Electrical and Computer Engineering Faculty Publications (71)
- Other Nanotechnology Publications (70)
- Purdue University Libraries Open Access Publishing Fund (70)
- The Journal of Problem Solving (63)
- Journal of Pre-College Engineering Education Research (J-PEER) (59)
- Publication Type
- File Type
Articles 10021 - 10050 of 12094
Full-Text Articles in Entire DC Network
Method Of Classification For Multisource Data In Remote Sensing Based On Interval-Vaiued Probabilities, Hakil Kim, Philip H. Swain
Method Of Classification For Multisource Data In Remote Sensing Based On Interval-Vaiued Probabilities, Hakil Kim, Philip H. Swain
Department of Electrical and Computer Engineering Technical Reports
This work was supported by NASA Grant No. NAGW-925 “Earth Observation Research - Using Multistage EOS-Iike Data” (Principal lnvestigators: David A. Landgrebe and Chris Johannsen). The Anderson River SAR/MSS data set was acquired, preprocessed, and loaned to us by the Canada Centre for Remote Sensing, Department of Energy Mines, and Resources, of the Government of Canada. The importance of utilizing multisource data in ground-cover^ classification lies in the fact that improvements in classification accuracy can be achieved at the expense of additional independent features provided by separate sensors. However, it should be recognized that information and knowledge from most available …
Using Celllular Graph Embeddings In Solving All Pairs Shortest Paths Problems, Greg N. Frederickson
Using Celllular Graph Embeddings In Solving All Pairs Shortest Paths Problems, Greg N. Frederickson
Department of Computer Science Technical Reports
No abstract provided.
Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey
Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey
Department of Computer Science Technical Reports
No abstract provided.
Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian
Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian
Department of Computer Science Technical Reports
No abstract provided.
The Shilp Solid Modeling And Display Toolkit A User's Manual, Vinod Anupam, Chanderjit Bajaj, Steven Klinkner
The Shilp Solid Modeling And Display Toolkit A User's Manual, Vinod Anupam, Chanderjit Bajaj, Steven Klinkner
Department of Computer Science Technical Reports
No abstract provided.
A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek
A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek
Department of Computer Science Technical Reports
No abstract provided.
Computer Viruses--A Form Of Artificial Life?, Eugene H. Spafford
Computer Viruses--A Form Of Artificial Life?, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Loop Coalescing And Scheduling For Barrier Mimd Architectures, Matthew T. O'Keefe, Henry G. Dietz
Loop Coalescing And Scheduling For Barrier Mimd Architectures, Matthew T. O'Keefe, Henry G. Dietz
Department of Electrical and Computer Engineering Technical Reports
Barrier MIMDs are asynchronous Multiple Instruction stream Multiple Data stream architectures capable of parallel execution of variable execution time instructions and arbitrary control flow (e.g., while loops and calls); however, they differ from conventional MlMDs in that the need for run-time synchronization is significantly reduced. This work considers the problem of scheduling nested loop structures on a barrier MIMD. The basic approach employs loop coalescing, a technique for transforming a multiply-nested loop into a single loop. Loop coalescing is extended to nested triangular loops, in which inner loop bounds are functions of outer loop indices. Also, a more efficient scheme …
Adaptive Control Of Flexible Joint Robots Derived From Arm Energy Considerations, Shaheen Ahmad, Fouad Mrad
Adaptive Control Of Flexible Joint Robots Derived From Arm Energy Considerations, Shaheen Ahmad, Fouad Mrad
Department of Electrical and Computer Engineering Technical Reports
Almost all industrial robots exhibit joint flexibility due to mechanical compliance of their gear boxes. In this paper we outline the design of three controllers for flexible joint robots. Two of the three controllers are suitable for parameter adaptation, the candidate Lyapunov functions for these two controllers are derived from arm energy considerations. The desired actuator trajectory in a flexible joint robot is dependent not only on the desired kinematic trajectory of the link but also on the link dynamics. Unfortunately, link dynamic parameters are unknown in most cases, as a result the desired actuator trajectory is also unknown: To …
Hierarchical Classification In High Dimensional, Numerous Class Cases, Byungyong Kim, D. A. Landgrebe
Hierarchical Classification In High Dimensional, Numerous Class Cases, Byungyong Kim, D. A. Landgrebe
Department of Electrical and Computer Engineering Technical Reports
As progress in new sensor technology continues, increasingly high resolution imaging sensors are being developed. HIRIS, the High Resolution Imaging Spectrometer, for example, will gather data simultaneously in 102 spectral bands in the 0.4 - 2.5 micrometer wavelength region at 30 m spatial resolution. AVIRIS, the Airborne Visible and Infrared Imaging Spectrometer, covers the 0.4 - 2.5 micrometer in 224 spectral bands. These sensors give more detailed and complex data for each picture element and greatly increase the dimensionality of data over past systems. In applying pattern recognition methods to remote sensing problems, an inherent limitation is that there is …
A Lower Bound On Embedding Large Hypercubes Into Small Hypercubes, Ajay K. Gupta, Alfred J. Boals, Naveed A. Sherwani, Susanne E. Hambrusch
A Lower Bound On Embedding Large Hypercubes Into Small Hypercubes, Ajay K. Gupta, Alfred J. Boals, Naveed A. Sherwani, Susanne E. Hambrusch
Department of Computer Science Technical Reports
No abstract provided.
Sensor Array Signal Processing Via Eigenanalysis Of Matrix Pencils Composed Of Data Derived From Translationally Invariant Subarrays, Demosthenis Stavrinides, Michael D. Zoltowski
Sensor Array Signal Processing Via Eigenanalysis Of Matrix Pencils Composed Of Data Derived From Translationally Invariant Subarrays, Demosthenis Stavrinides, Michael D. Zoltowski
Department of Electrical and Computer Engineering Technical Reports
An algorithm is developed for estimating characteristic parameters associated with a "scene" of radiating sources given the data derived from a pair of translationally invariant arrays, the X and Y arrays, which are displaced relative to one another. The algorithm is referred to as PR O—E SPRIT and is predicated on invoking two recent mathematical developments: (1) the SVD based solution to the Procrustes problem of optimally approximating an invariant subspace rotation and (2) the Total Least Squares method for perturbing each of the two estimates of a common subspace in a "minimal" fashion until the two perturbed spaces are …
Optimal Code Scheduling For Multiple Pipeline Processors, Ashar Nisar, Hank Dietz
Optimal Code Scheduling For Multiple Pipeline Processors, Ashar Nisar, Hank Dietz
Department of Electrical and Computer Engineering Technical Reports
Pipelining the functional units and memory interface of processors can result in shorter cycle times and dramatic increases in performance, but only if the pipeline delays can be hidden by other useful operations. The portion of pipeline delays which is not hidden results in an extension of the total execution time, either implemented by hardware interlocks or by compile-time insertion of NOPs (Null Operations). By rearranging instructions, it is possible to minimize the total pipelined execution time, but the problem of finding this optimal code schedule is well known to be NP-complete. In this thesis, we describe a code scheduler …
Importance Sampling Simulation Of The Stack Algorithm With Application To Sequential Decoding, Khaled Ben Letaief
Importance Sampling Simulation Of The Stack Algorithm With Application To Sequential Decoding, Khaled Ben Letaief
Department of Electrical and Computer Engineering Technical Reports
Importance sampling is a Monte Carlo variance reduction technique which in many applications has resulted in a significant reduction in computational cost required to obtain accurate Monte Carlo estimates. The basic idea is to generate the random inputs using a biased simulation distribution. That is, one that differs from the true underlying probability model. Simulation data is then weighted by an appropriate likelihood ratio in order to obtain an unbiased estimate of the desired parameter. This thesis presents new importance sampling techniques for the simulation of systems that employ the stack algorithm. The stack algorithm is primarily used in digital …
Directory Based Cache Coherency Protocols For Shared Memory Multiprocessors, Craig Warner
Directory Based Cache Coherency Protocols For Shared Memory Multiprocessors, Craig Warner
Department of Electrical and Computer Engineering Technical Reports
Directory based cache coherency protocols can be used to build large scale, weakly ordered, shared memory multiprocessors. The salient feature of these protocols is that they are interconnection network independent, making them more scaleable than snoopy bus protocols. The major criticisms of previously defined directory protocols point to the size of memory heeded to store the directory and the amount of communication across the interconnection network required to maintain coherence. This thesis tries solving these problems by changing the entry format of the global table, altering the architecture of the global table, and developing new protocols. Some alternative directory entry …
Building Solid Models From Polygonal Data, George Vanecek
Building Solid Models From Polygonal Data, George Vanecek
Department of Computer Science Technical Reports
No abstract provided.
The Structure Of Parallel Sparse Matrix Algorithms For Solving Partial Differential Equations On Hypercubes, Mo Mu, John R. Rice
The Structure Of Parallel Sparse Matrix Algorithms For Solving Partial Differential Equations On Hypercubes, Mo Mu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A New Design For Distributed Systems: The Remote Memory Model, Douglas E. Comer, James Griffioen
A New Design For Distributed Systems: The Remote Memory Model, Douglas E. Comer, James Griffioen
Department of Computer Science Technical Reports
No abstract provided.
Information Systems And The Erosion Of Personal Privacy, Scott D. Sterner
Information Systems And The Erosion Of Personal Privacy, Scott D. Sterner
Department of Computer Science Technical Reports
No abstract provided.
Adaptability Experiments In The Raid Distributed Database System, Bharat Bhargava, Karl Friesen, Abdelsalam Helal, John Riedl
Adaptability Experiments In The Raid Distributed Database System, Bharat Bhargava, Karl Friesen, Abdelsalam Helal, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Time-Optimal And Conflict-Free Mappings Of Uniform Dependence Algorithms Into Lower Dimensional Processor Arrays, Weijia Shang, Jose A. B. Fortes
Time-Optimal And Conflict-Free Mappings Of Uniform Dependence Algorithms Into Lower Dimensional Processor Arrays, Weijia Shang, Jose A. B. Fortes
Department of Electrical and Computer Engineering Technical Reports
Most existing methods of mapping algorithms into processor arrays are restricted to the case where n-dimensional algorithms or algorithms with n nested loops are mapped into (n—l)-dimensional arrays. However, in practice, it is interesting to map n-dimensional algorithms into (k —l)-dimensional arrays where k<.n. For example, many algorithms at bit-level are at least 4-dimensional (matrix multiplication, convolution, LU decomposition, etc.) and most existing bit level processor arrays are 2-dimensional. A computational conflict occurs if two or more computations of an algorithm are mapped into the same processor and the same execution time. In this paper, necessary and sufficient conditions are derived to identify all mappings without computational conflicts, based on the Hermite normal form of the mapping matrix. These conditions are used to propose methods of mapping any n-dimensional algorithm into (k— l)-dimensional arrays, kn—3, optimality of the mapping is guaranteed.
User's Guide For The Nihongo Tutorial System, Kei Wai Leung, Anthony A. Maciejewski
User's Guide For The Nihongo Tutorial System, Kei Wai Leung, Anthony A. Maciejewski
Department of Electrical and Computer Engineering Technical Reports
No abstract provided.
Source Code For The Nihongo Tutor, Kei Wai Leung, Anthony A. Maciejewski
Source Code For The Nihongo Tutor, Kei Wai Leung, Anthony A. Maciejewski
Department of Electrical and Computer Engineering Technical Reports
This document contains a listing of the Pascal source code for the Nihongo Tutor program. This code is designed to be executed on Macintosh computers under the Kanjitalk operating system. It was written by Kei Wai Leung under the supervision of Anthony A. Maciejewski as part of the Nihongo Tutorial System, a set of programs designed to assist scientists and engineers acquire a reading knowledge of technical Japanese. As this is an ongoing project, portions of this code are under revision. This project is funded by the National Science Foundation under Grant No. INT-8818039. The government has certain rights in …
Technical Specifications Of The Nihongo Tutorial System, Kei Wai Leung, Anthony A. Maciejewski
Technical Specifications Of The Nihongo Tutorial System, Kei Wai Leung, Anthony A. Maciejewski
Department of Electrical and Computer Engineering Technical Reports
The Nihongo tutorial system presented here is an intelligent tutorial system designed to use a computer to assist scientists and engineers in developing reading competence in technical Japanese. It is comprised of three applications: the Nihongo Tutor, the Parse Tree Editor and the Administrator. The Nihongo Tutor provides useful information about an article such as an English translation, syntax, and pronunciation to help the student to comprehend the text of a personalized lesson. It also records the student's performance into his personal database which reflects his current Japanese language proficiency. The Administrator uses the personal data of a student to …
Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid
Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid
Department of Computer Science Technical Reports
No abstract provided.
Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim
Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim
Department of Computer Science Technical Reports
No abstract provided.
Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du
Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du
Department of Computer Science Technical Reports
No abstract provided.
Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz
Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz
Department of Computer Science Technical Reports
No abstract provided.
A Multidatabase Transaction Model For Interbase, Ahmed Elmagarmid, Y. Leu, W. Litwin, Marek Rusinkiewicz
A Multidatabase Transaction Model For Interbase, Ahmed Elmagarmid, Y. Leu, W. Litwin, Marek Rusinkiewicz
Department of Computer Science Technical Reports
No abstract provided.