Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(random networks). Showing records 1 – 30 of 263 total matches.

[1] [2] [3] [4] [5] [6] [7] [8] [9]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Alberta

1. Sangi, Farzad. Ranking entities in heterogeneous multiple relation social networks using random walks.

Degree: MS, Department of Computing Science, 2011, University of Alberta

 A Social Network or Information Network is a structure made up of nodes representing entities, and edges representing the relationships among nodes. Understanding the behaviour… (more)

Subjects/Keywords: ranking; social networks; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sangi, F. (2011). Ranking entities in heterogeneous multiple relation social networks using random walks. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/ft848r479

Chicago Manual of Style (16th Edition):

Sangi, Farzad. “Ranking entities in heterogeneous multiple relation social networks using random walks.” 2011. Masters Thesis, University of Alberta. Accessed July 16, 2020. https://era.library.ualberta.ca/files/ft848r479.

MLA Handbook (7th Edition):

Sangi, Farzad. “Ranking entities in heterogeneous multiple relation social networks using random walks.” 2011. Web. 16 Jul 2020.

Vancouver:

Sangi F. Ranking entities in heterogeneous multiple relation social networks using random walks. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Jul 16]. Available from: https://era.library.ualberta.ca/files/ft848r479.

Council of Science Editors:

Sangi F. Ranking entities in heterogeneous multiple relation social networks using random walks. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/ft848r479


University of Waterloo

2. Karimi, Amir-Hossein. Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes.

Degree: 2018, University of Waterloo

 The story of this work is dimensionality reduction. Dimensionality reduction is a method that takes as input a point-set P of n points in R^d… (more)

Subjects/Keywords: Random Projections; Dimensionality Reduction; Nonlinear Random Projections; Biologically Inspired Random Projections; Supervised Random Projections; Deep Learning; Random-weighted Neural Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karimi, A. (2018). Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13220

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):

Karimi, Amir-Hossein. “Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes.” 2018. Thesis, University of Waterloo. Accessed July 16, 2020. http://hdl.handle.net/10012/13220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Karimi, Amir-Hossein. “Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes.” 2018. Web. 16 Jul 2020.

Vancouver:

Karimi A. Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10012/13220.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karimi A. Exploring New Forms of Random Projections for Prediction and Dimensionality Reduction in Big-Data Regimes. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13220

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

3. Dautov, Ruslan. Efficient collision resolution protocol for highly populated wireless networks.

Degree: Electrical Engineering, 2011, Rochester Institute of Technology

 An efficient Medium access control (MAC) protocol is an important part of every wireless system. It prevents multiple devices from accessing the channel at the… (more)

Subjects/Keywords: MAC protocol; Random channel access; Wireless networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dautov, R. (2011). Efficient collision resolution protocol for highly populated wireless networks. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/1239

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):

Dautov, Ruslan. “Efficient collision resolution protocol for highly populated wireless networks.” 2011. Thesis, Rochester Institute of Technology. Accessed July 16, 2020. https://scholarworks.rit.edu/theses/1239.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dautov, Ruslan. “Efficient collision resolution protocol for highly populated wireless networks.” 2011. Web. 16 Jul 2020.

Vancouver:

Dautov R. Efficient collision resolution protocol for highly populated wireless networks. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2020 Jul 16]. Available from: https://scholarworks.rit.edu/theses/1239.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dautov R. Efficient collision resolution protocol for highly populated wireless networks. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/1239

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

4. Parikh, Nidhi Kiranbhai. Generating Random Graphs with Tunable Clustering Coefficient.

Degree: MS, Computer Science, 2011, Virginia Tech

 Most real-world networks exhibit a high clustering coefficientâ the probability that two neighbors of a node are also neighbors of each other. We propose four… (more)

Subjects/Keywords: Clustering coefficient; complex networks; random graphs; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Parikh, N. K. (2011). Generating Random Graphs with Tunable Clustering Coefficient. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31591

Chicago Manual of Style (16th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Masters Thesis, Virginia Tech. Accessed July 16, 2020. http://hdl.handle.net/10919/31591.

MLA Handbook (7th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Web. 16 Jul 2020.

Vancouver:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10919/31591.

Council of Science Editors:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/31591

5. Fletcher, Robert Brian. Energy efficient compressed sensing in wireless sensor networks via random walk.

Degree: 2011, University of Tennessee – Chattanooga

 In this paper, we explore the problem of data acquisition using compressive sensing (CS) in wireless sensor networks. Unique properties of wireless sensor networks require… (more)

Subjects/Keywords: Random walks (Mathematics); Wireless sensor networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fletcher, R. B. (2011). Energy efficient compressed sensing in wireless sensor networks via random walk. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/65

Chicago Manual of Style (16th Edition):

Fletcher, Robert Brian. “Energy efficient compressed sensing in wireless sensor networks via random walk.” 2011. Masters Thesis, University of Tennessee – Chattanooga. Accessed July 16, 2020. https://scholar.utc.edu/theses/65.

MLA Handbook (7th Edition):

Fletcher, Robert Brian. “Energy efficient compressed sensing in wireless sensor networks via random walk.” 2011. Web. 16 Jul 2020.

Vancouver:

Fletcher RB. Energy efficient compressed sensing in wireless sensor networks via random walk. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2011. [cited 2020 Jul 16]. Available from: https://scholar.utc.edu/theses/65.

Council of Science Editors:

Fletcher RB. Energy efficient compressed sensing in wireless sensor networks via random walk. [Masters Thesis]. University of Tennessee – Chattanooga; 2011. Available from: https://scholar.utc.edu/theses/65


University of Illinois – Urbana-Champaign

6. Lu, Liqun. Analysis and operations in complex networked systems: From urban infrastructure to epidemics.

Degree: PhD, Civil Engineering, 2019, University of Illinois – Urbana-Champaign

 Many real-world systems run with underlying complex networked structures, and system disruptions or signals of many sorts are transmitted along these networks. This dissertation aims… (more)

Subjects/Keywords: interdependent infrastructure systems; epidemic control; random networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lu, L. (2019). Analysis and operations in complex networked systems: From urban infrastructure to epidemics. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/104880

Chicago Manual of Style (16th Edition):

Lu, Liqun. “Analysis and operations in complex networked systems: From urban infrastructure to epidemics.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 16, 2020. http://hdl.handle.net/2142/104880.

MLA Handbook (7th Edition):

Lu, Liqun. “Analysis and operations in complex networked systems: From urban infrastructure to epidemics.” 2019. Web. 16 Jul 2020.

Vancouver:

Lu L. Analysis and operations in complex networked systems: From urban infrastructure to epidemics. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2142/104880.

Council of Science Editors:

Lu L. Analysis and operations in complex networked systems: From urban infrastructure to epidemics. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/104880


University of Technology, Sydney

7. Lam, Sinh Cong. Performance analysis of fractional frequency reuse in random cellular networks.

Degree: 2018, University of Technology, Sydney

 In a Long Term Evolution (LTE) cellular network, Fractional Frequency Reuse (FFR) is a promising technique that improves the performance of mobile users which experience… (more)

Subjects/Keywords: Fractional frequency reuse.; Uplink cellular networks.; Downlink random cellular networks.; FFR random cellular network.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lam, S. C. (2018). Performance analysis of fractional frequency reuse in random cellular networks. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/127880

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):

Lam, Sinh Cong. “Performance analysis of fractional frequency reuse in random cellular networks.” 2018. Thesis, University of Technology, Sydney. Accessed July 16, 2020. http://hdl.handle.net/10453/127880.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lam, Sinh Cong. “Performance analysis of fractional frequency reuse in random cellular networks.” 2018. Web. 16 Jul 2020.

Vancouver:

Lam SC. Performance analysis of fractional frequency reuse in random cellular networks. [Internet] [Thesis]. University of Technology, Sydney; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10453/127880.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lam SC. Performance analysis of fractional frequency reuse in random cellular networks. [Thesis]. University of Technology, Sydney; 2018. Available from: http://hdl.handle.net/10453/127880

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Lund

8. Ajazi, Fioralba. Random geometric graphs and their applications in neuronal modelling.

Degree: 2018, University of Lund

Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons… (more)

Subjects/Keywords: Mathematics; Probability Theory and Statistics; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ajazi, F. (2018). Random geometric graphs and their applications in neuronal modelling. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf

Chicago Manual of Style (16th Edition):

Ajazi, Fioralba. “Random geometric graphs and their applications in neuronal modelling.” 2018. Doctoral Dissertation, University of Lund. Accessed July 16, 2020. https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf.

MLA Handbook (7th Edition):

Ajazi, Fioralba. “Random geometric graphs and their applications in neuronal modelling.” 2018. Web. 16 Jul 2020.

Vancouver:

Ajazi F. Random geometric graphs and their applications in neuronal modelling. [Internet] [Doctoral dissertation]. University of Lund; 2018. [cited 2020 Jul 16]. Available from: https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf.

Council of Science Editors:

Ajazi F. Random geometric graphs and their applications in neuronal modelling. [Doctoral Dissertation]. University of Lund; 2018. Available from: https://lup.lub.lu.se/record/b68cb74f-3fa5-4260-a7c4-1d2a4bb33507 ; https://portal.research.lu.se/ws/files/50587728/PhD_thesis_F.pdf


Rutgers University

9. Kion-Crosby, Willow B., 1991-. First-passage dynamics of random walks on complex and mutational codon networks.

Degree: PhD, Physics and Astronomy, 2019, Rutgers University

 The first three chapters of this dissertation describe a novel Bayesian methodology which uses random walk sampling for rapid inference of the statistical properties of… (more)

Subjects/Keywords: Complex networks; Computer networks  – Statistical methods; Random walks (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kion-Crosby, Willow B., 1. (2019). First-passage dynamics of random walks on complex and mutational codon networks. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/61780/

Chicago Manual of Style (16th Edition):

Kion-Crosby, Willow B., 1991-. “First-passage dynamics of random walks on complex and mutational codon networks.” 2019. Doctoral Dissertation, Rutgers University. Accessed July 16, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/61780/.

MLA Handbook (7th Edition):

Kion-Crosby, Willow B., 1991-. “First-passage dynamics of random walks on complex and mutational codon networks.” 2019. Web. 16 Jul 2020.

Vancouver:

Kion-Crosby, Willow B. 1. First-passage dynamics of random walks on complex and mutational codon networks. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2020 Jul 16]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61780/.

Council of Science Editors:

Kion-Crosby, Willow B. 1. First-passage dynamics of random walks on complex and mutational codon networks. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61780/


University of Notre Dame

10. Soon-Hyung Yook. From the Topology to the Dynamics of Complex Networks</h1>.

Degree: Physics, 2004, University of Notre Dame

  Understanding the mechanisms governing the behavior of complex networks is a prerequisite for characterizing complex systems. Frequently, networks are modelled as unweighted graphs in… (more)

Subjects/Keywords: Random Networks; Biological Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yook, S. (2004). From the Topology to the Dynamics of Complex Networks</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/nv935140w9x

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):

Yook, Soon-Hyung. “From the Topology to the Dynamics of Complex Networks</h1>.” 2004. Thesis, University of Notre Dame. Accessed July 16, 2020. https://curate.nd.edu/show/nv935140w9x.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yook, Soon-Hyung. “From the Topology to the Dynamics of Complex Networks</h1>.” 2004. Web. 16 Jul 2020.

Vancouver:

Yook S. From the Topology to the Dynamics of Complex Networks</h1>. [Internet] [Thesis]. University of Notre Dame; 2004. [cited 2020 Jul 16]. Available from: https://curate.nd.edu/show/nv935140w9x.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yook S. From the Topology to the Dynamics of Complex Networks</h1>. [Thesis]. University of Notre Dame; 2004. Available from: https://curate.nd.edu/show/nv935140w9x

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Portland State University

11. Damera, Prateen Reddy. A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture.

Degree: MS(M.S.) in Electrical and Computer Engineering, Electrical and Computer Engineering, 2011, Portland State University

  With the transition from single-core to multi-core computing and CMOS technology reaching its physical limits, new computing architectures which are scalable, robust, and low-power… (more)

Subjects/Keywords: Nanoarchitecture; Random Boolean networks; Small-world Networks; Computer networks  – Evaluation; Computer architecture; Cellular automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Damera, P. R. (2011). A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture. (Masters Thesis). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/670

Chicago Manual of Style (16th Edition):

Damera, Prateen Reddy. “A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture.” 2011. Masters Thesis, Portland State University. Accessed July 16, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/670.

MLA Handbook (7th Edition):

Damera, Prateen Reddy. “A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture.” 2011. Web. 16 Jul 2020.

Vancouver:

Damera PR. A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture. [Internet] [Masters thesis]. Portland State University; 2011. [cited 2020 Jul 16]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/670.

Council of Science Editors:

Damera PR. A low level analysis of Cellular Automata and Random Boolean Networks as a computational architecture. [Masters Thesis]. Portland State University; 2011. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/670


Carnegie Mellon University

12. Kruzick, Stephen M. Optimal Graph Filter Design for Large-Scale Random Networks.

Degree: 2018, Carnegie Mellon University

 Graph signal processing analyzes signals supported on the nodes of a network with respect to a shift operator matrix that conforms to the graph structure.… (more)

Subjects/Keywords: distributed average consensus; filter design; graph signal processing; random matrix theory; random networks; spectral asymptotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kruzick, S. M. (2018). Optimal Graph Filter Design for Large-Scale Random Networks. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/1165

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):

Kruzick, Stephen M. “Optimal Graph Filter Design for Large-Scale Random Networks.” 2018. Thesis, Carnegie Mellon University. Accessed July 16, 2020. http://repository.cmu.edu/dissertations/1165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kruzick, Stephen M. “Optimal Graph Filter Design for Large-Scale Random Networks.” 2018. Web. 16 Jul 2020.

Vancouver:

Kruzick SM. Optimal Graph Filter Design for Large-Scale Random Networks. [Internet] [Thesis]. Carnegie Mellon University; 2018. [cited 2020 Jul 16]. Available from: http://repository.cmu.edu/dissertations/1165.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kruzick SM. Optimal Graph Filter Design for Large-Scale Random Networks. [Thesis]. Carnegie Mellon University; 2018. Available from: http://repository.cmu.edu/dissertations/1165

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Cranfield University

13. Taalab, Khaled Paul. Modelling Soil Bulk Density using Data-Mining and Expert Knowledge.

Degree: PhD, 2013, Cranfield University

 Data about the spatial variation of soil attributes is required to address a great number of environmental issues, such as improving water quality, flood mitigation,… (more)

Subjects/Keywords: Bayesian networks; Random Forest; Artificial Neural Networks; Carbon Stocks; Elicitation; Soil Taxonomy; Legacy Data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Taalab, K. P. (2013). Modelling Soil Bulk Density using Data-Mining and Expert Knowledge. (Doctoral Dissertation). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/8273

Chicago Manual of Style (16th Edition):

Taalab, Khaled Paul. “Modelling Soil Bulk Density using Data-Mining and Expert Knowledge.” 2013. Doctoral Dissertation, Cranfield University. Accessed July 16, 2020. http://dspace.lib.cranfield.ac.uk/handle/1826/8273.

MLA Handbook (7th Edition):

Taalab, Khaled Paul. “Modelling Soil Bulk Density using Data-Mining and Expert Knowledge.” 2013. Web. 16 Jul 2020.

Vancouver:

Taalab KP. Modelling Soil Bulk Density using Data-Mining and Expert Knowledge. [Internet] [Doctoral dissertation]. Cranfield University; 2013. [cited 2020 Jul 16]. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8273.

Council of Science Editors:

Taalab KP. Modelling Soil Bulk Density using Data-Mining and Expert Knowledge. [Doctoral Dissertation]. Cranfield University; 2013. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8273


Cranfield University

14. Taalab, Khaled Paul. Modelling soil bulk density using data-mining and expert knowledge.

Degree: PhD, 2013, Cranfield University

 Data about the spatial variation of soil attributes is required to address a great number of environmental issues, such as improving water quality, flood mitigation,… (more)

Subjects/Keywords: 631.4; Bayesian networks; Random Forest; Artificial Neural Networks; Carbon Stocks; Elicitation; Soil Taxonomy; Legacy Data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Taalab, K. P. (2013). Modelling soil bulk density using data-mining and expert knowledge. (Doctoral Dissertation). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/8273 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590412

Chicago Manual of Style (16th Edition):

Taalab, Khaled Paul. “Modelling soil bulk density using data-mining and expert knowledge.” 2013. Doctoral Dissertation, Cranfield University. Accessed July 16, 2020. http://dspace.lib.cranfield.ac.uk/handle/1826/8273 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590412.

MLA Handbook (7th Edition):

Taalab, Khaled Paul. “Modelling soil bulk density using data-mining and expert knowledge.” 2013. Web. 16 Jul 2020.

Vancouver:

Taalab KP. Modelling soil bulk density using data-mining and expert knowledge. [Internet] [Doctoral dissertation]. Cranfield University; 2013. [cited 2020 Jul 16]. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8273 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590412.

Council of Science Editors:

Taalab KP. Modelling soil bulk density using data-mining and expert knowledge. [Doctoral Dissertation]. Cranfield University; 2013. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8273 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.590412


Tampere University

15. Mäkipörhölä, Miikka. Machine learning methods for manufacturing .

Degree: 2019, Tampere University

 Machine learning methods have become increasingly popular with the release of numerous open-source tools and libraries. Nevertheless the adoption of these techniques for use in… (more)

Subjects/Keywords: machine learning; support vector regression; random forest; neural networks; NARX neural networks; manufacturing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mäkipörhölä, M. (2019). Machine learning methods for manufacturing . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/105651

Chicago Manual of Style (16th Edition):

Mäkipörhölä, Miikka. “Machine learning methods for manufacturing .” 2019. Masters Thesis, Tampere University. Accessed July 16, 2020. https://trepo.tuni.fi/handle/10024/105651.

MLA Handbook (7th Edition):

Mäkipörhölä, Miikka. “Machine learning methods for manufacturing .” 2019. Web. 16 Jul 2020.

Vancouver:

Mäkipörhölä M. Machine learning methods for manufacturing . [Internet] [Masters thesis]. Tampere University; 2019. [cited 2020 Jul 16]. Available from: https://trepo.tuni.fi/handle/10024/105651.

Council of Science Editors:

Mäkipörhölä M. Machine learning methods for manufacturing . [Masters Thesis]. Tampere University; 2019. Available from: https://trepo.tuni.fi/handle/10024/105651


Stellenbosch University

16. Taha, Samah M. Osman. Small-world network models and their average path length.

Degree: MSc, Mathematical Sciences, 2014, Stellenbosch University

ENGLISH ABSTRACT: Socially-based networks are of particular interest amongst the variety of communication networks arising in reality. They are distinguished by having small average path… (more)

Subjects/Keywords: Network topology; Small-world networks; Real-world networks; Erdos-Renyi random network models; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Taha, S. M. O. (2014). Small-world network models and their average path length. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/95834

Chicago Manual of Style (16th Edition):

Taha, Samah M Osman. “Small-world network models and their average path length.” 2014. Masters Thesis, Stellenbosch University. Accessed July 16, 2020. http://hdl.handle.net/10019.1/95834.

MLA Handbook (7th Edition):

Taha, Samah M Osman. “Small-world network models and their average path length.” 2014. Web. 16 Jul 2020.

Vancouver:

Taha SMO. Small-world network models and their average path length. [Internet] [Masters thesis]. Stellenbosch University; 2014. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10019.1/95834.

Council of Science Editors:

Taha SMO. Small-world network models and their average path length. [Masters Thesis]. Stellenbosch University; 2014. Available from: http://hdl.handle.net/10019.1/95834


University of Melbourne

17. Wijesundera, Isuri Hansika. Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments.

Degree: 2015, University of Melbourne

 Predicting the expected time for a random walker to reach a specific target point in composite inhomogeneous media has been researched on for decades due… (more)

Subjects/Keywords: MFPT; random walks; natural disaster prediction; metastable systems; biased networks; inhomogeneous networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wijesundera, I. H. (2015). Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/91289

Chicago Manual of Style (16th Edition):

Wijesundera, Isuri Hansika. “Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments.” 2015. Doctoral Dissertation, University of Melbourne. Accessed July 16, 2020. http://hdl.handle.net/11343/91289.

MLA Handbook (7th Edition):

Wijesundera, Isuri Hansika. “Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments.” 2015. Web. 16 Jul 2020.

Vancouver:

Wijesundera IH. Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/11343/91289.

Council of Science Editors:

Wijesundera IH. Estimation of mean first passage time (MFPT) in naturally biased inhomogeneous environments. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/91289

18. Nanumyan, Vahan. Structure and Dynamics of Collaborative Knowledge Networks.

Degree: 2018, ETH Zürich

 A major means to encode and share scientific knowledge are publications, which cite each other and which are authored by one or more scientists. Citation… (more)

Subjects/Keywords: random graph models; complex networks; citation network; Collaboration networks; info:eu-repo/classification/ddc/370; Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nanumyan, V. (2018). Structure and Dynamics of Collaborative Knowledge Networks. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/282134

Chicago Manual of Style (16th Edition):

Nanumyan, Vahan. “Structure and Dynamics of Collaborative Knowledge Networks.” 2018. Doctoral Dissertation, ETH Zürich. Accessed July 16, 2020. http://hdl.handle.net/20.500.11850/282134.

MLA Handbook (7th Edition):

Nanumyan, Vahan. “Structure and Dynamics of Collaborative Knowledge Networks.” 2018. Web. 16 Jul 2020.

Vancouver:

Nanumyan V. Structure and Dynamics of Collaborative Knowledge Networks. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/20.500.11850/282134.

Council of Science Editors:

Nanumyan V. Structure and Dynamics of Collaborative Knowledge Networks. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/282134


University of Alberta

19. Li, Yin. A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models.

Degree: MS, Department of Mathematical and Statistical Sciences, 2010, University of Alberta

 Exponential Random Graph Models (ERGMs) have been developed for fitting social network data on both static and dynamic levels. However, the lack of large sample… (more)

Subjects/Keywords: Social Networks; Goodness of fit; Exponential Random Graph Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, Y. (2010). A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/2f75r8056

Chicago Manual of Style (16th Edition):

Li, Yin. “A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models.” 2010. Masters Thesis, University of Alberta. Accessed July 16, 2020. https://era.library.ualberta.ca/files/2f75r8056.

MLA Handbook (7th Edition):

Li, Yin. “A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models.” 2010. Web. 16 Jul 2020.

Vancouver:

Li Y. A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2020 Jul 16]. Available from: https://era.library.ualberta.ca/files/2f75r8056.

Council of Science Editors:

Li Y. A simulation-based approach to assess the goodness of fit of Exponential Random Graph Models. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/2f75r8056


Texas A&M University

20. Reddy, Chandan Rama. Capacity Proportional Unstructured Peer-to-Peer Networks.

Degree: 2010, Texas A&M University

 Existing methods to utilize capacity-heterogeneity in a P2P system either rely on constructing special overlays with capacity-proportional node degree or use topology adaptation to match… (more)

Subjects/Keywords: P2P; heterogeneous networks; random walks; Metropolis-Hastings algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reddy, C. R. (2010). Capacity Proportional Unstructured Peer-to-Peer Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878

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):

Reddy, Chandan Rama. “Capacity Proportional Unstructured Peer-to-Peer Networks.” 2010. Thesis, Texas A&M University. Accessed July 16, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Reddy, Chandan Rama. “Capacity Proportional Unstructured Peer-to-Peer Networks.” 2010. Web. 16 Jul 2020.

Vancouver:

Reddy CR. Capacity Proportional Unstructured Peer-to-Peer Networks. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Reddy CR. Capacity Proportional Unstructured Peer-to-Peer Networks. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

21. MARILY APARECIDA BENICIO. CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS.

Degree: 2013, UNIVERSIDADE ESTADUAL DE PONTA GROSSA

Os estudos sobre redes complexas nos auxiliam a compreender e modelar muitas situações do mundo real. O mundo é abundante em redes que podem ser… (more)

Subjects/Keywords: redes complexas; caminhada aleatória; centralidade; complex networks; random walk; centrality; FISICA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

BENICIO, M. A. (2013). CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS. (Thesis). UNIVERSIDADE ESTADUAL DE PONTA GROSSA. Retrieved from http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=938

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):

BENICIO, MARILY APARECIDA. “CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS.” 2013. Thesis, UNIVERSIDADE ESTADUAL DE PONTA GROSSA. Accessed July 16, 2020. http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=938.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

BENICIO, MARILY APARECIDA. “CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS.” 2013. Web. 16 Jul 2020.

Vancouver:

BENICIO MA. CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS. [Internet] [Thesis]. UNIVERSIDADE ESTADUAL DE PONTA GROSSA; 2013. [cited 2020 Jul 16]. Available from: http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=938.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

BENICIO MA. CENTRALIDADE DA CAMINHADA ALEATÓRIA EM REDES COMPLEXAS. [Thesis]. UNIVERSIDADE ESTADUAL DE PONTA GROSSA; 2013. Available from: http://www.bicen-tede.uepg.br/tde_busca/arquivo.php?codArquivo=938

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Bowling Green State University

22. Mandere, Edward Ondieki. Financial Networks and Their Applications to the Stock Market.

Degree: MS, Physics, 2009, Bowling Green State University

 Complex networks exist in many different fields of study. Recently financial networks have garnered a lot of interest mainly as a way of visualizing the… (more)

Subjects/Keywords: Physics; econophysics; Correlation Matrices; Correlation Networks; Random Matrix Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mandere, E. O. (2009). Financial Networks and Their Applications to the Stock Market. (Masters Thesis). Bowling Green State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1234473233

Chicago Manual of Style (16th Edition):

Mandere, Edward Ondieki. “Financial Networks and Their Applications to the Stock Market.” 2009. Masters Thesis, Bowling Green State University. Accessed July 16, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1234473233.

MLA Handbook (7th Edition):

Mandere, Edward Ondieki. “Financial Networks and Their Applications to the Stock Market.” 2009. Web. 16 Jul 2020.

Vancouver:

Mandere EO. Financial Networks and Their Applications to the Stock Market. [Internet] [Masters thesis]. Bowling Green State University; 2009. [cited 2020 Jul 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1234473233.

Council of Science Editors:

Mandere EO. Financial Networks and Their Applications to the Stock Market. [Masters Thesis]. Bowling Green State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1234473233


NSYSU

23. Li, Wei-shuo. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.

Degree: PhD, Computer Science and Engineering, 2010, NSYSU

 In this thesis, we present analytical analysis of key distribution schemes on wireless sensor networks. Since wireless sensor network is under unreliable environment, many random(more)

Subjects/Keywords: Wireless sensor networks; random key pre-distribution; regularity lemma

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Li, W. (2010). Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007

Chicago Manual of Style (16th Edition):

Li, Wei-shuo. “Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.” 2010. Doctoral Dissertation, NSYSU. Accessed July 16, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007.

MLA Handbook (7th Edition):

Li, Wei-shuo. “Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks.” 2010. Web. 16 Jul 2020.

Vancouver:

Li W. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2020 Jul 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007.

Council of Science Editors:

Li W. Probabilistic Analysis and Threshold Investigations of Random Key Pre-distribution based Wireless Sensor Networks. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-162007


NSYSU

24. Cheng, Chiao-lin. Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers.

Degree: Master, Communications Engineering, 2016, NSYSU

 Wireless sensor networks (WSNs) have been deployed for many applications, such as battlefield monitoring and smart home systems. Since the sensor nodes in a WSN… (more)

Subjects/Keywords: Wireless sensor networks; random field; reconstruction; Eavesdropper; estimate

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cheng, C. (2016). Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0611116-193816

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):

Cheng, Chiao-lin. “Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers.” 2016. Thesis, NSYSU. Accessed July 16, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0611116-193816.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cheng, Chiao-lin. “Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers.” 2016. Web. 16 Jul 2020.

Vancouver:

Cheng C. Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers. [Internet] [Thesis]. NSYSU; 2016. [cited 2020 Jul 16]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0611116-193816.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheng C. Secure Area Design for Signal Reconstruction in a Random Field in the Presence of Eavesdroppers. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0611116-193816

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

25. Anyanwu, Uchenna Kevin. A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms.

Degree: MS, Electrical and Computer Engineering, 2012, Virginia Tech

 Wireless communications technology ranging from satellite communications to sensor networks has benefited from the development of flexible, SDR platforms. SDR is used for military applications… (more)

Subjects/Keywords: Random Access MAC; Wireless Networks; Software Defined Radio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Anyanwu, U. K. (2012). A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33744

Chicago Manual of Style (16th Edition):

Anyanwu, Uchenna Kevin. “A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms.” 2012. Masters Thesis, Virginia Tech. Accessed July 16, 2020. http://hdl.handle.net/10919/33744.

MLA Handbook (7th Edition):

Anyanwu, Uchenna Kevin. “A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms.” 2012. Web. 16 Jul 2020.

Vancouver:

Anyanwu UK. A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10919/33744.

Council of Science Editors:

Anyanwu UK. A Reconfigurable Random Access MAC Implementation for Software Defined Radio Platforms. [Masters Thesis]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/33744


Virginia Tech

26. Alam, Md Maksudul. HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems.

Degree: PhD, Computer Science, 2016, Virginia Tech

 The advancement of modern technologies has resulted in an explosive growth of complex systems, such as the Internet, biological, social, and various infrastructure networks, which… (more)

Subjects/Keywords: Network Science; Parallel Algorithms; High Performance Computing; Random Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alam, M. M. (2016). HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/73582

Chicago Manual of Style (16th Edition):

Alam, Md Maksudul. “HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems.” 2016. Doctoral Dissertation, Virginia Tech. Accessed July 16, 2020. http://hdl.handle.net/10919/73582.

MLA Handbook (7th Edition):

Alam, Md Maksudul. “HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems.” 2016. Web. 16 Jul 2020.

Vancouver:

Alam MM. HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems. [Internet] [Doctoral dissertation]. Virginia Tech; 2016. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10919/73582.

Council of Science Editors:

Alam MM. HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems. [Doctoral Dissertation]. Virginia Tech; 2016. Available from: http://hdl.handle.net/10919/73582


University of North Carolina – Greensboro

27. Da, Rui. A method of determining culture related users using computation of correlation.

Degree: 2015, University of North Carolina – Greensboro

 The provision of security on most of computer networks is based on the obtaining and exchange of a unique key between the communicating parties. It… (more)

Subjects/Keywords: Computer networks – Security measures; Random number generators – Computer programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Da, R. (2015). A method of determining culture related users using computation of correlation. (Masters Thesis). University of North Carolina – Greensboro. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=18114

Chicago Manual of Style (16th Edition):

Da, Rui. “A method of determining culture related users using computation of correlation.” 2015. Masters Thesis, University of North Carolina – Greensboro. Accessed July 16, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=18114.

MLA Handbook (7th Edition):

Da, Rui. “A method of determining culture related users using computation of correlation.” 2015. Web. 16 Jul 2020.

Vancouver:

Da R. A method of determining culture related users using computation of correlation. [Internet] [Masters thesis]. University of North Carolina – Greensboro; 2015. [cited 2020 Jul 16]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=18114.

Council of Science Editors:

Da R. A method of determining culture related users using computation of correlation. [Masters Thesis]. University of North Carolina – Greensboro; 2015. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=18114


Boston University

28. Bhat, Uttam. The non-equilibrium statistical physics of stochastic search, foraging and clustering.

Degree: PhD, Physics, 2017, Boston University

 This dissertation explores two themes central to the field of non-equilibrium statistical physics. The first is centered around the use of random walks, first-passage processes,… (more)

Subjects/Keywords: Physics; Clustered networks; Foraging; Lattice foraging; Random walks; Statistical physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bhat, U. (2017). The non-equilibrium statistical physics of stochastic search, foraging and clustering. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/27361

Chicago Manual of Style (16th Edition):

Bhat, Uttam. “The non-equilibrium statistical physics of stochastic search, foraging and clustering.” 2017. Doctoral Dissertation, Boston University. Accessed July 16, 2020. http://hdl.handle.net/2144/27361.

MLA Handbook (7th Edition):

Bhat, Uttam. “The non-equilibrium statistical physics of stochastic search, foraging and clustering.” 2017. Web. 16 Jul 2020.

Vancouver:

Bhat U. The non-equilibrium statistical physics of stochastic search, foraging and clustering. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/2144/27361.

Council of Science Editors:

Bhat U. The non-equilibrium statistical physics of stochastic search, foraging and clustering. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/27361


University of New South Wales

29. Levenkova, Natalya. Applications of graph theory to real-world networks.

Degree: Mathematics & Statistics, 2014, University of New South Wales

 We apply graph theory to two problems involving real-world networks. The firstproblem is to model sexual contact networks, while the second involves criminal networks.The structure… (more)

Subjects/Keywords: Contact networks; Graph theory; Epidemiology; Random graphs; Stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Levenkova, N. (2014). Applications of graph theory to real-world networks. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Levenkova, Natalya. “Applications of graph theory to real-world networks.” 2014. Masters Thesis, University of New South Wales. Accessed July 16, 2020. http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true.

MLA Handbook (7th Edition):

Levenkova, Natalya. “Applications of graph theory to real-world networks.” 2014. Web. 16 Jul 2020.

Vancouver:

Levenkova N. Applications of graph theory to real-world networks. [Internet] [Masters thesis]. University of New South Wales; 2014. [cited 2020 Jul 16]. Available from: http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true.

Council of Science Editors:

Levenkova N. Applications of graph theory to real-world networks. [Masters Thesis]. University of New South Wales; 2014. Available from: http://handle.unsw.edu.au/1959.4/53918 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:12628/SOURCE02?view=true


University of Waterloo

30. Kulmatitskiy, Nikolay. Modeling Dynamic Network with Centrality-based Logistic Regression.

Degree: 2011, University of Waterloo

 Statistical analysis of network data is an active field of study, in which researchers inves- tigate graph-theoretic concepts and various probability models that explain the… (more)

Subjects/Keywords: Dynamic Networks; Network Analysis; Centrality; Exponential Random Graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kulmatitskiy, N. (2011). Modeling Dynamic Network with Centrality-based Logistic Regression. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6290

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):

Kulmatitskiy, Nikolay. “Modeling Dynamic Network with Centrality-based Logistic Regression.” 2011. Thesis, University of Waterloo. Accessed July 16, 2020. http://hdl.handle.net/10012/6290.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kulmatitskiy, Nikolay. “Modeling Dynamic Network with Centrality-based Logistic Regression.” 2011. Web. 16 Jul 2020.

Vancouver:

Kulmatitskiy N. Modeling Dynamic Network with Centrality-based Logistic Regression. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Jul 16]. Available from: http://hdl.handle.net/10012/6290.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kulmatitskiy N. Modeling Dynamic Network with Centrality-based Logistic Regression. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6290

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] [6] [7] [8] [9]

.