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)
- Dartmouth College (1022)
- San Jose State University (995)
- University of Nebraska - Lincoln (979)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (819)
- Technological University Dublin (791)
- Washington University in St. Louis (785)
- Brigham Young University (759)
- 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 (350)
- Deep Learning (350)
- Algorithms (337)
- Optimization (337)
- Neural networks (307)
- 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 58051 - 58080 of 58093
Full-Text Articles in Physical Sciences and Mathematics
Paul Feyerabend's Telegram, Rudolf Kaehr
Paul Feyerabend's Telegram, Rudolf Kaehr
Rudolf Kaehr
6-page telegram from Paul Feyerabend (London) to Rolf Kaehr (Westberlin) Telegram 1 I am ill. Please let the seminar continue in my absence. Inform Prof Landmann and Prof Huebner, cancel the hotel reservation and read the following final message to my class on tuesday 1pm: I am sorry that I cannot give what Telegram 2 would have been my last lecture to you. In this lecture I would have elaborated on Verons argument and would have tried to show that it also excludes consience, self expression, identification. Turning back to the empiricist methodology and demand for theoretical unification I would …
Planning Flood Control Measures By Digital Computer, James Norris Cline, L. Douglas James
Planning Flood Control Measures By Digital Computer, James Norris Cline, L. Douglas James
KWRRI Research Reports
The purpose of this study was to develop adequate guidelines whereby those interested in flood control planning would be able to apply a pair of digital computer programs known as the University of Kentucky Flood Control Planning Programs to ease the computational burden of evaluating specific flood control situations. Program II determines the economically optimum combination of channel improvement, land use restriction, and flood proofing for flood damage abatement. Program III also incorporates reservoir storage into the planning process. The Programs are not intended to provide a finished design but rather to select the optimum combination of flood control measures …
A Study Of Computers And Computer Programming, Janet Moffett
A Study Of Computers And Computer Programming, Janet Moffett
Honors Theses
Computers have become a great aid to scientists and businessmen. Their speed and accuracy had enabled much progress in many fields. Although computers are capable of many tasks, they are dependent upon the programmer and can only do what they are told to do. Computers are based on logical organization and act according to organized data.
There are many forms of input used by computers today. Some of the most common forms of input are by typewriter, punched cards, magnetic tape, punched paper taps, and console switches. The typewriter is usually used in accordance with other types of input media. …
Economic Analysis Of Flood Detention Storage By Digital Computer, James Ray Villines, L. Douglas James
Economic Analysis Of Flood Detention Storage By Digital Computer, James Ray Villines, L. Douglas James
KWRRI Research Reports
The objective of this study was to develop a digital computer procedure for preliminary analysis of the economic justification of reservoir detention storage for flood control and to present a sample study illustrating its application. A computer program called the University of Kentucky Flood Control Planning Program III was developed and tested on the flood plain of the South Fork of the Licking River in northeastern Kentucky.
Given a specified reservoir site and a downstream flood plain divided into planning units, Program III selects the economically efficient combination of reservoir detention storage and the associated combination of channel improvement, flood …
A Development Of Regression Models For Predicting Temperature, Salinity And Sound Velocity In Sea Water, Darwin Wayne Brown
A Development Of Regression Models For Predicting Temperature, Salinity And Sound Velocity In Sea Water, Darwin Wayne Brown
Masters Theses
"There are in existence today some reasonably good numerical procedures for predicting sound velocity, but these procedures require that certain initial data such as temperature and salinity be given before a sound velocity may be computed. Eliminating the need for on-location observations of temperature and salinity, which are used in computing sound velocity, was the primary objective of this study. Stepwise multiple regression was applied in the search for suitable models to predict temperature and salinity, and ultimately sound entirely in terms of controllable variables, such as latitude, longitude, depth, and day-of-year"--Abstract, page ii.
A Comparison Of Three Numerical Techniques Used For The Solution Of The Two-Point Boundary Value Problem, William Richard Krall
A Comparison Of Three Numerical Techniques Used For The Solution Of The Two-Point Boundary Value Problem, William Richard Krall
Masters Theses
"Three numerical approximation techniques, called the Initial step, Shooting, and Direct Finite Difference Techniques, respectively, are compared and discussed as they apply to the solution of both linear and non-linear boundary-value problems of the form y"=f(x,y,y') with endpoint conditions y(xo)=yo and y(xn)=yn. The techniques are compared with respect to speed and accuracy by comparing the solution of each problem considered four times, each time for a different increment value, and comparing the errors at four pivotal points chosen at equally spaced distances over the domain of the function, to give an indication of …
Solving Sequential Conditions By Finite State Strategies, J. Richard Buchi, Lawrence H. Landweber
Solving Sequential Conditions By Finite State Strategies, J. Richard Buchi, Lawrence H. Landweber
Department of Computer Science Technical Reports
No abstract provided.
Definability In The Monadic Second-Order Theory Of Successor, J. Richard Buchi, Lawrence H. Landweber
Definability In The Monadic Second-Order Theory Of Successor, J. Richard Buchi, Lawrence H. Landweber
Department of Computer Science Technical Reports
No abstract provided.
Problems Encountered With Control Networks In Highly-Restructurable Digital Systems, Donald F. Wann, Robert A. Ellis, Mishell J. Stucki, Robert M. Keller
Problems Encountered With Control Networks In Highly-Restructurable Digital Systems, Donald F. Wann, Robert A. Ellis, Mishell J. Stucki, Robert M. Keller
All HMC Faculty Publications and Research
This paper discusses problems encountered with control networks in highly restructurable digital systems. In particular the treatment of implementation errors is covered with emphasis on concurrent processing. The implementation of concurrent processing networks may result in errors which will be quite complex to detect and systematic methods are warranted. Four meta control elements are employed in obtaining convenient concurrent structures. We analyze several error detecting schemes and conclude that the arc-node method with node partitioning appears to be the most realistic approach at this time.
Structure Of A Language For A Numerical Analysis Problem Solving Systems, Lawrence R. Symes, Roger V. Roman
Structure Of A Language For A Numerical Analysis Problem Solving Systems, Lawrence R. Symes, Roger V. Roman
Department of Computer Science Technical Reports
No abstract provided.
The Generalized Inverse In Linear Programming: An Intersection Projection Method, L. Duane Pyle
The Generalized Inverse In Linear Programming: An Intersection Projection Method, L. Duane Pyle
Department of Computer Science Technical Reports
No abstract provided.
Air Force Rotc At The University Of Richmond, 1951-1957, Robert J. Dandridge
Air Force Rotc At The University Of Richmond, 1951-1957, Robert J. Dandridge
Honors Theses
In the summer of 1950, after the seriousness of the Korean conflict had become evident, a special committee appointed three years earlier by the Executive Committee of the Board of Trustees was reactivated for the purpose of considering "the feasibility of applying for a Reserve Office Training Corps unit" for the University of Richmond. This special committee, called the ROTC Committee, after thorough study, rendered a unanimous recommendation to the Board that a unit of Army ROTC be applied for. The application was completed and mailed to the Department of the Army. Approval of the application was not long in …
Rational Arithmetic As A Means Of Matrix Inversion, Jay Roland Peterson
Rational Arithmetic As A Means Of Matrix Inversion, Jay Roland Peterson
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
The solution to a set of simultaneous equations is of the form A-1 B = X where A-1 is the inverse of A in the equation AX= B. The purpose of this study is to obtain an exact A-1 through the use of rational arithmetic, and to study the behavior of rational numbers when used in arithmetic calculations.
This study describes a matrix inversion program written in SPS II, utilizing the concept of rational arithmetic. This program, using the Gaussian elimination matrix inversion method, is compared to the same method written in Fortran. Gaussian elimination …
Comparative Analysis Of Polynomial Root Finding Techniques, Charles Ray O'Daniel
Comparative Analysis Of Polynomial Root Finding Techniques, Charles Ray O'Daniel
Masters Theses
"The purpose of this study was to investigate and recommend various methods instrumental in finding the roots of a polynomial p(x) = 0. Many different methods are present today, and each has its advantages and disadvantages.
Through thorough investigation, the author has ascertained the key methods to be the method of Bisection, the Newton-Raphson method, and the Bairstow method. Special support in the form of algebraic theorems on the locations and kind of roots are extremely helpful. This combination of theorems and methods provides assurance, speed, and the ability to obtain complex roots.
The Bisnewbar method developed by this author …
The Memory Unit Of A Digital Computer, Bobby Ridgell
The Memory Unit Of A Digital Computer, Bobby Ridgell
Honors Theses
Since the development of the first modern digital computer in August 1944, the digital computer has become one of the most essential machines of the modern day. According to Edmund Berkeley and Lawrence Wainwright it is one of the two events by which the twentieth century will be remembered. This development has also led to what has been called the Second Industrial Revolution. That so much importance should be placed on one development is extraordinary, but the far reaching effects of the digital computer are also extraordinary.
Stable Predictor-Corrector Methods For First Order Ordinary Differential Equations, Terrell Lester Carlson
Stable Predictor-Corrector Methods For First Order Ordinary Differential Equations, Terrell Lester Carlson
Masters Theses
"Because of the wide variety of differential equations, there seems to be no numerical method which will affect the solution best for all problems. Predictor-corrector methods have been developed which utilize more ordinates in the predictor and corrector equations in the search for a better method.
These methods are compared for stability and convergence with the well known methods of Milne, Adams, and Hamming"--Abstract, page ii.
A Simulation Study Of A Proposed Computer Installation, John Edward Hawthorne
A Simulation Study Of A Proposed Computer Installation, John Edward Hawthorne
Masters Theses
"The operation of a data processing center has been studied with the objective of investigating the effect of various facilities, job loads, and operating policies as measured by job turnaround time. The mechanism for study was digital computer simulation.
This thesis purports to review the technology of simulation and the associated computer techniques, defines the problem and the alternatives available, and analyzes the results derived from the experiments.
Conclusions drawn from this study support the current practice of a functioning data processing center"--Abstract, page ii.
Comparative Analysis Of Numerical Integration Techniques, Edward Lee Sartore
Comparative Analysis Of Numerical Integration Techniques, Edward Lee Sartore
Masters Theses
"When integrating numerically, if the integrand can be expressed exactly as a polynomial of degree n, over a finite interval; then either Simpson's rule, Romberg integration, Legendre-Gauss or Jacobi-Gauss quadrature formulas provide good results. However, if the integrand can not be expressed exactly as an nth degree polynomial, then perhaps it can be expressed as a function f(x) divided by √1-x 2, or as a function g(x) times (1-x)α (l+x)ß , where α and ß are some real numbers >1, or as a function h(x) times one. If this is the case then the Chebyshev-Gauss, Jacobi-Gauss, and …
Economic Analysis Of Alternative Flood Control Measures By Digital Computer, Thomas M. Rachford
Economic Analysis Of Alternative Flood Control Measures By Digital Computer, Thomas M. Rachford
KWRRI Research Reports
The purpose of this project was to develop a digital computer program for selecting the optimum combination of flood proofing, flood-plain land use, channel improvement, and residual flood damage for a given floodplain. Based on economic efficiency, the optimum policy is selected for each planning unit of the total flood-plain for each period of time called a planning stage. The program was written in Fortran IV for the IBM 7040 and the University of Kentucky Computing Center compiler. The program requires about 23,000 words of core storage and about 30 seconds of execution time per planning-unit-stage for typical conditions. The …
Error Analysis Of Rational Approximations Of Functions With Emphasis On Minimax Techniques, Mary Frances Good
Error Analysis Of Rational Approximations Of Functions With Emphasis On Minimax Techniques, Mary Frances Good
Masters Theses
"This study examines the various considerations which are made when a function is approximated by a rational function. None of the four approximations considered here gives both a rapidly calculated approximation and one in which the maximum magnitude of the error function over a given interval is a minimum.
The second algorithm of Remes produces a sequence of rational approximations which converge to the rational approximation that minimizes the maximum magnitude of the error function for a given number of parameters to be calculated if the initial approximation in the sequence is chosen properly. Several rational function approximations are investigated …
A Study Of The Development Of A Heuristic Program That Solves Symbolic Laplace Transformation Problems, Arthur E. Zackrison
A Study Of The Development Of A Heuristic Program That Solves Symbolic Laplace Transformation Problems, Arthur E. Zackrison
Masters Theses
"A medium-speed general purpose digital computer (IBM 1620 Model II) was programmed to solve symbolic Laplace transformation problems. Although the applied mathematician and modern engineer has many uses for the symbolic solution of a problem, the potential of symbolic manipulation by a computer has not yet been sufficiently developed to help them because of many problems. This paper discusses the program and based on the author’s experience with it’s [sic] performance, clarifies the position of several of these difficulties and reaches some conclusions concerning computer solution of such problems"--Abstract, page ii.
A Comparison Of The Lr And Qr Transformations For Finding The Eigenvalues For Real Nonsymmetric Matrices, Susan Clara Hanson
A Comparison Of The Lr And Qr Transformations For Finding The Eigenvalues For Real Nonsymmetric Matrices, Susan Clara Hanson
Masters Theses
"The LR and QR algorithms, two of the best available iterative methods for finding the eigenvalues of a nonsymmetric matrix associated with a system of linear homogeneous equations, are studied. These algorithms are discussed as they apply to the determination of the eigenvalues of real nonsymmetric matrices.
A comparison of the speed and accuracy of these transformations is made. A detailed discussion of the criterion for convergence and the numerical difficulties which may occur in the computation of multiple and complex conjugate eigenvalues are included.
The results of this study indicate that the QR algorithm is the more successful method …
The Generalized Inverse In Linear Programming Basic Theory, L. Duane Pyle
The Generalized Inverse In Linear Programming Basic Theory, L. Duane Pyle
Department of Computer Science Technical Reports
No abstract provided.
Report On The Use Of An Ibm 1620 Computer By Carleton College Undergraduates, Donald H. Taranto
Report On The Use Of An Ibm 1620 Computer By Carleton College Undergraduates, Donald H. Taranto
Journal of the Minnesota Academy of Science
There are two primary sources of computer activity among Carleton students: course work and independent study. In many instances we have found that not only has the student learned something about programming and the use of computers from one of these activities, but also a great deal about the subject matter that motivated the computing. In this respect, the computer is an excellent pedagogic device.
In the following outline of our student computer work, I have merely named the computer problems originating in courses but have described more fully some of the work arising from independent study. The 1620 Users …
Near Optimal Sequencing :N Jobs And M Machines; All Jobs To Be Processed Through The Same Order Of Machines, Larry Glen Clark
Near Optimal Sequencing :N Jobs And M Machines; All Jobs To Be Processed Through The Same Order Of Machines, Larry Glen Clark
Masters Theses
"There is a need, in industry, for an efficient method of determining an optimal sequence for processing a number of jobs through two or more machines. A method which requires a minimum amount of time would be most beneficial. The purpose of this study has been to define such a method. Tests on the method described indicate that although an optimal solution is not always obtained, the solutions obtained are quite good and due to the time factor the method would be beneficial to industry"--Abstract, page ii.
A Parameter Perturbation Technique Applied To Multipoint Iteration Functions For The Solution Of Systems Of Nonlinear Equations, Robert N. Delozier
A Parameter Perturbation Technique Applied To Multipoint Iteration Functions For The Solution Of Systems Of Nonlinear Equations, Robert N. Delozier
Masters Theses
"The convergence of classical iterative procedures, when applied to a system of nonlinear algebraic or transcendental equations, is highly dependent upon a good initial approximation to the desired roots. Most of the classical iterative schemes have convergence factors between one and two. In this paper iterative schemes of order two and greater are studied in connection with a parameter perturbation process. The parameter perturbation process relaxes the restrictions on the choice of initial values. The procedure divides each problem into a number of subsidiary problems. Each subsidiary system of equations is then solved until a solution is found to the …
Ua11/2 Press Release - Ibm Program Panels, Wku Public Relations
Ua11/2 Press Release - Ibm Program Panels, Wku Public Relations
WKU Administration Documents
Press release regarding the acquisition of IBM program panels for the WKU mainframe computer.
Grade Herd Recording, 1963-64, Maurice C. Cullity
Grade Herd Recording, 1963-64, Maurice C. Cullity
Journal of the Department of Agriculture, Western Australia, Series 4
A review of Grade Herd Recording during the 1963-64 season.
THERE was a substantial increase in the number of cows which were recorded in 1963-64 compared with 1962-63 (23,520 and 22,635 respectively).
This season's figure represents 20.4 per cent, of all cows in the dairying districts.
The number of cows which completed lactation and therefore whose yields were included in the averages, rose from 17,258 to 19,011.
On The Definition Of Self-Organizing Systems, George G. Lendaris
On The Definition Of Self-Organizing Systems, George G. Lendaris
Systems Science Faculty Publications and Presentations
Published in: Proceedings of the IEEE ( Volume: 52, Issue: 3, March 1964)
A Stochastic Model For Programming The Supply Of A Strategic Material, Herman Karreman
A Stochastic Model For Programming The Supply Of A Strategic Material, Herman Karreman
About Harlan D. Mills
No abstract provided.