Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9042)
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (2694)
- Purdue University (2077)
-
- Old Dominion University (2018)
- Missouri University of Science and Technology (1926)
- University of Nebraska - Lincoln (1739)
- Edith Cowan University (1291)
- Air Force Institute of Technology (1278)
- University of Texas at El Paso (1198)
- Kennesaw State University (1163)
- Dartmouth College (1105)
- San Jose State University (1053)
- City University of New York (CUNY) (958)
- Embry-Riddle Aeronautical University (950)
- Washington University in St. Louis (830)
- Brigham Young University (823)
- Technological University Dublin (817)
- California Polytechnic State University, San Luis Obispo (788)
- Zayed University (677)
- University of Texas at Arlington (666)
- University for Business and Technology in Kosovo (637)
- Portland State University (625)
- Chulalongkorn University (618)
- Nova Southeastern University (577)
- New Jersey Institute of Technology (573)
- Syracuse University (532)
- University of Nebraska at Omaha (497)
- University of Central Florida (494)
- Keyword
-
- Machine learning (1675)
- Artificial intelligence (1031)
- Deep learning (1013)
- Machine Learning (778)
- Computer Science (719)
-
- Security (650)
- Cybersecurity (562)
- Artificial Intelligence (496)
- Deep Learning (453)
- Computer science (412)
- Privacy (410)
- Simulation (391)
- Technical Reports (390)
- UTEP Computer Science Department (389)
- Classification (378)
- Algorithms (358)
- Optimization (353)
- Computer vision (352)
- Neural networks (347)
- Data mining (337)
- AI (305)
- Natural language processing (294)
- Department of Computer Science and Engineering (291)
- Engineering (269)
- Education (267)
- Reinforcement learning (261)
- Cloud computing (256)
- Blockchain (255)
- College for Professional Studies (253)
- Software engineering (252)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8495)
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Theses and Dissertations (2734)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Computer Science Faculty Publications (938)
- Departmental Technical Reports (CS) (914)
- Computer Science Faculty Research & Creative Works (907)
- Master's Projects (859)
- Computer Science Technical Reports (772)
- The R Journal (708)
- All Computer Science and Engineering Research (683)
- All Works (675)
- Faculty Publications (663)
- C-Day Computing Showcase (653)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (618)
- Dissertations (573)
- Electronic Theses and Dissertations (567)
- Kno.e.sis Publications (542)
- Journal of Digital Forensics, Security and Law (536)
- CCAC Theses and Dissertations (512)
- Walden Dissertations and Doctoral Studies (469)
- Computer Science Faculty Publications and Presentations (404)
- Theses (404)
- USF Tampa Graduate Theses and Dissertations (398)
- Neutrosophic Systems with Applications (380)
- Computer Science and Engineering Theses - Archive (365)
- Browse all Theses and Dissertations (359)
- Computer Science: Faculty Publications (351)
- Publication Type
Articles 62971 - 63000 of 63328
Full-Text Articles in Entire DC Network
Ellpack 77 Contributor's Guide, John R. Rice
Ellpack 77 Contributor's Guide, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
The Effect On Accuracy Of The Placement Of Auxiliary Points In The Hodie Method For The Helmholtz Problem, Ronald F. Boisvert
The Effect On Accuracy Of The Placement Of Auxiliary Points In The Hodie Method For The Helmholtz Problem, Ronald F. Boisvert
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - June 1978, Wofford College Computer Center
Terminal Talk - The Wofford Connection - June 1978, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Qualitative Justification For A Measure Of Program Clarity, Ronald D. Gordon
A Qualitative Justification For A Measure Of Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
A Population Of Partial Differential Equations For Evaluating Methods, Elias N. Houstis, John R. Rice
A Population Of Partial Differential Equations For Evaluating Methods, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
An Experimental Design For The Computational Evaluation Of Elliptic Partial Differential Equations Solvers, Elias N. Houstis, John R. Rice
An Experimental Design For The Computational Evaluation Of Elliptic Partial Differential Equations Solvers, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
On Combinational Networks With Restricted Fan-Out, K. L. Kodandapani, Sharad C. Seth
On Combinational Networks With Restricted Fan-Out, K. L. Kodandapani, Sharad C. Seth
School of Computing: Faculty Publications
Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions.
1) Characterization of the class of fan-out-free functions: The characterization given is constructive in the sense that if a given function is fan-out free one obtains a fan-out-free network to realize it.
2) Counting the class of fan-out-free functions: After establishing a correspondence between a fan-out-free function and a normalized network realizing it, a series of formulas are developed to count distinct normal …
Measuring Improvements In Program Clarity, Ronald D. Gordon
Measuring Improvements In Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
Geometric Problems With Application To Hashing, Douglas E. Comer, Michael J. O'Donnell
Geometric Problems With Application To Hashing, Douglas E. Comer, Michael J. O'Donnell
Department of Computer Science Technical Reports
No abstract provided.
Measuring Improvements In Program Clarity, Ronald D. Gordon
Measuring Improvements In Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
Map: A Pascal Macro Preprocessor For Large Program Development, Douglas E. Comer
Map: A Pascal Macro Preprocessor For Large Program Development, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1978, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1978, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - January 1978, Wofford College Computer Center
Terminal Talk - The Wofford Connection - January 1978, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Technique To Calculate Complex Electromagnetic Fields By Using The Finite Element Method, Davood Asgharian
A Technique To Calculate Complex Electromagnetic Fields By Using The Finite Element Method, Davood Asgharian
Dissertations and Theses
A computer program based on Maxwell's equations is developed to calculate two-dimensional complex potentials by the Finite Element Method. This study offers a solution to a complex continuum problem by allowing a subdivision into a series of simple interrelated problems. The region of interest is divided into triangular elements. For each node in the grid, the Finite Element Method is used to set up an equation for the potential as a function of those of the surrounding nodes. All these equations are solved by the Gaussian Elimination Method. For increased accuracy this method requires a high degree of division of …
Generalized Connectors, Nicholas Pippenger
Generalized Connectors, Nicholas Pippenger
All HMC Faculty Publications and Research
An $n$-connector is an acyclic directed graph having $n$ inputs and $n$ outputs and satisfying the following condition: given any one-to-one correspondence between inputs and distinct outputs, there exists a set of vertex-disjoint paths that join each input to the corresponding output. It is known that the minimum possible number of edges in an $n$-connector lies between lower and upper bounds that are asymptotic to $3n\log _3 n$ and $6n\log _3 n$ respectively. A generalized $n$-connector satisfies the following stronger condition: given any one-to-many correspondence between inputs and disjoint sets of outputs, there exists a set of vertex-disjoint trees that …
Collocation - A Simple, Flexible And Efficient Method For Integral And Differential Equations, Elias N. Houstis
Collocation - A Simple, Flexible And Efficient Method For Integral And Differential Equations, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Structure Of The Information Base And Operations On The Entities In A System For Information Servicing Of Collectivities, Peter H. Barnev, Atanas Radenski
Structure Of The Information Base And Operations On The Entities In A System For Information Servicing Of Collectivities, Peter H. Barnev, Atanas Radenski
Mathematics, Physics, and Computer Science Faculty Articles and Research
This paper treats, from an user point of view, the structure of the entities in the information base (IB) of a System for information servicing of collectivities (SISC) as well as the operations on these entries.
Dialectics And Catastrophe, Martin Zwick
Dialectics And Catastrophe, Martin Zwick
Complex Systems Faculty Publications and Presentations
The three classical principles of Hegelian and Marxist dialectics, (1) the transformation of quantity into quality, (2) the unity and struggle of opposites, and (3) the negation of negation, can be modeled with the Catastrophe Theory of René Thom and E. C. Zeeman, especially with the ‘elementary catastrophes’ known as the cusp and the butterfly.
Quantum Measurement And Gödel's Proof, Martin Zwick
Quantum Measurement And Gödel's Proof, Martin Zwick
Complex Systems Faculty Publications and Presentations
The measurement problem in quantum mechanics has the character of a fundamental incompleteness within that theory similar to the incompleteness of axiomatic systems in mathematics, discovered and elaborated by Gödel and others. The difficulty of describing the measurement process by the time-dependent Schrodinger equation may reflect the limitations of formal language , and quantum theory may thus require a formalism consisting of two levels of description, one for the dynamics and one for measurement, levels whose relationship resembles that of a calculus and meta-calculus.
Ellpack Distribution Guide, Ronald F. Boisvert
Ellpack Distribution Guide, Ronald F. Boisvert
Department of Computer Science Technical Reports
No abstract provided.
The Complexity Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis
The Complexity Of Numerical Methods For Elliptic Partial Differential Equations, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Effects Of Updates On Optimality In Tries And Doubly-Chained Trees, Douglas E. Comer
Effects Of Updates On Optimality In Tries And Doubly-Chained Trees, Douglas E. Comer
Department of Computer Science Technical Reports
No abstract provided.
Further Validation Of An Error Hypothesis, Linda M. Ottenstein
Further Validation Of An Error Hypothesis, Linda M. Ottenstein
Department of Computer Science Technical Reports
No abstract provided.
Ua51/1/4 All About Us, Vol. 1 Special Edition, Wku Libraries
Ua51/1/4 All About Us, Vol. 1 Special Edition, Wku Libraries
WKU Administration Documents
Newsletter created by WKU Libraries as a communication device to relay information to faculty and staff in the Division of Library Services. This special edition contains instructions regarding the new microfiche catalog. This catalog listed full bibliographic descriptions of complete holdings of the libraries using all of the access entries found in a traditional library card catalog. A computer output microfiche is included with the newsletter.
Infem: An Inference-Finite Element Program For Flow Problems, B. Dendrou, Elias N. Houstis
Infem: An Inference-Finite Element Program For Flow Problems, B. Dendrou, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Computer Systems Modeling, Measurement And Evaluation: Project Report 1976-1977, Peter J. Denning, Saul Rosen, Herbert D. Schwetman
Computer Systems Modeling, Measurement And Evaluation: Project Report 1976-1977, Peter J. Denning, Saul Rosen, Herbert D. Schwetman
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - September 1977, Wofford College Computer Center
Terminal Talk - The Wofford Connection - September 1977, Wofford College Computer Center
Terminal Talk
No abstract provided.
A High Order Difference Method For Differential Equation, Robert E. Lynch, John R. Rice
A High Order Difference Method For Differential Equation, Robert E. Lynch, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Properties Of Ll-Regular Languages, David A. Poplawski
Properties Of Ll-Regular Languages, David A. Poplawski
Department of Computer Science Technical Reports
No abstract provided.
A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead
A Software Science Analysis Of The Writing Of A Technical Paper, M. H. Halstead
Department of Computer Science Technical Reports
No abstract provided.