View All Items

Title: Embedding binomial trees in faulty hypercube multiprocessors.
Creator: Luo, Yinqiu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We study the embedding of binomial trees with variable roots in faulty hypercubes. Based on novel embedding strategies, we propose three embedding algorithms with variable nodes as the root. The first algorithm can tolerate up to n - 1 faulty links, but the execution can be done within log2(n - 1) subcube splits. The second one can tolerate up to [(3(n - 1))\2] faulty links. The last one can tolerate up to [(3(n - 4))\2] faulty nodes.
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/15345
Subject Headings: Hypercube networks (Computer networks), Trees (Graph theory), Multiprocessors, Parallel processing (Electronic computers), Computer algorithms, Fault-tolerant computing, Embedded computer systems
Format: Document (PDF)

Title: Data mining heuristic-¬based malware detection for android applications.
Creator: Peiravian, Naser, Zhu, Xingquan, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Google Android mobile phone platform is one of the dominant smartphone operating systems on the market. The open source Android platform allows developers to take full advantage of the mobile operation system, but also raises significant issues related to malicious applications (Apps). The popularity of Android platform draws attention of many developers which also attracts the attention of cybercriminals to develop different kinds of malware to be inserted into the Google Android Market...
Show moreThe Google Android mobile phone platform is one of the dominant smartphone operating systems on the market. The open source Android platform allows developers to take full advantage of the mobile operation system, but also raises significant issues related to malicious applications (Apps). The popularity of Android platform draws attention of many developers which also attracts the attention of cybercriminals to develop different kinds of malware to be inserted into the Google Android Market or other third party markets as safe applications. In this thesis, we propose to combine permission, API (Application Program Interface) calls and function calls to build a Heuristic-Based framework for the detection of malicious Android Apps. In our design, the permission is extracted from each App’s profile information and the APIs are extracted from the packed App file by using packages and classes to represent API calls. By using permissions, API calls and function calls as features to characterize each of Apps, we can develop a classifier by data mining techniques to identify whether an App is potentially malicious or not. An inherent advantage of our method is that it does not need to involve any dynamic tracking of the system calls but only uses simple static analysis to find system functions from each App. In addition, Our Method can be generalized to all mobile applications due to the fact that APIs and function calls are always present for mobile Apps. Experiments on real-world Apps with more than 1200 malwares and 1200 benign samples validate the algorithm performance. Research paper published based on the work reported in this thesis: Naser Peiravian, Xingquan Zhu, Machine Learning for Android Malware Detection Using Permission and API Calls, in Proc. of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI) – Washington D.C, November 4-6, 2013.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fau/fd/FA0004045
Subject Headings: Computer networks -- Security measures, Data encryption (Computer science), Data structures (Computer science), Internet -- Security measures
Format: Document (PDF)

Title: Towards a portal and search engine to facilitate academic and research collaboration in engineering and.
Creator: Bonilla Villarreal, Isaura Nathaly, Larrondo-Petrie, Maria M., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: While international academic and research collaborations are of great importance at this time, it is not easy to find researchers in the engineering field that publish in languages other than English. Because of this disconnect, there exists a need for a portal to find Who’s Who in Engineering Education in the Americas. The objective of this thesis is to built an object-oriented architecture for this proposed portal. The Unified Modeling Language (UML) model developed in this thesis...
Show moreWhile international academic and research collaborations are of great importance at this time, it is not easy to find researchers in the engineering field that publish in languages other than English. Because of this disconnect, there exists a need for a portal to find Who’s Who in Engineering Education in the Americas. The objective of this thesis is to built an object-oriented architecture for this proposed portal. The Unified Modeling Language (UML) model developed in this thesis incorporates the basic structure of a social network for academic purposes. Reverse engineering of three social networks portals yielded important aspects of their structures that have been incorporated in the proposed UML model. Furthermore, the present work includes a pattern for academic social networks.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004179, http://purl.flvc.org/fau/fd/FA00004179
Subject Headings: Computer network architecture, Critical theory, Embedded computer systems, Interdisciplinary research, Software architecture, UML (Computer science)
Format: Document (PDF)

Title: An efficient and scalable core allocation strategy for multicore systems.
Creator: Rani, Manira S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Multiple threads can run concurrently on multiple cores in a multicore system and improve performance/power ratio. However, effective core allocation in multicore and manycore systems is very challenging. In this thesis, we propose an effective and scalable core allocation strategy for multicore systems to achieve optimal core utilization by reducing both internal and external fragmentations. Our proposed strategy helps evenly spreading the servicing cores on the chip to facilitate better...
Show moreMultiple threads can run concurrently on multiple cores in a multicore system and improve performance/power ratio. However, effective core allocation in multicore and manycore systems is very challenging. In this thesis, we propose an effective and scalable core allocation strategy for multicore systems to achieve optimal core utilization by reducing both internal and external fragmentations. Our proposed strategy helps evenly spreading the servicing cores on the chip to facilitate better heat dissipation. We introduce a multi-stage power management scheme to reduce the total power consumption by managing the power states of the cores. We simulate three multicore systems, with 16, 32, and 64 cores, respectively, using synthetic workload. Experimental results show that our proposed strategy performs better than Square-shaped, Rectangle-shaped, L-Shaped, and Hybrid (contiguous and non-contiguous) schemes in multicore systems in terms of fragmentation and completion time. Among these strategies, our strategy provides a better heat dissipation mechanism.
Show less
Date Issued: 2011
PURL: http://purl.flvc.org/FAU/3172698
Subject Headings: Modularity (Engineering), Multicasting (Computer networks), Convergence (Telecommunication), Computer architecture, Memory management (Computer science), Cache memory
Format: Document (PDF)

Title: Password-authenticated two-party key exchange with long-term security.
Creator: Gao, WeiZheng., Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: In the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the...
Show moreIn the design of two-party key exchange it is common to rely on a Die-Hellman type hardness assumption in connection with elliptic curves. Unlike the case of nite elds, breaking multiple instances of the underlying hardness assumption is here considered substantially more expensive than breaking a single instance. Prominent protocols such as SPEKE [12] or J-PAKE [8, 9, 10] do not exploit this, and here we propose a password-authenticated key establishment where the security builds on the intractability of solving a specied number of instances v of the underlying computational problem. Such a design strategy seems particularly interesting when aiming at long-term security guarantees for a protocol, where expensive special purpose equipment might become available to an adversary. In this thesis, we give one protocol for the special case when v = 1 in the random oracle model, then we provide the generalized protocol in the random oracle model and a variant of the generalized protocol in the standard model for v being a polynomial of the security parameter `.
Show less
Date Issued: 2012
PURL: http://purl.flvc.org/FAU/3342105
Subject Headings: Data encryption (Computer science), Computer networks (Security measures), Software protection, Computers, Access control, Passwords
Format: Document (PDF)

Title: Efficient and Effective Searching m Unstructured FileSharing Peer-to-Peer Networks.
Creator: Li, Xiuqi, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Peer-to-peer (P2P) networking has been receiving increasing attention from the research community recently. How to conduct efficient and effective searching in such networks has been a challenging research topic. This dissertation focuses on unstructured file-sharing peer-to-peer networks. Three novel searching schemes are proposed, implemented, and evaluated. In the first scheme named ISRL (Intelligent Search by Reinforcement Learning), we propose to systematically learn the best route to...
Show morePeer-to-peer (P2P) networking has been receiving increasing attention from the research community recently. How to conduct efficient and effective searching in such networks has been a challenging research topic. This dissertation focuses on unstructured file-sharing peer-to-peer networks. Three novel searching schemes are proposed, implemented, and evaluated. In the first scheme named ISRL (Intelligent Search by Reinforcement Learning), we propose to systematically learn the best route to desired files through reinforcement learning when topology adaptation is impossible or infeasible. To discover the best path to desired files, ISRL not only explores new paths by forwarding queries to randomly chosen neighbors, but also exploits the paths that have been discovered for reducing the cumulative query cost. Three models of ISRL are put forwarded: a basic version for finding one desired file, MP-ISRL (MP stands for Multiple-Path ISRL) for finding at least k files, and C-ISRL (C refers to Clustering) for reducing maintenance overhead through clustering when there are many queries. ISRL outperforms existing searching approaches in unstructured peer-to-peer networks by achieving similar query quality with lower cumulative query cost. The experimental results confirm the performance improvement of ISRL. The second approach, HS-SDBF (Hint-based Searching by Scope Decay Bloom Filter), addresses the issue of effective and efficient hint propagation. We design a new data structure called SDBF (Scope Decay Bloom Filter) to represent and advertise probabilistic hints. Compared to existing proactive schemes, HSSDBF can answer many more queries successfully at a lower amortized cost considering both the query traffic and hint propagation traffic. Both the analytic and the experimental results support the performance improvement of our protocol. The third algorithm, hybrid search, seeks to combine the benefits of both forwarding and non-forwarding searching schemes. In this approach, a querying source directly probes its own extended neighbors and forwards a query to a subset of its extended neighbors and guides these neighbors to probe their own extended neighbors on its behalf. The hybrid search is able to adapt query execution to the popularity of desired files without generating too much state maintenance overhead because of the 1-hop forwarding inherent in the approach. It achieves a higher query efficiency than the forwarding scheme and a better success rate than the non-forwarding approach. To the best of our knowledge, this work is the first attempt to integrate forwarding and non-forwarding schemes. Simulation results demonstrate the effectiveness of the hybrid search.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fau/fd/FA00012572
Subject Headings: Peer-to-peer architecture (Computer networks), Computer security, Database searching, Internetworking (Telecommunication), Heterogeneous computing
Format: Document (PDF)

Title: Dynamic simulation and control of an autonomous surface vehicle.
Creator: VanZwieten, Tannen S., Florida Atlantic University, Leonessa, Alexander, College of Engineering and Computer Science, Department of Ocean and Mechanical Engineering
Abstract/Description: Autonomous Surface Vehicle (ASV) research and development is inspired by the navigating and communicatiog challenges of Autonomous Underwater Vehicles (AUVs). The development objective is to provide real time positioning of and communication with AUVs through the air-sea interface. Despite extensive research on AUVs, the ASV has had limited research. The NAVY's desire to make AUV's defense capabilities realizable adds to the project's appeal. Guidance and control play an integral part in the...
Show moreAutonomous Surface Vehicle (ASV) research and development is inspired by the navigating and communicatiog challenges of Autonomous Underwater Vehicles (AUVs). The development objective is to provide real time positioning of and communication with AUVs through the air-sea interface. Despite extensive research on AUVs, the ASV has had limited research. The NAVY's desire to make AUV's defense capabilities realizable adds to the project's appeal. Guidance and control play an integral part in the ASV's success, motivating this thesis work. The overall vehicle dynamics were modeled and numerically simulated for 3 DOF lateral motion. These are development tools for the testing and tuning of PID and adaptive control algorithms. The results show the adaptive controller to be advantageous in terms of tuning, robustness and tracking performances. It uses a single layer neural network that bypasses the need for information about the system's dynamic structure and characteristics and provides portability.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13081
Subject Headings: Hydrodynamics, Adaptive control systems--Computer simulation, PID controllers--Computer simulation, Neural networks (Computer science)
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: Model-Driven Architecture and the Secure Systems Methodology.
Creator: Morrison, Patrick, Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: As a compamon and complement to the work being done to build a secure systems methodology, this thesis evaluates the use of Model-Driven Architecture (MDA) in support of the methodology's lifecycle. The development lifecycle illustrated follows the recommendations of this secure systems methodology, while using MDA models to represent requirements, analysis, design, and implementation information. In order to evaluate MDA, we analyze a well-understood distributed systems security problem,...
Show moreAs a compamon and complement to the work being done to build a secure systems methodology, this thesis evaluates the use of Model-Driven Architecture (MDA) in support of the methodology's lifecycle. The development lifecycle illustrated follows the recommendations of this secure systems methodology, while using MDA models to represent requirements, analysis, design, and implementation information. In order to evaluate MDA, we analyze a well-understood distributed systems security problem, remote access, as illustrated by the internet "secure shell" protocol, ssh. By observing the ability of MDA models and transformations to specify remote access in each lifecycle phase, MDA's strengths and weaknesses can be evaluated in this context. A further aim of this work is to extract concepts that can be contained in an MDA security metamodel for use in future projects.
Show less
Date Issued: 2007
PURL: http://purl.flvc.org/fau/fd/FA00012537
Subject Headings: Expert systems (Computer science), Software engineering, Computer-aided design, Computer network architectures
Format: Document (PDF)

Title: Energy-efficient routing in ad hoc wireless networks.
Creator: Dai, Qing., Florida Atlantic University, Wu, Jie
Abstract/Description: The ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's...
Show moreThe ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's Minimum Spanning Tree (MST) has better performance than Kruskal's MST and the two binary search algorithms. In the following two chapters, routing algorithms are studied for specific situations, when directional antenna is used (Chapter 4) or when partial signal could be collected, stored and integrated (Chapter 5). Different algorithms are discussed and their energy performance illustrated by simulation study. Their application and limitation are also discussed in the thesis.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13077
Subject Headings: Wireless communication systems, Routers (Computer networks), Electronic digital computers--Power supply, Mobile computing
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: Resource-sensitive intrusion detection models for network traffic.
Creator: Abushadi, Mohamed E., Florida Atlantic University, Khoshgoftaar, Taghi M.
Abstract/Description: Network security is an important subject in today's extensively interconnected computer world. The industry, academic institutions, small and large businesses and even residences are now greatly at risk from the increasing onslaught of computer attacks. Such malicious efforts cause damage ranging from mere violation of confidentiality and issues of privacy up to actual financial loss if business operations are compromised, or even further, loss of human lives in the case of mission-critical...
Show moreNetwork security is an important subject in today's extensively interconnected computer world. The industry, academic institutions, small and large businesses and even residences are now greatly at risk from the increasing onslaught of computer attacks. Such malicious efforts cause damage ranging from mere violation of confidentiality and issues of privacy up to actual financial loss if business operations are compromised, or even further, loss of human lives in the case of mission-critical networked computer applications. Intrusion Detection Systems (IDS) have been used along with the help of data mining modeling efforts to detect intruders, yet with the limitation of organizational resources it is unreasonable to inspect every network alarm raised by the IDS. Modified Expected Cost of Misclassification ( MECM) is a model selection measure that is resource-aware and cost-sensitive at the same time, and has proven to be effective for the identification of the best resource-based intrusion detection model.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/13054
Subject Headings: Computer networks--Security measures--Automation, Computers--Access control, Data mining, Computer security
Format: Document (PDF)

Title: Techniques for combining binary classifiers: A comparative study in network intrusion detection systems.
Creator: Lin, Hua., Florida Atlantic University, Khoshgoftaar, Taghi M., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We discuss a set of indirect combining techniques for addressing multi-category classification problems that have been used in many domains, but not for intrusion detection systems. In contrast to the indirect combining techniques, direct techniques generally extend associated binary classifiers to handle multi-category classification problems. An indirect combining technique decomposes the original multi-category problem into, based on some criteria, multiple binary-category problems. We...
Show moreWe discuss a set of indirect combining techniques for addressing multi-category classification problems that have been used in many domains, but not for intrusion detection systems. In contrast to the indirect combining techniques, direct techniques generally extend associated binary classifiers to handle multi-category classification problems. An indirect combining technique decomposes the original multi-category problem into, based on some criteria, multiple binary-category problems. We investigated two different approaches for building the binary classifiers. The results of the binary classifiers are then merged using a combining technique---three different combining techniques were studied. We implement some of the indirect combining techniques proposed in recent literature, and apply them to a case study of the DARPA KDD-1999 network intrusion detection project. The results demonstrate the usefulness of using indirect combining techniques for the multi-category classification problem of intrusion detection systems.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13111
Subject Headings: Computer networks--Security measures, Computer security, Computers--Access control, Electronic countermeasures, Fuzzy systems
Format: Document (PDF)

Title: XYZ: A scalable, partially centralized lookup service for large-scale peer-to-peer systems.
Creator: Zhang, Jianying., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. The objective of this thesis was to design XYZ, a partially centralized, scalable and self-organizing lookup service for wide area P2P systems. The XYZ system is based on distributed hash table (DHT). A unique ID and a color assigned to each...
Show morePeer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. The objective of this thesis was to design XYZ, a partially centralized, scalable and self-organizing lookup service for wide area P2P systems. The XYZ system is based on distributed hash table (DHT). A unique ID and a color assigned to each node and each file. The author uses clustering method to create the system backbone by connecting the cluster heads together and uses color clustering method to create color overlays. Any lookup for a file with a color will only be forwarded in the color overlay with the same color so that the searching space is minimized. Simulations and analysis are also provided in this thesis.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13263
Subject Headings: Wireless communication systems, Peer-to-peer architecture (Computer networks), Computational grids (Computer systems)
Format: Document (PDF)

Title: An improved neural net-based approach for predicting software quality.
Creator: Guasti, Peter John., Florida Atlantic University, Khoshgoftaar, Taghi M., Pandya, Abhijit S.
Abstract/Description: Accurately predicting the quality of software is a major problem in any software development project. Software engineers develop models that provide early estimates of quality metrics which allow them to take action against emerging quality problems. Most often the predictive models are based upon multiple regression analysis which become unstable when certain data assumptions are not met. Since neural networks require no data assumptions, they are more appropriate for predicting software...
Show moreAccurately predicting the quality of software is a major problem in any software development project. Software engineers develop models that provide early estimates of quality metrics which allow them to take action against emerging quality problems. Most often the predictive models are based upon multiple regression analysis which become unstable when certain data assumptions are not met. Since neural networks require no data assumptions, they are more appropriate for predicting software quality. This study proposes an improved neural network architecture that significantly outperforms multiple regression and other neural network attempts at modeling software quality. This is demonstrated by applying this approach to several large commercial software systems. After developing neural network models, we develop regression models on the same data. We find that the neural network models surpass the regression models in terms of predictive quality on the data sets considered.
Show less
Date Issued: 1995
PURL: http://purl.flvc.org/fcla/dt/15134
Subject Headings: Neural networks (Computer science), Computer software--Development, Computer software--Quality control, Software engineering
Format: Document (PDF)

Title: Fuzzy vault fingerprint cryptography: Experimental and simulation studies.
Creator: Kotlarchyk, Alex J., Florida Atlantic University, Pandya, Abhijit S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The fuzzy vault scheme introduced by Juels and Sudan [Jue02] was implemented in a fingerprint cryptography system using COTS software. This system proved to be unsuccessful. Failure analysis led to a series of simulations to investigate the parameters and system thresholds necessary for such a system to perform adequately and as guidance for constructing similar systems in the future. First, a discussion of the role of biometrics in data security and cryptography is presented, followed by a...
Show moreThe fuzzy vault scheme introduced by Juels and Sudan [Jue02] was implemented in a fingerprint cryptography system using COTS software. This system proved to be unsuccessful. Failure analysis led to a series of simulations to investigate the parameters and system thresholds necessary for such a system to perform adequately and as guidance for constructing similar systems in the future. First, a discussion of the role of biometrics in data security and cryptography is presented, followed by a review of the key developments leading to the development of the fuzzy vault scheme. The relevant mathematics and algorithms are briefly explained. This is followed by a detailed description of the implementation and simulation of the fuzzy vault scheme. Finally, conclusions drawn from analysis of the results of this research are presented.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13360
Subject Headings: Computer networks--Security measures, Computer security, Data encryption (Computer science)
Format: Document (PDF)

Title: Fault-tolerant distributed shared memories.
Creator: Brown, Larry., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Distributed shared memory (DSM) implements a shared-memory programming interface on message-passing hardware. The shared-memory programming paradigm offers several advantages over the message-passing paradigm. DSM is recognized as an important technology for massively parallel computing. However, as the number of processors in a system increases, the probability of a failure increases. To be widely useful, the DSM must be able to tolerate failures. This dissertation presents a method of...
Show moreDistributed shared memory (DSM) implements a shared-memory programming interface on message-passing hardware. The shared-memory programming paradigm offers several advantages over the message-passing paradigm. DSM is recognized as an important technology for massively parallel computing. However, as the number of processors in a system increases, the probability of a failure increases. To be widely useful, the DSM must be able to tolerate failures. This dissertation presents a method of implementing fault-tolerant DSM (FTDSM) that is based on the idea of a snooper. The snooper monitors DSM protocol messages and keeps a backup of the current state of the DSM. The snooper can respond on behalf of failed processors. The snooper-based FTDSM is an improvement over existing FTDSMs because it is based on the efficient dynamic distributed manager DSM algorithm, does not require the repair of a failed processor in access the DSM, and does not query all nodes to rebuild the state of the DSM. Three snooper-based FTDSM systems are developed. The single-snooper (SS) FTDSM has one snooper and is restricted to a broadcast network. Additional snoopers are added in the multiple-snooper (MS) FTDSM to improve performance. Two-phase commit (2PC) protocols are developed to coordinate the activities of the snoopers, and a special data structure is used to store causality information to reduce the amount of snooper activity. Snooping is integrated with each processor in the integrated snooper (IS) FTDSM. The IS FTDSM is scalable because it is not restricted to a broadcast network. The concept of dynamic snooping is introduced for the IS FTDSM and several snooper migration algorithms are studied. Several recovery algorithms are developed to allow failed processors to rejoin the system. The properties of data structures used to locate owners and snoopers are studied and used to prove that the system can tolerate any single fault. A flexible method of integrating application-level recovery with the FTDSM is presented, and a reliability analysis is conducted using a Markov-chain modeling tool to show that the snooper-based FTDSM is a cost effective way to improve the reliability of DSM.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12349
Subject Headings: Fault-tolerant computing, Electronic data processing--Distributed processing, Parallel processing (Electronic computers), Computer networks
Format: Document (PDF)

Title: Channel Assignment in Cognitive Radio Wireless Networks.
Creator: Wu, Yueshi, Cardei, Mihaela, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Cognitive radio technology that enables dynamic spectrum access has been a promising solution for the spectrum scarcity problem. Cognitive radio networks enable the communication on both licensed and unlicensed channels, having the potential to better solve the interference and collision issues. Channel assignment is of great importance in cognitive radio networks. When operating on licensed channels, the objective is to exploit spectrum holes through cognitive communication, giving priority...
Show moreCognitive radio technology that enables dynamic spectrum access has been a promising solution for the spectrum scarcity problem. Cognitive radio networks enable the communication on both licensed and unlicensed channels, having the potential to better solve the interference and collision issues. Channel assignment is of great importance in cognitive radio networks. When operating on licensed channels, the objective is to exploit spectrum holes through cognitive communication, giving priority to the primary users. In this dissertation, we focus on the development of efficient channel assignment algorithms and protocols to improve network performance for cognitive radio wireless networks. The first contribution is on channel assignment for cognitive radio wireless sensor networks aiming to provide robust topology control, as well as to increase network throughput and data delivery rate. The approach is then extended to specific cognitive radio network applications achieving improved performances.
Show less
Date Issued: 2016
PURL: http://purl.flvc.org/fau/fd/FA00004750, http://purl.flvc.org/fau/fd/FA00004750
Subject Headings: Cognitive radio networks--Technological innovations., Wireless communication systems--Technological innovations., Ad hoc networks (Computer networks), Routing protocols (Computer network protocols)
Format: Document (PDF)

Title: An implementation of the IEEE 1609.4 wave standard for use in a vehicular networking testbed.
Creator: Kuffermann, Kyle, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We present an implementation of the IEEE WAVE (Wireless Access in Vehicular Environments) 1609.4 standard, Multichannel Operation. This implementation provides concurrent access to a control channel and one or more service channels, enabling vehicles to communicate among each other on multiple service channels while still being able to receive urgent and control information on the control channel. Also included is functionality that provides over-the-air timing synchronization, allowing...
Show moreWe present an implementation of the IEEE WAVE (Wireless Access in Vehicular Environments) 1609.4 standard, Multichannel Operation. This implementation provides concurrent access to a control channel and one or more service channels, enabling vehicles to communicate among each other on multiple service channels while still being able to receive urgent and control information on the control channel. Also included is functionality that provides over-the-air timing synchronization, allowing participation in alternating channel access in the absence of a reliable time source. Our implementation runs on embedded Linux and is built on top of IEEE 802.11p, as well as a customized device driver. This implementation will serve as a key compo- nent in our IEEE 1609-compliant Vehicular Multi-technology Communication Device (VMCD) that is being developed for a VANET testbed under the Smart Drive initiative, supported by the National Science Foundation.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004299, http://purl.flvc.org/fau/fd/FA00004299
Subject Headings: Vehicular ad hoc networks (Computer networks)., Wireless sensor networks., Wireless communication systems., Wireless LANs., Linux., Expert systems (Computer science), Operating systems (Computers)
Format: Document (PDF)

Title: An uncertainty-aware reputation system in mobile networks: analysis and applications.
Creator: Li, Feng., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Many emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on...
Show moreMany emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on evaluating and quantifying trust to stimulate collaboration in mobile networks, introducing uncertainty concepts and metrics, as well as providing the various analysis and applications of uncertainty-aware reputation systems. Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include it in the reputation system. Specifically, we use an uncertainty metric to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information may affect uncertainty in nodes' opinions. Higher uncertainty leads to higher transaction cost and reduced acceptance of communication. We exploit mobility to efficiently reduce uncertainty and to speed up trust convergence. We also apply the new reputation system to enhance the analysis of the interactions among mobile nodes, and present three sample uncertainty-aware applications. We integrate the uncertainty-aware reputation model with game theory tools, and enhance the analysis on interactions among mobile nodes., Instead of reactively protecting the mobile networks from existing attacks as in the traditional security paradigms, the analysis in this dissertation gives more insights on nodes' rationality in the interaction, which will enable the mechanism design in mobile networks to be security and incentive compatible. Moreover, we present three sample applications, in which we clearly identify the challenges, specifically formalize the problems, and cleverly employ the uncertainty mitigation schemes. These applications show that the uncertainty definition and mitigation schemes can benefit a broad range of applications, including fields such as security, network services, and routing.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/210520
Subject Headings: Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Computer network architectures, Mobile computing, Ad hoc networks (Computer networks), Security measures
Format: Document (PDF)

FAU Theses and Dissertations (283)	+ -
FAU Graduate Student Research (2)	+ -
FAU College Collections (1)	+ -
HBOI Faculty Contributions (1)	+ -
Honors Student Theses (1)	+ -

Neural networks (Computer science) (82)	+ -
Computer network protocols (47)	+ -
Wireless communication systems (40)	+ -
Computer networks (35)	+ -
Computer network architectures (23)	+ -

Computer algorithms (17)	+ -
Mobile computing (15)	+ -
Technological innovations (15)	+ -
Local area networks (Computer networks) (14)	+ -
Artificial intelligence (12)	+ -
Computer security (12)	+ -
Ad hoc networks (Computer networks) (11)	+ -
Computer networks--Security measures (11)	+ -
Expert systems (Computer science) (11)	+ -
Sensor networks (11)	+ -
Hypercube networks (Computer networks) (10)	+ -
Pattern recognition systems (10)	+ -
Security measures (10)	+ -
Data encryption (Computer science) (9)	+ -
Design and construction (9)	+ -
Fault-tolerant computing (9)	+ -
Packet switching (Data transmission) (9)	+ -
Routers (Computer networks) (9)	+ -
Software engineering (9)	+ -
TCP/IP (Computer network protocol) (9)	+ -
Computer architecture (8)	+ -
Data transmission systems (8)	+ -
Fuzzy logic (8)	+ -
Machine learning (8)	+ -
Mobile communication systems (8)	+ -

United States (2)	+ -
Latin America (1)	+ -

Electronic Thesis or Dissertation (283)	+ -
abstract (2)	+ -
article (2)	+ -
poster (1)	+ -
thesis (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Geographic Subject

Title as Subject

Genre

Type of Resource

Language

Creator

Format

Owner