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 (7242)
- 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 (1360)
- Edith Cowan University (1172)
- 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 (792)
- 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 (529)
- SelectedWorks (527)
- Western University (525)
- New Jersey Institute of Technology (516)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1337)
- Deep learning (800)
- Artificial intelligence (657)
- Machine Learning (650)
- Computer Science (637)
-
- Security (618)
- Computer science (434)
- Privacy (409)
- Cybersecurity (407)
- Simulation (379)
- Technical Reports (369)
- Classification (368)
- UTEP Computer Science Department (367)
- Deep Learning (349)
- Data mining (348)
- Algorithms (337)
- Optimization (337)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (290)
- Software engineering (254)
- College for Professional Studies (253)
- Education (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (236)
- School of Computer & Information Science (236)
- Visualization (236)
- Natural language processing (232)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6890)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2498)
- 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 (595)
- Faculty Publications (588)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (507)
- Dissertations (505)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (468)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- 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 54421 - 54450 of 57994
Full-Text Articles in Physical Sciences and Mathematics
Fault Tolerance In Critical Real-Time Systems, Balaji Tirukarneswaran
Fault Tolerance In Critical Real-Time Systems, Balaji Tirukarneswaran
Electrical & Computer Engineering Theses & Dissertations
Critical real-time applications require work to be completed before a predefined deadline, else the consequences may be catastrophic. The anticipation of faults in such systems necessitates the need for fault tolerance. Fault tolerance can be achieved in many different ways. A real-time system designer may impose restrictions on any of the system performance measures such as the latency, throughput and number of processors, depending on the type of application. In this work, several different fault tolerant strategies for any given DFG (Data Flow Graph) are discussed. DFG models are developed using the strategies and the resulting worst case performances a.re …
Frequency Computation And Bounded Queries (Conference Paper), William I. Gasarch, Efim Kinber
Frequency Computation And Bounded Queries (Conference Paper), William I. Gasarch, Efim Kinber
School of Computer Science & Engineering Faculty Publications
There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: FaA(x1, …, xa)=A(x1)···A(xa). We are interested in the complexity (in terms of the number of queries) of approximating FaA. Let b⩽a and let f be any function such that FaA(x1, …, x a) and f(x1, …, xa) agree on at least b bits. For a general set A we have matching upper and lower bounds that depend on coding theory. These are applied …
Deciding Finiteness For Matrix Groups Over Function Fields, Robert Beals, Daniel N. Rockmore, Ki-Seng Tan
Deciding Finiteness For Matrix Groups Over Function Fields, Robert Beals, Daniel N. Rockmore, Ki-Seng Tan
Computer Science Technical Reports
Let S be any finite subset GLn(F(t)) where F is a field. In this paper we give algorithms to decide if the group generated by S is finite. In the case of characteristic zero, slight modifications of earlier work of Babai, Beals and Rockmore [1] give polynomial time deterministic algorithms to solve this problem. The case of positive characteristic turns out to be more subtle and our algorithms depend on a structure theorem proved here, generalizing a theorem of Weil. We also present a fairly detailed analysis of the size of finite subgroups in this case and give bounds which …
A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman
A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman
Dartmouth College Undergraduate Theses
No abstract provided.
Simulation Of A Video-On-Demand System, Song Bac Toh
Simulation Of A Video-On-Demand System, Song Bac Toh
Dartmouth College Undergraduate Theses
This paper presents a simulation study of a video-on-demand system. The focus of the study is the effectiveness of different caching strategies on a video-on-demand system with two levels of cache, RAM and disks, in front of a tape library. Using an event-driven simulator, I show that caching was helpful in increasing the service capacity of the system. On-demand caching showed its advantages especially when the requests were clustered around a few popular titles (in other words, there was temporal locality).
Tias: A Transportable Intelligent Agent System, Kenneth Harker
Tias: A Transportable Intelligent Agent System, Kenneth Harker
Dartmouth College Undergraduate Theses
In recent years, there has been an explosive growth in the amount of information available to our society. In particular, the amount of information available on-line through vast networks like the global Internet has been growing at a staggering rate. This growth rate has by far exceeded the rate of growth in network speeds, as has the number of individuals and organizations seeking access to this information. There is thus a motivation to find abstract methods of manipulating this on-line data in ways that both serve the needs of end users efficiently and use network resources intelligently. In lieu of …
Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow
Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow
ACMS Conference Proceedings 1995
In recent years, research studies have shown that control decisions and processes, beliefs about the nature of mathematics, attitudes, and other affective variables have enormous impact on the mathematical performance of students. This paper gives an overview of the research on mathematical beliefs and reviews some work done in Christian education relating to theological beliefs. It then compares the two.
Using Data To Develop Mathematical Methods, Philip R. Carlson
Using Data To Develop Mathematical Methods, Philip R. Carlson
ACMS Conference Proceedings 1995
An analysis of ordered pairs and their scatter plots leads to interesting questions related to mathematical modeling. Some statistical methods suggest ways to approach this analysis of the ordered pairs. Both high school and college methods are illustrated in this paper.
The Intermediate Value Theorem, Dale Varberg
The Intermediate Value Theorem, Dale Varberg
ACMS Conference Proceedings 1995
The Intermediate Value Theorem (a continuous function on an interval assumes all values between any two of its values) is one of the big theorems of calculus. Yet the theorem is absent or briefly mentioned in most calculus textbooks. The theorem deserves better as we intend to show by listing ten picturesque consequences that we think could enliven any calculus course.
What Does A Computer Program Mean? An Introduction To Denotational Semantics, Gene B. Chase
What Does A Computer Program Mean? An Introduction To Denotational Semantics, Gene B. Chase
ACMS Conference Proceedings 1995
This paper is for mathematicians who are curious about how topology is being used to prove computer programs correct. Those advanced parts have been limited to Sections III, V, and VI, and they are marked by a [clock symbol]. By contrast, sections II, IV, and VII are suitable as a companion to existing textbooks in a Computer Science course such as Organization of Programming Languages, the course CS 8 as described in Curriculum [1979]. Perhaps in a first reading you might read just those sections.
Among many books and articles on the semantics, or meaning, of computer languages, …
Statistics, Mathematics, And Teaching, David S. Moore
Statistics, Mathematics, And Teaching, David S. Moore
ACMS Conference Proceedings 1995
In discussing our teaching, we may focus on content, what we want our students to learn, or on pedagogy, what we do to help them learn. These two topics are of course related. In particular, changes in pedagogy are often driven in part by changing priorities for what kinds of things we want students to learn. It is nonetheless convenient to address content and pedagogy separately. Pedagogy, certainly the less specific of the two, is the topic of my second paper. This paper concerns content, and in particular contains one side of a conversation between a statistician and mathematicians …
Constructivism, Mathematics Education And Christianity, Ted Watanabe
Constructivism, Mathematics Education And Christianity, Ted Watanabe
ACMS Conference Proceedings 1995
In this paper, I briefly describe what constructivism is and its implications in the field of mathematics education. I will then discuss what this epistemology may mean to Christians who are in the field of mathematics education
The 25 Greatest Mathematicians, Robert Brabenec
The 25 Greatest Mathematicians, Robert Brabenec
ACMS Conference Proceedings 1995
Many have tried to determine the greatest mathematicians in history. The purpose of this paper is to consider making such a list, along with some criteria to consider in making a rank order of these mathematicians.
Experimenting With The Calculus Laboratory Setting, Glen Van Brummelen
Experimenting With The Calculus Laboratory Setting, Glen Van Brummelen
ACMS Conference Proceedings 1995
Reform of post-secondary mathematics education, particularly introductory calculus, is becoming commonplace across North America. Although there are many varieties of reform, most can be placed within the philosophical camp of social constructivism. According to this movement, mathematical knowledge is constructed in an interactive way through instructor-student and inter-student dialogue, rather than built in an axiomatic sense such as the "new math" of 20 years ago, or in the reductionistic, algorithmic sense dominant in secondary and introductory college mathematics. While I hold serious concerns about the relativizing of mathematical knowledge that occurs when social constructivism is adopted as a philosophy of …
Improving The Teaching Of Mathematics, David S. Moore
Improving The Teaching Of Mathematics, David S. Moore
ACMS Conference Proceedings 1995
No one concerned about the teaching of college mathematics--and few mathematicians who are not concerned--can have missed the movement to reform teaching in the mathematical sciences at all levels. The teaching of any active branch of knowledge, like the church, is of course "reforming and ever to be reformed." Calls to modernize what we offer students are always with us. What is striking about the current reform movement is not only its momentum but the fact that it centers on pedagogy rather than on content. We ought, say the reformers, to radically alter our style of teaching. My purpose in …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 6, June 1995, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 6, June 1995, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Dqdbsim User's Manual, Lewis Barnett Iii
Dqdbsim User's Manual, Lewis Barnett Iii
Department of Math & Statistics Technical Report Series
DQDBsim is a simulation program for the study of the performance of the Distributed Queue Dual Bus (DQDB) Metropolitan Area Network. The simulation is based on the description of DQDB found in [Ins90]. Only the Queued Arbitrated (QA) service is modeled by DQDBsim the inclusion of Prearbitrated (PA) service is under consideration for inclusion in a future release. This document contains a description of the program instructions for its use details of the formats of input and data files and information on other programs that are used cooperatively with DQDBsim.
Parallel Ellpack Elliptic Pde Solvers, Elias N. Houstis, S. B. Kim, S. Markus, P. Wu, N. E. Houstis, S. Weerawarana
Parallel Ellpack Elliptic Pde Solvers, Elias N. Houstis, S. B. Kim, S. Markus, P. Wu, N. E. Houstis, S. Weerawarana
Department of Computer Science Technical Reports
No abstract provided.
Neural And Neuro-Fuzzy Approaches To Support ``Intelligent'' Scientific Problem Solving, Anupam Joshi, Sanjiva Weerawarana, Narendran Ramakrishnan, Elias N. Houstis, John R. Rice
Neural And Neuro-Fuzzy Approaches To Support ``Intelligent'' Scientific Problem Solving, Anupam Joshi, Sanjiva Weerawarana, Narendran Ramakrishnan, Elias N. Houstis, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
//Ellpack: A System For Simulating Partial Differential Equations, Sanjiva Weerawarana, Elias N. Houstis, Ann C. Catlin, John R. Rice
//Ellpack: A System For Simulating Partial Differential Equations, Sanjiva Weerawarana, Elias N. Houstis, Ann C. Catlin, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
On Learning And Adaptation In Multiagent Systems: A Scientific Computing Perspective, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis
On Learning And Adaptation In Multiagent Systems: A Scientific Computing Perspective, Anupam Joshi, Tzvetan Drashansky, John R. Rice, Sanjiva Weerawarana, Elias N. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Pythia: A Knowledge Based System For Intelligent Scientific Computing, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Anupam Joshi, Catherine E. Houstis
Pythia: A Knowledge Based System For Intelligent Scientific Computing, Sanjiva Weerawarana, Elias N. Houstis, John R. Rice, Anupam Joshi, Catherine E. Houstis
Department of Computer Science Technical Reports
No abstract provided.
Introduction (1995), David L. Neuhouser
Introduction (1995), David L. Neuhouser
ACMS Conference Proceedings 1995
Tenth ACMS Conference on Mathematics from a Christian Perspective
Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White
Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White
School of Computing: Faculty Publications
In this paper, we discuss gigabit network applications enabled by "Mission to Planet Earth," an international effort to monitor the Earth as a system. We describe the design of a network architecture to support applications developed as part of this program; introduce a new component, public access resource centers (PARC9s); and discuss how PARC's would facilitate access by users outside the traditional research community. We also describe how a particular class of users, agriculture users, might to Planet Earth program and delivered in a value-added form to them by a so-called AgPARC. The suggested architecture requires the deployment of high-bandwidth …
The Forward-Backward Asymmetry For Charm Quarks At The Z Pole, D. Buskulic, Manoj Thulasidas
The Forward-Backward Asymmetry For Charm Quarks At The Z Pole, D. Buskulic, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
From 1.4 million hadronic Z decays collected by the ALEPH detector at LEP, an enriched sample of Z → cc̄ events is extracted by requiring the presence of a high momentum D∗±. The charm quark forward-backward charge asymmetry at the Z pole is measured to be AFB0.c = (8.0 ± 2.4) % corresponding to an effective electroweak mixing angle of sin2θWeff = 0.2302 ± 0.0054.
Biomedical Data Interpolation For 3-D Visualization, Ming-Chung Chen
Biomedical Data Interpolation For 3-D Visualization, Ming-Chung Chen
Theses and Dissertations
Medical imaging devices that produce three-dimensional data usually produce the data in the form of image slices. In such images, the resolution in z direction is lower than in x and y directions. Before extracting and displaying objects in such images, an interpolated 3-D gray-scale volume image can be generated via image interpolation techniques to fill in the missing information. The subject of this thesis is the applying three different interpolation techniques to generate intermediate slices and comparing their qualities. The three interpolation techniques are linear interpolation, cubic spline interpolation, and Fourier interpolation. We also apply the CT image matching …
The Mathematics Of Measuring Capabilities Of Artificial Neural Networks, Martha A. Carter
The Mathematics Of Measuring Capabilities Of Artificial Neural Networks, Martha A. Carter
Theses and Dissertations
Researchers rely on the mathematics of Vapnik and Chervonenkis to capture quantitatively the capabilities of specific artificial neural network (ANN) architectures. The quantifier is known as the V-C dimension, and is defined on functions or sets. Its value is the largest cardinality 1 of a set of vectors in Rd such that there is at least one set of vectors of cardinality 1 such that all dichotomies of that set into two sets can be implemented by the function or set. Stated another way, the V-C dimension of a set of functions is the largest cardinality of a set, such …
Optimal Mixed-Norm Control Synthesis For Discrete-Time Linear Systems, David R. Jacques
Optimal Mixed-Norm Control Synthesis For Discrete-Time Linear Systems, David R. Jacques
Theses and Dissertations
A mixed-norm approach to control synthesis for discrete time linear systems is developed. Specifically, the problem of minimizing the H2 norm of a transfer function, subject to a combination of ℓ1 and-or H∞ norm constraints on dissimilar but related transfer functions is considered. The uniqueness of the optimal solution is shown, and numerical methods for approximating the optimal solution to within arbitrary accuracy are developed. These methods generally result in high order compensators which can not be implemented in most practical applications. In response to this, a numerical method is developed which solves for suboptimal solutions of …
Physiologically-Based Pharmacokinetic Modeling Of Skin Absorption Using Dermal Subcompartments, Richard L. Bookout Jr.
Physiologically-Based Pharmacokinetic Modeling Of Skin Absorption Using Dermal Subcompartments, Richard L. Bookout Jr.
Theses and Dissertations
Dermal penetration of chemicals and drugs is important to both toxicologists and pharmacologists. Drug developers try to enhance and environmental professionals try to limit penetration of chemicals through the skin. Both can use predictive biologically-based mathematical models to assist in understanding the processes involved. When these models are based on physiological and biochemical parameters which can be measured in the laboratory, they can be extremely useful. Appropriately validated models based on first principles can be predictive of human exposures when the processes involved are adequately understood. In this thesis we develop four new physiologically-based pharmacokinetic (PBPK) models to predict blood …
Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang
Fast Byte Copying: A Re-Evaluation Of The Opportunities For Optimization, Jon Inouye, Jonathan Walpole, Ke Zhang
Computer Science Faculty Publications and Presentations
High-performance byte copying is important for many operating systems because it is the principle method used for transferring data between kernel and user protection domains. For example, byte copying is commonly used for transferring data from kernel buffers to user buffers during file system read and IPC recv calls and to kernel buffers from user buffers during 'Write and-send calls. Because of its impact on overall system performance, commercial operating systems tend to employ many specialized byte copy routines, each one optimized for a different circumstance.
This paper revisits the opportunities for optimizing byte copy performance by discussing a series …