Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (44)
- Electrical and Computer Engineering (19)
- Databases and Information Systems (16)
- Other Computer Sciences (16)
- Systems Architecture (16)
-
- Mechanical Engineering (8)
- Mining Engineering (8)
- Aerospace Engineering (7)
- Operations Research, Systems Engineering and Industrial Engineering (6)
- Biology (4)
- Life Sciences (4)
- Mathematics (4)
- Statistics and Probability (4)
- Chemical Engineering (3)
- Psychology (3)
- Social and Behavioral Sciences (3)
- Chemistry (2)
- Computational Engineering (2)
- Computer Engineering (2)
- Architectural Engineering (1)
- Architecture (1)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Civil and Environmental Engineering (1)
- Cognition and Perception (1)
- Cognitive Psychology (1)
- Keyword
-
- Security (21)
- Federated learning (15)
- Deep learning (12)
- Cloud computing (11)
- Edge computing (11)
-
- Internet (10)
- IoT (9)
- Sensor networks (9)
- Anomaly detection (8)
- Drone (8)
- Internet of Things (8)
- Routing (8)
- Wireless sensor networks (8)
- Crowdsourcing (7)
- Data Warehouses (7)
- Optimization (7)
- Privacy (7)
- Algorithms (6)
- Anomaly Detection (6)
- Big data (6)
- Deep Learning (6)
- Formal Specification (6)
- Information Resources (6)
- Large language models (6)
- Mobility (6)
- Parallel Algorithms (6)
- WHOWEDA (6)
- Approximation algorithms (5)
- Compression (5)
- Distributed (5)
- Publication Year
Articles 841 - 870 of 919
Full-Text Articles in Computer Sciences
Concepts Of Adaptive Information Filtering, Daniel R. Tauritz
Concepts Of Adaptive Information Filtering, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
This paper was written for the project study “Adaptive Information Filtering” at the Department of Computer Science, Leiden University, The Netherlands. The assignment was to write an introduction to Adaptive Information Filtering (AIF), based on the author’s ideas for his M.Sc. thesis, and with as large an audience as possible in mind. In addition to a simple introduction to AIF, this paper should also provide easy introductions to clustering algorithms, evolutionary computation, and n-gram analysis. (Preface, page 2)
A User Interface For The Visualization And Manipulation Of Arrays, Jennifer Leopold, A. Ambler
A User Interface For The Visualization And Manipulation Of Arrays, Jennifer Leopold, A. Ambler
Computer Science Faculty Research & Creative Works
The success of spreadsheets has shown that a visual representation of a 2D array greatly facilitates solving certain problems. However, spreadsheets are not general-purpose programming environments and are not suited to many problems that might naturally be solved using multi-dimensional arrays. Furthermore, spreadsheets employ a textual notation for cell references in formulas. This notation, which adds to the programmer''s burden by distinguishing between relative and absolute addressing, can be difficult to understand and is error-prone even for the most experienced users. In this paper, we present a user interface for multi-dimensional arrays within Formulate, a form-based visual programming language. This …
Tuning Numeric Parameters To Troubleshoot A Telephone-Network Loop, Christopher J. Merz, M. J. Pazzani, A. P. Danyluk
Tuning Numeric Parameters To Troubleshoot A Telephone-Network Loop, Christopher J. Merz, M. J. Pazzani, A. P. Danyluk
Computer Science Faculty Research & Creative Works
The Nynex Max expert system analyzes the result of an automated electric test on a telephone line and determines the type of problem. However, tuning the system's parameter values can be difficult. The Opti-Max system can automatically set these parameters by analyzing decisions made by experts who troubleshoot problems
Automatic Pcb Inspection Algorithms: A Survey, Madhav Moganti, Fikret Ercal, Cihan H. Dagli, Shou Tsunekawa
Automatic Pcb Inspection Algorithms: A Survey, Madhav Moganti, Fikret Ercal, Cihan H. Dagli, Shou Tsunekawa
Computer Science Faculty Research & Creative Works
The importance of the inspection process has been magnified by the requirements of the modern manufacturing environment. In electronics mass-production manufacturing facilities, an attempt is often made to achieve 100% quality assurance of all parts, subassemblies, and finished goods. A variety of approaches for automated visual inspection of printed circuits have been reported over the past two decades. In this survey, algorithms and techniques for the automated inspection of printed circuit boards are examined. A classification tree for these algorithms is presented and the algorithms are grouped according to this classification. This survey concentrates mainly on image analysis and fault …
Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong
Relaxing Synchronization In Distributed Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong
Computer Science Faculty Research & Creative Works
This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/2
Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson
Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
No abstract provided.
Automatic Pcb Inspection Systems, M. Moganti, Fikret Erçal
Automatic Pcb Inspection Systems, M. Moganti, Fikret Erçal
Computer Science Faculty Research & Creative Works
There are more than 50 process steps required to fabricate a printed circuit board (PCB). To ensure quality, human operators simply inspect the work visually against prescribed standards. The decisions made by this labor intensive, and therefore costly, procedure often also involve subjective judgements. Automatic inspection systems remove the subjective aspects and provide fast, quantitative dimensional assessments. Machine vision may answer the manufacturing industry's need to improve product quality and increase productivity. The major limitation of existing inspection systems is that all the algorithms need a special hardware platform to achieve the desired real-time speeds. This makes the systems extremely …
Adaptive Resonance Theory (Art): An Introduction, Lucien G. Heins, Daniel R. Tauritz
Adaptive Resonance Theory (Art): An Introduction, Lucien G. Heins, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
No abstract provided.
Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward
Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward
Computer Science Faculty Research & Creative Works
A significant problem in the design and construction of an artificial neural network for function approximation is limiting the magnitude and the variance of errors when the network is used in the field. Network errors can occur when the training data does not faithfully represent the required function due to noise or low sampling rates, when the network's flexibility does not match the variability of the data, or when the input data to the resultant network is noisy. This paper reports on several experiments whose purpose was to rank the relative significance of these error sources and thereby find neural …
Using Neural Networks For Aerodynamic Parameter Modeling, Gerald E. Peterson, William E. Bond, Roger Germann, Barry Streeter, James Urnes
Using Neural Networks For Aerodynamic Parameter Modeling, Gerald E. Peterson, William E. Bond, Roger Germann, Barry Streeter, James Urnes
Computer Science Faculty Research & Creative Works
Neural networks are being developed at McDonnell Douglas Corporation to provide an onboard model of an aircraft's aerodynamics to support advanced flight control systems. These flight control systems, constructed using neural networks and advanced controllers, have the potential to reduce flight control development costs and to improve inflight performance. Neural networks are useful in this situation because they can compactly represent the data and operate in real-time
An Efficient Multicomputer Algorithm For The Solution Of Chemical Process Flowsheeting Equations, Fikret Ercal, Neil L. Book, S. Pait, J. J. Fielding
An Efficient Multicomputer Algorithm For The Solution Of Chemical Process Flowsheeting Equations, Fikret Ercal, Neil L. Book, S. Pait, J. J. Fielding
Computer Science Faculty Research & Creative Works
This paper presents a parallel solution method of large sparse systems of linear equations arising in the context of a chemical process flowsheeting application on a message passing multicomputer. To maximize the performance, the algorithm uses a novel matrix decomposition and solution method, called parallel two-phased LU decomposition, which schedules the concurrent tasks in a maximally overlapping manner, and at the same time, tries to minimize the interprocessor data dependencies and obtain optimal load balancing. The forward elimination step is performed concurrently with the parallel two-phased LU decomposition step and backward substitution is parallelized in a piecewise manner. Implementation results …
Parameter Tuning For The Max Expert System, Christopher J. Merz, M. J. Pazzani
Parameter Tuning For The Max Expert System, Christopher J. Merz, M. J. Pazzani
Computer Science Faculty Research & Creative Works
We investigate methods for tuning numeric parameters in Nynex MAX, a telephone trouble screening expert system. Steepest descent, hillclimbing, and simulated annealing parameter adjustment strategies are applied to the problems of maximizing classification accuracy and minimizing misclassification cost. For both of those optimization problems we evaluate each algorithm''s ability to tune initial parameters for several situations
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
A Fuzzy Logic-Based Foundation For Analyzing Imprecise Conflicting Requirements, J. Yen, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
Imprecise requirements are represented by the canonical form in test-score semantics. The concepts of feasibility, satisfiability, and specificity are formalized based on the fuzzy sets. The relationships between requirements are classified to be conflicting and cooperative. A feasible overall requirement can thus be formulated based on the tradeoff analysis of the conflicting requirements by using fuzzy multi-criteria optimization technique
An Improved Characterization Of 1-Step Recoverable Embeddings: Rings In Hypercubes, Jun-Lin Liu, T.J. Sager, Bruce M. Mcmillin
An Improved Characterization Of 1-Step Recoverable Embeddings: Rings In Hypercubes, Jun-Lin Liu, T.J. Sager, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
An embedding is 1-step recoverable if any single fault occurs, the embedding can be reconfigured in one reconfiguration step to maintain the structure of the embedded graph. In this paper we present an efficient scheme to construct this type of 1-step recoverable ring embeddings in the hypercube. Our scheme will guarantee finding a 1-step recoverable embedding of a length-k (even) ring in a d-cube where 6 less than or equal to k less than or equal to (3/4)2/sup d/ and d greater than or equal to 3, provided such an embedding exists. Unlike previously proposed schemes, we solve the general …
Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret Erçal, Hsi-Chieh Lee, William V. Stoecker, Randy Hays Moss, Anurag Chawla
Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret Erçal, Hsi-Chieh Lee, William V. Stoecker, Randy Hays Moss, Anurag Chawla
Computer Science Faculty Research & Creative Works
Malignant melanoma is the deadliest form of all skin cancers. Approximately 32,000 new cases of malignant melanoma were diagnosed in 1991 in the United States, with approximately 80% of patients expected to survive 5 years. Fortunately, if detected early, even malignant melanoma may be treated successfully, Thus, in recent years, there has been rising interest in the automated detection and diagnosis of skin cancer, particularly malignant melanoma. Here, the authors present a novel neural network approach for the automated separation of melanoma from 3 benign categories of tumors which exhibit melanoma-like characteristics. The approach uses discriminant features, based on tumor …
Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond
Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond
Computer Science Faculty Research & Creative Works
Quinlan's ID3 machine learning algorithm induces classification trees (rules) from a set of training examples. The algorithm is extremely effective when training examples are composed of attributes whose values are taken from small discrete domains. The classification accuracy of ID3-produced trees on domains whose attributes are many-valued tends to be marginal due to the large number of possible values which may be associated with each attribute. Attempts to solve this problem by a priori grouping of attribute values into distinct subsets has met with limited success. The dynamic ID3 algorithm improves the performance of ID3 on this type of problem …
Finding Fixed Point Combinators Using Prolog, Richard Rankin, Ralph W. Wilkerson
Finding Fixed Point Combinators Using Prolog, Richard Rankin, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
A Powerful New Strategy, Called the Kernel Method, Has Been Developed by Larry Wos and William McCune at Argonne National Laboratories, to Study Various Fixed-Point Properties within Certain Classes of Applicative Systems. We Present a Very Simple Prolog Reasoning System, Named JIST, Which Incorporates Both Stages of the Kernel Method into a Single Unified Program. Furthermore, the Prolog Tool Has Been Extended to Run within a Distributed Environment using the Linda Protocol.
An Intelligent Approach To Discrete Sampling Of Parametric Curves, Chaman Sabharwal
An Intelligent Approach To Discrete Sampling Of Parametric Curves, Chaman Sabharwal
Computer Science Faculty Research & Creative Works
In graphics and animation applications, two of the problems are: (1) representation of an analytic curve by a discrete set of sampled points and (2) determining the similarity between two parametric curves. It is necessary to measure the accuracy of approximation and to have a metric to calculate the disparity between two parametric curves. Both of these problems have been associated with the reparameterization of the curves with respect to arc length. One of the methods uses Gaussian Quadrature to determine the arc length parameterization [Guenter and Parent 1990], while another interesting technique is a simple approximation method [Fritsch and …
A Hybrid Genetic Algorithm For An Np-Complete Problem With An Expensive Evaluation Function, Richard Rankin, Ralph W. Wilkerson, Geoff Harris, Jo Spring
A Hybrid Genetic Algorithm For An Np-Complete Problem With An Expensive Evaluation Function, Richard Rankin, Ralph W. Wilkerson, Geoff Harris, Jo Spring
Computer Science Faculty Research & Creative Works
In This Paper, a Non-Standard Hybrid Genetic Algorithm is Presented. the Approach is Non-Standard in that It Violates Some of the Common Attributes Associated with Genetic Algorithms in the Literature. the Algorithm Presented Uses Local Maxima to Locate the Global Maximum Value, Uses Haploid Chromosomes with Dominance Mating Instead of Crossover, Generates One Offspring Per Set of Parents, Has No Specific Mutation Operator, and is Designed for Rapid Convergence. When Applied to an NP-Complete Problem, the Results of This Hybrid Algorithm Are Shown to Be Very Successful in Reducing the Complexity of the Problem.
Recovering 3d Image Parameters From Corresponding Two 2d Images, Chaman Sabharwal
Recovering 3d Image Parameters From Corresponding Two 2d Images, Chaman Sabharwal
Computer Science Faculty Research & Creative Works
An improved algorithm for computing the three-dimensional structure of a scene from pair of stereo images is given. The spatial relationship between the two images is not known, only the "corresponding" points in the two images are known. This problem of 3D scene reconstruction involves: (1) establishing a one-to-one correspondence between the image plane stereo pairs corresponding to the spatial points-'the correspondence problem', and (2) determining the relative orientation of the two image planes and the depth relation of spatial points with respect to the image planes. This paper assumes the first problem solved [Usikov et al. 1991] and addresses …
Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg
Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg
Computer Science Faculty Research & Creative Works
The PRAM model has been shown to be an optimal design for emulating both loose and tightly coupled multiprocessors for unit time operations. When virtual processors are required, multiplexing work to available processors is employed. This introduces a form of latency incurred by operating system overhead. Further complications arise when bandwidth creates bottlenecking of work units. G.E. Blelloch (1989) showed how to add parallel prefix operations (scans) to an extended PRAM model which uses unit step, not time operations. This paper shows how the psi) calculus can be used to group work units, i.e., pipelining the work units, so that …
Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond
Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond
Computer Science Faculty Research & Creative Works
Functional reasoning, a subfield of model-based reasoning, is discussed. This approach uses abstractions of a device's purpose to index behaviors that achieve that purpose. Functional modeling, a variation on this method, also uses simulation as a core reasoning strategy. The complex causal knowledge of a device along functional lines is decomposed, then a causal story of how the device will operate in a particular situation given stated boundary conditions is composed. The application of the functional approach to modeling the fuel system of a F/A-18 aircraft is described. The representation of the F/A-18 fuel system includes 89 component devices, 92 …
Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss
Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss
Computer Science Faculty Research & Creative Works
A simple and yet effective method for finding the borders of tumors is presented as an initial step towards the diagnosis of skin tumors from their color images. The method makes use of an adaptive color metric from the red, green, and blue planes that contains information for discriminating the tumor from the background. Using this suitable coordinate transformation, the image is segmented. The tumor portion is then extracted from the segmented image and borders are drawn. Experimental results that verify the effectiveness of this approach are given
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Formation Of Clusters And Resolution Of Ordinal Attributes In Id3 Classification Trees, Chaman Sabharwal, Keith R. Hacke, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
Many learning systems have been designed to construct classification trees from a set of training examples. One of the most widely used approaches for constructing decision trees is the ID3 algorithm [Quinlan 1986]. Decision trees are ill-suited to handle attributes with ordinal values. Problems arise when a node representing an ordinal attribute has a branch for each value of the ordinal attribute in the training set. This is generally infeasible when the set of ordinal values is very large. Past approaches have sought to cluster large sets of ordinal values before the classification tree is constructed [Quinlan 1986; Lebowitz 1985; …
Parallel Error Tolerance Scheme Based On The Hill Climbing Nature Of Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong
Parallel Error Tolerance Scheme Based On The Hill Climbing Nature Of Simulated Annealing, Bruce M. Mcmillin, Chul-Eui Hong
Computer Science Faculty Research & Creative Works
In parallelizing simulated annealing in a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. One way to mitigate this bottleneck is to amortize the overhead of these state updates over as many parallel state changes as possible. Using this technique introduces errors in the calculated cost C(S) of a particular state S used by the annealing process. Analytically derived bounds are placed on this error in order to assure convergence to the correct result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the …
Experimentation With Proof Methods For Non-Horn Sets, Christopher J. Merz, Ralph W. Wilkerson
Experimentation With Proof Methods For Non-Horn Sets, Christopher J. Merz, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
Two Resolution Proof Strategies Developed by Peterson Are Implemented by Modifying Otter, an Existing Automated Theorem Prover. the Methods, Lock-T Refutation and LNL-T Refutation, Are Generalizations of Unit Refutation and Input Resolution, Respectively, to Non-Horn Sets and Represent Independent, Equivalent but Opposite Ways of Searching. the Algorithms Used Are based on a Corrected Version of the Foundational Work. the Strategies Have Been Tested on Various Non-Horn Challenge Problems from the Tarskian Geometry and the Non-Obvious Problem, with the Results Being in Some Cases Quite Favorable When Compared to Other Resolution Techniques.
Proving Functionally Difficult Problems Through Model Generation, Richard Rankin, Ralph W. Wilkerson
Proving Functionally Difficult Problems Through Model Generation, Richard Rankin, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
Satchmo [MA88] is a Theorem Prover Implemented in Prolog Which Attempts to Provide Satisfiability Checking through Model Generation. This Paper Gives a Brief Introduction to SATCHMO and Reports Extensions to the Original Work Which Allow SATCHMO to Solve Problems Previously Considered to Be Finitely Unprovable within the SATCHMO System. the Specific Problems Are from [PE86, MO85, LU85] and Were Designed to Convert Simple Propositional Logic Problems into Functionally Difficult First Order Problems. Although the Benefits of using the SATCHMO System Are Many, the Fact that It Could Not Offer Proofs for a Set of Problems Provable in Other Systems is …
Fault-Tolerant Concurrent Branch And Bound Algorithms Derived From Program Verification, Hanan Lutfiyya, Aggie Sun, Bruce M. Mcmillin
Fault-Tolerant Concurrent Branch And Bound Algorithms Derived From Program Verification, Hanan Lutfiyya, Aggie Sun, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
An important aspect which is often overlooked in software design of distributed environments is that of fault tolerance. Many methodologies in the past have attempted to provide fault tolerance efficiently but have never been successful at eliminating explicit time and space redundancy. One approach for providing fault tolerance is through examining the behavior and properties of the application and deriving executable assertions that detect faults. Our work focuses on transforming the assertions of a verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. It is also shown …
Semi-Supervised Adaptive Resonance Theory (Smart2), Christopher J. Merz, William E. Bond, Daniel C. St. Clair
Semi-Supervised Adaptive Resonance Theory (Smart2), Christopher J. Merz, William E. Bond, Daniel C. St. Clair
Computer Science Faculty Research & Creative Works
Adaptive resonance theory (ART) algorithms represent a class of neural network architectures which self-organize stable recognition categories in response to arbitrary sequences of input patterns. The authors discuss incorporation of supervision into one of these architectures, ART2. Results of numerical experiments indicate that this new semi-supervised version of ART2 (SMART2) outperformed ART for classification problems. The results and analysis of runs on several data sets by SMART2, ART2, and backpropagation are analyzed. The test accuracy of SMART2 was similar to that of backpropagation. However, SMART2 network structures are easier to interpret than the corresponding structures produced by backpropagation.
Composite Stock Cutting Through Simulated Annealing, Hanan Lutfiyya, Bruce M. Mcmillin, Pipatpong Poshyanonda, Cihan H. Dagli
Composite Stock Cutting Through Simulated Annealing, Hanan Lutfiyya, Bruce M. Mcmillin, Pipatpong Poshyanonda, Cihan H. Dagli
Computer Science Faculty Research & Creative Works
This paper explores the use of Simulated Annealing as an optimization technique for the problem of Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, annealing parameters and performance. © 1992.