Dissertations / Theses: 'Linked list'

1

Liu, Yang. "Simulating depth of field using per-pixel linked list buffer." Thesis, Purdue University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1598036.

Full text

Abstract:

In this thesis, I present a method for simulating three characteristics of depth of field image: partial occlusion, bokeh and blur. Retrieving color from occluded surfaces is achieved by constructing a per-pixel linked list buffer, which only requires two render passes. Additionally, per-pixel linked list buffer eliminates the memory overhead of empty pixels in depth layers. Bokeh and blur effect are accomplished by image-space point splatting (Lee 2008). I demonstrate how point splatting can be used to account for the effect of aperture shape and intensity distribution on bokeh. Spherical aberration and chromatic aberration can be approximated using a custom pre-built sprite. Together as a package, this method is capable matching the realism of multi-perspective methods and layered methods.

APA, Harvard, Vancouver, ISO, and other styles

2

Tett, Stuart Tosten. "A scripting interface for doubly linked face list based polygonal meshes." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-2121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

劉宗國 and Chung-kwok Albert Lau. "The doubly-linked list protocol family for distributed shared memory multiprocessor systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B3121325X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lau, Chung-kwok Albert. "The doubly-linked list protocol family for distributed shared memory multiprocessor systems /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B17590553.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Leung, K. H. W., and 梁海宏. "Implementation and performance evaluation of doubly-linked list protocols on a cluster of workstations." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31223060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Halverson, Ranette Hudson. "Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design." Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc278153/.

Full text

Abstract:

The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner. In this regard, there is a need to categorize strategies in order to solve broad classes of problems with similar structures and requirements. In this dissertation, two parallel algorithm design strategies are considered: linked list ranking and parentheses matching.

APA, Harvard, Vancouver, ISO, and other styles

7

Dicorato, Pino G. "Hardware linked-list using FPGAs and optical central stage impairments in a sectored packet switch with an optical core (demonstrator)." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27830.

Full text

Abstract:

Packet switches play a key role in packet-switched networks and are at the very core of the design in routers. The recent decade has enabled photonics to produce high-speed reliable networks; however within these networks the switching aspect remains mostly within the electrical domain. Opto-electrical and Electro-optical conversion is required for packet headers to be identified in order to forward the packets to their appropriate destination link. Convergence to a more optical solution depends on specific packet-switch architectures. This thesis presents on two aspects of building a "hardware demonstrator" of a CLOS-like optoelectronic packet switch architecture that consists of two stages of electronic islands (called "sectors") surrounding a photonic central stage. The hardware demonstrator is a scaled-down version of the switch and is intended to "demonstrate" the concepts and workings of the architecture. The first aspect is a detailed description and simulation of a System-on-Chip (SoC) linked-list memory manager implemented in a Field-Programmable Gate Array (FPGA) that is a building block of a common shared-memory switch that forms an electronic sector. If the core optical central stage is very far from the input and output sectors or if the switch is scaled to higher port counts, then key optical impairments need to be identified. The second part of this thesis explores the impairments for a wavelength selectable switch used in a cross-connect configuration as a possible switching technology and shows optical measurements for each of the identified impairments.

APA, Harvard, Vancouver, ISO, and other styles

8

Мартиненко, М. В. "Комп’ютерна реалізація структури даних "зв'язний список" в прикладному програмуванні." Master's thesis, Сумський державний університет, 2019. http://essuir.sumdu.edu.ua/handle/123456789/76432.

Full text

Abstract:

Виконані дослідження щодо застосування структури даних «зв’язний список» в прикладному програмуванні. Проведена комп’ютерна реа- лізація довідника лікарських рослин, побудованого на цій структурі даних та телефонний довідник. Комп’ютерне забезпечення реалізовано за допомогою мови програмування С++.

APA, Harvard, Vancouver, ISO, and other styles

9

Suchaževskaja, Tatjana. "Dinaminės duomenų struktūros ir kai kurių jų algoritmų realizavimas rodyklėmis." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050608_172624-42734.

Full text

Abstract:

The present research paper deals with the comparison of static and dynamic data structures: static array, dynamic array, pointers array - class TList (Delphi) and dynamic doubly linked list, created with the help of recursive record.To compare the above mentioned structures, sorting (Bubble) and convex hull creation algorithms (Graham, Endrew) are realized, with the time of their implementation analysed. The algorithm of sorting (Bubble) is realized by four ways: static array, dynamic array, pointers array (class TList) and a dynamic doubly linked list, created with the help of recursive record.The algorithms of convex hull creation (Graham, Endrew) is realized by three ways: static array, dynamic array and pointers array (TList).The research paper also describes the pointers array class TList (Delphi), its properties and methods. The sorting method Sort of this class is compared with the sorting method of a “Bubble”. Using class templates, a universal class MList (C++) was created for work with dynamic linear linked lists.

APA, Harvard, Vancouver, ISO, and other styles

10

Кучмій, О. О. "Реалізація телефонного довідника на структурах даних "зв’язний список" та "дерево пошуку"." Master's thesis, Сумський державний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/72256.

Full text

Abstract:

Проведено інформаційний огляд існуючих можливостей створення телефонних довідників та аналіз структур даних для таких розробок. Розроблено телефонні довідники на структурах даних «зв’язний список» та «бінарне дерево пошуку».Проведено порівняльний аналіз одержаних програмних продуктів. Продемонстровано приклад роботи програми з усіма операціями та коментарями.

APA, Harvard, Vancouver, ISO, and other styles

11

Hák, Tomáš. "Moderní e-learning systém na platformě JAVA." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217504.

Full text

Abstract:

This dissertation is studying e-learning – electronic form of education. At once it is analysing in details the advantages and disadvantages of this new form of education approach and is describing possibilities of some chosen e-learning systems and their basic structures. In the second part of this dissertation are said basic principles and possibilities of programming language Java in which language is designed it's own concept of system, that should make possible for users to manage and control the e-learning. In this part is described progress of communication between server and client, method of sending off the SQL (query) and receiving result too. In last part is viewed resulting application as a whole, is explained basic controlling, possibilities of administration and methods of entering data. Application itself is tested on local testing server.

APA, Harvard, Vancouver, ISO, and other styles

12

Farook, Mohammad. "Fast lock-free linked lists in distributed shared memory systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ32107.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Wenige, Lisa [Verfasser], Johannes M. [Gutachter] Ruhland, and Nils [Gutachter] Boysen. "On-the-fly recommendation retrieval from linked open data repositories / Lisa Wenige ; Gutachter: Johannes M. Ruhland, Nils Boysen." Jena : Friedrich-Schiller-Universität Jena, 2019. http://d-nb.info/1177387026/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Gängler, Thomas. "Semantic Federation of Musical and Music-Related Information for Establishing a Personal Music Knowledge Base." Master's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-72434.

Full text

Abstract:

Music is perceived and described very subjectively by every individual. Nowadays, people often get lost in their steadily growing, multi-placed, digital music collection. Existing music player and management applications get in trouble when dealing with poor metadata that is predominant in personal music collections. There are several music information services available that assist users by providing tools for precisely organising their music collection, or for presenting them new insights into their own music library and listening habits. However, it is still not the case that music consumers can seamlessly interact with all these auxiliary services directly from the place where they access their music individually. To profit from the manifold music and music-related knowledge that is or can be available via various information services, this information has to be gathered up, semantically federated, and integrated into a uniform knowledge base that can personalised represent this data in an appropriate visualisation to the users. This personalised semantic aggregation of music metadata from several sources is the gist of this thesis. The outlined solution particularly concentrates on users’ needs regarding music collection management which can strongly alternate between single human beings. The author’s proposal, the personal music knowledge base (PMKB), consists of a client-server architecture with uniform communication endpoints and an ontological knowledge representation model format that is able to represent the versatile information of its use cases. The PMKB concept is appropriate to cover the complete information flow life cycle, including the processes of user account initialisation, information service choice, individual information extraction, and proactive update notification. The PMKB implementation makes use of SemanticWeb technologies. Particularly the knowledge representation part of the PMKB vision is explained in this work. Several new Semantic Web ontologies are defined or existing ones are massively modified to meet the requirements of a personalised semantic federation of music and music-related data for managing personal music collections. The outcome is, amongst others, • a new vocabulary for describing the play back domain, • another one for representing information service categorisations and quality ratings, and • one that unites the beneficial parts of the existing advanced user modelling ontologies. The introduced vocabularies can be perfectly utilised in conjunction with the existing Music Ontology framework. Some RDFizers that also make use of the outlined ontologies in their mapping definitions, illustrate the fitness in practise of these specifications. A social evaluation method is applied to carry out an examination dealing with the reutilisation, application and feedback of the vocabularies that are explained in this work. This analysis shows that it is a good practise to properly publish Semantic Web ontologies with the help of some Linked Data principles and further basic SEO techniques to easily reach the searching audience, to avoid duplicates of such KR specifications, and, last but not least, to directly establish a \"shared understanding\". Due to their project-independence, the proposed vocabularies can be deployed in every knowledge representation model that needs their knowledge representation capacities. This thesis added its value to make the vision of a personal music knowledge base come true.

APA, Harvard, Vancouver, ISO, and other styles

15

Linke, Lisa [Verfasser], Günter [Akademischer Betreuer] Köhler, Günter [Gutachter] Köhler, and Pauline [Gutachter] Wimberger. "Charakterisierung, adjuvante Therapie, Nachsorge, progressionsfreies- und Gesamtüberleben von uterinen Karzinosarkomen / Lisa Linke ; Gutachter: Günter Köhler, Pauline Wimberger ; Betreuer: Günter Köhler." Greifswald : Ernst-Moritz-Arndt-Universität, 2018. http://d-nb.info/1170321445/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Linke, Lisa Verfasser], Günter [Akademischer Betreuer] [Köhler, Günter Gutachter] Köhler, and Pauline [Gutachter] [Wimberger. "Charakterisierung, adjuvante Therapie, Nachsorge, progressionsfreies- und Gesamtüberleben von uterinen Karzinosarkomen / Lisa Linke ; Gutachter: Günter Köhler, Pauline Wimberger ; Betreuer: Günter Köhler." Greifswald : Ernst-Moritz-Arndt-Universität, 2018. http://nbn-resolving.de/urn:nbn:de:gbv:9-opus-23461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Schönbrunn, Lisa Christiane [Verfasser], Rolf [Akademischer Betreuer] Wachter, Gerd [Akademischer Betreuer] Hasenfuß, and Dirk [Akademischer Betreuer] Raddatz. "Einfluss einer diabetischen Stoffwechsellage auf die diastolische Funktion des linken Ventrikels / Lisa Christiane Schönbrunn. Gutachter: Gerd Hasenfuß ; Dirk Raddatz. Betreuer: Rolf Wachter." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2011. http://d-nb.info/1042723664/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lindel, Lisa [Verfasser], and Dan [Akademischer Betreuer] Rujescu. "Assoziation von Single Nucleotid Polymorphismen im GRM5-Gen mit Schizophrenie und kognitiven Phänotypen / Lisa Lindel. Betreuer: Dan Rujescu." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2012. http://d-nb.info/1031379665/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zimmermann, Lisa [Verfasser], Christoph [Akademischer Betreuer] [Gutachter] Herrmann-Lingen, and Wolfgang [Gutachter] Himmel. "Einfluss von Imaginationsübungen bei klimakterischen Beschwerden (IKB) auf menopausale Symptome und die Lebensqualität von Mammakarzinompatientinnen / Lisa Zimmermann ; Gutachter: Christoph Herrmann-Lingen, Wolfgang Himmel ; Betreuer: Christoph Herrmann-Lingen." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2017. http://d-nb.info/112733512X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Beckendorf, Lisa [Verfasser], Wolfgang [Gutachter] Linke, and Raphael [Gutachter] Stoll. "Characterisation of the truncated titin isoform Novex-3 from striated muscle / Lisa Beckendorf ; Gutachter: Wolfgang Linke, Raphael Stoll ; Fakultät für Chemie und Biochemie." Bochum : Ruhr-Universität Bochum, 2018. http://d-nb.info/1165304724/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Krech, Lisa [Verfasser], David [Akademischer Betreuer] Zilles, Dirk [Gutachter] Wedekind, Christoph [Gutachter] Herrmann-Lingen, and Nicole von [Gutachter] Steinbüchel-Rheinwall. "Einfluss der Patientenerwartung auf Wirksamkeit und Verträglichkeit der Elektrokonvulsionstherapie / Lisa Krech ; Gutachter: Dirk Wedekind, Christoph Herrmann-Lingen, Nicole von Steinbüchel-Rheinwall ; Betreuer: David Zilles." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2019. http://d-nb.info/1189904578/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Souza, Hiale Yane Silva de. "Estudo termoanal?tico da perlita hidrofobizada com ?leo de linha?a." Universidade Federal do Rio Grande do Norte, 2010. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17640.

Full text

Abstract:

Made available in DSpace on 2014-12-17T15:41:53Z (GMT). No. of bitstreams: 1 HialeYSS_DISSERT.pdf: 3935527 bytes, checksum: 49a917d8f6b548b50f34324737a29f0a (MD5) Previous issue date: 2010-01-21
In this work, expanded perlite, a mineral clay, consisting of SiO2 and Al2O3 in the proportions of 72.1 and 18.5%, respectively, was used as an adsorbent for oil in its pure expanded form as well as hydrofobized with linseed oil. Thermogravimetry (TG), Derivative Thermogravimetry (DTG) and Differential Thermal Analysis (DTA) were used to study the thermal behavior and quantify the percent adsorption of perlite in differents processes comparing the results with the ones obtained using Gravimetric Analysis. In the process of hydrophobization with linseed oil granulometric fractions > 20, 20-32 and 32-60 mesh were used and adsorption tests with crude oil were performed in triplicate at room temperature. The results obtained by TG/DTG in dynamic atmosphere of air showed mass losses in a single step for the expanded perlite with pure adsorbed oil, indicating that the adsorption of oil was limited and that the particle size did not in this process. Linseed oil has performed well as an agent of hydrophobized perlite (32 to 60 mesh) indicating a maximum percentage of 59.9% and 68.6% the linseed with a fraction range from considering the data obtained by thermogravimetry and Gravimetry, respectively. The adsorption of oil in the expanded perlite and hydrofobized pure perlite with linseed oil did not produce good results, characterizing an increase of 0.5 to 4.6% in pure perlite and 3.3% in hydrofobized perlite with granulometric 32 to 60 mesh
Nesse trabalho a perlita expandida, um argilomineral, constitu?do de SiO2 e Al2O3 nas propor??es de 72,1 e 18,5%, respectivamente foi utilizada como adsorvente para petr?leo na sua forma pura expandida como tamb?m hidrofobizada com ?leo de linha?a. Para isso, utilizou-se a Termogravimetria (TG), a Termogravimetria Derivada (DTG) e a An?lise T?rmica Diferencial (DTA) para estudar o comportamento t?rmico e verificar o percentual de adsor??o da perlita nos processos utilizados, em compara??o com a An?lise Gravim?trica. No processo de hidrofobiza??o com o ?leo de linha?a utilizou-se as fra??es > 20, 20 a 32 e 32 a 60 mesh e os testes de adsor??o com o petr?leo bruto foram realizados em triplicata em temperatura ambiente. Os resultados obtidos por TG/DTG em atmosfera din?mica de ar mostraram perdas de massa em uma ?nica etapa para a perlita expandida pura adsorvida com petr?leo, indicando que a adsor??o de petr?leo foi limitada e que a granulometria n?o interferiu nesse processo. O ?leo de linha?a apresentou bons resultados como agente hidrofobizante da perlita indicando um percentual m?ximo de 59,9% e 68,6% de linha?a na fra??o de 32 a 60 mesh considerando os dados obtidos por Termogravimetria e Gravimetria, respectivamente. A adsor??o do petr?leo na perlita pura expandida e na perlita hidrofobizada com ?leo de linha?a n?o apresentou bons resultados, caracterizando um aumento de 0,5 a 4,6% na perlita pura e 3,3 % na perlita hidrofobizada de 32 a 60 mesh

APA, Harvard, Vancouver, ISO, and other styles

23

Malík, Viktor. "Abstrakce dynamických datových struktur s využitím šablon." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363894.

Full text

Abstract:

Cieľom tejto práce je návrh analýzy tvaru haldy vhodnej pre potreby analyzátora 2LS. 2LS je nástroj pre analýzu C programov založený na automatickom odvodzovaní invariantov s použitím SMT solvera. Navrhované riešenie obsahuje spôsob reprezentácie tvaru programovej haldy pomocou logických formulí nad teóriou bitových vektorov. Tie sú následne využité v SMT solveri pre predikátovú logiku prvého rádu na odvodenie invariantov cyklov a súhrnov jednotlivých funkcií analyzovaného programu. Náš prístup je založený na ukazateľových prístupových cestách, ktoré vyjadrujú dosiahnuteľnosť objektov na halde z ukazateľových premenných. Informácie získané z analýzy môžu byť využité na dokázanie rôznych vlastností programu súvisiacich s prácou s dynamickýcmi dátovými štruktúrami. Riešenie bolo implementované v rámci nástroja 2LS. S jeho použitím došlo k výraznému zlepšeniu schopnosti 2LS analyzovať programy pracujúce s ukazateľmi a dynamickými dátovými štruktúrami. Toto je demonštrované na sade experimentov prevzatých zo známej medzinárodnej súťaže vo verifikácii programov SV-COMP a iných experimentoch.

APA, Harvard, Vancouver, ISO, and other styles

24

Lagerkvist, Love. "Computation as Strange Material : Excursions into Critical Accidents." Thesis, Malmö universitet, Institutionen för konst, kultur och kommunikation (K3), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-43639.

Full text

Abstract:

Waking up in a world where everyone carries a miniature supercomputer, interaction designers find themselves in their forerunners dreams. Faced with the reality of planetary-scale we have to confront the task of articulating approaches responsive this accidental ubiquity of computation. This thesis attempts such a formulation by defining computation as a strange material, a plasticity shaped equally by its technical properties and the mode of production by which is its continuously re-produced. The definition is applied through a methodology of excursions — participatory explorations into two seemingly disparate sites of computation, connected in they ways they manifest a labor of care. First, we visit the social infrastructures that constitute the Linux kernel, examining strangle entanglements of programming and care in the world's largest design process. This is followed by a tour into the thorny lands of artificial intelligence, situated in the smart replies of LinkedIn. Here, we investigate the fluctuating border between the artificial and the human with participants performing AI, formulating new Turing tests in the process. These excursions afford an understanding of computation as fundamentally re-produced through interaction, a strange kind of affective work the understanding of which is crucial if we ambition to disarm the critical accidents of our present future.

APA, Harvard, Vancouver, ISO, and other styles

25

Chen, Chien-Lung, and 陳建龍. "Adaptive Linked-List Routing Algorithm with Wormhole Mechanism." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/qmggwc.

Full text

Abstract:

碩士
國立中山大學
電機工程學系研究所
104
Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism. The algorithm includes the manner of construction linked list network, data jumping for routing broken, a new node join mechanism, the manner of construction wormhole network and aim at the modbus protocol as application layer, set up suitable Modbus extension instructions for data collection. It’s an algorithm for IOT data collection. However, there are still a lot of non-adaptive in algorithm. First, on network initialization problem, because exchange address information packet with offline nodes and interrupt nodes which are exchanging address information, nodes must turn on respectively to finish construction network. When numerous nodes existing in network, the algorithm without nodes turn on simultaneously mechanism is non-adaptive. Second, the problem on continuous nodes broken, chain scission nodes will broadcast ask and join packet randomly for adding back to the network. The broadcast storm will be occurred and interference the nodes which are still working on network leads to the collapse of the entire network. Third, on node outliers problem, node exits without stabling routing first will cause data packets loss. Finally is packet processing problem, without planning a complete resend packet queue and establishing packet processing flag, will cause resend packet extracting error and packet race condition. In this paper, we proposed an adaptive linked-list routing algorithm with wormhole mechanism. Included implementation the manner of turn on nodes simultaneously with Lock-address mechanism. Let the initialization of the routing more adaptive in a large number of nodes environment. Then the algorithm proposed the stable chain scission, reset sequentially and cutting timer mechanism for broken nodes determination. So that chain scission nodes can stable routing first then brocast join packet sequentially when continuous nodes broken occurred to avoid broadcast storm and linked error happen. Third we proposed the node outliers mechanism. Nodes will follow the node outliers mechanism to stable routing first, and then executing reset when node in sensoring data abnormally for a long time to avoid data packets loss. Finally, the algorithm planned a complete resend packet queue and established packet processing flag to solve resend packet extracting error and packet race condition. In simulation, the performance of network initialization of adaptive linked-list routing algorithm with wormhole mechanism and flooding is compared and simulated by NS3 in this paper. The simulations results reveal that the initialization of adaptive linked-list routing algorithm with wormhole mechanism is more efficient than flooding when nodes are 5 meters apart and a matrix model of nodes number from 7*7 to 15*15. In the future, we expect that adaptive linked-list routing algorithm with wormhole mechanism not only implement in LR-WPANs environment, also in IEEE802.15.1 or IEEE802.11 etc. protocols. Establish the standard of the algorithm for wireless network data collection.

APA, Harvard, Vancouver, ISO, and other styles

26

Lee, Tsung-Lin, and 李宗霖. "Adaptive Linked-List Mechanism For Wi-Fi Wireless Network." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/nspptj.

Full text

Abstract:

碩士
國立中山大學
電機工程學系研究所
106
In response to the concept of Smart City and Internet of Things (IoT) being prevailed in recent years, networking requirements for various devices have increased significantly, however, many related problems have arisen. To solve the problems and shortcomings of the existing IoT wireless networking technologies, for example, the data rate of ZigBee is slow and the wireless networking technologies which uses star topology like NB-IoT and LoRa is rely on the signal of base station, if the node is at communication deadzone, it will not be able to successfully transmit data. Therefore, this thesis proposes an Adaptive Linked-List Mechanism For Wi-Fi Wireless Network, this algorithm takes advantage of the low-collision of the linked-list architecture and solves the problem that multiple nodes cannot be started at the same time, moreover, the nodes are able to use signal strength as the basis for constructing a linked-list network that ensure that the nodes within the signal coverage can be stably connected, and the entire system will not be interrupted due to a problem with a few nodes. The algorithm also modifies the linked-list network construction and broken node recovery process, and adds the packet signal strength queue mechanism, so that multiple nodes can quickly construct the network chain. Furthermore, we design a Wi-Fi control board which is based on CC3220MODA and implement our algorithm on it, finally, after testing in different environment, we offer two objective function for two important arguments. We hope to take advantage of this wireless linked-list network in data collection network in the future, and then solve the multi-device networking requirements, and build a stable, reliable and high-speed data collection network for IoT.

APA, Harvard, Vancouver, ISO, and other styles

27

Peng, Yi-wei. "Interactive 3D Debugging Information Visualization for Linked-List Data Structure." 2002. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0021-1904200715425065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Chiu, Hong-Wei, and 邱泓瑋. "Rescuing Algorithm for Linked-List Wireless Network with Wormhole Mechanism." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/71354134458798253749.

Full text

Abstract:

碩士
國立中山大學
電機工程學系研究所
104
Due to the concept of Smart City being gradually prevailed in recent years, the wireless routing algorithm for Low-Rate Wireless Personal Area Networks is an important research for data collecting network which is used for managing and collecting the several data in the city. Chiu and Chen proposed an adaptive linked list routing algorithm with wormhole mechanism. The algorithm is a low collision wireless protocol which is suitable for several kinds of data collection systems such as intelligent street lighting, smart meters, smart appliances and other systems. However, the algorithm may cause the unstable transmission because of environmental interference and the inappropriate design of the protocol. In this paper, we proposed a rescuing algorithm for linked-list wireless network with wormhole mechanism to solve the problems in the link-listed network. The algorithm has the efficient method which can collect the information of the isolated nodes which can’t join the network, and choose the urgent one to join the network as the save node rapidly with the advantage of the low collision. The algorithm also designs the mechanism to stabilize the data transmission path and fix the break of commands, tries to make the efficiency of the data collecting not to be affected easily by the environmental interference. In order to make the linked-list network can collect and write the data rapidly with the save nodes, the algorithm also fixes the related commands in the network. We use the network simulation-3 to verify the efficacy of the rescuing algorithm. First, we find that the algorithm can save most of the isolated nodes rapidly with the limited hardware device in the multi-nodes environment. We prove that the rescuing algorithm can solve the routing problem of the linked-list network. Then, we verify that the stable path of the data transmission mechanism can build the better wormhole data path for the packet with max payload. Finally, we simulate the Gather and Scatter commands and find that the linked-list network with the save nodes can completely and rapidly collect and write the multi-nodes data. The result of the simulation tells that the linked-list network with the save nodes can build a stable and rapid data collecting network system.

APA, Harvard, Vancouver, ISO, and other styles

29

Yi-wei, Peng, and 彭怡煒. "Interactive 3D Debugging Information Visualization for Linked-List Data Structure." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/90712672856074930954.

Full text

Abstract:

碩士
國立臺灣師範大學
資訊教育研究所
91
Debugging a complex program may be tedious and difficult. As the size of programs grow, this problem becomes serious. Programmers need effective debugger tools, but current debugging tools are far from their need. Our research uses the techniques of software visualization to visualize the variables and data structures of programs and extends the visualization to a 3D environment to address the scalability problem. Our system named DIVINE (3D Interactive Visualization Environment for Debugging) concentrates on the integration of visualization tool and debugger. DIVINE can be divided into two parts. One is the debugger and the other is the visualization subsystem. The debugger provides a window-based user interface for users to debug a program. The visualization subsystem provides a meaningful visualization to aid debugging for programs with complex linked-list structure. The visualization subsystem creates and displays the debugging information in a 3D graphic environment. Users can use a data glove to interact with DIVINE. Users need not key in debugging commands in the window-based debugger. They use the data glove with particular gestures and some simple keyboard keys to communicate with the debugger. Through the interactive visualization, programmers can facilitate the debugging process.

APA, Harvard, Vancouver, ISO, and other styles

30

Kuo, Shan-Chun, and 郭善群. "A Linked-List Difference Histogram Computation Algorithm for Fast Image Processing." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/25539177455645787916.

Full text

Abstract:

碩士
國立臺灣科技大學
電子工程系
101
Local histogram construction is one of the significant bases in many image processing applications, which efficiently shows the intensity distribution of pixel values. During the past few years, it has aroused increasing interest in image processing and computer vision, and has shown its effectiveness in a number of applications, in particular for video surveillance systems. This paper presents a comprehensive survey of local histogram construction methodology, furthermore, proposes a better histogram construction method and also describes the related embodiments. Experimental results demonstrate that the efficiency of the proposed method in contrast with those of other methods for histogram construction and image processing applications.

APA, Harvard, Vancouver, ISO, and other styles

31

Pai, Kai-Chung, and 白凱中. "Linked List Based High Utility Itemsets Mining Using Pattern Growth Method." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/71028669060393819757.

Full text

Abstract:

碩士
國立中正大學
資訊管理所暨醫療資訊管理所
97
In the past, several researches in frequent pattern mining focused on relative frequent patterns and did not consider the utility of merchandise. Indeed, the property of profit or revenue is also meaningful to business. Methods on mining high utility itemsets, considering profit, do not have anti-monotone property. Considering this problem, Liu et al. proposed the TwoPhase algorithm with anti-monotone property; but, it is based on candidate generation-and-test approach. On the other hand, Erwin et al. proposed CTU-Tree data structure and CTU-Mine algorithm to mine high utility itemsets; however, it is inefficient in traversal the CTU-Tree. In this paper, we develop the double layer index and linked lists method using pattern growth approach to enhance the performance of CTU-Mine. Moreover, the proposed method with the property of anti-monotone and lexicon order in each linked list can quickly find the specific pattern and utilize multi-processing approach to enhance the efficiency both for providing a real insight into business strategy.

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, Wen-hsin, and 王汶鑫. "Linked List Routing Algorithm with Wormhole Mechanism for Data Collecting Wireless Network." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/98568314906611664754.

Full text

Abstract:

碩士
國立中山大學
電機工程學系研究所
102
Due to the development of the Internet of Things(IOT), many communications protocols and routing algorithm used in IOT have been proposed. IOT is composed of numerous wireless embedded systems and its topology changes a lot. How to collect data stably within a short time is an important issue. However, the existing routing protocols are mostly used for data transmission and it’s inefficient if used in data collection with polling manner. Therefore, we proposed a Linked List Routing Algorithm with Wormhole Mechanism for Data Collecting Wireless Network. Using linked list topology to construct a data collecting network, in which data collecting behavior can be completed on the same path so that we can gather data at one time by data fusing operation. Moreover, when the number of node rise, we need a larger neighbor table and routing table to keep routing information correct, it will become a challenge due to the embedded system’s memory. Linked list network has simple routing table and neighbor table, we won’t spend too much time in path finding and it won’t limit by embedded system’s memory so that the extensibility is high. In traditional linked list network, the hop count is a big problem, so we add wormhole in our network to improve data collection efficiency. In our protocol, we develop some function such as how to construct a linked list network, how a new node join network, data routing when link failure and node repair. Besides, we develop an instruction and tell you how to collect data by this instruction. In this paper, we implement the routing protocol to verify a data collection in wireless sensor network. The performance of the Linked List Routing Algorithm with Wormhole Mechanism and AODV is compared and simulated by NS2. The simulation results reveal that the mechanism is more efficient than AODV. In the future, we expect that our proposed routing protocol can be used in health monitoring in hospital and sanatorium or power monitoring.

APA, Harvard, Vancouver, ISO, and other styles

33

Lin, Yue-Wei, and 林岳威. "Searching the Optimal Data Imputation Method for Missing Values of Vehicle Detector Using Linked List." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/18897154871480374324.

Full text

Abstract:

碩士
國立中央大學
土木工程研究所
100
To search for the optimal imputation of Vehicle Detector, this paper using the Data Structure-Linked Lists to search the optimal solution of imputation of Vehicle Detector. We have to establish three the essential VD Lists and the numbers of data imputation Lists. Using the Lists to find the optimal solution of missing values VD. First, use the 35 VD to establish the original VD Lists and copy the data of the original VD Lists to establish another List, it’s call data complete lists. Then we input the VD of missing values to delete VD of data complete lists, at the same time, use the VD of missing values to establish missing data lists. And then using combination of statistics of data complete lists to find the imputation mode, MAPE use the random to decide. Use the imputation mode to establish the numbers of data imputation Lists. Finally , we can search the local optimal solution from the data imputation Lists, and find the optimal solution from those local optimal solution. The result showed that every VD of missing value the local optimal solutions MAPE are 5%, because the imputation mode is too much and the MAPE is random to decide. But we have to find the optimal solution of missing value VD, so according to Literature, we choose the most VD imputation Data is optimal solution.

APA, Harvard, Vancouver, ISO, and other styles

34

Lin, Guan-An, and 林冠安. "Use of an Automated Cognitive Mentor for Learning Basic Linked List Concepts － A Preliminary investigation." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/p9zju3.

Full text

Abstract:

碩士
中原大學
資訊工程研究所
105
For novices, it is a great challenge to learn to program, especially when there are arrays, records and/or linked lists involved. Concepts of arrays, records, and linked lists are not so easy to grasp, making it hard for novices to come up with correct programs. This is especially the case with linked lists. When novices learn new concepts, they may form misconceptions. These misconceptions not only make the construction of programming knowledge difficult but also hinder their learning of subsequent programming concepts. To help novices correct their misconceptions, the use of direct teaching may not be very helpful. A better way of helping novices to correct their misconceptions may be to use Socratic dialogues. When conducting a Socratic dialog with a novice, it is important that the novice must find his/her misconceptions all by him/herself. That is, only the necessary guidance is given, so that the novice will find contradictions in his/her reasoning, which is then followed by necessary corrective measures, again with the help of further guidance. To use Socratic dialogs, however, there is a big problem that must be overcome, and the problem has to do with the fact that a teacher can handle only one student at a time. When there are many (say, 40 or even 80) students that need to be helped, the teacher will have problems using Socratic dialogs to help them. One solution to this situation is to use a computer system with embedded dialogs in it. Whenever the user (a student) gives an input to the system, the system always have a pre-designated answer for it, an answer that is reminiscent of a Socratic-styled answer. In this thesis, we investigate the use of such a computerized approach to help students correct their misconceptions of linked list processing. We focus on a very narrow domain - the domain of linked list traversal, node deletion, and node insertion, and we prove that our approach is somewhat effective in helping learners correct their misunderstandings.

APA, Harvard, Vancouver, ISO, and other styles

35

Ni, Jia-De, and 倪嘉德. "Hardware/Software Codesign and Implementation of a Linked-List-based Hough-Transform Algorithmic Processor for Line Detection." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/3tbq4z.

Full text

Abstract:

碩士
國立臺灣科技大學
電子工程系
106
This thesis is related to the hardware/software codesign and implementation of a linked-list-based Hough-transform algorithmic processor for line detection. The research includes four parts: The first part is to analyze the property of the algorithm and, after considering that the embedded systems have limited memory resources, a linked-list-based Hough-transform algorithm for line detection has been developed. Also the C language is used to write the program for implementing and verifying the proposed algorithm. The second part is to design and develop a linked-list-based Hough-transform algorithmic processor for line detection. This algorithmic processor consists of a control unit, a source data buffer, a valid-pixel logic, a coordinate-and-address generator, a Hough-parameter generator, and a linked-list-based Hough-transform algorithmic subprocessor. The algorithmic processor is integrated onto a SOPC-based chip and implemented on an Altera FPGA development board. The third part is about the hardware/software codesign of a linked-list-based Hough-transform algorithmic processor for line detection. Software and driver programs are developed by using the NIOS II integrated development environment to verify and analyze the function of this algorithmic processor. The fourth part is to evaluate the performance of the algorithm and the algorithmic processor. In conclusion, the goal of this thesis is: (1) to develop a linked-list-based Hough-transform algorithm for line detection; (2) to finish the hardware/software codesign and implementation of the HT-based algorithmic processor. Finally, by implementing this algorithmic processor on an FPGA development board, both the modified algorithm and the related algorithmic processor are proved to be more memory-efficient and have better performance.

APA, Harvard, Vancouver, ISO, and other styles

36

Yao, Zhenhua, Jian-Sheng Wang, and Min Cheng. "Improved O(N) neighbor list method using domain decomposition and data sorting." 2003. http://hdl.handle.net/1721.1/3884.

Full text

Abstract:

The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessary inter-atomic distance calculations in molecular simulations involving large amount of atoms. Both of the serial and parallelized performance of molecular dynamics simulation are evaluated using the new algorithm and compared with those using the conventional Verlet table and cell-linked list algorithm. Results show that the new algorithm significantly improved the performance of molecular dynamics simulation compared with conventional neighbor list maintaining and utilizing algorithms in serial programs as well as parallelized programs.
Singapore-MIT Alliance (SMA)

APA, Harvard, Vancouver, ISO, and other styles

37

Hu, Che-Wei, and 胡哲維. "A Study on Edge Detection by Using the Chained Linked List Structure and Its Application for Information Hiding." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/14141037155233139852.

Full text

Abstract:

碩士
國立臺中技術學院
多媒體設計研究所
94
Edge detection is a very important technique in the domain of image processing and computer vision. Because edge detection is useful in applying to image segmentation and object detection. An edge detection method based on Minimum Spanning Tree (MST) was published in 2005. The edge detection of MST method can produce better image quality than gradient operators. An information hiding algorithm based on Pixel-value Differencing (PVD) was announced in 2005. It can hide the secret data within the difference of two neighboring pixels. Afterward a new information hiding algorithm was issued in 2005. The new algorithm is based on combine PVD and Least Significant Bit (LSB). It can increase plenty of capacities more than the PVD algorithm. This study provides an edge detection method by chained linked-list. After compared to MST method, the proposed of the present study method has better time efficiency in processing speed. And the proposed method can detect the edge and the area of plain, it can reduce noises in the area of plain. In addition, CLL can be applied to information hiding, called Dynamic LSB by Edge Detection (DLED). DLED can determine the bits of LSB dynamic to improve hiding capacity and image quality. In current research, it is found that DLED can hide more secret data than PVD and others.

APA, Harvard, Vancouver, ISO, and other styles

38

Nagoor, Omniah H. "Image-based Exploration of Large-Scale Pathline Fields." Thesis, 2014. http://hdl.handle.net/10754/321000.

Full text

Abstract:

While real-time applications are nowadays routinely used in visualizing large nu- merical simulations and volumes, handling these large-scale datasets requires high-end graphics clusters or supercomputers to process and visualize them. However, not all users have access to powerful clusters. Therefore, it is challenging to come up with a visualization approach that provides insight to large-scale datasets on a single com- puter. Explorable images (EI) is one of the methods that allows users to handle large data on a single workstation. Although it is a view-dependent method, it combines both exploration and modification of visual aspects without re-accessing the original huge data. In this thesis, we propose a novel image-based method that applies the concept of EI in visualizing large flow-field pathlines data. The goal of our work is to provide an optimized image-based method, which scales well with the dataset size. Our approach is based on constructing a per-pixel linked list data structure in which each pixel contains a list of pathlines segments. With this view-dependent method it is possible to filter, color-code and explore large-scale flow data in real-time. In addition, optimization techniques such as early-ray termination and deferred shading are applied, which further improves the performance and scalability of our approach.

APA, Harvard, Vancouver, ISO, and other styles

39

Porter, Donald E. "Operating system transactions." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-12-2488.

Full text

Abstract:

Applications must be able to synchronize accesses to operating system (OS) resources in order to ensure correctness in the face of concurrency and system failures. This thesis proposes system transactions, with which the programmer specifies atomic updates to heterogeneous system resources and the OS guarantees atomicity, consistency, isolation, and durability (ACID). This thesis provides a model for system transactions as a concurrency control mechanism. System transactions efficiently and cleanly solve long-standing concurrency problems that are difficult to address with other techniques. For example, malicious users can exploit race conditions between distinct system calls in privileged applications, gaining administrative access to a system. Programmers can eliminate these vulnerabilities by eliminating these race conditions with system transactions. Similarly, failed software installations can leave a system unusable. System transactions can roll back an unsuccessful software installation without disturbing concurrent, independent updates to the file system. This thesis describes the design and implementation of TxOS, a variant of Linux 2.6.22 that implements system transactions. The thesis contributes new implementation techniques that yield fast, serializable transactions with strong isolation and fairness between system transactions and non-transactional activity. Using system transactions, programmers can build applications with better performance or stronger correctness guarantees from simpler code. For instance, wrapping an installation of OpenSSH in a system transaction guarantees that a failed installation will be rolled back completely. These atomicity properties are provided by the OS, requiring no modification to the installer itself and adding only 10% performance overhead. The prototype implementation of system transactions also minimizes non-transactional overheads. For instance, a non-transactional compilation of Linux incurs negligible (less than 2%) overhead on TxOS. Finally, this thesis describes a new lock-free linked list algorithm, called OLF, for optimistic, lock-free lists. OLF addresses key limitations of prior algorithms, which sacrifice functionality for performance. Prior lock-free list algorithms can safely insert or delete a single item, but cannot atomically compose multiple operations (e.g., atomically move an item between two lists). OLF provides both arbitrary composition of list operations as well as performance scalability close to previous lock-free list designs. OLF also removes previous requirements for dynamic memory allocation and garbage collection of list nodes, making it suitable for low-level system software, such as the Linux kernel. We replace lists in the Linux kernel's directory cache with OLF lists, which currently requires a coarse-grained lock to ensure invariants across multiple lists. OLF lists in the Linux kernel improve performance of a filesystem metadata microbenchmark by 3x over unmodified Linux at 8 CPUs. The TxOS prototype demonstrates that a mature OS running on commodity hardware can provide system transactions at a reasonable performance cost. As a practical OS abstraction for application developers, system transactions facilitate writing correct application code in the presence of concurrency and system failures. The OLF algorithm demonstrates that application developers can have both the functionality of locks and the performance scalability of a lock-free linked list.
text

APA, Harvard, Vancouver, ISO, and other styles

40

Fomitchev, Mikhail. "Lock-free linked lists and skip lists /." 2003. http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99307.

Full text

Abstract:

Thesis (M.Sc.)--York University, 2003. Graduate Programme in Computer Science.
Typescript. Includes bibliographical references (leaves 224-226). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL:http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss&rft%5Fval%5Ffmt=info:ofi/fmt:kev:mtx:dissertation&rft%5Fdat=xri:pqdiss:MQ99307

APA, Harvard, Vancouver, ISO, and other styles

41

Hsu, Kuo-Hua, and 徐國華. "Addition of Arrays, Records and Linked Lists to a Visual Coding System – Some Issues and Solutions." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/09538693502205138421.

Full text

Abstract:

碩士
中原大學
資訊工程研究所
99
For most novices, learning to write a program is a very difficult challenge, especially when arrays, records, or linked lists are used in the program. These data types are more complex. Therefore, students may not fully understand how to process such data structures. In order to solve this problem, a visual coding system was developed to help students learn the use of arrays, records, and linked lists. In this thesis, we describe how the system works and we also discuss about the design and implementation of this system. We first examine the differences between visual coding systems, visual programming systems, program visualization systems and interface builders. This is followed by a discussion about existing research on visual programming, program visualization and visual coding. The discussion focuses on issues and solutions as related to how arrays, records, and linked lists are presented and operated upon. By using a questionnaire, students’ reaction toward the potential usefulness of this system was solicited and presented as a survey result. The survey result shows that the use of this visual coding system for writing programs helped them better understand the working of programs; this system also helped them develop the understanding of the concepts of array and record. However, only few students agree that this system can be used as a substitute for traditional textual programming systems for writing programs. The survey result is in line with the role of the system. It also confirms that the use of visual coding does help students to better understand the concepts of array and record.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Linked list'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles