Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Graphics and Human Computer Interfaces (4)
- Systems Architecture (4)
- Databases and Information Systems (2)
- Life Sciences (2)
- Numerical Analysis and Scientific Computing (2)
-
- Other Computer Sciences (2)
- Programming Languages and Compilers (2)
- Software Engineering (2)
- Artificial Intelligence and Robotics (1)
- Arts and Humanities (1)
- Bioinformatics (1)
- Computer Engineering (1)
- Continental Philosophy (1)
- Engineering (1)
- Environmental Sciences (1)
- Epistemology (1)
- Genetics and Genomics (1)
- Logic and Foundations (1)
- Logic and Foundations of Mathematics (1)
- Mathematics (1)
- OS and Networks (1)
- Other Computer Engineering (1)
- Other Languages, Societies, and Cultures (1)
- Other Mathematics (1)
- Other Social and Behavioral Sciences (1)
- Philosophy (1)
- Philosophy of Mind (1)
- Institution
- Keyword
-
- Computer algorithms (2)
- Academic – UNF – Computer science; Department of Computer and Information Sciences (1)
- Albegra (1)
- Approximation algorithm (1)
- Bioinformatics (1)
-
- Biomolecular sequence analysis (1)
- Cache misses (1)
- Chiasmus (1)
- Cluster analysis (statistics) (1)
- Coalgebra (1)
- Competitive algorithms (1)
- Computer programming (1)
- Computer theory (1)
- Data compression (1)
- Dissolve Detector (1)
- Epistasis (Genetics) (1)
- Evolutionary computation--United States (1)
- Evolutionary design (1)
- Expert systems (Computer science) (1)
- Facility location (1)
- Genetic algorithms (1)
- Genetic algorithms -- Evaluation (1)
- Image processing (1)
- Indexing (1)
- Interactivity (1)
- Interaktivität (1)
- K mean (1)
- K median (1)
- Least squares (1)
- Lecture videos (1)
- Publication
- Publication Type
Articles 1 - 16 of 16
Full-Text Articles in Theory and Algorithms
A Robust Dissolve Detector By Support Vector Machine, Chong-Wah Ngo
A Robust Dissolve Detector By Support Vector Machine, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel approach for the robust detection and classification of dissolve sequences in videos. Our approach is based on the multi-resolution representation of temporal slices extracted from 3D image volume. At the low-resolution (LR) scale, the problem of dissolve detection is reduced as cut transition detection. At the highresolution (HR) space, Gabor wavelet features are computed for regions that surround the cuts located at LR scale. The computed features are then input to support vector machines for pattern classification. Encouraging results have been obtained through experiments.
Synchronization Of Lecture Videos And Electronic Slides By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Synchronization Of Lecture Videos And Electronic Slides By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Research Collection School Of Computing and Information Systems
An essential goal of structuring lecture videos captured in live presentation is to provide a synchronized view of video clips and electronic slides. This paper presents an automatic approach to match video clips and slides based on the analysis of text embedded in lecture videos. We describe a method to reconstruct high-resolution video texts from multiple keyframes for robust OCRrecognition. A two-stage matching algorithm based on the title and content similarity measures between video clips and slides is also proposed.
A Study Of Evolutionary Acceleration, Sanza Kazadi, Sparta Cheung, Cristal Ogletree, Shirley Kim, Catherine Lee, Andrew Min
A Study Of Evolutionary Acceleration, Sanza Kazadi, Sparta Cheung, Cristal Ogletree, Shirley Kim, Catherine Lee, Andrew Min
Sanza Kazadi
Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg
Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper considers several variations of an optimization problem with potential applications in such areas as biomolecular sequence analysis and image processing. Given a sequence of items, each with a weight and a length, the goal is to find a subsequence of consecutive items of optimal value, where value is either total weight or total weight divided by total length. There may also be a specified lower and/or upper bound on the acceptable length of subsequences. This paper shows that all the variations of the problem are solvable in linear time and space even with non-uniform item lengths and divisible …
A New Message-Based Protocol For Building A Platform And Language Independent Distributed Object Model, Hazem S. El Ashmawi
A New Message-Based Protocol For Building A Platform And Language Independent Distributed Object Model, Hazem S. El Ashmawi
Archived Theses and Dissertations
Standardization of messaging topologies for communication in recent distributed object computing architectures is becoming more and more inevitable. The emergence of a structured and flexible document model as XML has made an entry point towards this goal. In this thesis, we are utilizing the flexibility of XML and the simplicity of low -level socket communication to build a generalized messaging model that provides a basis for standardization and supports interoperability among existing distributed object computing architectures. The proposed system is composed of the basic components of a distributed architecture constituting a number of broker components acting as naming services and …
The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton
The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton
Dartmouth Scholarship
We introduce a natural variant of the (metric uncapacitated) k-median problem that we call the online median problem. Whereas the k-median problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities are placed one at a time, a facility cannot be moved once it is placed, and the total number of facilities to be placed, k, is not known in advance. The objective of an online median algorithm is to minimize the competitive ratio, that is, the worst-case ratio of the cost of an online placement to …
Explicit Building-Block Multiobjective Genetic Algorithms: Theory, Analysis, And Developing, Jesse B. Zydallis
Explicit Building-Block Multiobjective Genetic Algorithms: Theory, Analysis, And Developing, Jesse B. Zydallis
Theses and Dissertations
This dissertation research emphasizes explicit Building Block (BB) based MO EAs performance and detailed symbolic representation. An explicit BB-based MOEA for solving constrained and real-world MOPs is developed the Multiobjective Messy Genetic Algorithm II (MOMGA-II) which is designed to validate symbolic BB concepts. The MOMGA-II demonstrates that explicit BB-based MOEAs provide insight into solving difficult MOPs that is generally not realized through the use of implicit BB-based MOEA approaches. This insight is necessary to increase the effectiveness of all MOEA approaches. In order to increase MOEA computational efficiency parallelization of MOEAs is addressed. Communications between processors in a parallel MOEA …
Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise
Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise
University Faculty Publications and Creative Works
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straight-forward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent.
A Performance Analysis Of Distributed Algorithms In Javaspaces, Corba Services And Web Services, Suresh Sunku
A Performance Analysis Of Distributed Algorithms In Javaspaces, Corba Services And Web Services, Suresh Sunku
UNF Graduate Theses and Dissertations
Implementation of distributed parallel algorithms on networked computers has always been very difficult until the introduction of service-oriented architectures (SOA) like JavaSpaces service, CORBA services and Web Services. Algorithms of the type Master/Worker pattern are implemented with relative ease using the SOAs. This project analyzes the performance of such algorithms on three contemporary SOAs namely JavaSpaces service, CORBA services and Web Services. These architectures make the implementations of distributed algorithms reasonably fault tolerant and highly and dynamically scalable. Also, the systems built on these architectures are generally loosely coupled and operate asynchronously.
In this project we measure and analyze the …
The Window Least Mean Square Error Algorithm, Anna Semenovna Degtyarena
The Window Least Mean Square Error Algorithm, Anna Semenovna Degtyarena
Theses Digitization Project
In order to improve the performance of LMS (least mean square) algorithm by decreasing the amount of calculations this research proposes to make an update on each step only for those elements from the input data set, that fall within a small window W near the separating hyperplane surface. This work aims to describe in detail the results that can be achieved by using the proposed LMS with window learning algorithm in information systems that employ the methodology of neural network for the purposes of classification.
A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris
A Parallel Algorithm To Solve The Mathematical Problem "Double Coset Enumeration Of S₂₄ Over M₂₄", Elena Yavorska Harris
Theses Digitization Project
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.
Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick
Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick
Systems Science Faculty Publications and Presentations
The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We find that this influence exists, but depends on the generation in which it is measured. Early in the search process it may be more effective to have epistatic genes widely separated. Late in the search process, effectiveness is improved when they are close together. The early search effect is weak but still statistically significant; the late search effect is much stronger and plainly visible. We demonstrate both effects with a set of simple problems, and show that infonnation-theoretic …
Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar
Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar
Journal of the Arkansas Academy of Science
The use of finite difference schemes in computational aeroacoustics requires the use of structured grids incomputational space. Complex geometries in the physical space can be modeled using multiple overlapping grids that are transformed into computational space. In this work, finite difference schemes are used that necessitate the addition of psuedo- or ghost-points in the overlap region of the grids for closure of the difference stencil. The functional values at these ghost points must be approximated from the values at the original grid points. This paper investigates interpolation techniques for these overset grids. An n th order interpolation scheme using Lagrange …
Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan
Personalizing Interactions With Information Systems, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation tailored to the individual. In this chapter, we study personalization from the viewpoint of personalizing interaction. The survey covers mechanisms for information-finding on the web, advanced information retrieval systems, dialog-based applications, and mobile access paradigms. Specific emphasis is placed on studying how users interact with an information system and how the system can encourage and foster interaction. This helps bring out the role of the personalization system as a facilitator which reconciles …
The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones
The Staging Transformation Approach To Mixing Initiative, Robert Capra, Michael Narayan, Saverio Perugini, Naren Ramakrishnan, Manuel A. Pérez-Quiñones
Computer Science Faculty Publications
Mixed-initiative interaction is an important facet of many conversational interfaces, flexible planning architectures, intelligent tutoring systems, and interactive information retrieval systems. Software systems for mixed-initiative interaction must enable us to both operationalize the mixing of initiative (i.e., support the creation of practical dialogs) and to reason in real-time about how a flexible mode of interaction can be supported (e.g., from a meta-dialog standpoint). In this paper, we present the staging transformation approach to mixing initiative, where a dialog script captures the structure of the dialog and dialog control processes are realized through generous use of program transformation techniques (e.g., partial …
Strukturationen Der Interaktivität, Rudolf Kaehr