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:(Node content ). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Technology, Sydney

1. Guo, T. Real-time analytics for complex structure data.

Degree: 2015, University of Technology, Sydney

The advancement of data acquisition and analysis technology has resulted in many real-world data being dynamic and containing rich content and structured information. More specifically, with the fast development of information technology, many current real-world data are always featured with dynamic changes, such as new instances, new nodes and edges, and modifications to the node content. Different from traditional data, which are represented as feature vectors, data with complex relationships are often represented as graphs to denote the content of the data entries and their structural relationships, where instances (nodes) are not only characterized by the content but are also subject to dependency relationships. Plus, real-time availability is one of outstanding features of today’s data. Real-time analytics is dynamic analysis and reporting based on data entered into a system before the actual time of use. Real-time analytics emphasizes on deriving immediate knowledge from dynamic data sources, such as data streams, and knowledge discovery and pattern mining are facing complex, dynamic data sources. However, how to combine structure information and node content information for accurate and real-time data mining is still a big challenge. Accordingly, this thesis focuses on real-time analytics for complex structure data. We explore instance correlation in complex structure data and utilises it to make mining tasks more accurate and applicable. To be specific, our objective is to combine node correlation with node content and utilize them for three different tasks, including (1) graph stream classification, (2) super-graph classification and clustering, and (3) streaming network node classification. Understanding the role of structured patterns for graph classification: the thesis introduces existing works on data mining from an complex structured perspective. Then we propose a graph factorization-based fine-grained representation model, where the main objective is to use linear combinations of a set of discriminative cliques to represent graphs for learning. The optimization-oriented factorization approach ensures minimum information loss for graph representation, and also avoids the expensive sub-graph isomorphism validation process. Based on this idea, we propose a novel framework for fast graph stream classification. A new structure data classification algorithm: The second method introduces a new super-graph classification and clustering problem. Due to the inherent complex structure representation, all existing graph classification methods cannot be applied to super-graph classification. In the thesis, we propose a weighted random walk kernel which calculates the similarity between two super-graphs by assessing (a) the similarity between super-nodes of the super-graphs, and (b) the common walks of the super-graphs. Our key contribution is: (1) a new super-node and super-graph structure to enrich existing graph representation for real-world applications; (2) a weighted random walk kernel considering node and…

Subjects/Keywords: Data acquisition and analysis.; Complex structure data.; Real-time availability of data.; Data streams.; Node correlation.; Node content.; Super-node and super-graph structure.; Optimization-oriented factorization approach.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, T. (2015). Real-time analytics for complex structure data. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/38990

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

Guo, T. “Real-time analytics for complex structure data.” 2015. Thesis, University of Technology, Sydney. Accessed January 17, 2020. http://hdl.handle.net/10453/38990.

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

MLA Handbook (7th Edition):

Guo, T. “Real-time analytics for complex structure data.” 2015. Web. 17 Jan 2020.

Vancouver:

Guo T. Real-time analytics for complex structure data. [Internet] [Thesis]. University of Technology, Sydney; 2015. [cited 2020 Jan 17]. Available from: http://hdl.handle.net/10453/38990.

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

Council of Science Editors:

Guo T. Real-time analytics for complex structure data. [Thesis]. University of Technology, Sydney; 2015. Available from: http://hdl.handle.net/10453/38990

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


Indian Institute of Science

2. Aggarwal, Saurabh. Content Distribution in Social Groups.

Degree: 2014, Indian Institute of Science

We study Social Groups consisting of self-interested inter-connected nodes looking for common content. We can observe Social Groups in various socio-technological networks, such as Cellular Network assisted Device-to-Device communications, Cloud assisted Peer-to-Peer Networks, hybrid Peer-to-Peer Content Distribution Networks and Direct Connect Networks. Each node wants to acquire a universe of segments at least cost. Nodes can either access an expensive link to the content distributor for downloading data segments, or use the well-connected low cost inter-node network for exchanging segments among themselves. Activation of an inter-node link requires cooperation among the participating nodes and reduces the cost of downloading for the nodes. However, due to uploading costs, Non-Reciprocating Nodes are reluctant to upload segments, in spite of their interest in downloading segments from others. We define the Give-and-Take (GT) criterion, which prohibits non-reciprocating behaviour in Social Groups for all nodes at all instants. In the “Full Exchange” case studied, two nodes can exchange copies of their entire segment sets, if each node gains at least one new segment from the other. Incorporating the GT criterion in the Social Group, we study the problem of downloading the universe at least cost, from the perspective of a new node having no data segments. We analyze this NP-hard problem, and propose algorithms for choosing the initial segments to be downloaded from the content distributor and the sequence of nodes for exchange. We compare the performance of these algorithms with a few existing P2P downloading strategies in terms of cost and running time. In the second problem, we attempt to reduce the load on the content distributor by choosing a schedule of inter-node link activations such that the number of nodes with the universe is maximized. Link activation decisions are taken by a central entity, the facilitator, for achieving the social optimum. We present the asymptotically optimal Randomized algorithm. We also present other algorithms, such as the Greedy Links algorithm and the Polygon algorithm, which are optimal under special scenarios of interest. We compare the performances of all proposed algorithms with the optimal value of the objective. We observe that computationally intensive algorithms exhibit better performance. Further, we consider the problem of decentralized scheduling of links. The decisions of link activations are made by the participating nodes in a distributed manner. While conforming to the GT criterion for inter-node exchanges, each node's objective is to maximize its utility. Each node tries to find a pairing partner by preferentially exploring nodes for link formation. Unpaired nodes choose to download a segment using the expensive link with Segment Aggressiveness Probability (SAP). We present linear complexity decentralized algorithms for nodes to choose their best strategy. We present a decentralized randomized algorithm that works in the absence of the facilitator and performs… Advisors/Committee Members: Kuri, Joy.

Subjects/Keywords: Socio-Technological Networks; Cellular Networks; Device to Device Communication; Inter Node link; Autonomous Nodes in Social Groups; Peer-to-Peer Networks; Direct Connect Networks; Peer-to-Peer Content Distribution Networks; Give and Take based Peer-to-Peer Networks; Social Optimum; Social Groups; Give-and-Take (GT) Criterion; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aggarwal, S. (2014). Content Distribution in Social Groups. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3036

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

Aggarwal, Saurabh. “Content Distribution in Social Groups.” 2014. Thesis, Indian Institute of Science. Accessed January 17, 2020. http://hdl.handle.net/2005/3036.

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

MLA Handbook (7th Edition):

Aggarwal, Saurabh. “Content Distribution in Social Groups.” 2014. Web. 17 Jan 2020.

Vancouver:

Aggarwal S. Content Distribution in Social Groups. [Internet] [Thesis]. Indian Institute of Science; 2014. [cited 2020 Jan 17]. Available from: http://hdl.handle.net/2005/3036.

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

Council of Science Editors:

Aggarwal S. Content Distribution in Social Groups. [Thesis]. Indian Institute of Science; 2014. Available from: http://hdl.handle.net/2005/3036

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

3. Magdič, Tadej. POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN.

Degree: 2015, Univerza v Mariboru

Magistrsko delo opisuje razvoj sistema za nadgradnjo vgrajene programske opreme prek omrežja CAN. Razvit je bil celovit sistem za prenos vgrajene programske opreme od osebnega računalnika do končnega vozlišča CAN. Izvedena programska oprema za operacijski sistem Microsoft Windows nam omogoča izbiro datoteke vgrajene programske kode in možnost posredovanja izbrane vsebine do naprave z vmesnikom CAN, ki jo želimo nadgraditi. V ta namen je bil zasnovan in izveden vmesnik, ki omogoča pretvorbo oziroma posredovanje in sprejemanje okvirjev omrežja CAN prek standardnega univerzalnega vmesnika USB. S tem vmesnikom se osebnemu računalniku zagotovi možnost povezovanja v omrežje CAN, ki je deležno nadgradnje vgrajene programske opreme. Vozlišče znotraj tega omrežja je sposobno posredovane dele vgrajene programske kode iz prejetih okvirjev vpisovati v bliskovni pomnilnik krmilno-procesne enote.

CAN, USB, embedded systems, software, boot loader, protocol

Advisors/Committee Members: Kramberger, Iztok.

Subjects/Keywords: CAN; USB; vgrajeni sistem; programska oprema; zagonski nalagalnik; protokol; Master's thesis describes the development of a system to upgrade the firmware through the CAN network. A comprehensive system was developed to transfer the firmware from the PC to the final CAN node. Implemented software for the Microsoft Windows operating system allows us to select a file with embedded software code and the possibility for transferring the selected content to the device with a CAN interface; that we want to upgrade. For this purpose has been designed and implemented an interface that allows us to convert; send and receive CAN network frames through a standard universal USB interface. With this interface a personal computer gets a possibility for integration in CAN network; which is receiving firmware upgrade. Node within the CAN network is capable transmitted parts of the firmware code from the received frames write into in the flash memory of control processing unit.; info:eu-repo/classification/udc/004.42:004.72(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magdič, T. (2015). POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=47416 ; https://dk.um.si/Dokument.php?id=70762&dn= ; https://plus.si.cobiss.net/opac7/bib/19024662?lang=sl

Chicago Manual of Style (16th Edition):

Magdič, Tadej. “POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN.” 2015. Masters Thesis, Univerza v Mariboru. Accessed January 17, 2020. https://dk.um.si/IzpisGradiva.php?id=47416 ; https://dk.um.si/Dokument.php?id=70762&dn= ; https://plus.si.cobiss.net/opac7/bib/19024662?lang=sl.

MLA Handbook (7th Edition):

Magdič, Tadej. “POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN.” 2015. Web. 17 Jan 2020.

Vancouver:

Magdič T. POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN. [Internet] [Masters thesis]. Univerza v Mariboru; 2015. [cited 2020 Jan 17]. Available from: https://dk.um.si/IzpisGradiva.php?id=47416 ; https://dk.um.si/Dokument.php?id=70762&dn= ; https://plus.si.cobiss.net/opac7/bib/19024662?lang=sl.

Council of Science Editors:

Magdič T. POSODOBITEV PROGRAMSKE OPREME VGRAJENIH SISTEMOV V OMREŽJU CAN. [Masters Thesis]. Univerza v Mariboru; 2015. Available from: https://dk.um.si/IzpisGradiva.php?id=47416 ; https://dk.um.si/Dokument.php?id=70762&dn= ; https://plus.si.cobiss.net/opac7/bib/19024662?lang=sl

.