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 (7243)
- 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)
- Western University (525)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (485)
- Keyword
-
- Machine learning (1337)
- Deep learning (800)
- Artificial intelligence (659)
- Machine Learning (651)
- Computer Science (638)
-
- Security (620)
- Computer science (436)
- Cybersecurity (410)
- Privacy (408)
- Simulation (379)
- Technical Reports (369)
- Classification (367)
- UTEP Computer Science Department (367)
- Data mining (349)
- Deep Learning (349)
- Algorithms (337)
- Optimization (336)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (291)
- 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 (231)
- 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 (500)
- 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 (316)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 55261 - 55290 of 58033
Full-Text Articles in Physical Sciences and Mathematics
The Integration Of Database Systems, Tony Schaller, Omran A. Bukhres, Ahmed K. Elmagarmid, Xiangning Liu
The Integration Of Database Systems, Tony Schaller, Omran A. Bukhres, Ahmed K. Elmagarmid, Xiangning Liu
Department of Computer Science Technical Reports
No abstract provided.
A Semi-Linear Elliptic Pde Model For The Static Solution Of Josephson Junctions, J. G. Caputo, N. Flytzanis, E. A. Vavalis
A Semi-Linear Elliptic Pde Model For The Static Solution Of Josephson Junctions, J. G. Caputo, N. Flytzanis, E. A. Vavalis
Department of Computer Science Technical Reports
No abstract provided.
On Object Semantic Similarity In Heterogeneous Database Integration, Xiangning Lui, Omran A. Bukhres
On Object Semantic Similarity In Heterogeneous Database Integration, Xiangning Lui, Omran A. Bukhres
Department of Computer Science Technical Reports
No abstract provided.
Academic Programs In Computational Science And Engineering, John R. Rice
Academic Programs In Computational Science And Engineering, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Design And Implementation Of A Threads Library, Janche Sang, Felipe Knop, Vernon Rego
Design And Implementation Of A Threads Library, Janche Sang, Felipe Knop, Vernon Rego
Department of Computer Science Technical Reports
No abstract provided.
A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth
A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth
Kno.e.sis Publications
Presents an overview of the ITX (Interacting Transaction) system, which supports complex interactions among cooperating agents in the presence of user interventions that change application objectives and system failures. The system's components and its unique fixed-point criterion for feedback control of iterative interactions are described. An example of a simplified multimedia teleconferencing application is discussed to illustrate the features of the ITX system.
Performance Of A Token-Passing System With Batch Arrivals And Its Application To File Transfers, Robert H. Deng, Xuanyu Zhang, Kuan Tase Huang
Performance Of A Token-Passing System With Batch Arrivals And Its Application To File Transfers, Robert H. Deng, Xuanyu Zhang, Kuan Tase Huang
Research Collection School Of Computing and Information Systems
This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-Stieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived. Mean waiting time approximations are compared against both simulation results and other results presented in the literature; the variance approximation is evaluated by comparing it to simulation results only, since no other results on variance have been reported so …
Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko
Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko
Research Collection School Of Computing and Information Systems
In this paper, we study the end-to-end performance of interconnected local area networks (LAN) with server/client configuration. The system uses bridges to connect two token-ring LANs through a high-speed communication link. A server station located on one LAN receives requests from client-stations on the same LAN as well as on the remote LAN, processes the requests, and returns responses to the client-stations. The end-to-end connections of the interconnected network are modelled as single-chain and multiple-chain closed queueing systems, which are solved by an iterative algorithm based on the MVA (mean value analysis) method. The performance examples are shown in terms …
Multilevel Parallel Communications, Sanjay Khanna
Multilevel Parallel Communications, Sanjay Khanna
Computer Science Theses & Dissertations
The research reported in this thesis investigates the use of parallelism at multiple levels to realize high-speed networks that offer advantages in throughput, cost, reliability, and flexibility over alternative approaches. This research specifically considers use of parallelism at two levels: the "upper" level and the "lower" level. At the upper level, N protocol processors perform functions included in the transport and network layers. At the lower level, M channels provide data and physical layer functions. The resulting system provides very high bandwidth to an application. A key concept of this research is the use of replicated channels to provide a …
Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr.
Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr.
Computer Science Theses & Dissertations
The discrimination of texture features in an image has many important applications: from detection of man-made objects from a surrounding natural background to identification of cancerous from healthy tissue in X-ray imagery. The fractal structure in an image has been used with success to identify these features but requires unacceptable processing time if executed sequentially.
The paradigm of data parallelism is presented as the best method for applying massively parallel processing to the computation of fractal dimension of an image. With this methodology, and sufficient numbers of processors, this computation can reach real time speeds necessary for many applications. A …
A Framework For Data Sharing In Computer Supported Cooperative Environments, Mohamed Youssef Eltoweissy
A Framework For Data Sharing In Computer Supported Cooperative Environments, Mohamed Youssef Eltoweissy
Computer Science Theses & Dissertations
Concurrency control is an indispensable part of any information sharing system. Co-operative work introduces new requirements for concurrency control which cannot be met using existing applications and database management systems developed for non-cooperative environments. The emphasis of concurrency control in conventional database management systems is to keep users and their applications from inadvertently corrupting data rather than support a workgroup develop a product together. This "insular" approach is necessary because applications that access the database have been built with the assumptions that they have exclusive access to the data they manipulate and that users of these applications are generally oblivious …
Operational Evaluation Of Responsiveness Properties, Grace Tsai, Matt Insall, Bruce M. Mcmillin
Operational Evaluation Of Responsiveness Properties, Grace Tsai, Matt Insall, Bruce M. Mcmillin
Computer Science Technical Reports
In this paper, a new technique for ensuring run-time satisfaction of properties-specifically responsiveness property, a subset of liveness property, in responsive systems, is presented. Since whether the run-time behavior of a system is satisfied depends on the execution (operational) environment, we develop a translation which takes into account the constraints in the operational environment, and generates histories for each process in the system. Thus, every process can utilize its history to operationally evaluate the system behavior and signal errors if its history is violated. Therefore, this technique provides software safety, handles error-detection, and ensures run-time satisfaction of responsiveness property in …
A General Method For Maximizing The Error-Detecting Ability Of Distributd Algorithms, Martina Schollmeyer, Bruce M. Mcmillin
A General Method For Maximizing The Error-Detecting Ability Of Distributd Algorithms, Martina Schollmeyer, Bruce M. Mcmillin
Computer Science Technical Reports
Error-detecting algorithms can determine when, at run time, a program deviates from its expected behavior due to a hardware, software or communication error. In a fixed interconnect multiprocessor system, the error detecting ability heavily depends on the number of faults, which is bounded, and their spatial distribution. Otherwise multiple fault occurrences can mask each other. This paper provides a general method for computing the overall system failure bound, the maximal fault index, from the system topology and local communication patterns. The result of the computation is used to design a mapping of processes to processor groups such that multiple processor …
Designing A Unix Novice Interface, Lee K. Seitz
Designing A Unix Novice Interface, Lee K. Seitz
Honors Capstone Projects and Theses
No abstract provided.
On Inverse Sigmoid Functions, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
On Inverse Sigmoid Functions, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
Networks with sigmoid node functions have been shown to be universal approximators, and can use straightforward implementations of learning algorithms. Mathematically, what is common to different sigmoid functions used by different researchers? We establish a common representation of inverse sigmoid functions in terms of the Guass Hypergeometric function, generalizing different node function formulations. We also show that the continuous Hopfield network equation can be transformed into a Legendre differential equation, without assuming the specific form of the node function; this establishes a link between Hopfield nets and the method of function approximation using Legendre polynomials
Putting Humpty-Dumpty Together Again: Reconstructing Functions From Their Projections., Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Putting Humpty-Dumpty Together Again: Reconstructing Functions From Their Projections., Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
We present a problem decomposition approach to reduce neural net training times. The basic idea is to train neural nets in parallel on marginal distributions obtained from the original distribution (via projection), and then reconstruct the original table from the marginals (via a procedure similar to the join operator in database theory). A function is said to be reconstructible, if it may be recovered without error from its projections. Most distributions are non-reconstructible. The main result of this paper is the Reconstruction theorem, which enables non-reconstructible functions to be expressed in terms of reconstructible ones, and thus facilitates the application …
Off-Line Cursive Handwriting Recognition Using Style Parameters, Berrin A. Yanikoglu, Peter A. Sandon
Off-Line Cursive Handwriting Recognition Using Style Parameters, Berrin A. Yanikoglu, Peter A. Sandon
Computer Science Technical Reports
We present a system for recognizing off-line cursive English text, guided in part by global characteristics of the handwriting. A new method for finding the letter boundaries, based on minimizing a heuristic cost function, is introduced. The function is evaluated at each point along the baseline of the word to find the best possible segmentation points. The algorithm tries to find all the actual letter boundaries and as few additional ones as possible. After size and slant normalizations, the segments are classified by a one hidden layer feedforward neural network. The word recognition algorithm finds the segmentation points that are …
A New Look At An Old 3:16 An Acms Devotional, Russell W. Howell
A New Look At An Old 3:16 An Acms Devotional, Russell W. Howell
ACMS Conference Proceedings 1993
This paper examines John 3:16 in the bible by examining the language and cultural backgrounds of the verse.
Knuth's (1, 2, 1) Unstacking, Paul J. Zwier
Knuth's (1, 2, 1) Unstacking, Paul J. Zwier
ACMS Conference Proceedings 1993
This presentation is dedicated to Donald Knuth who has proposed many interesting and challenging problems in the Problems Section of The American Mathematical Monthly. The problem considered ist hat proposed by Barry Hayes, Knuth, and Carlos Subi (E3267 [1988,456]). The published solution, due to Albert Nijenhuis, just recently appeared in the March 1993 Monthly, pages 292-294.
The problem is as follows. Suppose that we are given n piles of blocks; the i-th pile having ai blocks, i = 1, 2, …, n. Dismantle the piles by choosing a pile having 2 or more blocks, removing …
A Conjectured Paradigm Shift In 21st Century Mathematics Pedagogy, Paul Isihara
A Conjectured Paradigm Shift In 21st Century Mathematics Pedagogy, Paul Isihara
ACMS Conference Proceedings 1993
With greater and greater capacity for automated content delivery, the role of teachers may shift increasingly to providing the human touch in pedagogy such as love for students.
Paper Abstracts, Association Of Christians In The Mathematical Sciences
Paper Abstracts, Association Of Christians In The Mathematical Sciences
ACMS Conference Proceedings 1993
Paradigm Shifts in the Mathematical Sciences
Introduction (1993), Russell Howell
Introduction (1993), Russell Howell
ACMS Conference Proceedings 1993
Paradigm Shifts in the Mathematical Sciences
Schedule (1993), Association Of Christians In The Mathematical Sciences
Schedule (1993), Association Of Christians In The Mathematical Sciences
ACMS Conference Proceedings 1993
Paradigm Shifts in the Mathematical Sciences
Table Of Contents (1993), Association Of Christians In The Mathematical Sciences
Table Of Contents (1993), Association Of Christians In The Mathematical Sciences
ACMS Conference Proceedings 1993
Paradigm Shifts in the Mathematical Sciences
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 1993, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 1993, 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.
Shastra -- An Architecture For Deveopment Of Collaborative Appplications, Vinod Anupam, Chandrajit L. Bajaj
Shastra -- An Architecture For Deveopment Of Collaborative Appplications, Vinod Anupam, Chandrajit L. Bajaj
Department of Computer Science Technical Reports
No abstract provided.
Some Experiments With A Basic Linear Algebra Routine On Distributed Memory Parallel Systems, H. Byun, Elias N. Houstis, E. A. Vavalis
Some Experiments With A Basic Linear Algebra Routine On Distributed Memory Parallel Systems, H. Byun, Elias N. Houstis, E. A. Vavalis
Department of Computer Science Technical Reports
No abstract provided.
The 1981, 1986, And 1990 Long Term Plans Of The Department Of Computer Sciences, John R. Rice
The 1981, 1986, And 1990 Long Term Plans Of The Department Of Computer Sciences, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
Biased Finger Trees And Three-Dimensional Layers Of Maxima, Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer
Biased Finger Trees And Three-Dimensional Layers Of Maxima, Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer
Department of Computer Science Technical Reports
No abstract provided.
Signal Processing With Neural Networks, Pero Smrzlic
Signal Processing With Neural Networks, Pero Smrzlic
Masters Theses
In this study, we introduce the Adaptive Back Propagation (ABP) learning algorithm, computationally superior to the standard Back Propagation. The ABP is based on the new activation function, with its corresponding adaptive learning parameter. By using the combination of computer simulations and analysis in the domain of activation function, the Method of One Hidden layer was developed for the effective utilization of units in one-hidden layer networks. A parallel version of the ABP was designed and implemented on a nCUBE-2 supercomputer with 128 processors.
The simulation results suggested a strong correlation between frequency of signals and the role of hidden …