Physical Sciences and Mathematics Commons^™

Peppering Knowledge Sources With Salt: Boosting Conceptual Content For Ontology Generation, Deryle W. Lonsdale, Yihong Ding, David W. Embley, Alan Melby

Faculty Publications

This paper describes work done to explore the common ground between two different ongoing research projects: the standardization of lexical and terminological resources, and the use of conceptual ontologies for information extraction and data integration. Specifically, this paper explores improving the generation of extraction ontologies through use of a comprehensive terminology database that has been represented in a standardized format for easy tool-based implementation. We show how, via the successful integration of these two distinct efforts, it is possible to leverage large-scale terminological and conceptual information having relationship-rich semantic resources in order to reformulate, match, and merge retrieved information of …

Pair Attribute Learning: Network Construction Using Pair Features, Tony R. Martinez, Eric K. Henderson

Faculty Publications

We present the Pair Attribute Learning (PAL) algorithm for the selection of relevant inputs and network topology. Correlations on training instance pairs are used to drive network construction of a single-hidden layer MLP. Results on nine learning problems demonstrate 70% less complexity, on average, without a significant loss of accuracy.

The Algebra And Geometry Of Curve And Surface Inversion, Thomas W. Sederberg, Eng-Wee Chionh, Kent Ridge

Faculty Publications

An inversion equation takes the Cartesian coordinates of a point on a parametric curve or surface and returns the parameter value(s) of that point. A 2-D curve inversion equation has the form t = f(x,y)/g(x,y). This paper shows that practical insight into inversion can be obtained by studying the geometry of the implicit curves f(x,y) = 0 and g(x,y) = 0. For example, the relationship between the singular locus of the parametric curve and the lowest possible degree of an inversion equation can be understood in this way. Also, insight is given into what parameter value will be returned if …

Chimes In April, Samuel Stinson

Mahurin Honors College Capstone Experience/Thesis Projects

No abstract provided.

Application Of Extensive Markup Language (Xml) For Shipping Companies, Bala Vithoba Meshram

World Maritime University Dissertations

No abstract provided.

Studying The Functional Genomics Of Stress Responses In Loblolly Pine With The Expresso Microarray Experiment Management System, Lenwood S. Heath, Naren Ramakrishnan, Ronald R. Sederoff, Ross W. Whetten, Boris I. Chevone, Craig Struble, Vincent Y. Jouenne, Dawei Chen, Leonel Van Zyl, Ruth Grene

Mathematics, Statistics and Computer Science Faculty Research and Publications

Conception, design, and implementation of cDNA microarray experiments present a variety of bioinformatics challenges for biologists and computational scientists. The multiple stages of data acquisition and analysis have motivated the design of Expresso, a system for microarray experiment management. Salient aspects of Expresso include support for clone replication and randomized placement; automatic gridding, extraction of expression data from each spot, and quality monitoring; flexible methods of combining data from individual spots into information about clones and functional categories; and the use of inductive logic programming for higher-level data analysis and mining. The development of Expresso is occurring in parallel with …

Techniques And Algorithms For Immersive And Interactive Visualization Of Large Datasets, Ashish Sharma

LSU Master's Theses

Advances in computing power have made it possible for scientists to perform atomistic simulations of material systems that range in size, from a few hundred thousand atoms to one billion atoms. An immersive and interactive walkthrough of such datasets is an ideal method for exploring and understanding the complex material processes in these simulations. However rendering such large datasets at interactive frame rates is a major challenge. A scalable visualization platform is developed that is scalable and allows interactive exploration in an immersive, virtual environment. The system uses an octree based data management system that forms the core of the …

Decentralized And Adaptive Sensor Data Routing, Mengxia Zhu

LSU Master's Theses

Wireless sensor network (WSN) has been attracting research efforts due to the rapidly increasing applications in military and civilian fields. An important issue in wireless sensor network is how to send information in an efficient and adaptive way. Information can be directly sent back to the base station or through a sequence of intermediate nodes. In the later case, it becomes the problem of routing. Current routing protocols can be categorized into two groups, namely table-drive (proactive) routing protocols and source-initiated on-demand (reactive) routing. For ad hoc wireless sensor network, routing protocols must deal with some unique constraints such as …

The Fusion And Integration Of Virtual Sensors, Thomas F. Litant

Dissertations, Theses, and Masters Projects

There are numerous sensors from which to choose when designing a mobile robot: ultrasonic, infrared, radar, or laser range finders, video, collision detectors, or beacon based systems such as the Global Positioning System. In order to meet the need for reliability, accuracy, and fault tolerance, mobile robot designers often place multiple sensors on the same platform, or combine sensor data from multiple platforms. The combination of the data from multiple sensors to improve reliability, accuracy, and fault tolerance is termed Sensor Fusion.;The types of robotic sensors are as varied as the properties of the environment that need to be sensed. …

Simulation Techniques In An Artificial Society Model, Barry Glenn Lawson

Dissertations, Theses, and Masters Projects

"Artificial society" refers to a generic class of agent-based simulation models used to discover global social structures and collective behavior produced by simple local rules and interaction mechanisms. Artificial society models are applicable in a variety of disciplines, including the modeling of chemical and biological processes, natural phenomena, and complex adaptive systems. We focus on the underlying simulation techniques used in artificial society discrete-event simulation models, including model time evolution and computational performance.;Although for some applications synchronous time evolution is the correct modeling approach, many other applications are better represented using asynchronous time evolution. We claim that asynchronous time evolution …

Experience-Based Language Acquisition: A Computational Model Of Human Language Acquisition, Brian Edward Pangburn

LSU Doctoral Dissertations

Almost from the very beginning of the digital age, people have sought better ways to communicate with computers. This research investigates how computers might be enabled to understand natural language in a more humanlike way. Based, in part, on cognitive development in infants, we introduce an open computational framework for visual perception and grounded language acquisition called Experience-Based Language Acquisition (EBLA). EBLA can “watch” a series of short videos and acquire a simple language of nouns and verbs corresponding to the objects and object-object relations in those videos. Upon acquiring this protolanguage, EBLA can perform basic scene analysis to generate …

Complexity And Heuristics In Ruled-Based Algorithmic Music Composition, Nigel Gwee

LSU Doctoral Dissertations

Successful algorithmic music composition requires the efficient creation of works that reflect human preferences. In examining this key issue, we make two main contributions in this dissertation: analysis of the computational complexity of algorithmic music composition, and methods to produce music that approximates a commendable human effort. We use species counterpoint as our compositional model, wherein a set of stylistic and grammatical rules governs the search for suitable countermelodies to match a given melody. Our analysis of the complexity of rule-based music composition considers four different types of computational problems: decision, enumeration, number, and optimization. For restricted versions of the …

Techniques To Explore Time-Related Correlation In Large Datasets, Sumeet Dua

LSU Doctoral Dissertations

The next generation of database management and computing systems will be significantly complex with data distributed both in functionality and operation. The complexity arises, at least in part, due to data types involved and types of information request rendered by the database user. Time sequence databases are generated in many practical applications. Detecting similar sequences and subsequences within these databases is an important research area and has generated lot of interest recently. Previous studies in this area have concentrated on calculating similitude between (sub)sequences of equal sizes. The question of unequal sized (sub)sequence comparison to report similitude has been an …

Performance Modeling And Prediction For The Scalable Solution Of Partial Differential Equations On Unstructured Grids, Dinesh Kumar Kaushik

Computer Science Theses & Dissertations

This dissertation studies the sources of poor performance in scientific computing codes based on partial differential equations (PDEs), which typically perform at a computational rate well below other scientific simulations (e.g., those with dense linear algebra or N-body kernels) on modern architectures with deep memory hierarchies. We identify that the primary factors responsible for this relatively poor performance are: insufficient available memory bandwidth, low ratio of work to data size (good algorithmic efficiency), and nonscaling cost of synchronization and gather/scatter operations (for a fixed problem size scaling). This dissertation also illustrates how to reuse the legacy scientific and engineering software …

Video Indexing And Retrieval Techniques Using Novel Approaches To Video Segmentation, Characterization, And Similarity Matching, Waleed Ezzat Farag

Computer Science Theses & Dissertations

Multimedia applications are rapidly spread at an ever-increasing rate introducing a number of challenging problems at the hands of the research community, The most significant and influential problem, among them, is the effective access to stored data. In spite of the popularity of keyword-based search technique in alphanumeric databases, it is inadequate for use with multimedia data due to their unstructured nature. On the other hand, a number of content-based access techniques have been developed in the context of image indexing and retrieval; meanwhile video retrieval systems start to gain wide attention, This work proposes a number of techniques constituting …

Federating Heterogeneous Digital Libraries By Metadata Harvesting, Xiaoming Liu

Computer Science Theses & Dissertations

This dissertation studies the challenges and issues faced in federating heterogeneous digital libraries (DLs) by metadata harvesting. The objective of federation is to provide high-level services (e.g. transparent search across all DLs) on the collective metadata from different digital libraries. There are two main approaches to federate DLs: distributed searching approach and harvesting approach. As the distributed searching approach replies on executing queries to digital libraries in real time, it has problems with scalability. The difficulty of creating a distributed searching service for a large federation is the motivation behind Open Archives Initiatives Protocols for Metadata Harvesting (OAI-PMH). OAI-PMH supports …

A Policy-Based Resource Brokering Environment For Computational Grids, Ahmed Hamdan Al-Theneyan

Computer Science Theses & Dissertations

With the advances in networking infrastructure in general, and the Internet in particular, we can build grid environments that allow users to utilize a diverse set of distributed and heterogeneous resources. Since the focus of such environments is the efficient usage of the underlying resources, a critical component is the resource brokering environment that mediates the discovery, access and usage of these resources. With the consumer's constraints, provider's rules, distributed heterogeneous resources and the large number of scheduling choices, the resource brokering environment needs to decide where to place the user's jobs and when to start their execution in a …

Geometric Integrators For Hamiltonian Pdes, Dmitry Karpeev

Computer Science Theses & Dissertations

We consider methods for systematic construction of algorithms for a class of time-dependent PDEs with Hamiltonian structure. These systems possess phase space geometry and constants of the motion that need to be preserved by the integration algorithm to reflect the qualitative features of the system.

We exploit the structure of Hamiltonian systems, in particular their variational formulation based on a Lagrangian, and the dual covariant formulation, to expose the geometric features of the system that have natural analogs when discretized. We emphasize the local space-time approach to the constructions, making them amenable to parallelization and preconditioning using domain decomposition methods, …

Adaptive Critic-Based Neural Network Controller For Uncertain Nonlinear Systems With Unknown Deadzones, Pingan He, Jagannathan Sarangapani, S. N. Balakrishnan

Electrical and Computer Engineering Faculty Research & Creative Works

A multilayer neural network (NN) controller in discrete-time is designed to deliver a desired tracking performance for a class of nonlinear systems with input deadzones. This multilayer NN controller has an adaptive critic NN architecture with two NNs for compensating the deadzone nonlinearity and a third NN for approximating the dynamics of the nonlinear system. A reinforcement learning scheme in discrete-time is proposed for the adaptive critic NN deadzone compensator, where the learning is performed based on a certain performance measure, which is supplied from a critic. The adaptive generating NN rejects the errors induced by the deadzone whereas a …

A Web Content Management And Personalization Model Using One-To-One Strategy For Higher Educational Institutions, Yee Pong Ng

Masters Theses

This research explored a Web content management and personalization model for higher educational institutions. Through a review of literature and data collected from users, it formulated a conceptual model for Web content management and personalization. The study used the Web site of School of Technology at Eastern Illinois University as a typical case from which to develop the model for higher educational institutions. Understanding the factors influencing user attitudes about the adoption of new Web technologies is extremely important. Such an understanding can help Web developers develop a theoretical framework for a Web model as well as identify its components. …

Simulation And Numerical Solution Of Stochastic Petri Nets With Discrete And Continuous Timing, Robert Linzey Jones Iii

Dissertations, Theses, and Masters Projects

We introduce a novel stochastic Petri net formalism where discrete and continuous phase-type firing delays can appear in the same model. By capturing deterministic and generally random behavior in discrete or continuous time, as appropriate, the formalism affords higher modeling fidelity and efficiencies to use in practice. We formally specify the underlying stochastic process as a general state space Markov chain and show that it is regenerative, thus amenable to renewal theory techniques to obtain steady-state solutions. We present two steady-state analysis methods depending on the class of problem: one using exact numerical techniques, the other using simulation. Although regenerative …

Aggregate Matrix-Analytic Techniques And Their Applications, Alma Riska

Dissertations, Theses, and Masters Projects

The complexity of computer systems affects the complexity of modeling techniques that can be used for their performance analysis. In this dissertation, we develop a set of techniques that are based on tractable analytic models and enable efficient performance analysis of computer systems. Our approach is three pronged: first, we propose new techniques to parameterize measurement data with Markovian-based stochastic processes that can be further used as input into queueing systems; second, we propose new methods to efficiently solve complex queueing models; and third, we use the proposed methods to evaluate the performance of clustered Web servers and propose new …

Efficient Parallel Computation On Multiprocessors With Optical Interconnection Networks, Min He

LSU Doctoral Dissertations

This dissertation studies optical interconnection networks, their architecture, address schemes, and computation and communication capabilities. We focus on a simple but powerful optical interconnection network model - the Linear Array with Reconfigurable pipelined Bus System (LARPBS). We extend the LARPBS model to a simplified higher dimensional LAPRBS and provide a set of basic computation operations. We then study the following two groups of parallel computation problems on both one dimensional LARPBS's as well as multi-dimensional LARPBS's: parallel comparison problems, including sorting, merging, and selection; Boolean matrix multiplication, transitive closure and their applications to connected component problems. We implement an optimal …

Fast Scalable Visualization Techniques For Interactive Billion-Particle Walkthrough, Xinlian Liu

LSU Doctoral Dissertations

This research develops a comprehensive framework for interactive walkthrough involving one billion particles in an immersive virtual environment to enable interrogative visualization of large atomistic simulation data. As a mixture of scientific and engineering approaches, the framework is based on four key techniques: adaptive data compression based on space-filling curves, octree-based visibility and occlusion culling, predictive caching based on machine learning, and scalable data reduction based on parallel and distributed processing. In terms of parallel rendering, this system combines functional parallelism, data parallelism, and temporal parallelism to improve interactivity. The visualization framework will be applicable not only to material simulation, …

Transparent Fault Tolerance For Web Services Based Architectures, Vijay Dialani, Simon Miles, Luc Moreau, David De Roure, Michael Luck

Vijay Dialani

Service-based architectures enable the development of new classes of Grid and distributed applications. One of the main capabilities provided by such systems is the dynamic and flexible integration of services, according to which services are allowed to be a part of more than one distributed system and simultaneously serve different applications. This increased flexibility in system composition makes it difficult to address classical distributed system issues such as fault-tolerance. While it is relatively easy to make an individual service fault-tolerant, improving fault-tolerance of services collaborating in multiple application scenarios is a challenging task. In this paper, we look at the …

Synchronization Of The Human Cortical Working Memory Network, Sharlene Newman, Marcel Just, Patricia Carpenter

Marcel Adam Just

No abstract provided.

A Compilation Of Soybean Ests: Generation And Analysis, Elizabeth Shoop, R. Schoemaker, Et Al

Elizabeth Shoop

No abstract provided.

Logic, Optimization And Constraint Programming, John Hooker

John Hooker

No abstract provided.

On The Convergence Of Puck Clustering Systems, S. Kazadi, A. Abdul-Khaliq, R. Goodman

Sanza Kazadi

Features For Word Spotting In Historical Manuscripts, Toni M. Rath, R. Manmatha

R. Manmatha

For the transition from traditional to digital libraries, the large number of handwritten manuscripts that exist pose a great challenge. Easy access to such collections requires an index, which is currently created manually at great cost. Because automatic handwriting recognizers fail on historical manuscripts, the word spotting technique has been developed: the words in a collection are matched as images and grouped into clusters which contain all instances of the same word. By annotating ``interesting clusters," an index that links words to the locations where they occur can be built automatically.

Due to the noise in historical documents, selecting the …