View All Items
(41 - 47 of 47)
Pages
- Title
- Static and dynamic load balance strategies for a class of applications.
- Creator
- Pan, Jianping., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Parallel/distributed systems offer a tremendous processing capacity. However, in order to take full advantage of it, good load distributions are needed. We study the task graph partition problem for a given parallel/distributed application which is modeled using data parallelism and is implemented in a transputer system in a mesh construction. Our approach uses domain partition to separate a given domain into a set of subdomains of equal size and each of which has at most four neighbors. We...
Show moreParallel/distributed systems offer a tremendous processing capacity. However, in order to take full advantage of it, good load distributions are needed. We study the task graph partition problem for a given parallel/distributed application which is modeled using data parallelism and is implemented in a transputer system in a mesh construction. Our approach uses domain partition to separate a given domain into a set of subdomains of equal size and each of which has at most four neighbors. We devise three methods to partition a given domain, these methods are compared based on several criteria. The impact of the number of processors used in implementation is also investigated based on several parameters, including processor speed, communication speed, and amount of computation and communication per data point. We discuss implementation of our approach in the application based on the existing features of the transputer system, and compare different versions of application through running a simulation system.
Show less - Date Issued
- 1996
- PURL
- http://purl.flvc.org/fcla/dt/15298
- Subject Headings
- Parallel processing (Electronic computers), Electronic data processing--Distributed processing, Computer capacity--Management, Transputers
- Format
- Document (PDF)
- Title
- Routing in mobile ad-hoc wireless networks.
- Creator
- Li, Hailan., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and...
Show moreThis thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and efficient distributed algorithm for calculating connected dominating set in a given un-directed ad hoc network, then evaluate the proposed algorithm through simulation. We also discuss connected dominating set update/recalculation algorithms when the topology of the ad hoc network changes. We also explore the possible extension of using hierarchical connected dominating set. The shortest path routing and the dynamic source routing, which are based on the connected dominating set subnetwork, are discussed.
Show less - Date Issued
- 1999
- PURL
- http://purl.flvc.org/fcla/dt/15695
- Subject Headings
- Mobile computing, Computer algorithms, Computer networks
- Format
- Document (PDF)
- Title
- Using classification and regression tree to detect hematology abnormalities.
- Creator
- Qian, Cheng., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
The detection of the abnormal blood cells and particles in a blood test is essential in medical diagnosis. The detection rules, which are usually implemented in the widely used automated hematology analyzer, are therefore critical for the health and even lives of millions of people. The research endeavor of this thesis is on generating such detection rules using a supervised machine learning algorithm. The first part of this thesis studies the hematology data and surveys the popular...
Show moreThe detection of the abnormal blood cells and particles in a blood test is essential in medical diagnosis. The detection rules, which are usually implemented in the widely used automated hematology analyzer, are therefore critical for the health and even lives of millions of people. The research endeavor of this thesis is on generating such detection rules using a supervised machine learning algorithm. The first part of this thesis studies the hematology data and surveys the popular classification algorithms. In the second part, the selected algorithm, CART, is implemented with deliberately selected parameters. In the third part, a modification of the algorithm, logical pruning with Enclose the Normal principle, is exercised. To extend the algorithm and to achieve better performance, I developed and implemented the idea of decision tree combinations. The research has proven to be successful by the achievement of good performance and reasonable detection rules.
Show less - Date Issued
- 2004
- PURL
- http://purl.flvc.org/fcla/dt/13189
- Subject Headings
- Regression analysis, Health survey--Statistical methods, Medical statistics, Blood--Diseases--Diagnosis, Hematology, Blood--Examination
- Format
- Document (PDF)
- Title
- Design and modeling of hybrid software fault-tolerant systems.
- Creator
- Zhang, Man-xia Maria., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Fault tolerant programming methods improve software reliability using the principles of design diversity and redundancy. Design diversity and redundancy, on the other hand, escalate the cost of the software design and development. In this thesis, we study the reliability of hybrid fault tolerant systems. Probability models based on fault trees are developed for the recovery block (RB), N-version programming (NVP) and hybrid schemes which are the combinations of RB and NVP. Two heuristic...
Show moreFault tolerant programming methods improve software reliability using the principles of design diversity and redundancy. Design diversity and redundancy, on the other hand, escalate the cost of the software design and development. In this thesis, we study the reliability of hybrid fault tolerant systems. Probability models based on fault trees are developed for the recovery block (RB), N-version programming (NVP) and hybrid schemes which are the combinations of RB and NVP. Two heuristic methods are developed to construct hybrid fault tolerant systems with total cost constraints. The algorithms provide a systematic approach to the design of hybrid fault tolerant systems.
Show less - Date Issued
- 1992
- PURL
- http://purl.flvc.org/fcla/dt/14783
- Subject Headings
- Computer software--Reliability, Fault-tolerant computing, Algorithms
- 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
- Properties of Static and Mobile Unreliable Networks and their effects on Combating Malicious Objects.
- Creator
- Ruocco, John, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Wireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks...
Show moreWireless sensor networks or WSNs continually become more common in todays world. They are able to give us a constant view into the world as they gather information and make this information more readily available. The infonnation these networks gather and contain is valuable and protecting it is of great importance. Today more and more devices are becoming wireless and mobile. This is allowing for very diverse networks to be created and they are constantly changing. Nodes in these networks are either moving to different positions or going offi ine which constantly changes the overall layout of the network. With this increasing connectivity of today's devices this opens the door for possibility for these types of networks to become targets by malicious objects designed to bring harm to the network. Many unre liable networks already face many problems such as having to optimize battety life and being deployed in areas where they can be damaged. A malicious object in this type of network has the power to destroy data and deplete the networks limited resources such as bandwidth and power. Removal of these malicious objects can also have a negative effect on these limited resources. We must find a way to remove these malicious objects in a way that minimizes loss to the network. In this paper we will look at the information survival threshold of these types of networks. Certain controllable parameters exist that directly impact the survival rate of all data in the network. We will combine this with the addition our own self-replicating objects to the network designed to neutralize their malicious counterparts. We will examine these information survival threshold parameters along with specific parameters available to the network. We shall see how these parameters affect overall survival of data in the network and their impact on our own good data.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/fau/fd/FA00012545
- Subject Headings
- Wireless communication systems--Security measures, Computer network protocols, Computer security, Computer networks--Security measures
- Format
- Document (PDF)
- Title
- Improving Cooperation in P2P Networks: A Social Network Approach.
- Creator
- Ponce, Victor, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Due to the dynamic nature of P2P systems, it is impossible to keep an accurate history of the transactions that take place while avoiding security attacks such as whitewashing and collusion, and abuse such as freeriding . This is why it is important to develop a mechanism that rewards cooperative peers and punishes misbehaving peers. Modeling P2P networks as social structures can allow incentive mechanisms to be used that prevent the negative behaviors mentioned. In this thesis, we extend a...
Show moreDue to the dynamic nature of P2P systems, it is impossible to keep an accurate history of the transactions that take place while avoiding security attacks such as whitewashing and collusion, and abuse such as freeriding . This is why it is important to develop a mechanism that rewards cooperative peers and punishes misbehaving peers. Modeling P2P networks as social structures can allow incentive mechanisms to be used that prevent the negative behaviors mentioned. In this thesis, we extend a social network algorithm to include credit transfer between peers in order to reduce the path length of queries. We also develop a selection strategy that involves different aspects of peer interactions in P2P networks, which is promoted by our credit transfer mechanism that discourages misbehaving peers by taking away credits that they have with good peers and transferring them to more cooperative ones. The simulation results show that our algorithm is effective in reducing the debt between peers, meaning that peers become more cooperative, and shortening the average path length to a satisfied query while increasing delivery ratio.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012539
- Subject Headings
- Peer-to-peer architecture (Computer networks)--Technological innovations, Social interaction, Network analysis (Planning)
- Format
- Document (PDF)
