Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- 2D string (1)
- Absolute Addressing (1)
- Array Manipulation (1)
- Array Visualization (1)
- Arrays (1)
-
- Automated Electric Test (1)
- Automatic Test Equipment (1)
- Cell References (1)
- Complexity (1)
- Crozzle (1)
- Data Handling (1)
- Data Structures (1)
- Data Visualisation (1)
- Data-parallel (1)
- Diagnostic Expert Systems (1)
- Divide-and-conquer (1)
- Error-Prone Notation (1)
- Form-Based Visual Programming Language (1)
- Formal Specification (1)
- Formulas (1)
- Formulate (1)
- Fuzzy Logic (1)
- Graphical User Interfaces (1)
- Hash table (1)
- Image database indexing (1)
- Intersection (1)
- Logical Regions (1)
- Multi-Dimensional Arrays (1)
- NP-hard (1)
- Numeric Parameter Tuning (1)
Articles 1 - 12 of 12
Full-Text Articles in Entire DC Network
Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin
Run-Time Security Evaluation: Can We Afford It?, Cristina Serban, Bruce M. Mcmillin
Computer Science Faculty Research & Creative Works
The use of the run-time security evaluation (RTSE) method for a distributed application takes a toll in overall application performance. The associated overhead and its major sources are discussed, along with possible solutions for improvements, and questions that remain still open.
R-By-C Crozzle: An Np-Hard Problem, Michelle Gower, Ralph W. Wilkerson
R-By-C Crozzle: An Np-Hard Problem, Michelle Gower, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
In an Australian Magazine, a Monetary Prize is Awarded to the Person with the Best Answer to a Word Puzzle Called a Crozzle. the Placement of Words into a Ten by Fifteen Grid Obtaining the Highest Score is the Best Answer. Various Search Techniques Have Been Employed to Solve This Problem, Yet No One Has Shown Whether There is a Polynomial-Time Algorithm to Find the Best Crozzle. This Paper Creates a Similar Word Puzzle, Called R-By-C Crozzle, by Lifting the Constraint on the Grid Size. R-By-C Crozzle is Not in NP, But There Exists a Polynomial Reduction to It from …
Data Parallel Implementation Of Surface-To-Surface Intersection, Terence M. Burke, Chaman Sabharwal
Data Parallel Implementation Of Surface-To-Surface Intersection, Terence M. Burke, Chaman Sabharwal
Computer Science Faculty Research & Creative Works
The sequential surface-to-surface intersection algorithm has been extensively studied in the past decade. With the advent of parallel processing machines, it is desirable to parallelize this algorithm to gain extra computation speed for real time applications. An earlier attempt to parallelize this algorithm was on shared memory parallel computer due to the highly shared model of data structure [Chang 1991). A shared memory machine is not available at every location. Instead, we have implemented it on distributed parallel computer iPSC/860 with 32 processors. The initial development was done using PVM software in heterogeneous environment consisting of Sun workstations and 486's …
Near Perfect Hash Table For Image Databases, Sanjiv K. Bhatia, Chaman Sabharwal
Near Perfect Hash Table For Image Databases, Sanjiv K. Bhatia, Chaman Sabharwal
Computer Science Faculty Research & Creative Works
In image database systems, a perfect hash table can be used to enhance the efficiency and effectiveness of the image retrieval process. In our earlier work, we have proposed heuristic algorithms to compute the minimal perfect hash table from symbolic picture objects. The hash table thus computed cannot be modified easily, limiting its application to fixed databases like the ones on CD-ROMs. In this paper, we propose a new data structure to allow for insertion and deletion in the hash table. The new data structure, the near-perfect hash table, allows a limited number of collisions on some of the hash …
A Systematic Tradeoff Methodology For Acquiring And Validating Imprecise Requirements, J. Yen, Xiaoqing Frank Liu, W. A. Tiao
A Systematic Tradeoff Methodology For Acquiring And Validating Imprecise Requirements, J. Yen, Xiaoqing Frank Liu, W. A. Tiao
Computer Science Faculty Research & Creative Works
Requirement analysis is one of the most important phases in a software development process. Existing requirement methodologies are limited in specifying requirements that are usually vague and imprecise, and in supporting tradeoff analysis between the conflicting requirements. In this paper, the elasticity of imprecise requirements is captured using fuzzy logic to facilitate tradeoffs between conflicting requirements. Based on the marginal rate of substitution in decision science, we have developed a systematic approach to elicit the structures and the parameters of imprecise requirements, to validate the scheme for aggregating requirements, and to assess relative priorities of conflicting requirements.
Adaptive Information Filtering As A Means To Overcome Information Overload, Daniel R. Tauritz
Adaptive Information Filtering As A Means To Overcome Information Overload, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
Information Filtering is concerned with filtering data streams in such a way as to leave only pertinent data (information) to be perused. When the data streams are produced in a changing environment (as most if not all are) the filtering has to adapt too in order to remain effective. Adaptive Information Filtering (AIF) is concerned with filtering in changing environments. The changes may occur both on the transmission side (the nature of the streams can change), and on the reception side (the interest of a user can change). The thesis research described in this paper combines trigram analysis, clustering, and …
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)
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
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 …
Frequency Coordination Between Adjacent Carriers Of Two Cdma Operators, Seung Jong Park, Hun Bum Ha, Jong Tai Chung, Yoon Sub Shim, Do Young Lee
Frequency Coordination Between Adjacent Carriers Of Two Cdma Operators, Seung Jong Park, Hun Bum Ha, Jong Tai Chung, Yoon Sub Shim, Do Young Lee
Computer Science Faculty Research & Creative Works
Frequency coordination is the process that assigns frequency bands to neighboring or coexisting systems to minimize interference. This interference is caused by unwanted signals from adjacent frequency bands. Especially, interference is maximized by the spatial near-far problem which occurs in case two different cellular systems serve. This critical case happens when different cellular operators using the adjacent carriers do not collocate their base stations (BS). In this paper, we investigate the frequency coordination when two CDMA operators using adjacent CDMA carriers don't collocate their BS. In order to lessen the unwanted interference, we put the guard band which separates adjacent …
Optimization Of The Discriminatory Power Of A Trigram Based Document Clustering Algorithm Using Evolutionary Computation, Daniel R. Tauritz
Optimization Of The Discriminatory Power Of A Trigram Based Document Clustering Algorithm Using Evolutionary Computation, Daniel R. Tauritz
Computer Science Faculty Research & Creative Works
No abstract provided.
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 …