Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (7312)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1458)
- Missouri University of Science and Technology (1371)
- Edith Cowan University (1173)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1105)
- University of Nebraska - Lincoln (1091)
- Dartmouth College (1022)
- San Jose State University (995)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (819)
- Brigham Young University (812)
- Technological University Dublin (791)
- Washington University in St. Louis (785)
- California Polytechnic State University, San Luis Obispo (732)
- Kennesaw State University (714)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (531)
- SelectedWorks (527)
- Western University (525)
- New Jersey Institute of Technology (516)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1342)
- Deep learning (801)
- Artificial intelligence (663)
- Machine Learning (652)
- Computer Science (637)
-
- Security (619)
- Computer science (434)
- Privacy (409)
- Cybersecurity (407)
- Simulation (379)
- Classification (369)
- Technical Reports (369)
- UTEP Computer Science Department (367)
- Data mining (351)
- Deep Learning (350)
- Algorithms (338)
- Optimization (337)
- Neural networks (308)
- Artificial Intelligence (299)
- Computer vision (290)
- Education (254)
- Software engineering (254)
- College for Professional Studies (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (237)
- School of Computer & Information Science (236)
- Visualization (236)
- Natural language processing (233)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6960)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2511)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (892)
- Master's Projects (845)
- Electronic Theses and Dissertations (738)
- Computer Science Faculty Publications (725)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (601)
- Faculty Publications (588)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (509)
- Dissertations (505)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (468)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (462)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Electronic Thesis and Dissertation Repository (334)
- Theses (334)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (318)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 58141 - 58170 of 58260
Full-Text Articles in Physical Sciences and Mathematics
Terminal Talk - The Wofford Connection - September 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - September 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - August 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - August 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
An Axiom System For The Weak Monadic Second Order Theory Of Two Successors, Dirk Siefkes
An Axiom System For The Weak Monadic Second Order Theory Of Two Successors, Dirk Siefkes
Department of Computer Science Technical Reports
No abstract provided.
A Simplex Algorithm - Gradient Projection Method For Nonlinear Programming, L. Duane Pyle
A Simplex Algorithm - Gradient Projection Method For Nonlinear Programming, L. Duane Pyle
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - June 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - June 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
Unsteady Flow Toward Partially Penetrating Artesian Wells, Y. H. Huang
Unsteady Flow Toward Partially Penetrating Artesian Wells, Y. H. Huang
KWRRI Research Reports
A numerical method programmed for a high-speed computer was developed for determining the drawdown around an artesian well. A salient feature of the program is that it can be used for both fully and partially penetrating wells in either infinite or finite aquifers. The method Involves the application of finite difference equations to the well-known heat equation using a graded network. A comparison of the finite difference solutions with those obtained from the close-form formulas of Muskat, Theis, and Hantush indicates the validity of the method. A comparison between the finite difference solutions and the drawdowns measured on a sand …
Terminal Talk - The Wofford Connection- May 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection- May 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Computerized Study Of Midpalatal Suture Expansion, Clelan G. Ehrler
A Computerized Study Of Midpalatal Suture Expansion, Clelan G. Ehrler
Loma Linda University Electronic Theses, Dissertations & Projects
An investigation has been conducted to consider the effects of midpalatal suture expansion on the cranial-facial complex. Nine patients were treated that had constricted maxillae. Data was obtained from frontal and lateral headplate radiographs which were taken at four intervals during treatment. The Rocky Mountain Data Systems diagnosis was utilized to interpret the radiographic data.
The data from the nine cases were averaged to obtain a composit [sic] change at each of the four times.
Examination of the lateral headplate data revealed that no permanent significant alteration occurred to the positions of the mandible or maxilla in a vertical or …
Terminal Talk - The Wofford Collection - March 1971, Wofford College Computer Center
Terminal Talk - The Wofford Collection - March 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection February 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection February 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - January 1971, Wofford College Computer Center
Terminal Talk - The Wofford Connection - January 1971, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Bayes Rule For The Symmetric Multiple Comparisons Problem, Aban Nawabi
A Bayes Rule For The Symmetric Multiple Comparisons Problem, Aban Nawabi
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Many procedures have been proposed for the symmetric multiple comparisons problem in recent years. These include a "protected" least significant difference procedure due to Fisher (FSD), a multiple range rule by Duncan, and HSD (honest significant difference) procedure by Tukey, and a procedure for testing all contrasts by Scheffe.
The tests which are mentioned above are either comparison-wise or experiment-wise approaches. The probability of Type I error is intended to be a for all comparisons made when an experiment-wise approach is used. Whereas, the probability of Type I error referred to each comparison is a comparison-wise approach. Both approaches can …
Bayesian Confidence Limits For The Reliability Of Mixed Exponential And Distribution-Free Cascade Subsystems, Melvin D. Springer, James K. Byers
Bayesian Confidence Limits For The Reliability Of Mixed Exponential And Distribution-Free Cascade Subsystems, Melvin D. Springer, James K. Byers
Computer Science Faculty Research & Creative Works
The problem treated here is the theoretical one of deriving exact Bayesian confidence intervals for the reliability of a system consisting of some independent cascade subsystems with exponential failure probability density functions (pdf) mixed with other independent cascade subsystems whose failure pdf's are unknown. The Mellin integral transform is used to derive the posterior pdf of the system reliability. The posterior cumulative distribution function (cdf) is then obtained in the usual manner by integrating the pdf, which serves the dual purpose of yielding system reliability confidence limits while at the same time providing a check on the derived pdf. A …
Computer Implemented Synthesis Of Multiple Level Combinational Networks, Alfredo Caldwell
Computer Implemented Synthesis Of Multiple Level Combinational Networks, Alfredo Caldwell
Masters Theses
The purpose of this investigation has been to implement, in the form of computer programs, two algorithms which are used in the synthesis of multiple level combinational networks. The algorithms implemented were devised by Professor Paul E. Wood, Jr., of M.I.T., and by Professor Eugene L. Lawler, of The University of Michigan. In the course of the investigation a more efficient way of implementing the two algorithms was discovered. The combined version of the algorithms takes advantage of the best features of the original algorithms.
In the synthesis of multiple level combinational networks minimal complexity is high desirable. The whole …
Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo
Some Results On The Distance Properties Of Convolutional Codes, Luther D. Rudolph, Alexander Miczo
Electrical Engineering and Computer Science - Technical Reports
Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes ìs derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes Ìs presented. Finally, an improved Gilbert bound for definite decoding is derived.
Numerical Analysis - Final Report, John R. Rice
Numerical Analysis - Final Report, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A One Pass Algorithm For Compiling Algol 68 Declarations, Victor B. Schneider
A One Pass Algorithm For Compiling Algol 68 Declarations, Victor B. Schneider
Department of Computer Science Technical Reports
No abstract provided.
On Maximally Parallel Schemata, Robert M. Keller
On Maximally Parallel Schemata, Robert M. Keller
All HMC Faculty Publications and Research
A model for parallel computation called a schema is presented. This model is similar to that presented in the recent work of Karp and Miller. Section 1 presents a description of the model, and some results on the characterization of computations within it. Section 2 summarizes some results on determinacy and equivalence. Section 3 presents a formalization of the property of maximal parallelism in schemata. Several alternate characterizations are shown to be equivalent for certain classes. Section 4 presents results on the complexity of a maximally parallel schema equivalent to a given schema.
On The Number Of Registers Needed To Evaluate Arithmetic Expressions, Victor Schneider
On The Number Of Registers Needed To Evaluate Arithmetic Expressions, Victor Schneider
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - August 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - August 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - July 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - July 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - May 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - May 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Terminal Talk - The Wofford Connection - March 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - March 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm
Electrical Engineering and Computer Science - Technical Reports
Formal parsing rules for programming languages often have machinery for recognizing identifiers, numerical constants, and other substrings whose internal structure is only marginally relevant to the language structure as a whole. In this note alphabets are introduced in which identifiers, constants, etc. are regarded as single symbols. An alphabet is thus constructed out of a finite set of characters, is identified as a regular language and a simple recognition algorithm is described, giving the language designer considerable latitude in his choice of alphabet.
A Note On "Axioms" For Computational Complexity And Computation Of Finite Functions, Paul R. Young
A Note On "Axioms" For Computational Complexity And Computation Of Finite Functions, Paul R. Young
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
Syntax-Directed Documentation For Pl360, Harlan D. Mills
Syntax-Directed Documentation For Pl360, Harlan D. Mills
The Harlan D. Mills Collection
No abstract provided.
Terminal Talk - The Wofford Connection - January 1970, Wofford College Computer Center
Terminal Talk - The Wofford Connection - January 1970, Wofford College Computer Center
Terminal Talk
No abstract provided.
A Special Studies Paper On The General Mathematics Requirements At Ouachita Baptist University, Linda Gamble
A Special Studies Paper On The General Mathematics Requirements At Ouachita Baptist University, Linda Gamble
Honors Theses
The object of this paper has been to study the opinions of graduates and present students about the required math hours (presently three hours) at Ouachita Baptist University. It has formerly been my opinion that this may be insufficient math background for many of our students going out seeking jobs. Many times the student, while still in college does not realize he may need more math but it may show up on graduate tests, in his occupational work, or personal matters such as income tax calculations, bookkeeping, or budgeting.
To compile the opinions of students on this subject a form …
A Special Studies Paper On Mathematics In Computer Programing, Linda Gamble
A Special Studies Paper On Mathematics In Computer Programing, Linda Gamble
Honors Theses
The profession of programing has existed for two decades or longer. Computer programing and the organization of computer analysis have gone beyond the reach of careful clerks with high school education. There is a growing demand for persons who are competent researchers, experienced in the use of multivariate methods, and skilled as computer users and programers. Mathematics and engineering predominate. The programer should have a knowledge of mathematics and a familiarity with computer hardware and must understand the content of the problem to be solved.