View All Items

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: Implementation and comparison of the Golay and first order Reed-Muller codes.
Creator: Shukina, Olga., Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: In this project we perform data transmission across noisy channels and recover the message first by using the Golay code, and then by using the first-order Reed- Muller code. The main objective of this thesis is to determine which code among the above two is more efficient for text message transmission by applying the two codes to exactly the same data with the same channel error bit probabilities. We use the comparison of the error-correcting capability and the practical speed of the Golay...
Show moreIn this project we perform data transmission across noisy channels and recover the message first by using the Golay code, and then by using the first-order Reed- Muller code. The main objective of this thesis is to determine which code among the above two is more efficient for text message transmission by applying the two codes to exactly the same data with the same channel error bit probabilities. We use the comparison of the error-correcting capability and the practical speed of the Golay code and the first-order Reed-Muller code to meet our goal.
Show less
Date Issued: 2013
PURL: http://purl.flvc.org/fcla/dt/3362579
Subject Headings: Error-correcting codes (Information theory), Coding theory, Computer algorithms, Digital modulation
Format: Document (PDF)

Title: Shamir's secret sharing scheme using floating point arithmetic.
Creator: Finamore, Timothy., Charles E. Schmidt College of Science, Department of Mathematical Sciences
Abstract/Description: Implementing Shamir's secret sharing scheme using floating point arithmetic would provide a faster and more efficient secret sharing scheme due to the speed in which GPUs perform floating point arithmetic. However, with the loss of a finite field, properties of a perfect secret sharing scheme are not immediately attainable. The goal is to analyze the plausibility of Shamir's secret sharing scheme using floating point arithmetic achieving the properties of a perfect secret sharing scheme and...
Show moreImplementing Shamir's secret sharing scheme using floating point arithmetic would provide a faster and more efficient secret sharing scheme due to the speed in which GPUs perform floating point arithmetic. However, with the loss of a finite field, properties of a perfect secret sharing scheme are not immediately attainable. The goal is to analyze the plausibility of Shamir's secret sharing scheme using floating point arithmetic achieving the properties of a perfect secret sharing scheme and propose improvements to attain these properties. Experiments indicate that property 2 of a perfect secret sharing scheme, "Any k-1 or fewer participants obtain no information regarding the shared secret", is compromised when Shamir's secret sharing scheme is implemented with floating point arithmetic. These experimental results also provide information regarding possible solutions and adjustments. One of which being, selecting randomly generated points from a smaller interval in one of the proposed schemes of this thesis. Further experimental results indicate improvement using the scheme outlined. Possible attacks are run to test the desirable properties of the different schemes and reinforce the improvements observed in prior experiments.
Show less
Date Issued: 2012
PURL: http://purl.flvc.org/FAU/3342048
Subject Headings: Signal processing, Digital techniques, Mathematics, Data encryption (Computer science), Computer file sharing, Security measures, Computer algorithms, Numerical analysis, Data processing
Format: Document (PDF)

Title: Modeling and simulation on the yard trailers deployment in the maritime container terminal.
Creator: Zhao, Yueqiong, College of Engineering and Computer Science, Department of Civil, Environmental and Geomatics Engineering
Abstract/Description: In recent years, there has been an exponential increase in container volume shipment within intermodal transportation systems. Container terminals as part of the global port system represent important hubs within this intermodal transportation system. Thus, the need to improve the operational efficiency is the most important issue for container terminals from an economic standpoint. Moreover, intermodal transportation systems, ports and inland transport facilities should all be integrated...
Show moreIn recent years, there has been an exponential increase in container volume shipment within intermodal transportation systems. Container terminals as part of the global port system represent important hubs within this intermodal transportation system. Thus, the need to improve the operational efficiency is the most important issue for container terminals from an economic standpoint. Moreover, intermodal transportation systems, ports and inland transport facilities should all be integrated into one coordinated plan. More specifically, a method to schedule different types of handling equipment in an integrated way within a container terminal is a popular topic for researchers. However, not many researchers have addresses this topic in relationship to the simulation aspect which will test feasible solutions under real container terminal environment parameters. In order to increase the efficiency of operations, the development of mathematical models and algorithms is critical in finding the best feasible solution. The objective of this study is to evaluate the feasible solution to find the proper number of Yard Trailers (YTs) with the minimal cost for the container terminals. This study uses the Dynamic YTs operation's method as a background for modeling. A mathematical model with various constraints related to the integrated operations among the different types of handling equipment is formulated. This model takes into consideration both serving time of quay cranes and yard cranes, and cost reduction strategies by decreasing use of YTs with the specific objective of minimum total cost including utilization of YTs and vessel berthing. In addition, a heuristic algorithm combined with Monte Carlo Method and Brute-Force Search are employed. The early Stage Technique of Monte Carlo method is proposed to generate vast random numbers to replicate simulation for real cases., The Brute-Force Search is used for identifying all potential cases specific to the conditions of this study. Some preliminary numerical test results suggest that this method is good for use in conjunction with simulation of container terminal operation. The expected outcome of this research is a solution to obtain the proper number of YTs for transporting containers with a minimum cost; thus, improving the operational efficiency in a container terminal.
Show less
Date Issued: 2011
PURL: http://purl.flvc.org/FAU/3174315
Subject Headings: Marine terminals, Computer programs, Computer algorithms, Materials management, Warehouses, Management, Transportation engineering, Freight and freightage
Format: Document (PDF)

Title: Mechanisms for prolonging network lifetime in wireless sensor networks.
Creator: Yang, Yinying., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Sensors are used to monitor and control the physical environment. A Wireless Sen- sor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using hop-by-hop communication. Once a sink receives sensed data, it processes and forwards it to the users. Sensors are usually battery powered and it is...
Show moreSensors are used to monitor and control the physical environment. A Wireless Sen- sor Network (WSN) is composed of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it [18][5]. Sensor nodes measure various parameters of the environment and transmit data collected to one or more sinks, using hop-by-hop communication. Once a sink receives sensed data, it processes and forwards it to the users. Sensors are usually battery powered and it is hard to recharge them. It will take a limited time before they deplete their energy and become unfunctional. Optimizing energy consumption to prolong network lifetime is an important issue in wireless sensor networks. In mobile sensor networks, sensors can self-propel via springs [14], wheels [20], or they can be attached to transporters, such as robots [20] and vehicles [36]. In static sensor networks with uniform deployment (uniform density), sensors closest to the sink will die first, which will cause uneven energy consumption and limitation of network life- time. In the dissertation, the nonuniform density is studied and analyzed so that the energy consumption within the monitored area is balanced and the network lifetime is prolonged. Several mechanisms are proposed to relocate the sensors after the initial deployment to achieve the desired density while minimizing the total moving cost. Using mobile relays for data gathering is another energy efficient approach. Mobile sensors can be used as ferries, which carry data to the sink for static sensors so that expensive multi-hop communication and long distance communication are reduced. In this thesis, we propose a mobile relay based routing protocol that considers both energy efficiency and data delivery delay. It can be applied to both event-based reporting and periodical report applications., Another mechanism used to prolong network lifetime is sensor scheduling. One of the major components that consume energy is the radio. One method to conserve energy is to put sensors to sleep mode when they are not actively participating in sensing or data relaying. This dissertation studies sensor scheduling mechanisms for composite event detection. It chooses a set of active sensors to perform sensing and data relaying, and all other sensors go to sleep to save energy. After some time, another set of active sensors is chosen. Thus sensors work alternatively to prolong network lifetime.
Show less
Date Issued: 2010
PURL: http://purl.flvc.org/FAU/1870693
Subject Headings: Wireless communication systems, Technological innovations, Wireless communication systems, Design and construction, Ad hoc networks (Computer networks), Technological innovations, Sensor networks, Design and construction, Computer algorithms, Computer network protocols
Format: Document (PDF)

Title: Design and implementation of efficient routing protocols in delay tolerant networks.
Creator: Liu, Cong., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Delay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks...
Show moreDelay tolerant networks (DTNs) are occasionally-connected networks that may suffer from frequent partitions. DTNs provide service despite long end to end delays or infrequent connectivity. One fundamental problem in DTNs is routing messages from their source to their destination. DTNs differ from the Internet in that disconnections are the norm instead of the exception. Representative DTNs include sensor-based networks using scheduled intermittent connectivity, terrestrial wireless networks that cannot ordinarily maintain end-to-end connectivity, satellite networks with moderate delays and periodic connectivity, underwater acoustic networks with moderate delays and frequent interruptions due to environmental factors, and vehicular networks with cyclic but nondeterministic connectivity. The focus of this dissertation is on routing protocols that send messages in DTNs. When no connected path exists between the source and the destination of the message, other nodes may relay the message to the destination. This dissertation covers routing protocols in DTNs with both deterministic and non-deterministic mobility respectively. In DTNs with deterministic and cyclic mobility, we proposed the first routing protocol that is both scalable and delivery guaranteed. In DTNs with non-deterministic mobility, numerous heuristic protocols are proposed to improve the routing performance. However, none of those can provide a theoretical optimization on a particular performance measurement. In this dissertation, two routing protocols for non-deterministic DTNs are proposed, which minimizes delay and maximizes delivery rate on different scenarios respectively. First, in DTNs with non-deterministic and cyclic mobility, an optimal single-copy forwarding protocol which minimizes delay is proposed., In DTNs with non-deterministic mobility, an optimal multi-copy forwarding protocol is proposed. which maximizes delivery rate under the constraint that the number of copies per message is fixed . Simulation evaluations using both real and synthetic trace are conducted to compare the proposed protocols with the existing ones.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/210522
Subject Headings: Computer network protocols, Computer networks, Reliability, Computer algorithms, Wireless communication systems, Technological innovations
Format: Document (PDF)

Title: Probabilistic predictor-based routing in disruption-tolerant networks.
Creator: Yuan, Quan., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Disruption-Tolerant Networks (DTNs) are the networks comprised of a set of wireless nodes, and they experience unstable connectivity and frequent connection disruption because of the limitations of radio range, power, network density, device failure, and noise. DTNs are characterized by their lack of infrastructure, device limitation, and intermittent connectivity. Such characteristics make conventional wireless network routing protocols fail, as they are designed with the assumption the...
Show moreDisruption-Tolerant Networks (DTNs) are the networks comprised of a set of wireless nodes, and they experience unstable connectivity and frequent connection disruption because of the limitations of radio range, power, network density, device failure, and noise. DTNs are characterized by their lack of infrastructure, device limitation, and intermittent connectivity. Such characteristics make conventional wireless network routing protocols fail, as they are designed with the assumption the network stays connected. Thus, routing in DTNs becomes a challenging problem, due to the temporal scheduling element in a dynamic topology. One of the solutions is prediction-based, where nodes mobility is estimated with a history of observations. Then, the decision of forwarding messages during data delivery can be made with that predicted information. Current prediction-based routing protocols can be divided into two sub-categories in terms of that whether they are probability related: probabilistic and non-probabilistic. This dissertation focuses on the probabilistic prediction-based (PPB) routing schemes in DTNs. We find that most of these protocols are designed for a specified topology or scenario. So almost every protocol has some drawbacks when applied to a different scenario. Because every scenario has its own particular features, there could hardly exist a universal protocol which can suit all of the DTN scenarios. Based on the above motivation, we investigate and divide the current DTNs scenarios into three categories: Voronoi-based, landmark-based, and random moving DTNs. For each category, we design and implement a corresponding PPB routing protocol for either basic routing or a specified application with considering its unique features., Specifically, we introduce a Predict and Relay routing protocol for Voronoi-based DTNs, present a single-copy and a multi-copy PPB routing protocol for landmark-based DTNs, and propose DRIP, a dynamic Voronoi region-based publish/subscribe protocol, to adapt publish/subscribe systems to random moving DTNs. New concepts, approaches, and algorithms are introduced during our work.
Show less
Date Issued: 2009
PURL: http://purl.flvc.org/FAU/359928
Subject Headings: Routers (Computer networks), Computer network protocols, Computer networks, Reliability, Computer algorithms, Wireless communication systems, Technological innovations
Format: Document (PDF)

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: 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: Efficient Resource Discovery Technique in a Mobile Ad Hoc Networks.
Creator: Thanawala, Ravi, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis describes a resource discovery technique in mobile ad hoc networks. Resource discovery is technique to search data in among the mobile nodes in the network. The highly dynamic nature of the infrastructure-less ad hoc networks poses new challenges in resource discovery, thus there is a need to for an optimized resource discovery technique. Efficient resource discovery algorithm discovers the resources in a mobile ad-hoc network in an optimized way. As there is no pre-established...
Show moreThis thesis describes a resource discovery technique in mobile ad hoc networks. Resource discovery is technique to search data in among the mobile nodes in the network. The highly dynamic nature of the infrastructure-less ad hoc networks poses new challenges in resource discovery, thus there is a need to for an optimized resource discovery technique. Efficient resource discovery algorithm discovers the resources in a mobile ad-hoc network in an optimized way. As there is no pre-established infrastructure in the network, every node takes its decision in forwarding resources and every node dynamically ranks these resources before disseminating them in the network. Ranking of the resources spreads the data which is of high priority at that instance of time. Ranking avoids the spreads the unwanted or low priority data which will utilize the bandwidth unnecessarily. The efficient resource discovery algorithm also keeps a check that redundant information is not spread in the network with the available bandwidth and the bandwidth is utilized in an optimized manner. We then introduce brokers in the algorithm for a better performance. We present a technique to maintain a constant number of brokers in the network. Our simulations show that, in a network with high density, the efficient resource discovery algorithm gives a better performance than the flooding and rank based broadcast algorithms.
Show less
Date Issued: 2008
PURL: http://purl.flvc.org/fau/fd/FA00012562
Subject Headings: Mobile communication systems--Mathematics, Computer algorithms, Wireless communication systems--Mathematics, Ad hoc networks (Computer networks)--Programming
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: 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: 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: 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: Label routing protocol: A new cross-layer protocol for multi-hop ad hoc wireless network.
Creator: Wang, Yu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Compared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex...
Show moreCompared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex and does not consider the mobility issue for wireless networks, especially for ad hoc networks. This thesis migrates the label concept into the ad hoc network and provides a framework for the efficient Label Routing Protocol (LRP) in such a network. The MAC layer is also optimized with LRP for shorter delay, power saving, and higher efficiency. The simulation results show that the delay is improved significantly with this cross-layer routing protocol.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13321
Subject Headings: Computer network protocols, Wireless communication systems, Mobile computing, Computer algorithms, MPLS standard, Operating systems (Computers)
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: 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: 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: 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)

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

Neural networks (Computer science) (3)	+ -
Parallel processing (Electronic computers) (3)	+ -
Pattern recognition systems (3)	+ -
Technological innovations (3)	+ -
Cryptography (2)	+ -
Data encryption (Computer science) (2)	+ -
Data mining (2)	+ -
Data transmission systems (2)	+ -
Equalizers (Electronics) (2)	+ -
Fault-tolerant computing (2)	+ -
Image processing--Digital techniques (2)	+ -
Reliability (2)	+ -
Routers (Computer networks) (2)	+ -
Security measures (2)	+ -
Ad hoc networks (Computer networks) (1)	+ -
Ad hoc networks (Computer networks)--Programming (1)	+ -
Bioinformatics (1)	+ -
Cellular radio (1)	+ -
Cluster analysis--Computer programs (1)	+ -
Coding theory (1)	+ -
Computer architecture (1)	+ -
Computer file sharing (1)	+ -
Computer network architectures (1)	+ -
Computer programs (1)	+ -

Florida Atlantic University (29)	+ -
College of Engineering and Computer Science (25)	+ -
Department of Computer and Electrical Engineering and Computer Science (24)	+ -
Wu, Jie (10)	+ -
Pandya, Abhijit S. (5)	+ -

Charles E. Schmidt College of Science (3)	+ -
Department of Mathematical Sciences (3)	+ -
Sudhakar, Raghavan (3)	+ -
Larrondo-Petrie, Maria M. (2)	+ -
Barrantes-Sliesarieva, Elena Gabriela. (1)	+ -
Boccuzzi, Joseph. (1)	+ -
Bruhns, Stefan (1)	+ -
Cang, Songluan. (1)	+ -
Chen, Xiao. (1)	+ -
Coulter, Neal S. (1)	+ -
Department of Civil, Environmental and Geomatics Engineering (1)	+ -
Dong, Yuhong. (1)	+ -
Fernandez, Eduardo B. (1)	+ -
Finamore, Timothy. (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)	+ -
Liu, Cong. (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Geographic Subject

Type of Resource

Language

Creator

Format

Owner