View All Items

Title: A utility-based routing scheme in multi-hop wireless networks.
Creator: Lu, Mingming., College of Engineering and Computer Science, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Multi-hop wireless networks are infrastructure-less networks consisting of mobile or stationary wireless devices, which include multi-hop wireless mesh networks and multi-hop wireless sensor networks. These networks are characterized by limited bandwidth and energy resources, unreliable communication, and a lack of central control. These characteristics lead to the research challenges of multi-hop wireless networks. Building up routing schemes with good balance among the routing QoS (such as...
Show moreMulti-hop wireless networks are infrastructure-less networks consisting of mobile or stationary wireless devices, which include multi-hop wireless mesh networks and multi-hop wireless sensor networks. These networks are characterized by limited bandwidth and energy resources, unreliable communication, and a lack of central control. These characteristics lead to the research challenges of multi-hop wireless networks. Building up routing schemes with good balance among the routing QoS (such as reliability, cost, and delay) is a paramount concern to achieve high performance wireless networks. These QoS metrics are internally correlated. Most existing works did not fully utilize this correlation. We design a metric to balance the trade-off between reliability and cost, and build up a framework of utility-based routing model in multi-hop wireless networks. This dissertation focuses on the variations with applications of utility-based routing models, designing new concepts, and developing new algorithms for them. A review of existing routing algorithms and the basic utility-based routing model for multi-hop wireless networks has been provided at the beginning. An efficient algorithm, called MaxUtility, has been proposed for the basic utility-based routing model. MaxUtility is an optimal algorithm that can find the best routing path with the maximum expected utility., Various utility-based routing models are extended to further enhance the routing reliability while reducing the routing overhead. Besides computing the optimal path for a given benefit value and a given source-destination pair, the utility-based routing can be further extended to compute all optimal paths for all possible benefit values and/or all source-destination pairs. Our utility-based routing can also adapt to different applications and various environments. In the self-organized environment, where network users are selfish, we design a truthful routing, where selfish users have to tell the truth in order to maximize their utilities. We apply our utility-based routing scheme to the data-gathering wireless sensor networks, where a routing scheme is required to transmit data sensed by multiple sensor nodes to a common sink node.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/FAU/77647
Subject Headings: Wireless communication systems, Security measures, Computer network protocols, Computer algorithms, Computer networks, Security measures
Format: Document (PDF)

Title: Achieving Higher Receiver Satisfaction using Multicast-Favored Bandwidth Allocation Protocols.
Creator: Yousefizadeh, Hooman, Zilouchian, Ali, Ilyas, Mohammad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In recent years, many protocols for efficient Multicasting have been proposed. However, many of the Internet Service Providers (ISPs) are reluctant to use multicastenabled routers in their networks. To provide such incentives, new protocols are needed to improve the quality of their services. The challenge is to find a compromise between allocating Bandwidth (BW) among different flows in a fair manner, and favoring multicast sessions over unicast sessions. In addition, the overall higher...
Show moreIn recent years, many protocols for efficient Multicasting have been proposed. However, many of the Internet Service Providers (ISPs) are reluctant to use multicastenabled routers in their networks. To provide such incentives, new protocols are needed to improve the quality of their services. The challenge is to find a compromise between allocating Bandwidth (BW) among different flows in a fair manner, and favoring multicast sessions over unicast sessions. In addition, the overall higher level of receiver satisfaction should be achieved. In this dissertation, we propose three new innovative protocols to favor multicast sessions over unicast sessions. Multicast Favored BW Allocation- Logarithmic (MFBA-Log) and Multicast Favored BW Allocation-Linear (MFBALin) protocols allocate BW proportional to the number of down stream receivers. The proposed Multicast Reserved BW Allocation (MRBA) protocol allocates part of the BW in the links only to multicast sessions. Simulation results show the increase in the overall level of Receiver Satisfaction in the network.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fau/fd/FA00012581
Subject Headings: Multicasting (Computer networks), Computer network protocols, Computer algorithms
Format: Document (PDF)

Title: Quantum Circuits for Symmetric Cryptanalysis.
Creator: Langenberg, Brandon Wade, Steinwandt, Rainer, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: Quantum computers and quantum computing is a reality of the near feature. Companies such as Google and IBM have already declared they have built a quantum computer and tend to increase their size and capacity moving forward. Quantum computers have the ability to be exponentially more powerful than classical computers today. With this power modeling behavior of atoms or chemical reactions in unusual conditions, improving weather forecasts and traffic conditions become possible. Also, their...
Show moreQuantum computers and quantum computing is a reality of the near feature. Companies such as Google and IBM have already declared they have built a quantum computer and tend to increase their size and capacity moving forward. Quantum computers have the ability to be exponentially more powerful than classical computers today. With this power modeling behavior of atoms or chemical reactions in unusual conditions, improving weather forecasts and traffic conditions become possible. Also, their ability to exponentially speed up some computations makes the security of todays data and items a major concern and interest. In the area of cryptography, some encryption schemes (such as RSA) are already deemed broken by the onset of quantum computing. Some encryption algorithms have already been created to be quantum secure and still more are being created each day. While these algorithms in use today are considered quantum-safe not much is known of what a quantum attack would look like on these algorithms. Specifically, this paper discusses how many quantum bits, quantum gates and even the depth of these gates that would be needed for such an attack. The research below was completed to shed light on these areas and offer some concrete numbers of such an attack.
Show less
Date Issued: 2018
PURL: http://purl.flvc.org/fau/fd/FA00013010
Subject Headings: Quantum computing, Cryptography, Cryptanalysis, Data encryption (Computer science), Computer algorithms
Format: Document (PDF)

Title: An Empirical Study of Performance Metrics for Classifier Evaluation in Machine Learning.
Creator: Bruhns, Stefan, Khoshgoftaar, Taghi M., Florida Atlantic University
Abstract/Description: A variety of classifiers for solving classification problems is available from the domain of machine learning. Commonly used classifiers include support vector machines, decision trees and neural networks. These classifiers can be configured by modifying internal parameters. The large number of available classifiers and the different configuration possibilities result in a large number of combinatiorrs of classifier and configuration settings, leaving the practitioner with the problem of...
Show moreA variety of classifiers for solving classification problems is available from the domain of machine learning. Commonly used classifiers include support vector machines, decision trees and neural networks. These classifiers can be configured by modifying internal parameters. The large number of available classifiers and the different configuration possibilities result in a large number of combinatiorrs of classifier and configuration settings, leaving the practitioner with the problem of evaluating the performance of different classifiers. This problem can be solved by using performance metrics. However, the large number of available metrics causes difficulty in deciding which metrics to use and when comparing classifiers on the basis of multiple metrics. This paper uses the statistical method of factor analysis in order to investigate the relationships between several performance metrics and introduces the concept of relative performance which has the potential to case the process of comparing several classifiers. The relative performance metric is also used to evaluate different support vector machine classifiers and to determine if the default settings in the Weka data mining tool are reasonable.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/fau/fd/FA00012508
Subject Headings: Machine learning, Computer algorithms, Pattern recognition systems, Data structures (Computer science), Kernel functions, Pattern perception--Data processing
Format: Document (PDF)

Title: Asynchronous distributed algorithms for multi-agent supporting systems.
Creator: Jin, Kai., Florida Atlantic University, Larrondo-Petrie, Maria M.
Abstract/Description: Based on multi-agent supporting system (MASS) structures used to investigate the synchronous algorithms in my previous work, the partially and totally asynchronous distributed algorithms are proposed in this thesis. The stability of discrete MASS with asynchronous distributed algorithms is analyzed. The partially asynchronous algorithms proposed for both 1- and 2-dimensional MASS are proven to be convergent, if the vertical disturbances vary sufficiently slower than the convergent time of the...
Show moreBased on multi-agent supporting system (MASS) structures used to investigate the synchronous algorithms in my previous work, the partially and totally asynchronous distributed algorithms are proposed in this thesis. The stability of discrete MASS with asynchronous distributed algorithms is analyzed. The partially asynchronous algorithms proposed for both 1- and 2-dimensional MASS are proven to be convergent, if the vertical disturbances vary sufficiently slower than the convergent time of the system. The adjacent error becomes zero when the system converges. It is also proven that in 1-dimensional MASS using the proposed totally asynchronous algorithm, the maximum of the absolute value of the adjacent error is non-increasing over time. Finally, the simulation results for all the above cases are presented to demonstrate the theoretical findings.
Show less
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/15277
Subject Headings: Electronic data processing--Distributed processing, Computer algorithms
Format: Document (PDF)

Title: Application level intrusion detection using a sequence learning algorithm.
Creator: Dong, Yuhong., Florida Atlantic University, Hsu, Sam, Rajput, Saeed, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: An un-supervised learning algorithm on application level intrusion detection, named Graph Sequence Learning Algorithm (GSLA), is proposed in this dissertation. Experiments prove its effectiveness. Similar to most intrusion detection algorithms, in GSLA, the normal profile needs to be learned first. The normal profile is built using a session learning method, which is combined with the one-way Analysis of Variance method (ANOVA) to determine the value of an anomaly threshold. In the proposed...
Show moreAn un-supervised learning algorithm on application level intrusion detection, named Graph Sequence Learning Algorithm (GSLA), is proposed in this dissertation. Experiments prove its effectiveness. Similar to most intrusion detection algorithms, in GSLA, the normal profile needs to be learned first. The normal profile is built using a session learning method, which is combined with the one-way Analysis of Variance method (ANOVA) to determine the value of an anomaly threshold. In the proposed approach, a hash table is used to store a sparse data matrix in triple data format that is collected from a web transition log instead of an n-by-n dimension matrix. Furthermore, in GSLA, the sequence learning matrix can be dynamically changed according to a different volume of data sets. Therefore, this approach is more efficient, easy to manipulate, and saves memory space. To validate the effectiveness of the algorithm, extensive simulations have been conducted by applying the GSLA algorithm to the homework submission system at our computer science and engineering department. The performance of GSLA is evaluated and compared with traditional Markov Model (MM) and K-means algorithms. Specifically, three major experiments have been done: (1) A small data set is collected as a sample data, and is applied to GSLA, MM, and K-means algorithms to illustrate the operation of the proposed algorithm and demonstrate the detection of abnormal behaviors. (2) The Random Walk-Through sampling method is used to generate a larger sample data set, and the resultant anomaly score is classified into several clusters in order to visualize and demonstrate the normal and abnormal behaviors with K-means and GSLA algorithms. (3) Multiple professors' data sets are collected and used to build the normal profiles, and the ANOVA method is used to test the significant difference among professors' normal profiles. The GSLA algorithm can be made as a module and plugged into the IDS as an anomaly detection system.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/12220
Subject Headings: Data mining, Parallel processing (Electronic computers), Computer algorithms, Computer security, Pattern recognition systems
Format: Document (PDF)

Title: Determination of receptive fields in neural networks using Alopex.
Creator: Shah, Gaurang G., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This research aims at proposing a model for visual pattern recognition inspired by the neural circuitry in the brain. Our attempt is to propose few modifications in the Alopex algorithm and try to use it for the calculations of the receptive fields of neurons in the trained network. We have developed a small-scale, four-layered neural network model for simple character recognition as well as complex image patterns, which can recognize the patterns transformed by affine conversion. Here Alopex...
Show moreThis research aims at proposing a model for visual pattern recognition inspired by the neural circuitry in the brain. Our attempt is to propose few modifications in the Alopex algorithm and try to use it for the calculations of the receptive fields of neurons in the trained network. We have developed a small-scale, four-layered neural network model for simple character recognition as well as complex image patterns, which can recognize the patterns transformed by affine conversion. Here Alopex algorithm is presented as an iterative and stochastic processing method, which was proposed for optimization of a given cost function over hundreds or thousands of iterations. In this case the receptive fields of the neurons in the output layers are obtained using the Alopex algorithm.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13298
Subject Headings: Pattern recognition systems, Neural networks (Computer science), Computer algorithms, Neuroanatomy, Image processing
Format: Document (PDF)

Title: Complexity metrics in parallel computing.
Creator: Larrondo-Petrie, Maria M., Florida Atlantic University, Fernandez, Eduardo B., Coulter, Neal S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Accompanying the potential increase in power offered by parallel computers is an increase in the complexity of program design, implementation, testing and maintenance. It is important to understand the logical complexity of parallel programs in order to support the development of concurrent software. Measures are needed to quantify the components of parallel software complexity and to establish a basis for comparison and analysis of parallel algorithms at various stages of development and...
Show moreAccompanying the potential increase in power offered by parallel computers is an increase in the complexity of program design, implementation, testing and maintenance. It is important to understand the logical complexity of parallel programs in order to support the development of concurrent software. Measures are needed to quantify the components of parallel software complexity and to establish a basis for comparison and analysis of parallel algorithms at various stages of development and implementation. A set of primitive complexity measures is proposed that collectively describe the total complexity of parallel programs. The total complexity is separated into four dimensions or components: requirements, sequential, parallel and communication. Each proposed primitive measure is classified under one of these four areas. Two additional possible dimensions, fault-tolerance and real-time, are discussed. The total complexity measure is expressed as a vector of dimensions; each component is defined as a vector of primitive metrics. The method of quantifying each primitive metric is explained in detail. Those primitive metrics that contribute to the parallel and communications complexity are exercised against ten published summation algorithms and programs, illustrating that architecture has a significant effect on the complexity of parallel programs--even if the same programming language is used. The memory organization and the processor interconnection scheme had no effect on the parallel component, but did affect the communication component. Programming style and language did not have a noticeable effect on either component. The proposed metrics are quantifiable, consistent, and useful in comparing parallel algorithms. Unlike existing parallel metrics, they are general and applicable to different languages, architectures, algorithms, paradigms, programming styles and stages of software development.
Show less
Date Issued: 1992
PURL: http://purl.flvc.org/fcla/dt/12296
Subject Headings: Parallel programming (Computer Science), Computer algorithms
Format: Document (PDF)

Title: Connected Dominating Set in Wireless Ad Hoc Networks: Variations with Applications.
Creator: Yang, Shuhui, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless ad hoc networks (or simply ad hoc networks) are infrastructureless multihop networks consisting of mobile or stationary wireless devices, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). These networks are characterized by limited bandwidth and energy resources, frequent topology changes, and a lack of central control. These characteristics lead to the research challenges of ad hoc networks. The algorithms designed for ad hoc networks should be...
Show moreWireless ad hoc networks (or simply ad hoc networks) are infrastructureless multihop networks consisting of mobile or stationary wireless devices, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). These networks are characterized by limited bandwidth and energy resources, frequent topology changes, and a lack of central control. These characteristics lead to the research challenges of ad hoc networks. The algorithms designed for ad hoc networks should be localized, selforganizing, and energy efficient. A connected dominating set (CDS) is frequently used in ad hoc networks as a virtual backbone to support efficient routing, service discovery, and area monitoring. In addition, efficient broadcasting (i.e., finding a small set of forward nodes to ensure full delivery) can be viewed as forming a CDS on-the-fly. The periodically maintained virtual backbone is called a static CDS, and the temporarily formed forward node set is called a dynamk CDS. For efficiency and robustness, the ideal CDS construction algorithm is lightweight, has fast convergence, and minimizes the CDS size. Recently, due to some specific applications and new techniques, the concept of a connected dominating set can be modified or further extended for more efficient usage. This dissertation focuses on the variations with applications of the connected dominating set, designing new concepts, and developing new algorithms for them. A review of CDS construction algorithms for ad hoc networks has been provided at the beginning. An efficient scheme, called Rule K, has been proposed for static CDS construction. Rule K achieves a probabilistic constant upper bound on the expected CDS size, which is currently the best known performance guarantee for localized CDS algorithms. Several CDS algorithms are extended to generate the extended CDS, which exploits the cooperative communication technique to further reduce the size of CDS. A k-coverage set is developed for higher robustness. With the equipment of directional antennas , the transmission can be restricted to some certain directions to reduce interference and energy consumption. The corresponding directional CDS is discussed. Finally, a wireless sensor and actor network (WSAN) is introduced and localized algorithms are designed for it.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012580
Subject Headings: Computer network protocols, Wireless communication systems--Design and construction, Mobile computing, Computer algorithms
Format: Document (PDF)

Title: Binary representation of DNA sequences towards developing useful algorithms in bioinformatic data-mining.
Creator: Pandya, Shivani., Florida Atlantic University, Neelakanta, Perambur S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis refers to a research addressing the use of binary representation of the DNA for the purpose of developing useful algorithms for Bioinformatics. Pertinent studies address the use of a binary form of the DNA base chemicals in information-theoretic base so as to identify symmetry between DNA and complementary DNA. This study also refers to "fuzzy" (codon-noncodon) considerations in delinating codon and noncodon regimes in a DNA sequences. The research envisaged further includes a...
Show moreThis thesis refers to a research addressing the use of binary representation of the DNA for the purpose of developing useful algorithms for Bioinformatics. Pertinent studies address the use of a binary form of the DNA base chemicals in information-theoretic base so as to identify symmetry between DNA and complementary DNA. This study also refers to "fuzzy" (codon-noncodon) considerations in delinating codon and noncodon regimes in a DNA sequences. The research envisaged further includes a comparative analysis of the test results on the aforesaid efforts using different statistical metrics such as Hamming distance Kullback-Leibler measure etc. the observed details supports the symmetry aspect between DNA and CDNA strands. It also demonstrates capability of identifying non-codon regions in DNA even under diffused (overlapped) fuzzy states.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13089
Subject Headings: Bioinformatics, Data mining, Nucleotide sequence--Databases, Computer algorithms
Format: Document (PDF)

Title: Methods and Algorithms for Human Detection in Video Sequences.
Creator: Pertuz, Carlos, Marques, Oge, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Lower prices of video sensors, security concerns and the need for better and faster algorithms to extract high level information from video sequences are all factors which have stimulated research in the area of automated video surveillance systems. In the context of security the analysis of human interrelations and their environment provides hints to proactively identify anomalous behavior. However, human detection is a necessary component in systems where the automatic extraction of higher...
Show moreLower prices of video sensors, security concerns and the need for better and faster algorithms to extract high level information from video sequences are all factors which have stimulated research in the area of automated video surveillance systems. In the context of security the analysis of human interrelations and their environment provides hints to proactively identify anomalous behavior. However, human detection is a necessary component in systems where the automatic extraction of higher level information, such as recognizing individuals' activities, is required. The human detection problem is one of classification. In general, motion, appearance and shape are the classification approaches a system can employ to perform human detection. Techniques representative of these approaches, such us periodic motion detection, skin color detection and MPEG-7 shape descriptors are implemented in this work. An infrastructure that allows data collection for such techniques was also implemented.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012538
Subject Headings: MPEG (Video coding standard), Image processing--Digital techniques, Form perception, Computer algorithms, Video compression
Format: Document (PDF)

Title: Multi-Path Intelligent Virtual Mobile Nodes for Ad Hoc Networks.
Creator: Qian, Binbin, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In mobile ad hoc networks, it is challenging to solve the standard problems encountered in fixed network because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure the stable node performance. The virtual mobile node (VMN) abstraction that has been applied implements an virtual mobile node that consists of a set of real nodes traveling on one predetermined virtual...
Show moreIn mobile ad hoc networks, it is challenging to solve the standard problems encountered in fixed network because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure the stable node performance. The virtual mobile node (VMN) abstraction that has been applied implements an virtual mobile node that consists of a set of real nodes traveling on one predetermined virtual path to collect messages and deliver them to the destinations when they meet. It conquers the unpredictable motion with virtual nodes' predictable motion. But it encounters unavoidable failure when all the nodes leave the VMN region and stop emulating the VMN. We extend the idea of the VMN abstraction to the Multi-path Intelligent Virtual Mobile Node (MIVMN) abstraction, which allows the messages to switch between multiple Hamiltonian paths to increase the message delivery ratio and decrease the failure rate of the virtual nodes. Through simulation results we show that the MIVMN abstraction successfully meets our goals.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012542
Subject Headings: Routers (Computer networks), Computer network architectures, Wireless communication systems, Computer algorithms
Format: Document (PDF)

Title: Examples of deterministic and Monte Carlo algorithms for cryptographic applications.
Creator: McPherson, Joe Cullen, Florida Atlantic University, Hoffman, Frederick
Abstract/Description: In this thesis two different types of computer algorithms, Deterministic and Monte Carlo, are illustrated. Implementations of the Berlekamp-Massey algorithm and the Parallelized Pollard Rho Search are described here. The questions of what these two algorithms provide to the field of cryptography and why they have proven themselves important to cryptography are briefly discussed. It is also shown that with a little extra knowledge, the Parallelized Pollard Rho Search may be easily modified to...
Show moreIn this thesis two different types of computer algorithms, Deterministic and Monte Carlo, are illustrated. Implementations of the Berlekamp-Massey algorithm and the Parallelized Pollard Rho Search are described here. The questions of what these two algorithms provide to the field of cryptography and why they have proven themselves important to cryptography are briefly discussed. It is also shown that with a little extra knowledge, the Parallelized Pollard Rho Search may be easily modified to improve its performance.
Show less
Date Issued: 2000
PURL: http://purl.flvc.org/fcla/dt/12687
Subject Headings: Monte Carlo method, Computer algorithms, Cryptography
Format: Document (PDF)

Title: Performance analysis of K-means algorithm and Kohonen networks.
Creator: Syed, Afzal A., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: K-means algorithm and Kohonen network possess self-organizing characteristics and are widely used in different fields currently. The factors that influence the behavior of K-means are the choice of initial cluster centers, number of cluster centers and the geometric properties of the input data. Kohonen networks have the ability of self-organization without any prior input about the number of clusters to be formed. This thesis looks into the performances of these algorithms and provides a...
Show moreK-means algorithm and Kohonen network possess self-organizing characteristics and are widely used in different fields currently. The factors that influence the behavior of K-means are the choice of initial cluster centers, number of cluster centers and the geometric properties of the input data. Kohonen networks have the ability of self-organization without any prior input about the number of clusters to be formed. This thesis looks into the performances of these algorithms and provides a unique way of combining them for better clustering. A series of benchmark problem sets are developed and run to obtain the performance analysis of the K-means algorithm and Kohonen networks. We have attempted to obtain the better of these two self-organizing algorithms by providing the same problem sets and extract the best results based on the users needs. A toolbox, which is user-friendly and written in C++ and VC++ is developed for applications on both images and feature data sets. The tool contains K-means algorithm and Kohonen networks code for clustering and pattern classification.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13112
Subject Headings: Self-organizing maps, Neural networks (Computer science), Cluster analysis--Computer programs, Computer algorithms
Format: Document (PDF)

Title: Performance evaluation of blind equalization techniques in the digital cellular environment.
Creator: Boccuzzi, Joseph., Florida Atlantic University, Sudhakar, Raghavan
Abstract/Description: This thesis presents simulation results evaluating the performance of blind equalization techniques in the Digital Cellular environment. A new method of a simple zero memory non-linear detector for complex signals is presented for various forms of Fractionally Spaced Equalizers (FSE). Initial simulations are conducted with Binary Phase Shift Keying (BPSK) to study the characteristics of FSEs. The simulations are then extended to complex case via $\pi/$4-Differential Quaterny Phase Shift...
Show moreThis thesis presents simulation results evaluating the performance of blind equalization techniques in the Digital Cellular environment. A new method of a simple zero memory non-linear detector for complex signals is presented for various forms of Fractionally Spaced Equalizers (FSE). Initial simulations are conducted with Binary Phase Shift Keying (BPSK) to study the characteristics of FSEs. The simulations are then extended to complex case via $\pi/$4-Differential Quaterny Phase Shift Keying ($\pi/$4-DQPSK) modulation. The primary focus in this thesis is the performance of this complex case when operating in Additive White Gaussian Noise (AWGN) and Rayleigh Multipath Fading channels.
Show less
Date Issued: 1992
PURL: http://purl.flvc.org/fcla/dt/14859
Subject Headings: Equalizers (Electronics), Computer algorithms, Data transmission systems, Programming electronic computers
Format: Document (PDF)

Title: Quality of service support in TDMA-based mobile ad hoc networks.
Creator: Jawhar, Imad., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: With the continuing advances in computing and wireless technologies, mobile ad hoc networks (MANETs) are expected to become an indispensable part of the computing environment in the near future. Wireless devices are constantly growing in computing speed, memory, communication capabilities and features, while shrinking in weight and size. With this growth and the proliferation of these devices in every aspect of society, the need for such devices to communicate in a seamless manner is becoming...
Show moreWith the continuing advances in computing and wireless technologies, mobile ad hoc networks (MANETs) are expected to become an indispensable part of the computing environment in the near future. Wireless devices are constantly growing in computing speed, memory, communication capabilities and features, while shrinking in weight and size. With this growth and the proliferation of these devices in every aspect of society, the need for such devices to communicate in a seamless manner is becoming increasingly essential. Multiple routing protocols have been developed for MANETs [51]. As MANETs gain popularity, their need to support real time and multimedia applications is growing as well. Such applications have stringent quality of service (QoS) requirements such as bandwidth, delay, and delay fitter. Design and development of routing algorithms with QoS support is experiencing increased research interest. Several approaches which propose various routing algorithms with QoS support for MANETs have been presented in research. This dissertation addresses the issues and challenges of QoS routing in MANETS and presents three new protocols which provide QoS support for this environment. First, a brief classification of existing QoS routing algorithms is provided. Then, the three new protocols for QoS routing support in MANETs are presented. These protocols focus on resource reservation for QoS provisioning in TDMA-based MANETs. The first protocol improves QoS support by eliminating racing conditions during multiple reservations of QoS paths. The second protocol is a new protocol for resource reservation for QoS support in TDMA-based MANETs using directional antennas. The last protocol provides dynamic range resource reservation for QoS support in MANETs and represents an extension of the previous protocols.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/12158
Subject Headings: Digital communications, Time division multiple access, Computer algorithms, Computer network protocols, Wireless communication systems
Format: Document (PDF)

Title: A VLSI implementable learning algorithm.
Creator: Ruiz, Laura V., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: A top-down design methodology using hardware description languages (HDL's) and powerful design, analysis, synthesis and layout software tools for electronic circuit design is described and applied to the design of a single layer artificial neural network that incorporates on-chip learning. Using the perception learning algorithm, these simple neurons learn a classification problem in 10.55 microseconds in one application. The objective is to describe a methodology by following the design of a...
Show moreA top-down design methodology using hardware description languages (HDL's) and powerful design, analysis, synthesis and layout software tools for electronic circuit design is described and applied to the design of a single layer artificial neural network that incorporates on-chip learning. Using the perception learning algorithm, these simple neurons learn a classification problem in 10.55 microseconds in one application. The objective is to describe a methodology by following the design of a simple network. This methodology is later applied in the design of a novel architecture, a stochastic neural network. All issues related to algorithmic design for VLSI implementability are discussed and results of layout and timing analysis given over software simulations. A top-down design methodology is presented, including a brief introduction to HDL's and an overview of the software tools used throughout the design process. These tools make it possible now for a designer to complete a design in a relative short period of time. In-depth knowledge of computer architecture, VLSI fabrication, electronic circuits and integrated circuit design is not fundamental to accomplish a task that a few years ago would have required a large team of specialized experts in many fields. This may appeal to researchers from a wide background of knowledge, including computer scientists, mathematicians, and psychologists experimenting with learning algorithms. It is only in a hardware implementation of artificial neural network learning algorithms that the true parallel nature of these architectures could be fully tested. Most of the applications of neural networks are basically software simulations of the algorithms run on a single CPU executing sequential simulations of a parallel, richly interconnected architecture. This dissertation describes a methodology whereby a researcher experimenting with a known or new learning algorithm will be able to test it as it was intentionally designed for, on a parallel hardware architecture.
Show less
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/12453
Subject Headings: Integrated circuits--Very large scale integration--Design and construction, Neural networks (Computer science)--Design and construction, Computer algorithms, Machine learning
Format: Document (PDF)

Title: A connected dominating-set-based routing in ad hoc wireless networks.
Creator: Gao, Ming., Florida Atlantic University, Wu, Jie
Abstract/Description: In ad hoc wireless networks, routing protocols are challenged with establishing and maintaining multihop routes in the face of mobility, bandwidth limitation and power constraints. Routing based on a connected dominating set is a promising approach, where the searching space for a router reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the dominating set or adjacent to some nodes in the dominating set. In this thesis, we propose a method of...
Show moreIn ad hoc wireless networks, routing protocols are challenged with establishing and maintaining multihop routes in the face of mobility, bandwidth limitation and power constraints. Routing based on a connected dominating set is a promising approach, where the searching space for a router reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the dominating set or adjacent to some nodes in the dominating set. In this thesis, we propose a method of calculating power-aware connected dominating set. Our simulation results show that the proposed approach outperforms several existing approaches in terms of life span of the network. We also discuss mobility management in dominating-set-based networks. Three operations are considered which are mobile host switch on, mobile host switch off and mobile host movement. We also discuss the use of dynamic source routing as an application of the connected dominating set.
Show less
Date Issued: 2001
PURL: http://purl.flvc.org/fcla/dt/12780
Subject Headings: Mobile computing, Computer networks, Computer algorithms
Format: Document (PDF)

Title: Learning in connectionist networks using the Alopex algorithm.
Creator: Venugopal, Kootala Pattath., Florida Atlantic University, Pandya, Abhijit S., Sudhakar, Raghavan, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Alopex algorithm is presented as a universal learning algorithm for connectionist models. It is shown that the Alopex procedure could be used efficiently as a supervised learning algorithm for such models. The algorithm is demonstrated successfully on a variety of network architectures. Such architectures include multilayer perceptrons, time-delay models, asymmetric, fully recurrent networks and memory neuron networks. The learning performance as well as the generation capability of the...
Show moreThe Alopex algorithm is presented as a universal learning algorithm for connectionist models. It is shown that the Alopex procedure could be used efficiently as a supervised learning algorithm for such models. The algorithm is demonstrated successfully on a variety of network architectures. Such architectures include multilayer perceptrons, time-delay models, asymmetric, fully recurrent networks and memory neuron networks. The learning performance as well as the generation capability of the Alopex algorithm are compared with those of the backpropagation procedure, concerning a number of benchmark problems, and it is shown that the Alopex has specific advantages over the backpropagation. Two new architectures (gain layer schemes) are proposed for the on-line, direct adaptive control of dynamical systems using neural networks. The proposed schemes are shown to provide better dynamic response and tracking characteristics, than the other existing direct control schemes. A velocity reference scheme is introduced to improve the dynamic response of on-line learning controllers. The proposed learning algorithm and architectures are studied on three practical problems; (i) Classification of handwritten digits using Fourier Descriptors; (ii) Recognition of underwater targets from sonar returns, considering temporal dependencies of consecutive returns and (iii) On-line learning control of autonomous underwater vehicles, starting with random initial conditions. Detailed studies are conducted on the learning control applications. Effect of the network learning rate on the tracking performance and dynamic response of the system are investigated. Also, the ability of the neural network controllers to adapt to slow and sudden varying parameter disturbances and measurement noise is studied in detail.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12325
Subject Headings: Computer algorithms, Computer networks, Neural networks (Computer science), Machine learning
Format: Document (PDF)

Title: Fault-tolerant routing in two-dimensional and three-dimensional meshes.
Creator: Chen, Xiao., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Mesh-connected multicomputers are one of the simplest and least expensive structures to build a system using hundreds and even thousands of processors. The nodes communicate with each other by sending and receiving messages. As the system gets larger and larger, it not only requires the routing algorithms be efficient but also fault-tolerant. The fault model we use in 2-D meshes is a faulty block while in 3-D meshes, the fault model is a faculty cube. In order to route messages through...
Show moreMesh-connected multicomputers are one of the simplest and least expensive structures to build a system using hundreds and even thousands of processors. The nodes communicate with each other by sending and receiving messages. As the system gets larger and larger, it not only requires the routing algorithms be efficient but also fault-tolerant. The fault model we use in 2-D meshes is a faulty block while in 3-D meshes, the fault model is a faculty cube. In order to route messages through feasible minimum paths, the extended safety level is used to determine the existence of a minimal path and faulty block (cube) information is used to guide the routing. This dissertation presents an in-depth study of fault-tolerant minimal routing in 2-D tori, 3-D meshes, and tree-based fault-tolerant multicasting in 2-D and 3-D meshes using extended safety levels. Also path-based fault-tolerant deadlock-free multicasting in 2-D and 3-D meshes is studied. In fault-tolerant minimal routing in 2-D meshes, if no faulty block is encountered, any adaptive minimal routing can be used until the message encounters a faulty block. The next step is guided by the faulty block information until the message gets away from the faulty block. After that, any minimal adaptive routing can be used again. The minimal routing in 2-D tori is similar to that in 2-D meshes if at the beginning of the routing a conversion is made from a 2-D torus to a 2-D mesh. The fault-tolerant minimal routing in 3-D meshes can be done in a similar way. In the tree-based multicasting in 2-D and 3-D meshes, a time-step optimal and traffic-step suboptimal algorithm is proposed. Several heuristic strategies are presented to resolve a conflict, which are compared by simulations. A path-based fault-tolerant deadlock-free multicast algorithm in 2-D meshes with inter-block distance of at least three is presented to solve the deadlock problem in tree-based multicast algorithms. The approach is then extended to 3-D meshes and to inter-block distance of at least two in 2-D meshes. The path is Hamiltonian that is only updated locally in the neighborhood of a faulty block when a faulty block is encountered. Two virtual channels are used to prevent deadlock in 2-D and 3-D meshes with inter-block (inter-cube) distance of at least three and two more virtual channels are added if the inter-block distance is at least two.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/12597
Subject Headings: Fault-tolerant computing, Computer algorithms
Format: Document (PDF)

Wireless communication systems (6)	+ -
Computer network protocols (5)	+ -
Mobile computing (5)	+ -
Computer networks (4)	+ -
Machine learning (3)	+ -

Neural networks (Computer science) (3)	+ -
Parallel processing (Electronic computers) (3)	+ -
Pattern recognition systems (3)	+ -
Cryptography (2)	+ -
Data mining (2)	+ -
Data transmission systems (2)	+ -
Equalizers (Electronics) (2)	+ -
Fault-tolerant computing (2)	+ -
Image processing--Digital techniques (2)	+ -
Ad hoc networks (Computer networks)--Programming (1)	+ -
Bioinformatics (1)	+ -
Cellular radio (1)	+ -
Cluster analysis--Computer programs (1)	+ -
Computer architecture (1)	+ -
Computer network architectures (1)	+ -
Computer security (1)	+ -
Cryptanalysis (1)	+ -
Data compression (Computer science) (1)	+ -
Data encryption (Computer science) (1)	+ -
Data structures (Computer science) (1)	+ -
Digital communications (1)	+ -
Electronic data processing--Distributed processing (1)	+ -
Embedded computer systems (1)	+ -
Form perception (1)	+ -

College of Engineering and Computer Science (21)	+ -
Department of Computer and Electrical Engineering and Computer Science (21)	+ -
Wu, Jie (10)	+ -
Pandya, Abhijit S. (5)	+ -
Sudhakar, Raghavan (3)	+ -

Larrondo-Petrie, Maria M. (2)	+ -
Barrantes-Sliesarieva, Elena Gabriela. (1)	+ -
Boccuzzi, Joseph. (1)	+ -
Bruhns, Stefan (1)	+ -
Cang, Songluan. (1)	+ -
Charles E. Schmidt College of Science (1)	+ -
Chen, Xiao. (1)	+ -
Coulter, Neal S. (1)	+ -
Department of Mathematical Sciences (1)	+ -
Dong, Yuhong. (1)	+ -
Fernandez, Eduardo B. (1)	+ -
Gao, Ming. (1)	+ -
Hoffman, Frederick (1)	+ -
Hsu, Sam (1)	+ -
Ilyas, Mohammad (1)	+ -
Jawhar, Imad. (1)	+ -
Jin, Kai. (1)	+ -
Kamath, Anuradha K. (1)	+ -
Khoshgoftaar, Taghi M. (1)	+ -
Langenberg, Brandon Wade (1)	+ -
Li, Hailan. (1)	+ -
Lu, Mingming. (1)	+ -
Luo, Yinqiu. (1)	+ -
Mahgoub, Imad (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Genre

Type of Resource

Language

Creator

Format

Owner