You searched for +publisher:"Florida International University" +contributor:("Deng Pan").
Showing records 1 – 30 of
40 total matches.
◁ [1] [2] ▶
Florida International University
1.
Erazo, Miguel A.
Leveraging Symbiotic Relationships for Emulation of Computer Networks.
Degree: PhD, Computer Science, 2013, Florida International University
URL: https://digitalcommons.fiu.edu/etd/827 
;
10.25148/etd.FI13042205
;
FI13042205
► The lack of analytical models that can accurately describe large-scale networked systems makes empirical experimentation indispensable for understanding complex behaviors. Research on network testbeds…
(more)
▼ The lack of analytical models that can accurately describe large-scale networked systems makes empirical experimentation indispensable for understanding complex behaviors. Research on network testbeds for testing network protocols and distributed services, including physical, emulated, and federated testbeds, has made steady progress. Although the success of these testbeds is undeniable, they fail to provide: 1) scalability, for handling large-scale networks with hundreds or thousands of hosts and routers organized in different scenarios, 2) flexibility, for testing new protocols or applications in diverse settings, and 3) inter-operability, for combining simulated and real network entities in experiments. This dissertation tackles these issues in three different dimensions.
First, we present SVEET, a system that enables inter-operability between real and simulated hosts. In order to increase the scalability of networks under study, SVEET enables time-dilated synchronization between real hosts and the discrete-event simulator. Realistic TCP congestion control algorithms are implemented in the simulator to allow seamless interactions between real and simulated hosts. SVEET is validated via extensive experiments and its capabilities are assessed through case studies involving real applications.
Second, we present PrimoGENI, a system that allows a distributed discrete-event simulator, running in real-time, to interact with real network entities in a federated environment. PrimoGENI greatly enhances the flexibility of network experiments, through which a great variety of network conditions can be reproduced to examine what-if questions. Furthermore, PrimoGENI performs resource management functions, on behalf of the user, for instantiating network experiments on shared infrastructures.
Finally, to further increase the scalability of network testbeds to handle large-scale high-capacity networks, we present a novel symbiotic simulation approach. We present SymbioSim, a testbed for large-scale network experimentation where a high-performance simulation system closely cooperates with an emulation system in a mutually beneficial way. On the one hand, the simulation system benefits from incorporating the traffic metadata from real applications in the emulation system to reproduce the realistic traffic conditions. On the other hand, the emulation system benefits from receiving the continuous updates from the simulation system to calibrate the traffic between real applications. Specific techniques that support the symbiotic approach
include: 1) a model downscaling scheme that can significantly reduce the complexity of the large-scale simulation model, resulting in an efficient emulation system for modulating the high-capacity network traffic between real applications; 2) a queuing network model for the downscaled emulation system to accurately represent the network effects of the simulated traffic; and 3) techniques for reducing the synchronization overhead between the simulation and emulation…
Advisors/Committee Members: Jason Liu, Armando Barreto, Deng Pan, Shu-Ching Chen.
Subjects/Keywords: Network simulation; emulation; modeling; networking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Erazo, M. A. (2013). Leveraging Symbiotic Relationships for Emulation of Computer Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/827 ; 10.25148/etd.FI13042205 ; FI13042205
Chicago Manual of Style (16th Edition):
Erazo, Miguel A. “Leveraging Symbiotic Relationships for Emulation of Computer Networks.” 2013. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/827 ; 10.25148/etd.FI13042205 ; FI13042205.
MLA Handbook (7th Edition):
Erazo, Miguel A. “Leveraging Symbiotic Relationships for Emulation of Computer Networks.” 2013. Web. 19 Jan 2021.
Vancouver:
Erazo MA. Leveraging Symbiotic Relationships for Emulation of Computer Networks. [Internet] [Doctoral dissertation]. Florida International University; 2013. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/827 ; 10.25148/etd.FI13042205 ; FI13042205.
Council of Science Editors:
Erazo MA. Leveraging Symbiotic Relationships for Emulation of Computer Networks. [Doctoral Dissertation]. Florida International University; 2013. Available from: https://digitalcommons.fiu.edu/etd/827 ; 10.25148/etd.FI13042205 ; FI13042205
Florida International University
2.
Ramalingam, Mukesh.
Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE.
Degree: MS, Electrical Engineering, 2015, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2014
;
10.25148/etd.FIDC000134
;
FIDC000134
► Global connectivity is on the verge of becoming a reality to provide high-speed, high-quality, and reliable communication channels for mobile devices at anytime, anywhere…
(more)
▼ Global connectivity is on the verge of becoming a reality to provide high-speed, high-quality, and reliable communication channels for mobile devices at anytime, anywhere in the world. In a heterogeneous wireless environment, one of the key ingredients to provide efficient and ubiquitous computing with guaranteed quality and continuity of service is the design of intelligent handoff algorithms. Traditional single-metric handoff decision algorithms, such as Received Signal Strength (RSS), are not efficient and intelligent enough to minimize the number of unnecessary handoffs, decision delays, call-dropping and blocking probabilities.
This research presents a novel approach for of a Multi Attribute Decision Making (MADM) model based on an integrated fuzzy approach for target network selection.
Advisors/Committee Members: Kang K. Yen, Jean H. Andrian, Deng Pan.
Subjects/Keywords: Vertical Handoff; Fuzzy logic; ELECTRE; MADM; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ramalingam, M. (2015). Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE. (Thesis). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2014 ; 10.25148/etd.FIDC000134 ; FIDC000134
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ramalingam, Mukesh. “Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE.” 2015. Thesis, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2014 ; 10.25148/etd.FIDC000134 ; FIDC000134.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ramalingam, Mukesh. “Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE.” 2015. Web. 19 Jan 2021.
Vancouver:
Ramalingam M. Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE. [Internet] [Thesis]. Florida International University; 2015. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2014 ; 10.25148/etd.FIDC000134 ; FIDC000134.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ramalingam M. Vertical Handoff Target Selection in a Heterogeneous Wireless Network Using Fuzzy ELECTRE. [Thesis]. Florida International University; 2015. Available from: https://digitalcommons.fiu.edu/etd/2014 ; 10.25148/etd.FIDC000134 ; FIDC000134
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Florida International University
3.
Jing, Xueyan.
Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection.
Degree: PhD, Electrical Engineering, 2016, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2436
;
10.25148/etd.FIDC000288
;
FIDC000288
► Intrusion detection is the essential part of network security in combating against illegal network access or malicious cyberattacks. Due to the constantly evolving nature…
(more)
▼ Intrusion detection is the essential part of network security in combating against illegal network access or malicious cyberattacks. Due to the constantly evolving nature of cyber attacks, it has been a technical challenge for an intrusion detection system (IDS) to effectively recognize unknown attacks or known attacks with inadequate training data. Therefore in this dissertation work, an innovative two-stage classifier is developed for accurately and efficiently detecting both unknown attacks and known attacks with insufficient or inaccurate training information.
The novel two-stage fuzzy classification scheme is based on advanced machine learning techniques specifically for handling the ambiguity of traffic connections and network data. In the first stage of the classification, a fuzzy C-means (FCM) algorithm is employed to softly compute and optimize clustering centers of the training datasets with some degree of fuzziness counting for feature inaccuracy and ambiguity in the training data. Subsequently, a distance-weighted k-NN (k-nearest neighbors) classifier, combined with the Dempster-Shafer Theory (DST), is introduced to assess the belief functions and pignistic probabilities of the incoming data associated with each of known classes to further address the data uncertainty issue in the cyberattack data. In the second stage of the proposed classification algorithm, a subsequent classification scheme is implemented based on the obtained pignistic probabilities and their entropy functions to determine if the input data are normal, one of the known attacks or an unknown attack. Secondly, to strengthen the robustness to attacks, we form the three-layer hierarchy ensemble classifier based on the FCM weighted k-NN DST classifier to have more precise inferences than those made by a single classifier. The proposed intrusion detection algorithm is evaluated through the application of the KDD’99 datasets and their variants containing known and unknown attacks. The experimental results show that the new two-stage fuzzy KNN-DST classifier outperforms other well-known classifiers in intrusion detection and is especially effective in detecting unknown attacks.
Advisors/Committee Members: Hai Deng, Frank Urban, Jean Andrian, Deng Pan.
Subjects/Keywords: intrusion detection; classification; fuzzy; Dempster-shafer theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jing, X. (2016). Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2436 ; 10.25148/etd.FIDC000288 ; FIDC000288
Chicago Manual of Style (16th Edition):
Jing, Xueyan. “Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection.” 2016. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2436 ; 10.25148/etd.FIDC000288 ; FIDC000288.
MLA Handbook (7th Edition):
Jing, Xueyan. “Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection.” 2016. Web. 19 Jan 2021.
Vancouver:
Jing X. Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection. [Internet] [Doctoral dissertation]. Florida International University; 2016. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2436 ; 10.25148/etd.FIDC000288 ; FIDC000288.
Council of Science Editors:
Jing X. Innovative Two-Stage Fuzzy Classification for Unknown Intrusion Detection. [Doctoral Dissertation]. Florida International University; 2016. Available from: https://digitalcommons.fiu.edu/etd/2436 ; 10.25148/etd.FIDC000288 ; FIDC000288
Florida International University
4.
Kaleem, Faisal.
VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network.
Degree: PhD, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/602
;
10.25148/etd.FI12050206
;
FI12050206
► Global connectivity, for anyone, at anyplace, at anytime, to provide high-speed, high-quality, and reliable communication channels for mobile devices, is now becoming a reality.…
(more)
▼ Global connectivity, for anyone, at anyplace, at anytime, to provide high-speed, high-quality, and reliable communication channels for mobile devices, is now becoming a reality. The credit mainly goes to the recent technological advances in wireless communications comprised of a wide range of technologies, services, and applications to fulfill the particular needs of end-users in different deployment scenarios (Wi-Fi, WiMAX, and 3G/4G cellular systems). In such a heterogeneous wireless environment, one of the key ingredients to provide efficient ubiquitous computing with guaranteed quality and continuity of service is the design of intelligent handoff algorithms.
Traditional single-metric handoff decision algorithms, such as Received Signal Strength (RSS) based, are not efficient and intelligent enough to minimize the number of unnecessary handoffs, decision delays, and call-dropping and/or blocking probabilities.
This research presented a novel approach for the design and implementation of a multi-criteria vertical handoff algorithm for heterogeneous wireless networks. Several parallel Fuzzy Logic Controllers were utilized in combination with different types of ranking algorithms and metric weighting schemes to implement two major modules: the first module estimated the necessity of handoff, and the other module was developed to select the best network as the target of handoff.
Simulations based on different traffic classes, utilizing various types of wireless networks were carried out by implementing a wireless test-bed inspired by the concept of Rudimentary Network Emulator (RUNE).
Simulation results indicated that the proposed scheme provided better performance in terms of minimizing the unnecessary handoffs, call dropping, and call blocking and handoff blocking probabilities. When subjected to Conversational traffic and compared against the RSS-based reference algorithm, the proposed scheme, utilizing the FTOPSIS ranking algorithm, was able to reduce the average outage probability of MSs moving with high speeds by 17%, new call blocking probability by 22%, the handoff blocking probability by 16%, and the average handoff rate by 40%. The significant reduction in the resulted handoff rate provides MS with efficient power consumption, and more available battery life. These percentages indicated a higher probability of guaranteed session continuity and quality of the currently utilized service, resulting in higher user satisfaction levels.
Advisors/Committee Members: Kang K. Yen, Abolfazl Mehbodniya, Kaushik Dutta, Deng Pan, Hai Deng.
Subjects/Keywords: Heterogeneous Wireless Networks; Fuzzy Logic; Multi-Attribute Decision Making; Handoff
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kaleem, F. (2012). VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/602 ; 10.25148/etd.FI12050206 ; FI12050206
Chicago Manual of Style (16th Edition):
Kaleem, Faisal. “VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/602 ; 10.25148/etd.FI12050206 ; FI12050206.
MLA Handbook (7th Edition):
Kaleem, Faisal. “VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network.” 2012. Web. 19 Jan 2021.
Vancouver:
Kaleem F. VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/602 ; 10.25148/etd.FI12050206 ; FI12050206.
Council of Science Editors:
Kaleem F. VHITS: Vertical Handoff Initiation and Target Selection in a Heterogeneous Wireless Network. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/602 ; 10.25148/etd.FI12050206 ; FI12050206
Florida International University
5.
Du, Yu.
Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/630
;
10.25148/etd.FI12050236
;
FI12050236
► This dissertation introduces three novel multiuser detection approaches in Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems by blind signal separation…
(more)
▼ This dissertation introduces three novel multiuser detection approaches in Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems by blind signal separation (BSS) techniques. The conventional methodologies for multiuser detection have to retransmit channel state information (CSI) constantly from the transmitter in MIMO ODFM systems at the cost of economic efficiency, because they require more channel resources to improve the communication quality. Compared with the traditional methodologies, the proposed BSS methods are relatively efficient approaches without the unnecessary retransmission of channel state information.
The current methodologies apply the space-time coding or the spatial multiplexing to implement an MIMO OFDM system, which requires relatively complex antenna design and allocation in the transmitter. The proposed Spatial Division Multiple Access (SDMA) method enables different mobile users to share the same bandwidth simultaneously in different geographical locations, and this scheme requires only one antenna for each mobile user. Therefore, it greatly simplifies the antenna design and allocation.
The goal of this dissertation is to design and implement three blind multiuser detection schemes without knowing the channel state information or the channel transfer function in the SDMA-based uplink MIMO OFDM system. The proposed scenarios include: (a) the BSS-only scheme, (b) the BSS-Minimum Mean Square Error (MMSE) scheme, and (c) the BSS-Minimum Bit Error Ratio (MBER) scheme.
The major contributions of the dissertation include: (a) the three proposed schemes save the commercially expensive cost of channel resources; (b) the proposed SDMA-based uplink MIMO OFDM system simplifies the requirements of antennas for mobile users; (c) the three proposed schemes obtain high parallel computing efficiency through paralleled subcarriers; (d) the proposed BSS-MBER scheme gains the best BER performance; (e) the proposed BSS-MMSE method yields the best computational efficiency; and (f) the proposed BSS-only scenario balances the BER performance and computational complexity.
Advisors/Committee Members: Kang K. Yen, Jean H. Andrian, Deng Pan, Yimin Zhu.
Subjects/Keywords: Multiuser Detection; Multiple Input Multiple Output; Orthogonal Frequency Division Multiplexing; Blind Signal Separation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Du, Y. (2012). Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/630 ; 10.25148/etd.FI12050236 ; FI12050236
Chicago Manual of Style (16th Edition):
Du, Yu. “Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/630 ; 10.25148/etd.FI12050236 ; FI12050236.
MLA Handbook (7th Edition):
Du, Yu. “Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques.” 2012. Web. 19 Jan 2021.
Vancouver:
Du Y. Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/630 ; 10.25148/etd.FI12050236 ; FI12050236.
Council of Science Editors:
Du Y. Multiuser Detection in Multiple Input Multiple Output Orthogonal Frequency Division Multiplexing Systems by Blind Signal Separation Techniques. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/630 ; 10.25148/etd.FI12050236 ; FI12050236
Florida International University
6.
Wu, Nansong.
Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/637
;
10.25148/etd.FI12050248
;
FI12050248
► The number of wireless systems, services, and users are constantly increasing and therefore the bandwidth requirements have become higher. One of the most robust…
(more)
▼ The number of wireless systems, services, and users are constantly increasing and therefore the bandwidth requirements have become higher. One of the most robust modulations is Orthogonal Frequency-Division Multiplexing (OFDM). It has been considered as an attractive solution for future broadband wireless communications.
This dissertation investigates bit and power allocation, joint resource allocation, user scheduling, and limited feedback problem in multi-user OFDM systems. The following dissertation contributes to improved OFDM systems in the following manner. (1) A low complexity sub-carrier, power, and bit allocation algorithm is proposed. This algorithm has lower computational complexity and results in performance that is comparable to that of the existing algorithms. (2) Variations of the proportional fair scheduling scheme are proposed and analyzed. The proposed scheme improves system throughput and delay time, and achieves higher throughput without sacrificing fairness which makes it a better scheme in terms of efficiency and fairness. (3) A DCT feedback compression algorithm based on sorting is proposed. This algorithm uses sorting to increase the correlation between feedback channel quality information of frequency selective channels. The feedback overhead of system is successfully reduced.
Advisors/Committee Members: Kang K. Yen, Jean H. Andrian, Deng Pan, Yimin Zhu.
Subjects/Keywords: MIMO; OFDM; Resource; Scheduling; Feedback
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, N. (2012). Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/637 ; 10.25148/etd.FI12050248 ; FI12050248
Chicago Manual of Style (16th Edition):
Wu, Nansong. “Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/637 ; 10.25148/etd.FI12050248 ; FI12050248.
MLA Handbook (7th Edition):
Wu, Nansong. “Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems.” 2012. Web. 19 Jan 2021.
Vancouver:
Wu N. Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/637 ; 10.25148/etd.FI12050248 ; FI12050248.
Council of Science Editors:
Wu N. Resource Allocation, Scheduling and Feedback Reduction in Multiple Input Multiple Output (MIMO) Orthogonal Frequency-Division Multiplexing (OFDM) Systems. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/637 ; 10.25148/etd.FI12050248 ; FI12050248
Florida International University
7.
Ahmed, Kishwar.
Energy Demand Response for High-Performance Computing Systems.
Degree: PhD, Computer Science, 2018, Florida International University
URL: https://digitalcommons.fiu.edu/etd/3569
;
10.25148/etd.FIDC006527
;
FIDC006527
► The growing computational demand of scientific applications has greatly motivated the development of large-scale high-performance computing (HPC) systems in the past decade. To accommodate…
(more)
▼ The growing computational demand of scientific applications has greatly motivated the development of large-scale high-performance computing (HPC) systems in the past decade. To accommodate the increasing demand of applications, HPC systems have been going through dramatic architectural changes (e.g., introduction of many-core and multi-core systems, rapid growth of complex interconnection network for efficient communication between thousands of nodes), as well as significant increase in size (e.g., modern supercomputers consist of hundreds of thousands of nodes). With such changes in architecture and size, the energy consumption by these systems has increased significantly. With the advent of exascale supercomputers in the next few years, power consumption of the HPC systems will surely increase; some systems may even consume hundreds of megawatts of electricity. Demand response programs are designed to help the energy service providers to stabilize the power system by reducing the energy consumption of participating systems during the time periods of high demand power usage or temporary shortage in power supply.
This dissertation focuses on developing energy-efficient demand-response models and algorithms to enable HPC system's demand response participation. In the first part, we present interconnection network models for performance prediction of large-scale HPC applications. They are based on interconnected topologies widely used in HPC systems: dragonfly, torus, and fat-tree. Our interconnect models are fully integrated with an implementation of message-passing interface (MPI) that can mimic most of its functions with packet-level accuracy. Extensive experiments show that our integrated models provide good accuracy for predicting the network behavior, while at the same time allowing for good parallel scaling performance. In the second part, we present an energy-efficient demand-response model to reduce HPC systems' energy consumption during demand response periods. We propose HPC job scheduling and resource provisioning schemes to enable HPC system's emergency demand response participation. In the final part, we propose an economic demand-response model to allow both HPC operator and HPC users to jointly reduce HPC system's energy cost. Our proposed model allows the participation of HPC systems in economic demand-response programs through a contract-based rewarding scheme that can incentivize HPC users to participate in demand response.
Advisors/Committee Members: Jason Liu, S. S. Iyengar, Deng Pan, Leonardo Bobadilla, Wujie Wen.
Subjects/Keywords: High-Performance Computing; Interconnection Network; Performance Prediction; Demand Response; Resource Management; Energy Efficiency; Contracts; Digital Communications and Networking; Power and Energy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ahmed, K. (2018). Energy Demand Response for High-Performance Computing Systems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3569 ; 10.25148/etd.FIDC006527 ; FIDC006527
Chicago Manual of Style (16th Edition):
Ahmed, Kishwar. “Energy Demand Response for High-Performance Computing Systems.” 2018. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/3569 ; 10.25148/etd.FIDC006527 ; FIDC006527.
MLA Handbook (7th Edition):
Ahmed, Kishwar. “Energy Demand Response for High-Performance Computing Systems.” 2018. Web. 19 Jan 2021.
Vancouver:
Ahmed K. Energy Demand Response for High-Performance Computing Systems. [Internet] [Doctoral dissertation]. Florida International University; 2018. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/3569 ; 10.25148/etd.FIDC006527 ; FIDC006527.
Council of Science Editors:
Ahmed K. Energy Demand Response for High-Performance Computing Systems. [Doctoral Dissertation]. Florida International University; 2018. Available from: https://digitalcommons.fiu.edu/etd/3569 ; 10.25148/etd.FIDC006527 ; FIDC006527
Florida International University
8.
Geng, Zhe.
Radar Signal Processing for Interference Mitigation.
Degree: PhD, Electrical Engineering, 2018, Florida International University
URL: https://digitalcommons.fiu.edu/etd/3571
;
10.25148/etd.FIDC006569
;
FIDC006569
► It is necessary for radars to suppress interferences to near the noise level to achieve the best performance in target detection and measurements. In…
(more)
▼ It is necessary for radars to suppress interferences to near the noise level to achieve the best performance in target detection and measurements. In this dissertation work, innovative signal processing approaches are proposed to effectively mitigate two of the most common types of interferences: jammers and clutter. Two types of radar systems are considered for developing new signal processing algorithms: phased-array radar and multiple-input multiple-output (MIMO) radar. For phased-array radar, an innovative target-clutter feature-based recognition approach termed as Beam-Doppler Image Feature Recognition (BDIFR) is proposed to detect moving targets in inhomogeneous clutter. Moreover, a new ground moving target detection algorithm is proposed for airborne radar. The essence of this algorithm is to compensate for the ground clutter Doppler shift caused by the moving platform and then to cancel the Doppler-compensated clutter using MTI filters that are commonly used in ground-based radar systems. Without the need of clutter estimation, the new algorithms outperform the conventional Space-Time Adaptive Processing (STAP) algorithm in ground moving target detection in inhomogeneous clutter.
For MIMO radar, a time-efficient reduced-dimensional clutter suppression algorithm termed as Reduced-dimension Space-time Adaptive Processing (RSTAP) is proposed to minimize the number of the training samples required for clutter estimation. To deal with highly heterogeneous clutter more effectively, we also proposed a robust deterministic STAP algorithm operating on snapshot-to-snapshot basis. For cancelling jammers in the radar mainlobe direction, an innovative jamming elimination approach is proposed based on coherent MIMO radar adaptive beamforming. When combined with mutual information (MI) based cognitive radar transmit waveform design, this new approach can be used to enable spectrum sharing effectively between radar and wireless communication systems.
The proposed interference mitigation approaches are validated by carrying out simulations for typical radar operation scenarios. The advantages of the proposed interference mitigation methods over the existing signal processing techniques are demonstrated both analytically and empirically.
Advisors/Committee Members: Hai Deng, Malek Adjouadi, Jean Andrian, Ismail Guvenc, Deng Pan.
Subjects/Keywords: Radar; signal processing; interference mitigation; Signal Processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Geng, Z. (2018). Radar Signal Processing for Interference Mitigation. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3571 ; 10.25148/etd.FIDC006569 ; FIDC006569
Chicago Manual of Style (16th Edition):
Geng, Zhe. “Radar Signal Processing for Interference Mitigation.” 2018. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/3571 ; 10.25148/etd.FIDC006569 ; FIDC006569.
MLA Handbook (7th Edition):
Geng, Zhe. “Radar Signal Processing for Interference Mitigation.” 2018. Web. 19 Jan 2021.
Vancouver:
Geng Z. Radar Signal Processing for Interference Mitigation. [Internet] [Doctoral dissertation]. Florida International University; 2018. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/3571 ; 10.25148/etd.FIDC006569 ; FIDC006569.
Council of Science Editors:
Geng Z. Radar Signal Processing for Interference Mitigation. [Doctoral Dissertation]. Florida International University; 2018. Available from: https://digitalcommons.fiu.edu/etd/3571 ; 10.25148/etd.FIDC006569 ; FIDC006569
Florida International University
9.
Chaparro-Baquero, Gustavo A.
Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems.
Degree: PhD, Electrical Engineering, 2018, Florida International University
URL: https://digitalcommons.fiu.edu/etd/3712
;
10.25148/etd.FIDC004092
;
FIDC004092
► As a major component of a computing system, memory has been a key performance and power consumption bottleneck in computer system design. While processor…
(more)
▼ As a major component of a computing system, memory has been a key performance and power consumption bottleneck in computer system design. While processor speeds have been kept rising dramatically, the overall computing performance improvement of the entire system is limited by how fast the memory can feed instructions/data to processing units (i.e. so-called
memory wall problem). The increasing transistor density and surging access demands from a rapidly growing number of processing cores also significantly elevated the power consumption of the memory system. In addition, the interference of memory access from different applications and processing cores significantly degrade the computation predictability, which is essential to ensure timing specifications in real-time system design. The recent IC technologies (such as 3D-IC technology) and emerging data-intensive real-time applications (such as Virtual Reality/Augmented Reality, Artificial Intelligence, Internet of Things) further amplify these challenges. We believe that it is not simply desirable but necessary to adopt a joint CPU/Memory resource management framework to deal with these grave challenges.
In this dissertation, we focus on studying how to schedule fixed-priority hard real-time tasks with memory impacts taken into considerations. We target on the fixed-priority real-time scheduling scheme since this is one of the most commonly used strategies for practical real-time applications. Specifically, we first develop an approach that takes into consideration not only the execution time variations with cache allocations but also the task period relationship, showing a significant improvement in the feasibility of the system. We further study the problem of how to guarantee timing constraints for hard real-time systems under CPU and memory thermal constraints. We first study the problem under an architecture model with a single core and its main memory individually packaged. We develop a thermal model that can capture the thermal interaction between the processor and memory, and incorporate the
periodic resource sever model into our scheduling framework to guarantee both the timing and thermal constraints. We further extend our research to the multi-core architectures with processing cores and memory devices integrated into a single 3D platform. To our best knowledge, this is the first research that can guarantee hard deadline constraints for real-time tasks under temperature constraints for both processing cores and memory devices. Extensive simulation results demonstrate that our proposed scheduling can improve significantly the feasibility of hard real-time systems under thermal constraints.
Advisors/Committee Members: Gang Quan, Jean Andrian, Nezih Pala, Deng Pan, Wujie Wen.
Subjects/Keywords: electrical engineering; Computer and Systems Architecture; Computer Engineering; Electrical and Computer Engineering; Engineering; Hardware Systems; VLSI and Circuits, Embedded and Hardware Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chaparro-Baquero, G. A. (2018). Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3712 ; 10.25148/etd.FIDC004092 ; FIDC004092
Chicago Manual of Style (16th Edition):
Chaparro-Baquero, Gustavo A. “Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems.” 2018. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/3712 ; 10.25148/etd.FIDC004092 ; FIDC004092.
MLA Handbook (7th Edition):
Chaparro-Baquero, Gustavo A. “Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems.” 2018. Web. 19 Jan 2021.
Vancouver:
Chaparro-Baquero GA. Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems. [Internet] [Doctoral dissertation]. Florida International University; 2018. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/3712 ; 10.25148/etd.FIDC004092 ; FIDC004092.
Council of Science Editors:
Chaparro-Baquero GA. Memory-Aware Scheduling for Fixed Priority Hard Real-Time Computing Systems. [Doctoral Dissertation]. Florida International University; 2018. Available from: https://digitalcommons.fiu.edu/etd/3712 ; 10.25148/etd.FIDC004092 ; FIDC004092
Florida International University
10.
Nguyen, Hien M.
Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning.
Degree: PhD, Computer Science, 2015, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2297
;
10.25148/etd.FIDC000194
;
FIDC000194
► Learning at any-time, at anywhere, using any mobile computing platform learning (which we refer to as “education in your palm”) empowers informal and formal…
(more)
▼ Learning at any-time, at anywhere, using any mobile computing platform learning (which we refer to as “education in your palm”) empowers informal and formal education. It supports the continued creation of knowledge outside a classroom, after-school programs, community-based organizations, museums, libraries, and shopping malls with under-resourced settings. In doing so, it fosters the continued creation of a cumulative body of knowledge in informal and formal education. Anytime, anywhere, using any device computing platform learning means that students are not required to attend traditional classroom settings in order to learn. Instead, students will be able to access and share learning resources from any mobile computing platform, such as smart phones, tablets using highly dynamic mobile and wireless ad-hoc networks. There has been little research on how to facilitate the integrated use of the service description, discovery and integration resources available in mobile and wireless ad-hoc networks including description schemas and mobile learning objects, and in particular as it relates to the consistency, availability, security and privacy of spatio-temporal and trajectory information. Another challenge is finding, combining and creating suitable learning modules to handle the inherent constraints of mobile learning, resource-poor mobile devices and ad-hoc networks.
The aim of this research is to design, develop and implement the cutting edge context-aware and ubiquitous self-directed learning methodologies using ad-hoc and sensor networks. The emphasis of our work is on defining an appropriate mobile learning object and the service adaptation descriptions as well as providing mechanisms for ad-hoc service discovery and developing concepts for the seamless integration of the learning objects and their contents with a particular focus on preserving data and privacy. The research involves a combination of modeling, designing, and developing a mobile learning system in the absence of a networking infrastructure that integrates sensory data to support ubiquitous learning. The system includes mechanisms to allow content exchange among the mobile ad-hoc nodes to ensure consistency and availability of information. It also provides an on-the-fly content service discovery, query request, and retrieving data from mobile nodes and sensors.
Advisors/Committee Members: Niki Pissinou, S.S. Iyengar, Kia Makki, Deng Pan, Naphtali Rishe.
Subjects/Keywords: Computer sciences; Computer Sciences
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nguyen, H. M. (2015). Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2297 ; 10.25148/etd.FIDC000194 ; FIDC000194
Chicago Manual of Style (16th Edition):
Nguyen, Hien M. “Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning.” 2015. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2297 ; 10.25148/etd.FIDC000194 ; FIDC000194.
MLA Handbook (7th Edition):
Nguyen, Hien M. “Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning.” 2015. Web. 19 Jan 2021.
Vancouver:
Nguyen HM. Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning. [Internet] [Doctoral dissertation]. Florida International University; 2015. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2297 ; 10.25148/etd.FIDC000194 ; FIDC000194.
Council of Science Editors:
Nguyen HM. Modeling, Designing, and Implementing an Ad-hoc M-Learning Platform that Integrates Sensory Data to Support Ubiquitous Learning. [Doctoral Dissertation]. Florida International University; 2015. Available from: https://digitalcommons.fiu.edu/etd/2297 ; 10.25148/etd.FIDC000194 ; FIDC000194
Florida International University
11.
Xu, Yiqi.
Storage Management of Data-intensive Computing Systems.
Degree: PhD, Computer Science, 2016, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2474
;
10.25148/etd.FIDC000251
;
FIDC000251
► Computing systems are becoming increasingly data-intensive because of the explosion of data and the needs for processing the data, and storage management is critical…
(more)
▼ Computing systems are becoming increasingly data-intensive because of the explosion of data and the needs for processing the data, and storage management is critical to application performance in such data-intensive computing systems. However, existing resource management frameworks in these systems lack the support for storage management, which causes unpredictable performance degradations when applications are under I/O contention. Storage management of data-intensive systems is a challenging problem because I/O resources cannot be easily partitioned and distributed storage systems require scalable management. This dissertation presents the solutions to address these challenges for typical data-intensive systems including high-performance computing (HPC) systems and big-data systems.
For HPC systems, the dissertation presents vPFS, a performance virtualization layer for parallel file system (PFS) based storage systems. It employs user-level PFS proxies to interpose and schedule parallel I/Os on a per-application basis. Based on this framework, it enables SFQ(D)+, a new proportional-share scheduling algorithm which allows diverse applications with good performance isolation and resource utilization. To manage an HPC system’s total I/O service, it also provides two complementary synchronization schemes to coordinate the scheduling of large numbers of storage nodes in a scalable manner.
For big-data systems, the dissertation presents IBIS, an interposition-based big-data I/O scheduler. By interposing the different I/O phases of big-data applications, it schedules the I/Os transparently to the applications. It enables a new proportional-share scheduling algorithm, SFQ(D2), to address the dynamics of the underlying storage by adaptively adjusting the I/O concurrency. Moreover, it employs a scalable broker to coordinate the distributed I/O schedulers and provide proportional sharing of a big-data system’s total I/O service.
Experimental evaluations show that these solutions have low-overhead and provide strong I/O performance isolation. For example, vPFS’ overhead is less than 3% in through- put and it delivers proportional sharing within 96% of the target for diverse workloads; and IBIS provides up to 99% better performance isolation for WordCount and 30% better proportional slowdown for TeraSort and TeraGen than native YARN.
Advisors/Committee Members: Ming Zhao, Raju Rangaswami, Jason Liu, Gang Quan, Deng Pan.
Subjects/Keywords: Big data; Storage management; I/O scheduler; Performance; Computer and Systems Architecture; Data Storage Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Xu, Y. (2016). Storage Management of Data-intensive Computing Systems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2474 ; 10.25148/etd.FIDC000251 ; FIDC000251
Chicago Manual of Style (16th Edition):
Xu, Yiqi. “Storage Management of Data-intensive Computing Systems.” 2016. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2474 ; 10.25148/etd.FIDC000251 ; FIDC000251.
MLA Handbook (7th Edition):
Xu, Yiqi. “Storage Management of Data-intensive Computing Systems.” 2016. Web. 19 Jan 2021.
Vancouver:
Xu Y. Storage Management of Data-intensive Computing Systems. [Internet] [Doctoral dissertation]. Florida International University; 2016. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2474 ; 10.25148/etd.FIDC000251 ; FIDC000251.
Council of Science Editors:
Xu Y. Storage Management of Data-intensive Computing Systems. [Doctoral Dissertation]. Florida International University; 2016. Available from: https://digitalcommons.fiu.edu/etd/2474 ; 10.25148/etd.FIDC000251 ; FIDC000251
Florida International University
12.
Chen, Kai.
Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks.
Degree: Electrical Engineering, 2011, Florida International University
URL: https://digitalcommons.fiu.edu/etd/412
;
10.25148/etd.FI11050606
;
FI11050606
► An iterative travel time forecasting scheme, named the Advanced Multilane Prediction based Real-time Fastest Path (AMPRFP) algorithm, is presented in this dissertation. This scheme…
(more)
▼ An iterative travel time forecasting scheme, named the Advanced Multilane Prediction based Real-time Fastest Path (AMPRFP) algorithm, is presented in this dissertation. This scheme is derived from the conventional kernel estimator based prediction model by the association of real-time nonlinear impacts that caused by neighboring arcs’ traffic patterns with the historical traffic behaviors. The AMPRFP algorithm is evaluated by prediction of the travel time of congested arcs in the urban area of Jacksonville City. Experiment results illustrate that the proposed scheme is able to significantly reduce both the relative mean error (RME) and the root-mean-squared error (RMSE) of the predicted travel time. To obtain high quality real-time traffic information, which is essential to the performance of the AMPRFP algorithm, a data clean scheme enhanced empirical learning (DCSEEL) algorithm is also introduced. This novel method investigates the correlation between distance and direction in the geometrical map, which is not considered in existing fingerprint localization methods. Specifically, empirical learning methods are applied to minimize the error that exists in the estimated distance. A direction filter is developed to clean joints that have negative influence to the localization accuracy. Synthetic experiments in urban, suburban and rural environments are designed to evaluate the performance of DCSEEL algorithm in determining the cellular probe’s position. The results show that the cellular probe’s localization accuracy can be notably improved by the DCSEEL algorithm. Additionally, a new fast correlation technique for overcoming the time efficiency problem of the existing correlation algorithm based floating car data (FCD) technique is developed. The matching process is transformed into a 1-dimensional (1-D) curve matching problem and the Fast Normalized Cross-Correlation (FNCC) algorithm is introduced to supersede the Pearson product Moment Correlation Co-efficient (PMCC) algorithm in order to achieve the real-time requirement of the FCD method. The fast correlation technique shows a significant improvement in reducing the computational cost without affecting the accuracy of the matching process.
Advisors/Committee Members: Niki Pissinou, Kia Makki, Stavros V. Georgakopoulos, Deng Pan, Yi-Min Zhu.
Subjects/Keywords: Cellular network location estimation; fingerprint method; real-time information aggregation; machine learning; travel time prediction and forecasting; floating car data; congestion mitigation; real-time routing; empirical learning; 1-D curve matching; fast normalized cross-correlation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, K. (2011). Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks. (Thesis). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/412 ; 10.25148/etd.FI11050606 ; FI11050606
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chen, Kai. “Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks.” 2011. Thesis, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/412 ; 10.25148/etd.FI11050606 ; FI11050606.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Kai. “Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks.” 2011. Web. 19 Jan 2021.
Vancouver:
Chen K. Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks. [Internet] [Thesis]. Florida International University; 2011. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/412 ; 10.25148/etd.FI11050606 ; FI11050606.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chen K. Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks. [Thesis]. Florida International University; 2011. Available from: https://digitalcommons.fiu.edu/etd/412 ; 10.25148/etd.FI11050606 ; FI11050606
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Florida International University
13.
Liu, Guanglei.
Practical Dynamic Thermal Management on Intel Desktop Computer.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/688
;
10.25148/etd.FI12080613
;
FI12080613
► Fueled by increasing human appetite for high computing performance, semiconductor technology has now marched into the deep sub-micron era. As transistor size keeps shrinking,…
(more)
▼ Fueled by increasing human appetite for high computing performance, semiconductor technology has now marched into the deep sub-micron era. As transistor size keeps shrinking, more and more transistors are integrated into a single chip. This has increased tremendously the power consumption and heat generation of IC chips. The rapidly growing heat dissipation greatly increases the packaging/cooling costs, and adversely affects the performance and reliability of a computing system. In addition, it also reduces the processor's life span and may even crash the entire computing system. Therefore, dynamic thermal management (DTM) is becoming a critical problem in modern computer system design.
Extensive theoretical research has been conducted to study the DTM problem. However, most of them are based on theoretically idealized assumptions or simplified models. While these models and assumptions help to greatly simplify a complex problem and make it theoretically manageable, practical computer systems and applications must deal with many practical factors and details beyond these models or assumptions.
The goal of our research was to develop a test platform that can be used to validate theoretical results on DTM under well-controlled conditions, to identify the limitations of existing theoretical results, and also to develop new and practical DTM techniques. This dissertation details the background and our research efforts in this endeavor. Specifically, in our research, we first developed a customized test platform based on an Intel desktop. We then tested a number of related theoretical works and examined their limitations under the practical hardware environment. With these limitations in mind, we developed a new reactive thermal management algorithm for single-core computing systems to optimize the throughput under a peak temperature constraint. We further extended our research to a multicore platform and developed an effective proactive DTM technique for throughput maximization on multicore processor based on task migration and dynamic voltage frequency scaling technique. The significance of our research lies in the fact that our research complements the current extensive theoretical research in dealing with increasingly critical thermal problems and enabling the continuous evolution of high performance computing systems.
Advisors/Committee Members: Gang Quan, Nezih Pala, Deng Pan, Jean H. Andrian, Kang K. Yen.
Subjects/Keywords: Dynamic thermal management; thermal-aware scheduling; throughput maximization; practical hardware platform; temperature
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, G. (2012). Practical Dynamic Thermal Management on Intel Desktop Computer. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/688 ; 10.25148/etd.FI12080613 ; FI12080613
Chicago Manual of Style (16th Edition):
Liu, Guanglei. “Practical Dynamic Thermal Management on Intel Desktop Computer.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/688 ; 10.25148/etd.FI12080613 ; FI12080613.
MLA Handbook (7th Edition):
Liu, Guanglei. “Practical Dynamic Thermal Management on Intel Desktop Computer.” 2012. Web. 19 Jan 2021.
Vancouver:
Liu G. Practical Dynamic Thermal Management on Intel Desktop Computer. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/688 ; 10.25148/etd.FI12080613 ; FI12080613.
Council of Science Editors:
Liu G. Practical Dynamic Thermal Management on Intel Desktop Computer. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/688 ; 10.25148/etd.FI12080613 ; FI12080613
14.
Iyer, Vasanth.
Ensemble Stream Model for Data-Cleaning in Sensor Networks.
Degree: PhD, Computer Science, 2013, Florida International University
URL: https://digitalcommons.fiu.edu/etd/973
;
10.25148/etd.FI13120409
;
FI13120409
► Ensemble Stream Modeling and Data-cleaning are sensor information processing systems have different training and testing methods by which their goals are cross-validated. This research…
(more)
▼ Ensemble Stream Modeling and Data-cleaning are sensor information processing systems have different training and testing methods by which their goals are cross-validated. This research examines a mechanism, which seeks to extract novel patterns by generating ensembles from data. The main goal of label-less stream processing is to process the sensed events to eliminate the noises that are uncorrelated, and choose the most likely model without over fitting thus obtaining higher model confidence. Higher quality streams can be realized by combining many short streams into an ensemble which has the desired quality. The framework for the investigation is an existing data mining tool.
First, to accommodate feature extraction such as a bush or natural forest-fire event we make an assumption of the burnt area (BA*), sensed ground truth as our target variable obtained from logs. Even though this is an obvious model choice the results are disappointing. The reasons for this are two: One, the histogram of fire activity is highly skewed. Two, the measured sensor parameters are highly correlated. Since using non descriptive features does not yield good results, we resort to temporal features. By doing so we carefully eliminate the averaging effects; the resulting histogram is more satisfactory and conceptual knowledge is learned from sensor streams.
Second is the process of feature induction by cross-validating attributes with single or multi-target variables to minimize training error. We use F-measure score, which combines precision and accuracy to determine the false alarm rate of fire events. The multi-target data-cleaning trees use information purity of the target leaf-nodes to learn higher order features. A sensitive variance measure such as f-test is performed during each node’s split to select the best attribute. Ensemble stream model approach proved to improve when using complicated features with a simpler tree classifier.
The ensemble framework for data-cleaning and the enhancements to quantify quality of fitness (30% spatial, 10% temporal, and 90% mobility reduction) of sensor led to the formation of streams for sensor-enabled applications. Which further motivates the novelty of stream quality labeling and its importance in solving vast amounts of real-time mobile streams generated today.
Advisors/Committee Members: S. Sitharama Iyengar, Niki Pissinou, Deng Pan, Shaolei Ren, Shu-Ching Chen.
Subjects/Keywords: Sensor Networks; Mobile Sensor Networks; Data-cleaning; Machine Learning; Data Mining; Routing; Power-aware routing; Netcoding; Data Aggregation; Quality of Data; Quality of Service; Feature Extraction; Randomforest; Bagging; Classifiers; Renewable Energy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Iyer, V. (2013). Ensemble Stream Model for Data-Cleaning in Sensor Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/973 ; 10.25148/etd.FI13120409 ; FI13120409
Chicago Manual of Style (16th Edition):
Iyer, Vasanth. “Ensemble Stream Model for Data-Cleaning in Sensor Networks.” 2013. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/973 ; 10.25148/etd.FI13120409 ; FI13120409.
MLA Handbook (7th Edition):
Iyer, Vasanth. “Ensemble Stream Model for Data-Cleaning in Sensor Networks.” 2013. Web. 19 Jan 2021.
Vancouver:
Iyer V. Ensemble Stream Model for Data-Cleaning in Sensor Networks. [Internet] [Doctoral dissertation]. Florida International University; 2013. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/973 ; 10.25148/etd.FI13120409 ; FI13120409.
Council of Science Editors:
Iyer V. Ensemble Stream Model for Data-Cleaning in Sensor Networks. [Doctoral Dissertation]. Florida International University; 2013. Available from: https://digitalcommons.fiu.edu/etd/973 ; 10.25148/etd.FI13120409 ; FI13120409
Florida International University
15.
Han, Qiushi.
Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems.
Degree: PhD, Electrical Engineering, 2015, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2222
;
10.25148/etd.FIDC000077
;
FIDC000077
► Over the past several decades, we have experienced tremendous growth of real-time systems in both scale and complexity. This progress is made possible largely…
(more)
▼ Over the past several decades, we have experienced tremendous growth of real-time systems in both scale and complexity. This progress is made possible largely due to advancements in semiconductor technology that have enabled the continuous scaling and massive integration of transistors on a single chip. In the meantime, however, the relentless transistor scaling and integration have dramatically increased the power consumption and degraded the system reliability substantially. Traditional real-time scheduling techniques with the sole emphasis on guaranteeing timing constraints have become insufficient.
In this research, we studied the problem of how to develop advanced scheduling methods on hard real-time systems that are subject to multiple design constraints, in particular, timing, energy consumption, and reliability constraints. To this end, we first investigated the energy minimization problem with fault-tolerance requirements for dynamic-priority based hard real-time tasks on a single-core processor. Three scheduling algorithms have been developed to judiciously make tradeoffs between fault tolerance and energy reduction since both design objectives usually conflict with each other. We then shifted our research focus from single-core platforms to multi-core platforms as the latter are becoming mainstream. Specifically, we launched our research in fault-tolerant multi-core scheduling for fixed-priority tasks as fixed-priority scheduling is one of the most commonly used schemes in the industry today. For such systems, we developed several checkpointing-based partitioning strategies with the joint consideration of fault tolerance and energy minimization. At last, we exploited the implicit relations between real-time tasks in order to judiciously make partitioning decisions with the aim of improving system schedulability.
According to the simulation results, our design strategies have been shown to be very promising for emerging systems and applications where timeliness, fault-tolerance, and energy reduction need to be simultaneously addressed.
Advisors/Committee Members: Gang Quan, Kang K. Yen, Jean H. Andrian, Nezih Pala, Deng Pan.
Subjects/Keywords: real-time; fault-tolerant; energy minimization; Electrical and Computer Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Han, Q. (2015). Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2222 ; 10.25148/etd.FIDC000077 ; FIDC000077
Chicago Manual of Style (16th Edition):
Han, Qiushi. “Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems.” 2015. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2222 ; 10.25148/etd.FIDC000077 ; FIDC000077.
MLA Handbook (7th Edition):
Han, Qiushi. “Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems.” 2015. Web. 19 Jan 2021.
Vancouver:
Han Q. Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems. [Internet] [Doctoral dissertation]. Florida International University; 2015. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2222 ; 10.25148/etd.FIDC000077 ; FIDC000077.
Council of Science Editors:
Han Q. Energy-aware Fault-tolerant Scheduling for Hard Real-time Systems. [Doctoral Dissertation]. Florida International University; 2015. Available from: https://digitalcommons.fiu.edu/etd/2222 ; 10.25148/etd.FIDC000077 ; FIDC000077
Florida International University
16.
Zeng, Kaiman.
Next Generation of Product Search and Discovery.
Degree: PhD, Electrical Engineering, 2015, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2312
;
10.25148/etd.FIDC000207
;
FIDC000207
► Online shopping has become an important part of people’s daily life with the rapid development of e-commerce. In some domains such as books, electronics,…
(more)
▼ Online shopping has become an important part of people’s daily life with the rapid development of e-commerce. In some domains such as books, electronics, and CD/DVDs, online shopping has surpassed or even replaced the traditional shopping method. Compared with traditional retailing, e-commerce is information intensive. One of the key factors to succeed in e-business is how to facilitate the consumers’ approaches to discover a product. Conventionally a product search engine based on a keyword search or category browser is provided to help users find the product information they need. The general goal of a product search system is to enable users to quickly locate information of interest and to minimize users’ efforts in search and navigation. In this process human factors play a significant role. Finding product information could be a tricky task and may require an intelligent use of search engines, and a non-trivial navigation of multilayer categories. Searching for useful product information can be frustrating for many users, especially those inexperienced users.
This dissertation focuses on developing a new visual product search system that effectively extracts the properties of unstructured products, and presents the possible items of attraction to users so that the users can quickly locate the ones they would be most likely interested in. We designed and developed a feature extraction algorithm that retains product color and local pattern features, and the experimental evaluation on the benchmark dataset demonstrated that it is robust against common geometric and photometric visual distortions. Besides, instead of ignoring product text information, we investigated and developed a ranking model learned via a unified probabilistic hypergraph that is capable of capturing correlations among product visual content and textual content. Moreover, we proposed and designed a fuzzy hierarchical co-clustering algorithm for the collaborative filtering product recommendation. Via this method, users can be automatically grouped into different interest communities based on their behaviors. Then, a customized recommendation can be performed according to these implicitly detected relations. In summary, the developed search system performs much better in a visual unstructured product search when compared with state-of-art approaches. With the comprehensive ranking scheme and the collaborative filtering recommendation module, the user’s overhead in locating the information of value is reduced, and the user’s experience of seeking for useful product information is optimized.
Advisors/Committee Members: Kang K. Yen, Jean H. Andrian, Hai Deng, Deng Pan, Bogdan Carbunar.
Subjects/Keywords: visual search; content based image retrieval; ranking; hypergraph learning; recommendation; collaborative filtering; clustering; Other Electrical and Computer Engineering; Signal Processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zeng, K. (2015). Next Generation of Product Search and Discovery. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2312 ; 10.25148/etd.FIDC000207 ; FIDC000207
Chicago Manual of Style (16th Edition):
Zeng, Kaiman. “Next Generation of Product Search and Discovery.” 2015. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2312 ; 10.25148/etd.FIDC000207 ; FIDC000207.
MLA Handbook (7th Edition):
Zeng, Kaiman. “Next Generation of Product Search and Discovery.” 2015. Web. 19 Jan 2021.
Vancouver:
Zeng K. Next Generation of Product Search and Discovery. [Internet] [Doctoral dissertation]. Florida International University; 2015. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2312 ; 10.25148/etd.FIDC000207 ; FIDC000207.
Council of Science Editors:
Zeng K. Next Generation of Product Search and Discovery. [Doctoral Dissertation]. Florida International University; 2015. Available from: https://digitalcommons.fiu.edu/etd/2312 ; 10.25148/etd.FIDC000207 ; FIDC000207
Florida International University
17.
Talukder, Sajedul Karim.
Detection and Prevention of Abuse in Online Social Networks.
Degree: PhD, Computer Science, 2019, Florida International University
URL: https://digitalcommons.fiu.edu/etd/4026
;
10.25148/etd.FIDC007657
;
FIDC007657
► Adversaries leverage social networks to collect sensitive data about regular users and target them with abuse that includes fake news, cyberbullying, malware distribution, and…
(more)
▼ Adversaries leverage social networks to collect sensitive data about regular users and target them with abuse that includes fake news, cyberbullying, malware distribution, and propaganda. Such behavior is more effective when performed by the social network friends of victims. In two preliminary user studies we found that 71 out of 80 participants have at least 1 Facebook friend with whom (1) they never interact, either in Facebook or in real life, or whom they believe is (2) likely to abuse their posted photos or status updates, or (3) post offensive, false or malicious content. Such friend abuse is often considered to be outside the scope of online social network defenses. Several of our studies suggest that (1) perceived Facebook friend abuse as well as stranger friends are a significant problem; (2) users lack the knowledge or ability to address this problem themselves; and (3) when helped and educated, users are often willing to take defensive actions against abusive existing and pending friends, and strangers.
Motivated by the rich, private information of users that is available to the Facebook friends, often the entry point of this vulnerability is the pending friends. In an exploratory study with a number of participants, we found that participants not only tend to accept invitations from perfect strangers but can even invent a narrative of common background to motivate their choice. Further, based on our conjecture that Facebook's interface encourages users to accept pending friends, we develop new interfaces that seek to encourage users to explore the background of their pending friends and also to train them to avoid suspicious friends. The efficacy and implementation simplicity of the proposed modifications suggest that Facebook's unwillingness to protect its users from abusive strangers is deliberate.
This dissertation explores the friend abuse problem in online social networks like Facebook. We introduce two novel approaches to prevent friend abuse problem in Facebook. (1) First, we introduce AbuSniff which can detect already existing abusive friends in Facebook, and prevent the abusive friend from doing abuse by taking some protective actions against them. (2) Second, we introduce FLock to address the problem of abuse prevention during the time of friend invitation: by educating and training the Facebook users about the abusive friend from the list of pending friend invitations, and introducing new User Interface to help users reject the potentially abusive friend invitation, thus protecting the user from abuse in advance.
Advisors/Committee Members: Bogdan Carbunar, Sundaraja S. Iyengar, Deng Pan, Leonardo Bobadilla, B.M. Golam Kibria.
Subjects/Keywords: Abuse Detection; Online Social Networks; Facebook Abuse; Abuse Detection and Prevention; Machine Learning; Friend Spam; Information Security; Other Computer Sciences; Systems Architecture
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Talukder, S. K. (2019). Detection and Prevention of Abuse in Online Social Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/4026 ; 10.25148/etd.FIDC007657 ; FIDC007657
Chicago Manual of Style (16th Edition):
Talukder, Sajedul Karim. “Detection and Prevention of Abuse in Online Social Networks.” 2019. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/4026 ; 10.25148/etd.FIDC007657 ; FIDC007657.
MLA Handbook (7th Edition):
Talukder, Sajedul Karim. “Detection and Prevention of Abuse in Online Social Networks.” 2019. Web. 19 Jan 2021.
Vancouver:
Talukder SK. Detection and Prevention of Abuse in Online Social Networks. [Internet] [Doctoral dissertation]. Florida International University; 2019. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/4026 ; 10.25148/etd.FIDC007657 ; FIDC007657.
Council of Science Editors:
Talukder SK. Detection and Prevention of Abuse in Online Social Networks. [Doctoral Dissertation]. Florida International University; 2019. Available from: https://digitalcommons.fiu.edu/etd/4026 ; 10.25148/etd.FIDC007657 ; FIDC007657
Florida International University
18.
Kamhoua, Georges Arsene K.
Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms.
Degree: PhD, Computer Science, 2019, Florida International University
URL: https://digitalcommons.fiu.edu/etd/4281
;
FIDC007703
► Online Social Networks (OSNs) have created new ways for people to communicate, and for companies to engage their customers – with these new avenues…
(more)
▼ Online Social Networks (OSNs) have created new ways for people to communicate, and for companies to engage their customers – with these new avenues for communication come new vulnerabilities that can be exploited by attackers. This dissertation aims to investigate two attack models: Identity Clone Attacks (ICA) and Reconnaissance Attacks (RA). During an ICA, attackers impersonate users in a network and attempt to infiltrate social circles and extract confidential information. In an RA, attackers gather information on a target's resources, employees, and relationships with other entities over public venues such as OSNs and company websites. This was made easier for the RA to be efficient because well-known social networks, such as Facebook, have a policy to force people to use their real identities for their accounts. The goal of our research is to provide mechanisms to defend against colluding attackers in the presence of ICA and RA collusion attacks. In this work, we consider a scenario not addressed by previous works, wherein multiple attackers collude against the network, and propose defense mechanisms for such an attack. We take into account the asymmetric nature of social networks and include the case where colluders could add or modify some attributes of their clones. We also consider the case where attackers send few friend requests to uncover their targets.
To detect fake reviews and uncovering colluders in crowdsourcing, we propose a semantic similarity measurement between reviews and a community detection algorithm to overcome the non-adversarial attack. ICA in a colluding attack may become stronger and more sophisticated than in a single attack. We introduce a token-based comparison and a friend list structure-matching approach, resulting in stronger identifiers even in the presence of attackers who could add or modify some attributes on the clone. We also propose a stronger RA collusion mechanism in which colluders build their own legitimacy by considering asymmetric relationships among users and, while having partial information of the networks, avoid recreating social circles around their targets. Finally, we propose a defense mechanism against colluding RA which uses the weakest person (e.g., the potential victim willing to accept friend requests) to reach their target.
Advisors/Committee Members: Niki Pissinou, Sundaraja Sitharama Iyengar, Deng Pan, Jean H. Andrian, Leonardo Bobadilla.
Subjects/Keywords: Cybersecurity; Colluding Attacks; Online Social Networks; Crowdsourcing; Threats and Solutions; Social Network Analysis; Colluding Targeted Reconnaissance Attack; Identity Clone Attack; Community Detection; Communication Technology and New Media; Mass Communication; Other Electrical and Computer Engineering; Social Media
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kamhoua, G. A. K. (2019). Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/4281 ; FIDC007703
Chicago Manual of Style (16th Edition):
Kamhoua, Georges Arsene K. “Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms.” 2019. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/4281 ; FIDC007703.
MLA Handbook (7th Edition):
Kamhoua, Georges Arsene K. “Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms.” 2019. Web. 19 Jan 2021.
Vancouver:
Kamhoua GAK. Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms. [Internet] [Doctoral dissertation]. Florida International University; 2019. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/4281 ; FIDC007703.
Council of Science Editors:
Kamhoua GAK. Mitigating Colluding Attacks in Online Social Networks and Crowdsourcing Platforms. [Doctoral Dissertation]. Florida International University; 2019. Available from: https://digitalcommons.fiu.edu/etd/4281 ; FIDC007703
19.
Guo, Mingming.
User-Centric Privacy Preservation in Mobile and Location-Aware Applications.
Degree: PhD, Computer Science, 2018, Florida International University
URL: https://digitalcommons.fiu.edu/etd/3674
;
10.25148/etd.FIDC006533
;
FIDC006533
► The mobile and wireless community has brought a significant growth of location-aware devices including smart phones, connected vehicles and IoT devices. The combination of…
(more)
▼ The mobile and wireless community has brought a significant growth of location-aware devices including smart phones, connected vehicles and IoT devices. The combination of location-aware sensing, data processing and wireless communication in these devices leads to the rapid development of mobile and location-aware applications. Meanwhile, user privacy is becoming an indispensable concern. These mobile and location-aware applications, which collect data from mobile sensors carried by users or vehicles, return valuable data collection services (e.g., health condition monitoring, traffic monitoring, and natural disaster forecasting) in real time. The sequential spatial-temporal data queries sent by users provide their location trajectory information. The location trajectory information not only contains users’ movement patterns, but also reveals sensitive attributes such as users’ personal habits, preferences, as well as home and work addresses. By exploring this type of information, the attackers can extract and sell user profile data, decrease subscribed data services, and even jeopardize personal safety.
This research spans from the realization that user privacy is lost along with the popular usage of emerging location-aware applications. The outcome seeks to relive user location and trajectory privacy problems. First, we develop a pseudonym-based anonymity zone generation scheme against a strong adversary model in continuous location-based services. Based on a geometric transformation algorithm, this scheme generates distributed anonymity zones with personalized privacy parameters to conceal users’ real location trajectories. Second, based on the historical query data analysis, we introduce a query-feature-based probabilistic inference attack, and propose query-aware randomized algorithms to preserve user privacy by distorting the probabilistic inference conducted by attackers. Finally, we develop a privacy-aware mobile sensing mechanism to help vehicular users reduce the number of queries to be sent to the adversarial servers. In this mechanism, mobile vehicular users can selectively query nearby nodes in a peer-to-peer way for privacy protection in vehicular networks.
Advisors/Committee Members: Niki Pissinou, S.S. Iyengar, Deng Pan, Bogdan Carbunar, Kang Yen.
Subjects/Keywords: User Privacy; Location-based Services; Probabilistic Inference; Search Query; Optimization; Mobile Sensing; Artificial Intelligence and Robotics; Databases and Information Systems; Digital Communications and Networking; Information Security; Probability; Theory and Algorithms
…LOCATIONAWARE APPLICATIONS
by
Mingming Guo
Florida International University, 2018
Miami, Florida…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Guo, M. (2018). User-Centric Privacy Preservation in Mobile and Location-Aware Applications. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3674 ; 10.25148/etd.FIDC006533 ; FIDC006533
Chicago Manual of Style (16th Edition):
Guo, Mingming. “User-Centric Privacy Preservation in Mobile and Location-Aware Applications.” 2018. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/3674 ; 10.25148/etd.FIDC006533 ; FIDC006533.
MLA Handbook (7th Edition):
Guo, Mingming. “User-Centric Privacy Preservation in Mobile and Location-Aware Applications.” 2018. Web. 19 Jan 2021.
Vancouver:
Guo M. User-Centric Privacy Preservation in Mobile and Location-Aware Applications. [Internet] [Doctoral dissertation]. Florida International University; 2018. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/3674 ; 10.25148/etd.FIDC006533 ; FIDC006533.
Council of Science Editors:
Guo M. User-Centric Privacy Preservation in Mobile and Location-Aware Applications. [Doctoral Dissertation]. Florida International University; 2018. Available from: https://digitalcommons.fiu.edu/etd/3674 ; 10.25148/etd.FIDC006533 ; FIDC006533
20.
Putthapipat, Pasd.
Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication.
Degree: PhD, Electrical Engineering, 2013, Florida International University
URL: https://digitalcommons.fiu.edu/etd/867
;
10.25148/etd.FI13042334
;
FI13042334
► The ability to use Software Defined Radio (SDR) in the civilian mobile applications will make it possible for the next generation of mobile devices…
(more)
▼ The ability to use Software Defined Radio (SDR) in the civilian mobile applications will make it possible for the next generation of mobile devices to handle multi-standard personal wireless devices and ubiquitous wireless devices. The original military standard created many beneficial characteristics for SDR, but resulted in a number of disadvantages as well. Many challenges in commercializing SDR are still the subject of interest in the software radio research community. Four main issues that have been already addressed are performance, size, weight, and power.
This investigation presents an in-depth study of SDR inter-components communications in terms of total link delay related to the number of components and packet sizes in systems based on Software Communication Architecture (SCA). The study is based on the investigation of the controlled environment platform. Results suggest that the total link delay does not linearly increase with the number of components and the packet sizes. The closed form expression of the delay was modeled using a logistic function in terms of the number of components and packet sizes. The model performed well when the number of components was large.
Based upon the mobility applications, energy consumption has become one of the most crucial limitations. SDR will not only provide flexibility of multi-protocol support, but this desirable feature will also bring a choice of mobile protocols. Having such a variety of choices available creates a problem in the selection of the most appropriate protocol to transmit. An investigation in a real-time algorithm to optimize energy efficiency was also performed. Communication energy models were used including switching estimation to develop a waveform selection algorithm. Simulations were performed to validate the concept.
Advisors/Committee Members: Jean H. Andrian, Chen Liu, Gang Quan, Deng Pan.
Subjects/Keywords: Software Defined Radio; Inter-component Communication; Energy Aware; Digital Communications and Networking
…COMMUNICATION
by
Pasd Putthapipat
Florida International University, 2013
Miami, Florida
Associate…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Putthapipat, P. (2013). Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/867 ; 10.25148/etd.FI13042334 ; FI13042334
Chicago Manual of Style (16th Edition):
Putthapipat, Pasd. “Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication.” 2013. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/867 ; 10.25148/etd.FI13042334 ; FI13042334.
MLA Handbook (7th Edition):
Putthapipat, Pasd. “Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication.” 2013. Web. 19 Jan 2021.
Vancouver:
Putthapipat P. Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication. [Internet] [Doctoral dissertation]. Florida International University; 2013. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/867 ; 10.25148/etd.FI13042334 ; FI13042334.
Council of Science Editors:
Putthapipat P. Lightweight Middleware for Software Defined Radio (SDR) Inter-Components Communication. [Doctoral Dissertation]. Florida International University; 2013. Available from: https://digitalcommons.fiu.edu/etd/867 ; 10.25148/etd.FI13042334 ; FI13042334
21.
Njilla, Laurent L. Y.
Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory.
Degree: PhD, Electrical Engineering, 2015, Florida International University
URL: https://digitalcommons.fiu.edu/etd/2284
;
10.25148/etd.FIDC000182
;
FIDC000182
► This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design,…
(more)
▼ This dissertation presents novel approaches to modeling and analyzing security and resource allocation in mobile ad hoc networks (MANETs). The research involves the design, implementation and simulation of different models resulting in resource sharing and security’s strengthening of the network among mobile devices. Because of the mobility, the network topology may change quickly and unpredictably over time. Moreover, data-information sent from a source to a designated destination node, which is not nearby, has to route its information with the need of intermediary mobile nodes. However, not all intermediary nodes in the network are willing to participate in data-packet transfer of other nodes. The unwillingness to participate in data forwarding is because a node is built on limited resources such as energy-power and data. Due to their limited resource, nodes may not want to participate in the overall network objectives by forwarding data-packets of others in fear of depleting their energy power.
To enforce cooperation among autonomous nodes, we design, implement and simulate new incentive mechanisms that used game theoretic concepts to analyze and model the strategic interactions among rationale nodes with conflicting interests. Since there is no central authority and the network is decentralized, to address the concerns of mobility of selfish nodes in MANETs, a model of security and trust relationship was designed and implemented to improve the impact of investment into trust mechanisms. A series of simulations was carried out that showed the strengthening of security in a network with selfish and malicious nodes. Our research involves bargaining for resources in a highly dynamic ad-hoc network. The design of a new arbitration mechanism for MANETs utilizes the Dirichlet distribution for fairness in allocating resources. Then, we investigated the problem of collusion nodes in mobile ad-hoc networks with an arbitrator. We model the collusion by having a group of nodes disrupting the bargaining process by not cooperating with the arbitrator. Finally, we investigated the resource allocation for a system between agility and recovery using the concept of Markov decision process. Simulation results showed that the proposed solutions may be helpful to decision-makers when allocating resources between separated teams.
Advisors/Committee Members: Niki Pissinou, Jean Andrian, Deng Pan, Kang Yen, Charles Kamhoua.
Subjects/Keywords: Security; Resource Allocation; MANET; Wireless Network; Game Theory; Ad hoc Network; Cyber Security; Computer Engineering; Computer Sciences; Electrical and Computer Engineering
…Yamen Njilla
Florida International University, 2015
Miami, Florida
Professor Niki Pissinou…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Njilla, L. L. Y. (2015). Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/2284 ; 10.25148/etd.FIDC000182 ; FIDC000182
Chicago Manual of Style (16th Edition):
Njilla, Laurent L Y. “Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory.” 2015. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/2284 ; 10.25148/etd.FIDC000182 ; FIDC000182.
MLA Handbook (7th Edition):
Njilla, Laurent L Y. “Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory.” 2015. Web. 19 Jan 2021.
Vancouver:
Njilla LLY. Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory. [Internet] [Doctoral dissertation]. Florida International University; 2015. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/2284 ; 10.25148/etd.FIDC000182 ; FIDC000182.
Council of Science Editors:
Njilla LLY. Modeling Security and Resource Allocation for Mobile Multi-hop Wireless Neworks Using Game Theory. [Doctoral Dissertation]. Florida International University; 2015. Available from: https://digitalcommons.fiu.edu/etd/2284 ; 10.25148/etd.FIDC000182 ; FIDC000182
22.
Rong, Rong.
Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis.
Degree: PhD, Computer Science, 2016, Florida International University
URL: https://digitalcommons.fiu.edu/etd/3058
;
10.25148/etd.FIDC001176
;
FIDC001176
► In the past decade or so, significant advances were made in the field of Future Internet Architecture (FIA) design. Undoubtedly, the size of Future…
(more)
▼ In the past decade or so, significant advances were made in the field of Future Internet Architecture (FIA) design. Undoubtedly, the size of Future Internet will increase tremendously, and so will the complexity of its users’ behaviors. This advancement means most of future Internet applications and services can only achieve and demonstrate full potential on a large-scale basis. The development of network testbeds that can validate key design decisions and expose operational issues at scale is essential to FIA research. In conjunction with the development and advancement of FIA, cyber-infrastructure testbeds have also achieved remarkable progress. For meaningful network studies, it is indispensable to utilize cyber-infrastructure testbeds appropriately in order to obtain accurate experiment results. That said, existing current network experimentation is intrinsically deficient. The existing testbeds do not offer scalability, flexibility, and realism at the same time. This dissertation aims to construct a hybrid system of conducting at-scale network studies and experiments by exploiting the distributed computing ability of current testbeds.
First, this work presents a synchronization of parallel discrete event simulation that offers the simulation with transparent scalability and performance on various high-end computing platforms. The parallel simulator that we implement is configured so that it can self-adapt for the performance while running on supercomputers with disparate architectures. The simulator could be used to handle models of different sizes, varying modeling details, and different complexity levels.
Second, this works addresses the issue of researching network design and implementation realistically at scale, through the use of distributed cyber-infrastructure testbeds. An existing symbiotic approach is applied to integrate emulation with simulation so that they can overcome the limitations of physical setup. The symbiotic method is used to improve the capabilities of a specific emulator, Mininet. In this case, Mininet can be used to run applications directly on the virtual machines and software switches, with network connectivity represented by detailed simulation at scale. We also propose a method for using the symbiotic approach to coordinate separate Mininet instances, each representing a different set of the overlapping network flows. This approach provides a significant improvement to the scalability of the network experiments.
Advisors/Committee Members: Jason Liu, Deng Pan, Raju Rangaswami, Bogdan Carbunar, Gang Quan.
Subjects/Keywords: Parallel discrete event simulation; Synchronization algorithms; Distributed network emulation; Symbiotic network simulation; Digital Communications and Networking
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rong, R. (2016). Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/3058 ; 10.25148/etd.FIDC001176 ; FIDC001176
Chicago Manual of Style (16th Edition):
Rong, Rong. “Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis.” 2016. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/3058 ; 10.25148/etd.FIDC001176 ; FIDC001176.
MLA Handbook (7th Edition):
Rong, Rong. “Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis.” 2016. Web. 19 Jan 2021.
Vancouver:
Rong R. Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis. [Internet] [Doctoral dissertation]. Florida International University; 2016. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/3058 ; 10.25148/etd.FIDC001176 ; FIDC001176.
Council of Science Editors:
Rong R. Toward Distributed At-scale Hybrid Network Test with Emulation and Simulation Symbiosis. [Doctoral Dissertation]. Florida International University; 2016. Available from: https://digitalcommons.fiu.edu/etd/3058 ; 10.25148/etd.FIDC001176 ; FIDC001176
23.
Bhattacharya, Abhishek.
Affect-based Modeling and its Application in Multimedia Analysis Problems.
Degree: PhD, Computer Science, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/713
;
10.25148/etd.FI12081301
;
FI12081301
► The multimedia domain is undergoing a rapid development phase with transition in audio, image, and video systems such as VoIP, Telepresence, Live/On-Demand Internet Streaming,…
(more)
▼ The multimedia domain is undergoing a rapid development phase with transition in audio, image, and video systems such as VoIP, Telepresence, Live/On-Demand Internet Streaming, SecondLife, and many more. In such a situation, the analysis of multimedia systems, like retrieval, quality evaluation, enhancement, summarization, and re-targeting applications, from various context is becoming critical. Current methods for solving the above-mentioned analysis problems do not consider the existence of humans and their affective characteristics in the design methodology. This contradicts the fact that most of the digital media is consumed only by the human end-users. We believe incorporating human feedback during the design and adaptation stage is key to the building process of multimedia systems. In this regard, we observe that affect is an important indicator of human perception and experience. This can be exploited in various ways for designing effective systems that will adapt more closely to the human response.
We advocate an affect-based modeling approach for solving multimedia analysis problems by exploring new directions. In this dissertation, we select two representative multimedia analysis problems, e.g. Quality-of-Experience (QoE) evaluation and Image Enhancement in order to derive solutions based on affect-based modeling techniques. We formulate specific hypothesis for them by correlating system parameters to user's affective response, and investigate their roles under varying conditions for each respective scenario. We conducted extensive user studies based on human-to-human interaction through an audio conferencing system.We also conducted user studies based on affective enhancement of images and evaluated the effectiveness of our proposed approaches. Moving forward, multimedia systems will become more media-rich, interactive, and sophisticated and therefore effective solutions for quality, retrieval, and enhancement will be more challenging. Our work thus represents an important step towards the application of affect-based modeling techniques for the future generation of multimedia systems.
Advisors/Committee Members: Zhenyu Yang, Peter Clarke, Christine Lisetti, Deng Pan, Chen Liu.
Subjects/Keywords: Multimedia; Quality of Experience; Quality of Service; Image Enhancement; Affective Computing; VoIP; Machine Learning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bhattacharya, A. (2012). Affect-based Modeling and its Application in Multimedia Analysis Problems. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/713 ; 10.25148/etd.FI12081301 ; FI12081301
Chicago Manual of Style (16th Edition):
Bhattacharya, Abhishek. “Affect-based Modeling and its Application in Multimedia Analysis Problems.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/713 ; 10.25148/etd.FI12081301 ; FI12081301.
MLA Handbook (7th Edition):
Bhattacharya, Abhishek. “Affect-based Modeling and its Application in Multimedia Analysis Problems.” 2012. Web. 19 Jan 2021.
Vancouver:
Bhattacharya A. Affect-based Modeling and its Application in Multimedia Analysis Problems. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/713 ; 10.25148/etd.FI12081301 ; FI12081301.
Council of Science Editors:
Bhattacharya A. Affect-based Modeling and its Application in Multimedia Analysis Problems. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/713 ; 10.25148/etd.FI12081301 ; FI12081301
24.
Mekala, Priyanka.
Field Programmable Gate Array Based Target Detection and Gesture Recognition.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/723
;
10.25148/etd.FI12110703
;
FI12110703
► The move from Standard Definition (SD) to High Definition (HD) represents a six times increases in data, which needs to be processed. With expanding…
(more)
▼ The move from Standard Definition (SD) to High Definition (HD) represents a six times increases in data, which needs to be processed. With expanding resolutions and evolving compression, there is a need for high performance with flexible architectures to allow for quick upgrade ability. The technology advances in image display resolutions, advanced compression techniques, and video intelligence. Software implementation of these systems can attain accuracy with tradeoffs among processing performance (to achieve specified frame rates, working on large image data sets), power and cost constraints. There is a need for new architectures to be in pace with the fast innovations in video and imaging. It contains dedicated hardware implementation of the pixel and frame rate processes on Field Programmable Gate Array (FPGA) to achieve the real-time performance.
The following outlines the contributions of the dissertation. (1) We develop a target detection system by applying a novel running average mean threshold (RAMT) approach to globalize the threshold required for background subtraction. This approach adapts the threshold automatically to different environments (indoor and outdoor) and different targets (humans and vehicles). For low power consumption and better performance, we design the complete system on FPGA. (2) We introduce a safe distance factor and develop an algorithm for occlusion occurrence detection during target tracking. A novel mean-threshold is calculated by motion-position analysis. (3) A new strategy for gesture recognition is developed using Combinational Neural Networks (CNN) based on a tree structure. Analysis of the method is done on American Sign Language (ASL) gestures. We introduce novel point of interests approach to reduce the feature vector size and gradient threshold approach for accurate classification. (4) We design a gesture recognition system using a hardware/ software co-simulation neural network for high speed and low memory storage requirements provided by the FPGA. We develop an innovative maximum distant algorithm which uses only 0.39% of the image as the feature vector to train and test the system design. Database set gestures involved in different applications may vary. Therefore, it is highly essential to keep the feature vector as low as possible while maintaining the same accuracy and performance
Advisors/Committee Members: Jeffrey Fan, Hai Deng, Armando Barreto, Deng Pan.
Subjects/Keywords: TARGET DETECTION; GESTURE RECOGNITION; NEURAL NETWORKS; BACK PROPAGATION; AMERICAN SIGN LANGUAGE; OCCLUSION DETECTION; FIELD PROGRAMMABLE GATE ARRAY; VERILOG; HARDWARE SOFTWARE CO-SIMULATION PLATFORM
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mekala, P. (2012). Field Programmable Gate Array Based Target Detection and Gesture Recognition. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/723 ; 10.25148/etd.FI12110703 ; FI12110703
Chicago Manual of Style (16th Edition):
Mekala, Priyanka. “Field Programmable Gate Array Based Target Detection and Gesture Recognition.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/723 ; 10.25148/etd.FI12110703 ; FI12110703.
MLA Handbook (7th Edition):
Mekala, Priyanka. “Field Programmable Gate Array Based Target Detection and Gesture Recognition.” 2012. Web. 19 Jan 2021.
Vancouver:
Mekala P. Field Programmable Gate Array Based Target Detection and Gesture Recognition. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/723 ; 10.25148/etd.FI12110703 ; FI12110703.
Council of Science Editors:
Mekala P. Field Programmable Gate Array Based Target Detection and Gesture Recognition. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/723 ; 10.25148/etd.FI12110703 ; FI12110703
25.
Cheocherngngarn, Tosmate.
Cross-Layer Design for Energy Efficiency on Data Center Network.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/730
;
10.25148/etd.FI12111301
;
FI12111301
► Energy efficient infrastructures or green IT (Information Technology) has recently become a hot button issue for most corporations as they strive to eliminate every…
(more)
▼ Energy efficient infrastructures or green IT (Information Technology) has recently become a hot button issue for most corporations as they strive to eliminate every inefficiency from their enterprise IT systems and save capital and operational costs. Vendors of IT equipment now compete on the power efficiency of their devices, and as a result, many of the new equipment models are indeed more energy efficient. Various studies have estimated the annual electricity consumed by networking devices in the U.S. in the range of 6 - 20 Terra Watt hours.
Our research has the potential to make promising solutions solve those overuses of electricity. An energy-efficient data center network architecture which can lower the energy consumption is highly desirable. First of all, we propose a fair bandwidth allocation algorithm which adopts the max-min fairness principle to decrease power consumption on packet switch fabric interconnects. Specifically, we include power aware computing factor as high power dissipation in switches which is fast turning into a key problem, owing to increasing line speeds and decreasing chip sizes. This efficient algorithm could not only reduce the convergence iterations but also lower processing power utilization on switch fabric interconnects. Secondly, we study the deployment strategy of multicast switches in hybrid mode in energy-aware data center network: a case of famous Fat-tree topology. The objective is to find the best location to deploy multicast switch not only to achieve optimal bandwidth utilization but also minimize power consumption. We show that it is possible to easily achieve nearly 50% of energy consumption after applying our proposed algorithm. Finally, although there exists a number of energy optimization solutions for DCNs, they consider only either the hosts or network, but not both. We propose a joint optimization scheme that simultaneously optimizes virtual machine (VM) placement and network flow routing to maximize energy savings. The simulation results fully demonstrate that our design outperforms existing host- or network-only optimization solutions, and well approximates the ideal but NP-complete linear program. To sum up, this study could be crucial for guiding future eco-friendly data center network that deploy our algorithm on four major layers (with reference to OSI seven layers) which are physical, data link, network and application layer to benefit power consumption in green data center.
Advisors/Committee Members: Jean Andrian, Deng Pan, Hai Deng, Jeffrey Fan.
Subjects/Keywords: data center network; energy efficiency; green IT
…by
Tosmate Cheocherngngarn
Florida International University, 2012
Miami, Florida
Professor… …Deng Pan, Co-Major Professor
Professor Jean Andrian, Co-Major Professor
Energy efficient…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cheocherngngarn, T. (2012). Cross-Layer Design for Energy Efficiency on Data Center Network. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/730 ; 10.25148/etd.FI12111301 ; FI12111301
Chicago Manual of Style (16th Edition):
Cheocherngngarn, Tosmate. “Cross-Layer Design for Energy Efficiency on Data Center Network.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/730 ; 10.25148/etd.FI12111301 ; FI12111301.
MLA Handbook (7th Edition):
Cheocherngngarn, Tosmate. “Cross-Layer Design for Energy Efficiency on Data Center Network.” 2012. Web. 19 Jan 2021.
Vancouver:
Cheocherngngarn T. Cross-Layer Design for Energy Efficiency on Data Center Network. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/730 ; 10.25148/etd.FI12111301 ; FI12111301.
Council of Science Editors:
Cheocherngngarn T. Cross-Layer Design for Energy Efficiency on Data Center Network. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/730 ; 10.25148/etd.FI12111301 ; FI12111301
26.
Jin, Hao.
Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks.
Degree: PhD, Electrical Engineering, 2012, Florida International University
URL: https://digitalcommons.fiu.edu/etd/735
;
10.25148/etd.FI12111906
;
FI12111906
► Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the…
(more)
▼ Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center.
The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.
Advisors/Committee Members: Deng Pan, Niki Pissinou, Jean Andrian, Jason Liu.
Subjects/Keywords: Data Center; Networks; Optimization; Performance Enhancement; Energy Efficiency
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jin, H. (2012). Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/735 ; 10.25148/etd.FI12111906 ; FI12111906
Chicago Manual of Style (16th Edition):
Jin, Hao. “Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks.” 2012. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/735 ; 10.25148/etd.FI12111906 ; FI12111906.
MLA Handbook (7th Edition):
Jin, Hao. “Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks.” 2012. Web. 19 Jan 2021.
Vancouver:
Jin H. Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks. [Internet] [Doctoral dissertation]. Florida International University; 2012. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/735 ; 10.25148/etd.FI12111906 ; FI12111906.
Council of Science Editors:
Jin H. Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks. [Doctoral Dissertation]. Florida International University; 2012. Available from: https://digitalcommons.fiu.edu/etd/735 ; 10.25148/etd.FI12111906 ; FI12111906
27.
Jin, Xinyu.
Trajectory Privacy Preservation in Mobile Wireless Sensor Networks.
Degree: PhD, Electrical Engineering, 2013, Florida International University
URL: https://digitalcommons.fiu.edu/etd/983
;
10.25148/etd.FI13120417
;
FI13120417
► In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags.…
(more)
▼ In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node.
This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.
Advisors/Committee Members: Niki Pissinou, Deng Pan, S. S. Iyengar, Jeffrey Fan, Jean H. Andrian.
Subjects/Keywords: privacy; trajectory; security; wireless sensor networks; mobile networks; Digital Communications and Networking; Information Security; Systems and Communications; Systems Architecture
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jin, X. (2013). Trajectory Privacy Preservation in Mobile Wireless Sensor Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/983 ; 10.25148/etd.FI13120417 ; FI13120417
Chicago Manual of Style (16th Edition):
Jin, Xinyu. “Trajectory Privacy Preservation in Mobile Wireless Sensor Networks.” 2013. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/983 ; 10.25148/etd.FI13120417 ; FI13120417.
MLA Handbook (7th Edition):
Jin, Xinyu. “Trajectory Privacy Preservation in Mobile Wireless Sensor Networks.” 2013. Web. 19 Jan 2021.
Vancouver:
Jin X. Trajectory Privacy Preservation in Mobile Wireless Sensor Networks. [Internet] [Doctoral dissertation]. Florida International University; 2013. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/983 ; 10.25148/etd.FI13120417 ; FI13120417.
Council of Science Editors:
Jin X. Trajectory Privacy Preservation in Mobile Wireless Sensor Networks. [Doctoral Dissertation]. Florida International University; 2013. Available from: https://digitalcommons.fiu.edu/etd/983 ; 10.25148/etd.FI13120417 ; FI13120417
28.
Pumpichet, Sitthapon.
Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks.
Degree: PhD, Electrical Engineering, 2013, Florida International University
URL: https://digitalcommons.fiu.edu/etd/1004
;
10.25148/etd.FI13120904
;
FI13120904
► The promise of Wireless Sensor Networks (WSNs) is the autonomous collaboration of a collection of sensors to accomplish some specific goals which a single…
(more)
▼ The promise of Wireless Sensor Networks (WSNs) is the autonomous collaboration of a collection of sensors to accomplish some specific goals which a single sensor cannot offer. Basically, sensor networking serves a range of applications by providing the raw data as fundamentals for further analyses and actions. The imprecision of the collected data could tremendously mislead the decision-making process of sensor-based applications, resulting in an ineffectiveness or failure of the application objectives. Due to inherent WSN characteristics normally spoiling the raw sensor readings, many research efforts attempt to improve the accuracy of the corrupted or “dirty” sensor data. The dirty data need to be cleaned or corrected. However, the developed data cleaning solutions restrict themselves to the scope of static WSNs where deployed sensors would rarely move during the operation. Nowadays, many emerging applications relying on WSNs need the sensor mobility to enhance the application efficiency and usage flexibility. The location of deployed sensors needs to be dynamic. Also, each sensor would independently function and contribute its resources. Sensors equipped with vehicles for monitoring the traffic condition could be depicted as one of the prospective examples. The sensor mobility causes a transient in network topology and correlation among sensor streams. Based on static relationships among sensors, the existing methods for cleaning sensor data in static WSNs are invalid in such mobile scenarios. Therefore, a solution of data cleaning that considers the sensor movements is actively needed. This dissertation aims to improve the quality of sensor data by considering the consequences of various trajectory relationships of autonomous mobile sensors in the system. First of all, we address the dynamic network topology due to sensor mobility. The concept of virtual sensor is presented and used for spatio-temporal selection of neighboring sensors to help in cleaning sensor data streams. This method is one of the first methods to clean data in mobile sensor environments. We also study the mobility pattern of moving sensors relative to boundaries of sub-areas of interest. We developed a belief-based analysis to determine the reliable sets of neighboring sensors to improve the cleaning performance, especially when node density is relatively low. Finally, we design a novel sketch-based technique to clean data from internal sensors where spatio-temporal relationships among sensors cannot lead to the data correlations among sensor streams.
Advisors/Committee Members: Niki Pissinou, Stavros Georgakopoulos, Deng Pan, Nikoloas Tsoukias, Syed M. Ahmed.
Subjects/Keywords: Online data cleaning: Data stream recovery: Mobile wireless sensor networks: Virtual sensor: Belief-based data cleaning: Sketch technique: Trajectory sensor data cleaning; Digital Communications and Networking; Systems and Communications
…TRAJECTORY, WIRELESS SENSOR NETWORKS
by
Sitthapon Pumpichet
Florida International University, 2013…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pumpichet, S. (2013). Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/1004 ; 10.25148/etd.FI13120904 ; FI13120904
Chicago Manual of Style (16th Edition):
Pumpichet, Sitthapon. “Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks.” 2013. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/1004 ; 10.25148/etd.FI13120904 ; FI13120904.
MLA Handbook (7th Edition):
Pumpichet, Sitthapon. “Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks.” 2013. Web. 19 Jan 2021.
Vancouver:
Pumpichet S. Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks. [Internet] [Doctoral dissertation]. Florida International University; 2013. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/1004 ; 10.25148/etd.FI13120904 ; FI13120904.
Council of Science Editors:
Pumpichet S. Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks. [Doctoral Dissertation]. Florida International University; 2013. Available from: https://digitalcommons.fiu.edu/etd/1004 ; 10.25148/etd.FI13120904 ; FI13120904
29.
Kamhoua, Charles A. K.
Modeling Security and Cooperation in Wireless Networks Using Game Theory.
Degree: Electrical Engineering, 2011, Florida International University
URL: https://digitalcommons.fiu.edu/etd/436
;
10.25148/etd.FI11072602
;
FI11072602
► This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory…
(more)
▼ This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.
Advisors/Committee Members: Niki Pissinou, Kia Makki, Norman D. H. Munroe, Kang K. Yen, Deng Pan.
Subjects/Keywords: Wireless network; Ad hoc network; Wireless sensor network; Telecommunication; Cooperation; Game theory; Evolutionary game theory; Network security; Trust; Prisoner's dilemma game
…GAME THEORY
by
Charles Alexandre Kenmogne Kamhoua
Florida International University, 2011…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kamhoua, C. A. K. (2011). Modeling Security and Cooperation in Wireless Networks Using Game Theory. (Thesis). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/436 ; 10.25148/etd.FI11072602 ; FI11072602
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kamhoua, Charles A K. “Modeling Security and Cooperation in Wireless Networks Using Game Theory.” 2011. Thesis, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/436 ; 10.25148/etd.FI11072602 ; FI11072602.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kamhoua, Charles A K. “Modeling Security and Cooperation in Wireless Networks Using Game Theory.” 2011. Web. 19 Jan 2021.
Vancouver:
Kamhoua CAK. Modeling Security and Cooperation in Wireless Networks Using Game Theory. [Internet] [Thesis]. Florida International University; 2011. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/436 ; 10.25148/etd.FI11072602 ; FI11072602.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kamhoua CAK. Modeling Security and Cooperation in Wireless Networks Using Game Theory. [Thesis]. Florida International University; 2011. Available from: https://digitalcommons.fiu.edu/etd/436 ; 10.25148/etd.FI11072602 ; FI11072602
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
30.
Fan, Ming.
Real-Time Scheduling of Embedded Applications on Multi-Core Platforms.
Degree: PhD, Electrical Engineering, 2014, Florida International University
URL: https://digitalcommons.fiu.edu/etd/1243
;
10.25148/etd.FI14040815
;
FI14040815
► For the past several decades, we have experienced the tremendous growth, in both scale and scope, of real-time embedded systems, thanks largely to the…
(more)
▼ For the past several decades, we have experienced the tremendous growth, in both scale and scope, of real-time embedded systems, thanks largely to the advances in IC technology. However, the traditional approach to get performance boost by increasing CPU frequency has been a way of past. Researchers from both industry and academia are turning their focus to multi-core architectures for continuous improvement of computing performance. In our research, we seek to develop efficient scheduling algorithms and analysis methods in the design of real-time embedded systems on multi-core platforms. Real-time systems are the ones with the response time as critical as the logical correctness of computational results. In addition, a variety of stringent constraints such as power/energy consumption, peak temperature and reliability are also imposed to these systems. Therefore, real-time scheduling plays a critical role in design of such computing systems at the system level.
We started our research by addressing timing constraints for real-time applications on multi-core platforms, and developed both partitioned and semi-partitioned scheduling algorithms to schedule fixed priority, periodic, and hard real-time tasks on multi-core platforms. Then we extended our research by taking temperature constraints into consideration. We developed a closed-form solution to capture temperature dynamics for a given periodic voltage schedule on multi-core platforms, and also developed three methods to check the feasibility of a periodic real-time schedule under peak temperature constraint. We further extended our research by incorporating the power/energy constraint with thermal awareness into our research problem. We investigated the energy estimation problem on multi-core platforms, and developed a computation efficient method to calculate the energy consumption for a given voltage schedule on a multi-core platform. In this dissertation, we present our research in details and demonstrate the effectiveness and efficiency of our approaches with extensive experimental results.
Advisors/Committee Members: Gang Quan, Malek Adjouadi, Jean H. Andrian, Nezih Pala, Deng Pan.
Subjects/Keywords: Real-Time Scheduling; Multi-Core Platform; Fixed-Priority; Feasibility Analysis; Temperature Formulation; Energy Estimation; Computer and Systems Architecture; Power and Energy; Systems Architecture; Theory and Algorithms
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fan, M. (2014). Real-Time Scheduling of Embedded Applications on Multi-Core Platforms. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/1243 ; 10.25148/etd.FI14040815 ; FI14040815
Chicago Manual of Style (16th Edition):
Fan, Ming. “Real-Time Scheduling of Embedded Applications on Multi-Core Platforms.” 2014. Doctoral Dissertation, Florida International University. Accessed January 19, 2021.
https://digitalcommons.fiu.edu/etd/1243 ; 10.25148/etd.FI14040815 ; FI14040815.
MLA Handbook (7th Edition):
Fan, Ming. “Real-Time Scheduling of Embedded Applications on Multi-Core Platforms.” 2014. Web. 19 Jan 2021.
Vancouver:
Fan M. Real-Time Scheduling of Embedded Applications on Multi-Core Platforms. [Internet] [Doctoral dissertation]. Florida International University; 2014. [cited 2021 Jan 19].
Available from: https://digitalcommons.fiu.edu/etd/1243 ; 10.25148/etd.FI14040815 ; FI14040815.
Council of Science Editors:
Fan M. Real-Time Scheduling of Embedded Applications on Multi-Core Platforms. [Doctoral Dissertation]. Florida International University; 2014. Available from: https://digitalcommons.fiu.edu/etd/1243 ; 10.25148/etd.FI14040815 ; FI14040815
◁ [1] [2] ▶
. 
Open Access Theses and Dissertations
