Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- P4-sparse graphs (2)
- Architecture (Computers) (1)
- Buckets (1)
- Classifications (1)
- Cluster analysis (1)
-
- Cographs (1)
- Cross-entropy (1)
- Cross-entropy minimization (1)
- Data storage (1)
- Digital data (1)
- Digital libraries (1)
- Documents (1)
- Fourier transform (1)
- Geiringer’s theorem (1)
- Group-based collaboration (1)
- Information dissemination (1)
- Information management (1)
- Information retrieval (1)
- Integrated library systems (1)
- Intertwining data sets (1)
- Libraries (1)
- Mobile computing (1)
- NC algorithms (1)
- Parallel algorithms (1)
- Probability distribution (1)
- Random heuristic search (1)
- Scheduling (1)
- Semantics (1)
- Shared memory model (1)
- Software development tools (1)
Articles 1 - 7 of 7
Full-Text Articles in Computer Sciences
Minimum Cross-Entropy Approximation For Modeling Of Highly Intertwining Data Sets At Subclass Levels, Qiuming Zhu
Minimum Cross-Entropy Approximation For Modeling Of Highly Intertwining Data Sets At Subclass Levels, Qiuming Zhu
Computer Science Faculty Publications
We study the problem of how to accurately model the data sets that contain a number of highly intertwining sets in terms of their spatial distributions. Applying the Minimum Cross-Entropy minimization technique, the data sets are placed into a minimum number of subclass clusters according to their high intraclass and low interclass similarities. The method leads to a derivation of the probability density functions for the data sets at the subclass levels. These functions then, in combination, serve as an approximation to the underlying functions that describe the statistical features of each data set.
The Simple Genetic Algorithm And The Walsh Transform: Part Ii, The Inverse, Michael D. Vose, Alden H. Wright
The Simple Genetic Algorithm And The Walsh Transform: Part Ii, The Inverse, Michael D. Vose, Alden H. Wright
Computer Science Faculty Publications
This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially “triangularized” when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.
The Simple Genetic Algorithm And The Walsh Transform: Part I: Theory, Michael D. Vose, Alden H. Wright
The Simple Genetic Algorithm And The Walsh Transform: Part I: Theory, Michael D. Vose, Alden H. Wright
Computer Science Faculty Publications
This paper is the first part of a two-part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary representation, the Walsh transform is the Fourier transform.) The results are of a theoretical nature and are based on the analysis of mutation and crossover. The Fourier transform of the mixing matrix is shown to be sparse. An explicit formula is given for the spectrum of the differential of the mixing transformation. By using the Fourier representation and the fast Fourier transform, one generation of the infinite population simple genetic algorithm …
Creating A Canonical Scientific And Technical Information Classification System For Ncstrl+, Melissa E. Tiffany, Michael L. Nelson
Creating A Canonical Scientific And Technical Information Classification System For Ncstrl+, Melissa E. Tiffany, Michael L. Nelson
Computer Science Faculty Publications
The purpose of this paper is to describe the new subject classification system for the NCSTRL+ project. NCSTRL+ is a canonical digital library (DL) based on the Networked Computer Science Technical Report Library (NCSTRL). The current NCSTRL+ classification system uses the NASA Scientific and Technical (STI) subject classifications, which has a bias towards the aerospace, aeronautics, and engineering disciplines. Examination of other scientific and technical information classification systems showed similar discipline-centric weaknesses. Traditional, library-oriented classification systems represented all disciplines, but were too generalized to serve the needs of a scientific and technically oriented digital library. Lack of a suitable existing …
Buckets: Aggregative, Intelligent Agents For Publishing, Michael L. Nelson, Kurt Maly, Stewart N. T. Shen, Mohammad Zubair
Buckets: Aggregative, Intelligent Agents For Publishing, Michael L. Nelson, Kurt Maly, Stewart N. T. Shen, Mohammad Zubair
Computer Science Faculty Publications
Buckets are an aggregative, intelligent construct for publishing in digital libraries. The goal of research projects is to produce information. This information is often instantiated in several forms, differentiated by semantic types (report, software, video, datasets, etc.). A given semantic type can be further differentiated by syntactic representations as well (PostScript version, PDF version, Word version, etc.). Although the information was created together and subtle relationships can exist between them, different semantic instantiations are generally segregated along currently obsolete media boundaries. Reports are placed in report archives, software might go into a software archive, but most of the data and …
On The Structure Of Graphs With Few P4s, Luitpold Babel, Stephan Olariu
On The Structure Of Graphs With Few P4s, Luitpold Babel, Stephan Olariu
Computer Science Faculty Publications
We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P4-reducible graphs, and P4-sparse graphs.
A Fast Parallel Algorithm To Recognize P4-Sparse Graphs, Rong Lin, Stephan Olariu
A Fast Parallel Algorithm To Recognize P4-Sparse Graphs, Rong Lin, Stephan Olariu
Computer Science Faculty Publications
A number of problems in mobile computing, group-based collaboration, automated theorem proving, networking, scheduling, and cluster analysis suggested the study of graphs featuring certain “local density” characteristics. Typically, the notion of local density is equated with the absence of chordless paths of length three or more. Recently, a new metric for local density has been proposed, allowing a number of such induced paths to occur. More precisely, a graphG is called P4-sparse if no set of five vertices inG induces more than one chordless path of length three. P4-sparse graphs generalize the well-known class of cographs corresponding to …