Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9016)
- Missouri University of Science and Technology (1895)
- City University of New York (CUNY) (957)
- Brigham Young University (710)
- University of Texas at Arlington (661)
-
- Syracuse University (479)
- University of Central Florida (475)
- University of Nevada, Las Vegas (392)
- Chulalongkorn University (258)
- Regis University (254)
- Portland State University (242)
- TÜBİTAK (230)
- Old Dominion University (197)
- San Jose State University (192)
- University of South Carolina (188)
- Wright State University (186)
- Technological University Dublin (152)
- Washington University in St. Louis (148)
- University of South Florida (137)
- Edith Cowan University (111)
- Purdue University (111)
- University of Nebraska - Lincoln (108)
- Nova Southeastern University (101)
- California Polytechnic State University, San Luis Obispo (96)
- Dartmouth College (94)
- University of New Mexico (94)
- Zayed University (94)
- University at Albany, State University of New York (89)
- Air Force Institute of Technology (88)
- Kennesaw State University (74)
- Keyword
-
- Machine learning (601)
- Artificial intelligence (410)
- Deep learning (342)
- Machine Learning (257)
- College for Professional Studies (253)
-
- School of Computer & Information Science (236)
- Security (195)
- Artificial Intelligence (188)
- Natural language processing (184)
- Deep Learning (182)
- Computer Science (180)
- Privacy (145)
- Social media (140)
- Algorithms (138)
- Computer science (137)
- MS Computer and Information Technology (136)
- Data mining (135)
- Neural networks (129)
- Reinforcement learning (123)
- Computer vision (121)
- Natural Language Processing (119)
- Cybersecurity (116)
- Twitter (116)
- Software engineering (115)
- AI (110)
- Classification (109)
- Regis University MSCIT thesis (108)
- Cloud computing (106)
- Optimization (106)
- Clustering (96)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8488)
- Computer Science Faculty Research & Creative Works (907)
- Theses and Dissertations (831)
- Computer Science Technical Reports (411)
- Faculty Publications (381)
-
- Computer Science and Engineering Theses - Archive (364)
- Electronic Theses and Dissertations (331)
- Publications and Research (291)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Computer Science and Engineering Dissertations - Archive (270)
- Open Educational Resources (262)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (258)
- Regis University Student Publications (comprehensive collection) (254)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (236)
- Masters Theses (235)
- Turkish Journal of Electrical Engineering and Computer Sciences (230)
- Dissertations and Theses (203)
- Dissertations and Theses Collection (Open Access) (189)
- Electrical Engineering and Computer Science - Technical Reports (176)
- Master's Projects (167)
- Dissertations, Theses, and Capstone Projects (145)
- Electrical Engineering and Computer Science - All Scholarship (138)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (137)
- USF Tampa Graduate Theses and Dissertations (122)
- Doctoral Dissertations (119)
- Electronic Theses and Dissertations, 2020-2023 (119)
- All Works (94)
- Computer Science Faculty Publications (94)
- Northeast Parallel Architecture Center (92)
- Dissertations (89)
- Publication Type
- File Type
Articles 20101 - 20130 of 20536
Full-Text Articles in Entire DC Network
Inclusive Production Of The Charmed Baryon C+ From E+E- Annihilations At S=10.55 Gev, P. Avery, Manoj Thulasidas
Inclusive Production Of The Charmed Baryon C+ From E+E- Annihilations At S=10.55 Gev, P. Avery, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
We report results on inclusive production of the charmed baryon Λc+ from e+e− annihilations at √s=10.5 GeV. Measurements are presented of the inclusive cross section times branching fraction for the continuum production of Λc+ as observed in six different decay modes, and of a new, improved value of the Λc+ mass. The inclusive cross section times the branching fraction into pK−π+ is measured to be 10.0±1.5±1.5 pb summed over all xp. The branching fractions of Λc+ into p¯K0, p¯K0π+π−, Λπ+, Λπ+π−π+, and Ξ−K+π+ relative to that into pK−π+ are measured to be 0.44±0.07±0.05, 0.43±0.12±0.04, 0.18±0.03±0.03, 0.65±0.11±0.12, and 0.15±0.04±0.03, respectively. The …
Integration Of Abductive And Deductive Inference Diagnosis Model And Its Application In Intelligent Tutoring System, Jingying Zhang
Integration Of Abductive And Deductive Inference Diagnosis Model And Its Application In Intelligent Tutoring System, Jingying Zhang
Computer Science Theses & Dissertations
This dissertation presents a diagnosis model, Integration of Abductive and Deductive Inference diagnosis model (IADI), in the light of the cognitive processes of human diagnosticians. In contrast with other diagnosis models, that are based on enumerating, tracking and classifying approaches, the IADI diagnosis model relies on different inferences to solve the diagnosis problems. Studies on a human diagnosticians' process show that a diagnosis process actually is a hypothesizing process followed by a verification process. The IADI diagnosis model integrates abduction and deduction to simulate these processes. The abductive inference captures the plausible features of this hypothesizing process while the deductive …
Functional Reasoning And Functional Modelling, J. Sticklen, William E. Bond
Functional Reasoning And Functional Modelling, J. Sticklen, William E. Bond
Computer Science Faculty Research & Creative Works
A car that will not start on a cold winter day and one that will not start on a hot summer day usually indicate two very different situations. When pressed to explain the difference, we would give a winter account- "Oil is more viscous in cold conditions, and that causes . . .'' -and a summer story- "Vapor lock is a possibility in hot weather and is usually caused by . . .'' How do we build such explanations? One possibility is that understanding how the car works as a device gives us a basis for generating the explanations. But …
A Visualization Model For Massively Parallel Algorithms, Rashi Khanna, Bruce M. Mcmillin
A Visualization Model For Massively Parallel Algorithms, Rashi Khanna, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
A visualization model has been developed to analyze the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns. These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMILI (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff s Faces have been selected to …
Simulating Adaptive Load Sharing Policies On An Ipsc/2 Multicomputer, Yuh Jong Hu, Billy E. Gillett
Simulating Adaptive Load Sharing Policies On An Ipsc/2 Multicomputer, Yuh Jong Hu, Billy E. Gillett
Computer Science Faculty Research & Creative Works
Unlike most other adaptive load sharing (LS) policy studies, each node in the distributed system is modeled as a central server model represented by a closed queueing network (QN). The primary objective of this study is to use a simulation model to find the improvement for an adaptive LS policy in a distributed system. In homogeneous distributed systems, the simulation results in this study show that the performance improvements between no LS, LS with task placement, and LS with task migration are very small. These results are quite different from other studies, which show a significant improvement of mean response …
Fault-Tolerant Parallel Matrix Multiplication With One Iteration Fault Detection Latency, Chul Eui Hong, Bruce M. Mcmillin
Fault-Tolerant Parallel Matrix Multiplication With One Iteration Fault Detection Latency, Chul Eui Hong, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
The checksum technique is a low-cost method to detect errors in matrix operations performed by processor arrays. The fault detection of this method is done only at problem termination, so this method is not an effective fault tolerance technique for large scale matrix multiplication. This paper presents a new algorithm, the ID algorithm, which minimizes the fault-detection latency, In the ID algorithm, a fault is detected as soon as the fault occurs instead of at problem termination. For n2 processors, the fault-latency time of the ID algorithm is l/n of that of checksum algorithm with a run-time penalty of O(nlog2n) …
A Model-Based Approach For Organizing Quantitative Computations, J. Sticklen, A. Kamel, William E. Bond
A Model-Based Approach For Organizing Quantitative Computations, J. Sticklen, A. Kamel, William E. Bond
Computer Science Faculty Research & Creative Works
Model based reasoning (MBR) is currently receiving wide spread attention because it offers a way to circumvent the brittleness of reasoning systems built solely on associational knowledge. To date, most MBR approaches have focused on the use and manipulation of qualitative models. The authors report their experience in applying techniques of functional reasoning to the general problem of organizing quantitative calculations. As a testbed, they have solved a problem initially posed at the Model-Based Diagnosis workshop (Paris, July, 1989): representing an automotive cruise control system. The results show that the principles of the functional reasoning approach can provide leverage in …
Pattern Recognition For Nondestructive Evaluation, S. Morris, P. O'Rorke, William E. Bond, M. M. Amirfathi, Daniel C. St. Clair
Pattern Recognition For Nondestructive Evaluation, S. Morris, P. O'Rorke, William E. Bond, M. M. Amirfathi, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
The issues involved in automating nondestructive evaluation (NDE) techniques are outlined. Attention is given to research focused on the application of machine learning techniques to the construction and maintenance of knowledge-based systems which are capable of evaluating the readings from nondestructive tests that have been performed on aircraft components. Preliminary results obtained from this research are described. In particular, the authors discuss the application of a symbolic machine learning algorithm, ID3, to the NDE problem. ID3 has been used by Douglas Aircraft to classify defects in sets of standard NDE reference blocks. Based on the preliminary results, a need for …
Fitting Semantics For Conditional Term Rewriting, Chilukuri K. Mohan
Fitting Semantics For Conditional Term Rewriting, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination. It is shown that the approach used by Fitting [5] for Prolog-style logic programs is applicable in this context. A monotone operator is developed, whose fixpoints describe the semantics of conditional rewriting. Several examples illustrate this semantics for non-terminating rewrite systems which could not be easily handled by previous approaches.
Balancing A Pipeline By Folding, Per Brinch Hansen
Balancing A Pipeline By Folding, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
A pipeline for Householder reduction is folded several times across an array of processors to achieve approximate load balancing. The performance of the folded pipeline is analyzed and measured on a Computing Surface.
The All-Pairs Pipeline, Per Brinch Hansen
The All-Pairs Pipeline, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
An all-pairs problem is a computation on every possible subset consisting of two elements chosen from a set of n elements. N-body simulation and Householder reduction are all-pairs problems. The paper defines the all-pairs problem concisely by means of precedence matrices and derives a parallel algorithm. The algorithm is presented in both coarse-grain and medium-grain form. The all-pairs paradigm is illustrated by a pipeline for Householder reduction of a matrix to triangular form.
Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
We have addressed the problem of analyzing images containing multiple sparse overlapped patterns. This problem arises naturally when analyzing the composition of organic macromolecules using data gathered from their NMR spectra. Using a neural network approach, we have obtained excellent results in using NMR data to analyze the presence of amino acids in protein molecules. We have achieved high correct classification percentages (about 87%) for images containing as many as five substantially distorted overlapping patterns.
Householder Reduction, Per Brinch Hansen
Householder Reduction, Per Brinch Hansen
Electrical Engineering and Computer Science - Technical Reports
This tutorial discusses Householder reduction of n linear equations to a triangular form which can be solved by back substitution. The main strengths of the method are its numerical stability and suitability for parallel computing. We explain how Householder reduction can be derived from elementary matrix algebra. The method is illustrated by a numerical example and a Pascal algorithm. We assume that the reader has a general knowledge of vector and matrix algebra but is less familiar with linear transformation of a vector space.
A Whole Word And Number Reading Machine Based On Two Dimensional Low Frequency Fourier Transforms, Mark A. O'Hair
A Whole Word And Number Reading Machine Based On Two Dimensional Low Frequency Fourier Transforms, Mark A. O'Hair
Theses and Dissertations
The Fourier transform is investigated as a means for developing an optical reader capable of reading a large vocabulary without segmenting the image of a word into individual characters. The reader is capable of reading printed and cursive font styles, is scale invariant, and is substantially insensitive to noise. The image of a particular word is treated as a single symbol; the two dimensional low frequency Fourier coefficients (assuming n coefficients are calculated) define the word's location on an n dimensional hypersphere of unit radius. The distance between individual locations (words) categorizes similar and dissimilar words. The smaller the distance, …
An Object Oriented Design And Implementation Of The Idef0 Essential Data Model Using Ada And An Ada Based Expert System, Terry L. Kitchen
An Object Oriented Design And Implementation Of The Idef0 Essential Data Model Using Ada And An Ada Based Expert System, Terry L. Kitchen
Theses and Dissertations
This thesis develops and implements an Ada based object oriented design (OOD) of the IDEF0 Essential Data Model called the Essential Subsystem, which includes an Ada based expert system for IDEF0 model syntax checking. IDEF0 is a graphic approach to system description development by SofTech, Inc. for the U.S. Air Force Program for Integrated Computer Aided Manufacturing (ICAM) and is a subset of the Structured Analysis (SA) language (30, 36). The IDEF0 Essential Data Model is an entity-relationship (E-R) model of the IDEF0 language and represents the fundamental (essential) information of an IDEF0 model. …
Axiomatization Of Some Natural Quantifiers, William C. Purdy
Axiomatization Of Some Natural Quantifiers, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
This paper extends an existing logic, £n, to some of the generalized quantifiers of natural language. In contrast to the usual approach, this extension does not require the identity relation. Sommers has suggested that the identity is unnecessary in a logic that properly treats singular terms. This paper lends support to Sommers position. £n is a logic designed for natural language reasoning (see [3]). This paper defines an extension, LNQ, of that logic to include the cardinal quantifiers, at least n, and the second-order quantifier, most. Because of the limited expressiveness of first-order languages, a complete axiomatization for most is …
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper describes parallel algorithms for the following operations on quadtrees - boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar
Parallel Vision Algorithms Using Sparse Array Representations, Ravi V. Shankar
Electrical Engineering and Computer Science - Technical Reports
Sparse arrays are arrays in which the number of non-zero elements is a small fraction of the total number of array elements. This paper presents computer vision algorithms using sparse representations for arrays. The parallel architecture considered is a hypercube. The algorithms can be easily modified for other architectures like the mesh. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents a neural network approach to multivariate time-series analysis. Real world observations of flour prices in three cities have been used as a benchmark in our experiments. Feedforward connectionist networks have been designed to model flour prices over the period from August 1972 to November 1980 for the cities of Buffalo, Minneapolis, and Kansas City. Remarkable success has been achieved in training the networks to learn the price curve for each of these cities, and thereby to make accurate price predictions. Our results show that the neural network approach leads to better predictions than the autoregressive moving average(ARMA) …
A Graphical Knowledge Level Approach For User-Database Interaction, K. Tan, H. Chan, Keng Siau
A Graphical Knowledge Level Approach For User-Database Interaction, K. Tan, H. Chan, Keng Siau
Research Collection School Of Computing and Information Systems
The authors propose a novel user interface, the Graphical Knowledge Level interface, for user-database interaction. This interface addresses two of the current research problems: the semantic inadequacy of the relational model and the logical data dependence of the relational languages. The interface is more user-friendly than the SOL interface and the Universal Relation interface, as it employs the graphical approach. The semantic inadequacy problem is alleviated by using an enhanced entity-relationship model. This data model includes abstraction concepts such as aggregation, generalization, and categorization. A formal, high-level Graphical Knowledge Level Query Language, GKQL, which provides for both logical and physical …
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Optimal Parallel Solutions To The Neighbor Localization Problem And Integer Sorting: A Fine Grained Approach, Ramachandran Vaidyanathan, Carlos R.P. Hartmann, Pramod K. Varshney
Electrical Engineering and Computer Science - Technical Reports
In this report, a fine-grained decomposition approach is used to obtain an optimal parallel solution to the Neighbor Localization Problem, which in turn is œ used to sort n θ(log n)-bit numbers optimally on an EREW model. The model of computation used is the EREW Reconfigurable PRAM (R-PRAM) that permits the use of “very small” processors. The main result of this report is a parallel EREW R-PRAM algorithm that sorts n θ(log n)-bit numbers in θ(log n) time with θ(n log n) “work”. The proposed algorithm is asymptotically optimal in time and efficiency. If a weaker variant of the R-PRAM …
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. …
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel
Electrical Engineering and Computer Science - Technical Reports
We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is based on an extension to Petri net-based techniques, where a concurrent program is modeled as a Petri net and a reachability graph is then derived and analyzed for desired information. In this approach, Predicate-Action subnets representing Ada programming constructs are described, where predicates and actions are attached to transitions. Predicates are those found in decision statements. Actions involve updating the status of the variables that affect the tasking behavior of the program and updating the Read and Write sets of shared variables. The shared …
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri
Electrical Engineering and Computer Science - Technical Reports
A static analysis tool for detecting deadlocks and potential race conditions on shared variables in concurrent programs is presented. It is based on Petri Net modeling and reachability analysis, where a concurrent program is modeled as an augmented Petri net and a reachability graph is then derived and analyzed for desired information. Place-Transition subnets representing programming language constructs are described. Transitions in these subnets are augmented with sets of shared variables that occur in sections of the program, called concurrency zones, related to the transitions. The tool consists of four modules. The modeling module employs the augmented subnets as building …
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Unification In Modal Theorem Proving, Xiaolin Zhang, Chilukuri K. Mohan
Electrical Engineering and Computer Science - Technical Reports
Modal formulas can be proved by translating them into a three-typed logic and then using unification and resolution, with axioms describing properties of the reachability relation among possible worlds. In this paper, we improve on the algorithms in [1], showing that "strong skolemisation" and occurrence checks are not needed for proving theorems of Q, T, Q4, and S4. We also extend the 'path logic' approach to S5, give the appropriate unification algorithm, and prove its correctness.
Surface Reasoning, William C. Purdy
Surface Reasoning, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Surface reasoning is defined to be deduction conducted in the surface language in terms of certain primitive logical relations. The surface language is a spoken or written natural language (in this paper, English), in contrast to a "base language" or “deep structure" sometimes hypothesized to explain natural language phenomena. The primitive logical relations are inclusion, exclusion and overlap between classes of entities. A calculus for surface reasoning is presented. Then a model for reasoning in this calculus is developed. The model is similar to but more general than syllogistic. In this model, reasoning is represented as construction of fragments (subposets) …
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.
Techniques For Cubic Algebraic Surfaces Ii, Thomas W. Sederberg
Techniques For Cubic Algebraic Surfaces Ii, Thomas W. Sederberg
Faculty Publications
A survey of some techniques that may have potential for free-form modeling with algebraic surfaces is continued. Classical results as well as several recent innovations are included. Specific attention is paid to cubic algebraic surfaces, although many of the ideas presented have application to algebraic surfaces of any degree. Topics addressed include piecewise constructions, interpolation to points and space curves, and parameterization.
Robot Pedagogics: The Adaptation, Analysis, And Computer Control Of A Model Manipulator, Edward T. Hammerand, Chung You Ho
Robot Pedagogics: The Adaptation, Analysis, And Computer Control Of A Model Manipulator, Edward T. Hammerand, Chung You Ho
Computer Science Technical Reports
The subject of robotics is addressed by many different fields, among them computer science, electrical engineering, and mechanical engineering. This work is an attempt to bring together all of these aspects from the perspective of a computer science background. Different techniques are considered and reconciled with one another in the analytical area, while detail and explanation are added in all areas that were not previously available. In addition, geometrical interpretations arc presented for concepts that have heretofore been presented only in the form of equations.