Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (150)
- Artificial Intelligence and Robotics (77)
- Computer Engineering (61)
- Social and Behavioral Sciences (33)
- Electrical and Computer Engineering (27)
-
- Information Security (22)
- Software Engineering (19)
- Theory and Algorithms (17)
- Operations Research, Systems Engineering and Industrial Engineering (14)
- Robotics (14)
- Signal Processing (14)
- Medicine and Health Sciences (13)
- Aerospace Engineering (11)
- Databases and Information Systems (11)
- Digital Communications and Networking (11)
- Life Sciences (11)
- Law (10)
- Systems Architecture (10)
- Education (9)
- Navigation, Guidance, Control and Dynamics (9)
- OS and Networks (9)
- Physics (9)
- Programming Languages and Compilers (9)
- Cybersecurity (8)
- Systems and Communications (8)
- Geography (7)
- Library and Information Science (7)
- Linguistics (7)
- Institution
-
- Brigham Young University (296)
- Air Force Institute of Technology (180)
- University of South Carolina (53)
- The University of Southern Mississippi (34)
- San Jose State University (28)
-
- Fordham University (16)
- Purdue University (13)
- East Texas A&M University (12)
- Hope College (6)
- William & Mary Law School (6)
- University of Southern Maine (5)
- Macalester College (3)
- Stephen F. Austin State University (3)
- University of New Hampshire (2)
- University of Tennessee Health Science Center (2)
- Denison University (1)
- Louisiana State University (1)
- University of Northern Iowa (1)
- Villanova University Charles Widger School of Law (1)
- Keyword
-
- Machine learning (41)
- Neural networks (14)
- Deep learning (13)
- #antcenter (12)
- Neural network (11)
-
- Generalization (10)
- Classification (9)
- Reinforcement learning (9)
- Robotics (9)
- Artificial neural networks (8)
- Interpolation (8)
- UAV (8)
- DNA sequencing (7)
- Multicast (7)
- Particle swarm optimization (7)
- Algorithms (6)
- Artificial intelligence (6)
- Phylogenetic analysis (6)
- Validation (6)
- Behavior-Based (5)
- Bluetooth (5)
- Cybersecurity (5)
- Data mining (5)
- Digital forensics (5)
- Feature extraction (5)
- Formal Verification (5)
- Hopfield network (5)
- Learning (5)
- Networks (5)
- Path planning (5)
- Publication Year
Articles 631 - 660 of 663
Full-Text Articles in Computer Sciences
Surface Intersection Loop Destruction, Thomas W. Sederberg, Alan K. Zundel
Surface Intersection Loop Destruction, Thomas W. Sederberg, Alan K. Zundel
Faculty Publications
The intersection curve between two surface patches consists of one or more connected components or branches. Each component can be classified as either an open branch, with endpoints on at least one patch boundary, or as a closed loop.
Hodographs And Normals Of Rational Curves And Surfaces, Thomas W. Sederberg, Takafumi Saito, Guo-Jin Wang
Hodographs And Normals Of Rational Curves And Surfaces, Thomas W. Sederberg, Takafumi Saito, Guo-Jin Wang
Faculty Publications
Derivatives and normals of rational Bézier curves and surface patches are discussed. A non-uniformly scaled hodograph of a degree m x n tensor-product rational surface, which provides correct derivative direction but not magnitude, can be written as a degree (2m - 2) x 2n or 2m x (2n - 2) vector function in polynomial Bézier form. Likewise, the scaled normal direction is degree (3m - 2) x(3n - 2). Efficient methods are developed for bounding these directions and the derivative magnitude.
The Effect Of Domain Knowledge On Elementary School Children's Search Behavior On An Information Retrieval System: The Science Library Catalog, Sandra Hirsh
Faculty Publications
Few information retrieval systems are designed with children’s special needs and capabilities in mind. We need to learn more about children’s information-seeking behavior in order to provide them with information-based tools which support exploratory learning. This dissertation examines children’s search behavior on a hypertext-based automated library catalog designed for elementary school children. The focus of this research is on the effect of domain knowledge on children’s search performance, search behavior, and learning as they look for science books on this system. Reseaxch has shown that level of domain knowledge in~luences the way people search for information. Data was collected through …
Dynamics Of Order-Parameter-Conserving Ising Models At T > Tc, J.C. Lee
Dynamics Of Order-Parameter-Conserving Ising Models At T > Tc, J.C. Lee
Faculty Publications
http://journals.aps.org/prb/pdf/10.1103/PhysRevB.51.2661
Using Multiple Statistical Prototypes To Classify Continuously Valued Data, Tony R. Martinez, Dan A. Ventura
Using Multiple Statistical Prototypes To Classify Continuously Valued Data, Tony R. Martinez, Dan A. Ventura
Faculty Publications
Multiple Statistical Prototypes (MSP) is a modification of a standard minimum distance classification scheme that generates muItiple prototypes per class using a modified greedy heuristic. Empirical comparison of MSP with other well-known learning algorithms shows MSP to be a robust algorithm that uses a very simple premise to produce good generalization and achieve parsimonious hypothesis representation.
A Vlsi Implementation Of A Parallel, Self-Organizing Learning Model, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout
A Vlsi Implementation Of A Parallel, Self-Organizing Learning Model, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout
Faculty Publications
This paper presents a VLSI implementation of the Priority Adaptive Self-organizing Concurrent System (PASOCS) learning model that is built using a multi-chip module (MCM) substrate. Many current hardware implementations of neural network learning models are direct implementations of classical neural network structures - a large number of sample computing nodes connected by a dense number of weighted links. PASOCS is one of a class of ASOCS (Adaptive Self-Organizing Concurrent System) connectionist models whose overall goal is the same as classical neural networks models, but whose functional mechanisms differ significantly. This model has potential application in areas such as pattern recognition, …
Spiders: A New User Interface For Rotation And Visualization Of N-Dimensional Point Sets, William A. Barrett, Kirk L. Duffin
Spiders: A New User Interface For Rotation And Visualization Of N-Dimensional Point Sets, William A. Barrett, Kirk L. Duffin
Faculty Publications
We present a new method for creating n-dimensional rotation matrices from manipulating the projections of n-dimensional data coordinate axes onto a viewing plane. A user interface for n-dimensional rotation is implemented. The interface is shown to have no rotational hysteresis.
A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout
A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout
Faculty Publications
The requirement for dense interconnect in artificial neural network systems has led researchers to seek high-density interconnect technologies. This paper reports an implementation using multi-chip modules (MCMs) as the interconnect medium. The specific system described is a self-organizing, parallel, and dynamic learning model which requires a dense interconnect technology for effective implementation; this requirement is fulfilled by exploiting MCM technology. The ideas presented in this paper regarding an MCM implementation of artificial neural networks are versatile and can be adapted to apply to other neural network and connectionist models.
Proof Of Correctness For Asocs Aa3 Networks, J. Cory Barker, Tony R. Martinez
Proof Of Correctness For Asocs Aa3 Networks, J. Cory Barker, Tony R. Martinez
Faculty Publications
This paper analyzes adaptive algorithm 3 (AA3) of adaptive self-organizing concurrent systems (ASOCS) and proves that AA3 correctly fulfills the rules presented. Several different models for ASOCS have been developed. AA3 uses a distributed mechanism for implementing rules so correctness is not obvious. An ASOCS is an adaptive network composed of many simple computing elements operating in parallel. An ASOCS operates in one of two modes: learning and processing. In learning mode, rules are presented to the ASOCS and incorporated in a self-organizing fashion. In processing mode, the ASOCS acts as a parallel hardware circuit that performs the function defined …
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Faculty Publications
Fast computer simulation is an essential tool in the design of large parallel computers. We discuss the design and performance of our Fast Accurate Simulation Tool, FAST. We start by summarizing the tradeoffs made in the designs of this and other simulators. The key ideas used in this simulator involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work in execution driven simulation by introducing several new uses …
Towards A General Distributed Platform For Learning And Generalization, Brent W. Hughes, Tony R. Martinez
Towards A General Distributed Platform For Learning And Generalization, Brent W. Hughes, Tony R. Martinez
Faculty Publications
Different learning models employ different styles of generalization on novel inputs. This paper proposes the need for multiple styles of generalization to support a broad application base. The Priority ASOCS model (Priority Adaptive Self-organizing Concurrent System) is overviewed and presented as a potential platform which can support multiple generalization styles. PASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. The PASOCS can operate in either a data processing mode or a learning mode. During data processing mode, the system acts as a parallel hardware circuit. During leaming mode, the PASOCS incorporates rules, with …
The Importance Of Using Multiple Styles Of Generalization, Tony R. Martinez, D. Randall Wilson
The Importance Of Using Multiple Styles Of Generalization, Tony R. Martinez, D. Randall Wilson
Faculty Publications
There are many ways for a learning system to generalize from training set data. There is likely no one style of generalization which will solve all problems better than any other style, for different styles will work better on some applications than others. This paper presents several styles of generalization and uses them to suggest that a collection of such styles can provide more accurate generalization than any one style by itself. Empirical results of generalizing on several real-world applications are given, and comparisons are made on the generalization accuracy of each style of generalization. The empirical results support the …
Rsvp: A New Resource Reservation Protocol, Daniel Zappala, Stephen Deering, Deborah Estrin, Scott Shenker, Lixia Zhang
Rsvp: A New Resource Reservation Protocol, Daniel Zappala, Stephen Deering, Deborah Estrin, Scott Shenker, Lixia Zhang
Faculty Publications
The current Internet architecture, embodied in the Internet Protocol (IP) network protocol, offers a very simple service model: point-to-point best-effort service. In recent years, several new classes of distributed applications have been developed, such as remote video, multimedia conferencing, data fusion, visualization, and virtual reality. It is becoming increasingly clear that the Internet’s primitive service model is inadequate for these new applications. This inadequacy stems from the failure of the point-to-point best-effort service model to address two application requirements. First, many of these applications are very sensitive to the quality of service their packets receive. For a network to deliver …
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd
Faculty Publications
Fast computer simulation is an essential tool in the design of large parallel computers. Our Fast Accurate Simulation Tool, FAST, is able to accurately simulate large shared memory multiprocessors and their execution of parallel applications at simulation speeds that are one to two orders of magnitude faster than previous comparable simulators. The key ideas involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work by introducing several new …
Adaptive Boundary Detection Using “Live-Wire” Two-Dimensional Dynamic Programming, William A. Barrett, Bryan S. Morse, Eric N. Mortensen, Jayaram Udupa
Adaptive Boundary Detection Using “Live-Wire” Two-Dimensional Dynamic Programming, William A. Barrett, Bryan S. Morse, Eric N. Mortensen, Jayaram Udupa
Faculty Publications
An adaptive boundary detection algorithm that uses two-dimensional dynamic programming is presented. The algorithm is less constrained than previous one-dimensional dynamic programming algorithms and allows the user to interactively determine the mathematically optimal boundary between a user-selected seed point and any other dynamically selected "free” point in the image. Interactive movement of the free point by the cursor causes the boundary to behave like a “live wire” as it adapts to the new minimum cost path between the seed point and the currently selected free point. The algorithm can also be adapted or customized to learn boundary-defining features for a …
Approximation By Interval Bezier Curves, Thomas W. Sederberg, Rida T. Farouki
Approximation By Interval Bezier Curves, Thomas W. Sederberg, Rida T. Farouki
Faculty Publications
The interval Bezier curve, which, unlike other curve and surface approximation schemes, can transfer a complete description of approximation errors between diverse CAD/CAM systems that impose fundamentally incompatible constraints on their canonical representation schemes, is described. Interval arithmetic, which offers an essentially infallible way to monitor error propagation in numerical algorithms that use floating-point arithmetic is reviewed. Affine maps, the computations of which are key operations in the de Casteljau subdivision and degree-elevation algorithms for Bezier curves, the floating-point error propagation in such computations, approximation by interval polynomials, and approximation by interval Bezier curves are discussed.
A Self-Organizing Binary Decision Tree For Incrementally Defined Rule-Based Systems, Douglas M. Campbell, Tony R. Martinez
A Self-Organizing Binary Decision Tree For Incrementally Defined Rule-Based Systems, Douglas M. Campbell, Tony R. Martinez
Faculty Publications
This paper presents an adaptive self-organizing concurrent system (ASOCS) model for massively parallel processing of incrementally defined rule systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. This paper focuses on adaptive algorithm 3 (AA3) and details its architecture and learning algorithm. It has advantages over previous ASOCS models in simplicity, implementability, and cost. An ASOCS can operate in either a data processing mode or a learning mode. During the data processing mode, an ASOCS acts as a parallel …
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.
Techniques For Cubic Algebraic Surfaces I, Thomas W. Sederberg
Techniques For Cubic Algebraic Surfaces I, Thomas W. Sederberg
Faculty Publications
The tutorial presents some tools for free-form modeling with algebraic surfaces, that is, surfaces that can be defined using an implicit polynomial equation f(x, y, z )=0. Cubic algebraic surfaces (defined by an implicit equation of degree 3) are emphasized. While much of this material applies only to cubic surfaces, some applies to algebraic surfaces of any degree. This area of the tutorial introduces terminology, presents different methods for defining and modeling with cubic surfaces, and examines the power basis representation of algebraic surfaces. Methods of forcing an algebraic surface to interpolate a set of points or a space curve …
Consistency And Generalization In Incrementally Trained Connectionist Networks, Tony R. Martinez
Consistency And Generalization In Incrementally Trained Connectionist Networks, Tony R. Martinez
Faculty Publications
This paper discusses aspects of consistency and generalization in connectionist networks which learn through incremental training by examples or rules. Differences between training set learning and incremental rule or example learning are presented. Generalization, the ability to output reasonable mappings when presented with novel input patterns, is discussed in light of the above learning methods. In particular, the contrast between humming distance generalization and generalizing by high order combinations of critical variables is overviewed. Examples of detailed rules for an incremental learning model are presented for both consistency and generalization constraints.
Interactive Morphometrics From Three-Dimensional Surface Images, William A. Barrett, Shawn C. Becker
Interactive Morphometrics From Three-Dimensional Surface Images, William A. Barrett, Shawn C. Becker
Faculty Publications
Techniques have been developed for extracting three-dimensional (3D) measurements directly and interactively from 3D representations of surface anatomy. In order to obtain 3D measurements the anatomical surface is interrogated directly through the use of morphometric tools. Morphometric tools include points, 3D graphical "probes", and logical sectioning functions which interact with the surface through depth buffer compositing operations. Tools are interactively positioned on or through the surface to measure surface dimensions and partial volumes, or to define intersecting functions which allow surface anatomy to be visualized in the context of surrounding anatomy. Visualization is also enhanced because tools reveal much pertaining …
Interactive Measurement Of Three-Dimensional Cardiac Morphology, William A. Barrett, Shawn C. Becker
Interactive Measurement Of Three-Dimensional Cardiac Morphology, William A. Barrett, Shawn C. Becker
Faculty Publications
Techniques have been developed for extracting three-dimensional (3D) measurements directly and interactively from 3D representations of Cine CT images. In order to obtain 3D measurements the anatomical surface is interrogated directly through the use of a 3D graphical "probe" (line). The probe is interactively positioned and stretched between any visible surface points to allow direct capture of 3D (linear) distance. Distance measurements are updated in real time as the probe dynamically "penetrates" any intervening anatomy while providing valuable depth cuing for visual feedback and probe placement. Curvilinear distance is obtained by stretching the probe over multiple surface points. The probe …
Probabilistic Segmentation Of Myocardial Tissue By Deterministic Relaxation, William A. Barrett, Shawn C. Becker, Jerome A. Broekhuijsen
Probabilistic Segmentation Of Myocardial Tissue By Deterministic Relaxation, William A. Barrett, Shawn C. Becker, Jerome A. Broekhuijsen
Faculty Publications
A recently-developed probabilistic model for automatically segmenting regions of interest in abdominal CT scans has been adapted to the challenging task of segmenting myocardial tissue in Cine CT scans. A system has been implemented on relatively low-cost hardware which performs such segmentations. Special techniques have been developed to improve consistency and accuracy. Early results of testing this new modality are encouraging and promising. Based on observations from experimentation, new directions for future work have been identified.
A Relaxation Algorithm For Segmentation Of The Endocardial Surface From Cine Ct, William A. Barrett, Bryan S. Morse
A Relaxation Algorithm For Segmentation Of The Endocardial Surface From Cine Ct, William A. Barrett, Bryan S. Morse
Faculty Publications
A relaxation algorithm has been developed for automated segmentation of the endocardial surface from contrast Cine CT images. The image is contoured at an initial density threshold and a one-dimensional edge operator is applied orthogonally to each point of the contour. Output from the operator is used to generate a histogram, the mode of which identifies a new threshold. The image is contoured again at the new threshold and the process is repeated. Iteration continues with successive threshold estimates converging to a stable value in the region of the endocardial surface. Computer-determined thresholds compare favorably with manual segmentation while reducing …
A Parallel-Processing Subsystem For Rapid 3-D Interpolation Of Ct Images, William A. Barrett, Stephen J. Allan, Scott R. Cannon
A Parallel-Processing Subsystem For Rapid 3-D Interpolation Of Ct Images, William A. Barrett, Stephen J. Allan, Scott R. Cannon
Faculty Publications
An inexpensive parallel-processing subsystem for the rapid interpolation of CT image planes is demonstrated with a variety of node topologies. The subsystem is based on a tree network of INMOS T414 Transputer processors and is hosted by an AT-based image workstation. The subsystem accepts a stack of eight arbitrarily-spaced 256 x 256 image planes from the host. Subsystem output to the host consists of a stack of 32 scaled and evenly-spaced image planes (256 x 256 x 32 with cubic voxels). Benchmark execution times ranged from 12.3 seconds for three nodes to 5.8 seconds for eight nodes.
Dynamic Display And Quantitative Analysis Of Three-Dimensional Left Ventricular Pathology, William A. Barrett, Jayaram K. Udupa
Dynamic Display And Quantitative Analysis Of Three-Dimensional Left Ventricular Pathology, William A. Barrett, Jayaram K. Udupa
Faculty Publications
Techniques have been developed for automated extraction and dynamic interactive display of three-dimensional (3D) left ventricular (LV) surface anatomy from Cine CT images using a PC-based image display architecture. Images of both endocardial and myocardial surface anatomy are generated from multiple views at multiple time instances to demonstrate various LV pathologies including apical akinesis, apical and posterior aneurysms, LV Failure, IHSS, and a left atrial myxoma. Surface generation requires interpolation between scans, surface tracking, and rendering. Generation of 60 views corresponding to a single time instance requires approximately 15 minutes. LV dimensions are measured between two or more surface points …
Digital Neural Networks, Tony R. Martinez
Digital Neural Networks, Tony R. Martinez
Faculty Publications
Demands for applications requiring massive parallelism in symbolic environments have given rebirth to research in models labeled as neural networks. These models are made up of many simple nodes which are highly interconnected such that computation takes place as data flows amongst the nodes of the network. To present, most models have proposed nodes based on simple analog functions, where inputs are multiplied by weights and summed, the total then optionally being transformed by an arbitrary function at the node. Learning in these systems is accomplished by adjusting the weights on the input lines. This paper discusses the use of …
Can Programmers Reuse Software?, Scott N. Woodfield, David W. Embley, Del T. Scott
Can Programmers Reuse Software?, Scott N. Woodfield, David W. Embley, Del T. Scott
Faculty Publications
An experiment asked programmers untrained in reuse to evaluate component reusability. They did poorly. Are reusability's promises hollow? Or are there some answers?
Algebraic Geometry For Computer-Aided Geometric Design, Thomas W. Sederberg, Ronald N. Goldman
Algebraic Geometry For Computer-Aided Geometric Design, Thomas W. Sederberg, Ronald N. Goldman
Faculty Publications
Classical algebraic geometry has been virtually ignored in computer-aided geometric design. However, because it deals strictly with algorithms, it is really more suited to this field than is modern algebraic geometry, which introduces abstractions far removed from the algorithmic nature of computer-aided design. This tutorial examines resultants, curve implicitization, curve inversion, and curve intersection. Discussion follows a series of examples simple enough for those with only a modest algebra background to follow.
Six Copyright Theories For The Protection Of Computer Object Programs, I. Trotter Hardy
Six Copyright Theories For The Protection Of Computer Object Programs, I. Trotter Hardy
Faculty Publications
No abstract provided.