Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Social and Behavioral Sciences (4293)
- Library and Information Science (2648)
- Arts and Humanities (1725)
- Engineering (1392)
- Physical Sciences and Mathematics (1211)
-
- Education (1120)
- Computer Sciences (1010)
- Comparative Literature (1005)
- Communication (854)
- Critical and Cultural Studies (594)
- Civil and Environmental Engineering (512)
- Rhetoric and Composition (425)
- Feminist, Gender, and Sexuality Studies (347)
- American Studies (340)
- Business (333)
- Film and Media Studies (333)
- Civil Engineering (332)
- Reading and Language (329)
- European Languages and Societies (313)
- Psychology (313)
- Other Arts and Humanities (306)
- Life Sciences (296)
- Theatre and Performance Studies (284)
- Medicine and Health Sciences (281)
- Other Film and Media Studies (275)
- Television (264)
- Political Science (228)
- Sociology (224)
- Higher Education (191)
- English Language and Literature (186)
- Keyword
-
- Comparative literature (348)
- comparative literature (341)
- Comparative cultural studies (242)
- Applied sciences (238)
- comparative cultural studies (238)
-
- Education (140)
- Information literacy (108)
- Social sciences (108)
- Cultural studies (93)
- cultural studies (91)
- Media studies (82)
- media studies (81)
- Literary theory (75)
- literary theory (74)
- Problem-based learning (71)
- Communication and the arts (62)
- Sustainability (56)
- Assessment (55)
- Collaboration (54)
- Health and environmental sciences (52)
- Comparative humanities (50)
- Intercultural studies (50)
- comparative humanities (50)
- intercultural studies (50)
- Biological sciences (47)
- Engineering (45)
- Higher education (45)
- Psychology (45)
- Culture theory (43)
- culture theory (43)
- Publication Year
- Publication
-
- Against the Grain (1424)
- CLCWeb: Comparative Literature and Culture (1007)
- Department of Computer Science Technical Reports (858)
- Proceedings of the IATUL Conferences (854)
- Open Access Dissertations (778)
-
- Open Access Theses (690)
- Purdue Road School (661)
- The Writing Center Journal (576)
- Charleston Library Conference (545)
- JTRP Technical Reports (322)
- Department of Electrical and Computer Engineering Technical Reports (312)
- CIB Conferences (255)
- International Refrigeration and Air Conditioning Conference (233)
- Education and Culture (210)
- Global Business Languages (204)
- International Compressor Engineering Conference (203)
- Libraries Faculty and Staff Scholarship and Research (187)
- Interdisciplinary Journal of Problem-Based Learning (153)
- Department of Physics and Astronomy Faculty Publications (152)
- Purdue Journal of Service-Learning and International Engagement (146)
- The Journal of Purdue Undergraduate Research (146)
- Dismantling Bias Conference Series (145)
- Journal of Pre-College Engineering Education Research (J-PEER) (118)
- Artl@s Bulletin (104)
- Journal of Southeast Asian American Education and Advancement (103)
- International High Performance Buildings Conference (102)
- Libraries Faculty and Staff Presentations (84)
- Journal of Aviation Technology and Engineering (77)
- Journal of Rhetoric, Professional Communication, and Globalization (75)
- People and Animals: The International Journal of Research and Practice (68)
- Publication Type
Articles 12961 - 12990 of 13650
Full-Text Articles in Entire DC Network
Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski
Ultimate Characterizations Of The Burst Response Of An Interval Searching Algorithm, Philippe Jacquet, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Partitioning The Process Of Interaction: An Implementation, Balachander Krishnamurthy
Partitioning The Process Of Interaction: An Implementation, Balachander Krishnamurthy
Department of Computer Science Technical Reports
No abstract provided.
Partitioning The Process Of Interaction: An Abstract View, Balachander Krishnamurthy
Partitioning The Process Of Interaction: An Abstract View, Balachander Krishnamurthy
Department of Computer Science Technical Reports
No abstract provided.
Shells In An Interactive System, Balachander Krishnamurthy
Shells In An Interactive System, Balachander Krishnamurthy
Department of Computer Science Technical Reports
No abstract provided.
Raid Programmers's Manual, Bharat Bhargava
Raid Programmers's Manual, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
Supercomputing About Physical Objects, John R. Rice
Supercomputing About Physical Objects, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Basic Studies Of Iii-Iv High Efficiency Cell Components, Mark S. Lundstrom, M. R. Melloch, R. F. Pierret, Paul D. Demoulin, D. P. Rancour, C. S. Kyono
Basic Studies Of Iii-Iv High Efficiency Cell Components, Mark S. Lundstrom, M. R. Melloch, R. F. Pierret, Paul D. Demoulin, D. P. Rancour, C. S. Kyono
Department of Electrical and Computer Engineering Technical Reports
The objective of the project is to raise the understanding of dark current mechanisms in GaAs-related solar cells to a level comparable to that of silicon cells. Motivation for this work arises from the observation that much of the progress in crystalline silicon cell performance has occurred as a result of a very deep knowledge of the physics controlling the cell’s dark current. Based on this knowledge, new cell structures evolved to suppress dominant dark current mechanisms. A comparable level of knowledge of GaAs cell device physics does not yet exist, but will be essential if cell performance near the …
Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian
Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian
Department of Computer Science Technical Reports
No abstract provided.
A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski
A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice
Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Algorithms And Data Structures For An Expanded Family Of Matroid Intersection Problems, Greg N. Frederickson, Mandayam A. Srinivas
Algorithms And Data Structures For An Expanded Family Of Matroid Intersection Problems, Greg N. Frederickson, Mandayam A. Srinivas
Department of Computer Science Technical Reports
No abstract provided.
Efficient Scheduling Algorithms For Robot Inverse Dynamics Computation On A Multiprocessor System, C. L. Chen, C. S. G. Lee, S. H. E. Hou
Efficient Scheduling Algorithms For Robot Inverse Dynamics Computation On A Multiprocessor System, C. L. Chen, C. S. G. Lee, S. H. E. Hou
Department of Electrical and Computer Engineering Technical Reports
Robot manipulators are highly nonlinear systems and their motion control requires the computation of generalized forces/torques to drive all the joint motors at an adequate rate. This paper presents efficient scheduling algorithms for computing the robot inverse dynamics on a multiprocessor system. The problem of scheduling the inverse dynamics computation consisting of m computational modules to be executed on a multiprocessor system consisting of p identical homogeneous processors to achieve a minimum-scheduled length is known to be NP-complete. In order to achieve the minimum computation time, the Newton-Euler equations of motion are expressed in the homogeneous linear recurrence form which …
An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber
An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber
Department of Computer Science Technical Reports
No abstract provided.
An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo
An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo
Department of Computer Science Technical Reports
No abstract provided.
Concurrent Checkpointing And Recovery In Distributed Systems, Pei-Jyun Leu, Bharat Bhargava
Concurrent Checkpointing And Recovery In Distributed Systems, Pei-Jyun Leu, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
The Parse Programming Paradigm. Part I: Software Development Methodology. Part Ii: Software Development Support Tools, T. L. Casavant, Henry G. Dietz, P. C.-Y. Sheu, H. J. Siegel
The Parse Programming Paradigm. Part I: Software Development Methodology. Part Ii: Software Development Support Tools, T. L. Casavant, Henry G. Dietz, P. C.-Y. Sheu, H. J. Siegel
Department of Electrical and Computer Engineering Technical Reports
The programming methodology of PARSE (parallel software environment), a software environment being developed for reconfigurable non-shared memory parallel computers, is described. This environment will consist of an integrated collection of language interfaces, automatic and semi-automatic debugging and analysis tools, and operating system —all of which are made more flexible by the use of a knowledge-based implementation for the tools that make up PARSE. The programming paradigm supports the user freely choosing among three basic approaches /abstractions for programming a parallel machine: logic-based descriptive, sequential-control procedural, and parallel-control procedural programming. All of these result in efficient parallel execution. The current work …
A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl
A Model For Adaptable Concurrency Control, Bharat Bhargava, John Riedl
Department of Computer Science Technical Reports
No abstract provided.
Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin
Reachability Graphs And Invariants For Stochastic High Level Petri Nets, Jing Dong, Dan C. Marinescu, Chuang Lin
Department of Computer Science Technical Reports
No abstract provided.
An M/Sm/1 View Of A Token Ring Queue, Vernon J. Rego, Wojciech Szpankowski
An M/Sm/1 View Of A Token Ring Queue, Vernon J. Rego, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Non Homogeneous Parallel Computations I. Synchronization Analysis Of Parallel Algorithms, Dan C. Marinescu, John R. Rice
Non Homogeneous Parallel Computations I. Synchronization Analysis Of Parallel Algorithms, Dan C. Marinescu, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
On The Variance Of The External Path Length In A Binary Digital Trie, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
On The Variance Of The External Path Length In A Binary Digital Trie, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Efficient Parallel Algorithms And Vlsi Architectures For Manipulator Jacobian Computation, T. B. Yeung, C. S. G. Lee
Efficient Parallel Algorithms And Vlsi Architectures For Manipulator Jacobian Computation, T. B. Yeung, C. S. G. Lee
Department of Electrical and Computer Engineering Technical Reports
Real-time computations of manipulator Jacobian are examined for executing on uniprocessor computers, parallel computers, and VLSI pipelines. The characteristics of the Jacobian equations are found to be in the form of the first-order linear recurrence. The time lower bound of computing the first-order linear recurrence, and hence the Jacobian, is of order O(N) on uniprocessor computers, and of order O(log2N) on parallel SIMD computers, where TV is the number of degrees-of-freedom of the manipulator. The Generalized-^ method, which achieves the time lower bound on uniprocessor computers, is derived to compute the Jacobian at any desired reference coordinate frame A; from …
The Harmonic Impact Of Rectifiers Serviced By Scott And Leblanc Connected Transformers, William P. Butler
The Harmonic Impact Of Rectifiers Serviced By Scott And Leblanc Connected Transformers, William P. Butler
Department of Electrical and Computer Engineering Technical Reports
Conventional three-phase, six-pulse rectifiers produce harmonic currents which propagate into the ac power system from which they are supplied. A two-phase, four-pulse rectifier can be operated such that there are no ac harmonic currents generated. In this connection, although there is no harmonic impact, the three-phase load current is imbalanced. The operation of a line-commutated two-phase, four-pulse rectifer [rectifier] served by the Scott and LeBlanc three-phase to two-phase transformer connections is simulated using a digital computer program in this thesis. Several different methods of rectification for a two-phase bridge are simulated and their current waveforms analyzed for harmonic content and …
Triangulating A Polygon In Parallel, Michael T. Goodrich
Triangulating A Polygon In Parallel, Michael T. Goodrich
Department of Computer Science Technical Reports
No abstract provided.
On An Alternative Sum Useful In The Analysis Of Some Data Structures, Wojciech Szpankowski
On An Alternative Sum Useful In The Analysis Of Some Data Structures, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Decompositions Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Decompositions Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim
Department of Computer Science Technical Reports
No abstract provided.
Contour Tracking With Force Feedback, Shaheen Ahmad
Contour Tracking With Force Feedback, Shaheen Ahmad
Department of Electrical and Computer Engineering Technical Reports
In this paper we describe an algorithm to allow a manipulator to track a complex contour without having to teach or program any points on the contour. This is an important problem in many manufacturing situations, when a robot tool such as a deburring tool must follow a complex work piece contour. La such instances it is tedious to teach or program the manipulator to follow such contour additionally calibration of the manipulator or the workpart may be difficult. The algorithm we present has been experimentally demonstrated utilizing a force sensor, a five degree of freedom manipulator and a 68000 …
Distributed Systems Based Upon A Functional Communication Model With A Timed Token Protocol, Dan C. Marinescu
Distributed Systems Based Upon A Functional Communication Model With A Timed Token Protocol, Dan C. Marinescu
Department of Computer Science Technical Reports
No abstract provided.
Applying Ai Techniques To Program Optimization For Parallel Computers, Ko-Yang Wang, Dennis Gannon
Applying Ai Techniques To Program Optimization For Parallel Computers, Ko-Yang Wang, Dennis Gannon
Department of Computer Science Technical Reports
No abstract provided.
50 Years Of The Joint Highway Research Project (Jhrp), Harold L. Michael
50 Years Of The Joint Highway Research Project (Jhrp), Harold L. Michael
Purdue Road School
No abstract provided.