Dissertationen zum Thema „Co-Networks“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Co-Networks" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Morel, Victor. „Generating co-evolutionary polarized opinion networks“. Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-307147.
Der volle Inhalt der QuellePires, David Laranjo. „Authorship attribution using co-occurrence networks“. Master's thesis, Universidade de Évora, 2021. http://hdl.handle.net/10174/30831.
Der volle Inhalt der QuelleXi, Wenna. „Community Structure in Co-Location Networks“. The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1566156023255678.
Der volle Inhalt der QuelleKalluru, Vikram Gajanan. „Identify Condition Specific Gene Co-expression Networks“. The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338304258.
Der volle Inhalt der QuelleDelgado, Román María del Carmen. „Organisation-based co-ordination of wireless sensor networks“. Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/285080.
Der volle Inhalt der QuelleThis thesis introduces the Coalition Oriented Sensing Algorithm (COSA) as a self-organisation mechanism for Wireless Sensor Networks (WSNs). This algorithm aims at extending the network lifetime at the same time that the primary goal of the network –faithfully monitoring the environment– is also guaranteed. The evaluation of the algorithm performance is based on a novel simulator, RepastSNS. The implementation of COSA and the development of its experimental setup define a reusable software structure to work over this simulation environment. It also favours the performance of future enhancements of the algorithm as well as its exportation. The use of WSNs has become widespread in the last years. The special characteristics of these networks have favoured their application to many different areas. One of the major concerns about WSNs refers to their energy management, as they are typically constraint in energy availability. This problem has gained the attention of researchers that try to improve this aspect of the WSNs by defining network energy conservation strategies. This constraint becomes especially acute when the network deployment environment does not allow for battery replenishment or node connection to the net. This is the case of the environment considered for COSA evaluation. The use case considered is a WSN deployed along a waterway in order to monitor the state of the water and detect the presence of pollutant sources. The definition of COSA is inspired by the Multiagent Systems (MAS) paradigm through the identification of nodes in a WSN with agents in a MAS. COSA defines a coalition formation algorithm based on peer-to-peer dialogues between neighbouring agents (nodes). The algorithm is completely embedded into the agent behaviour. Agents implementing COSA communicate with its neighbours to exchange information about their perception of the environment and their state. As a result of this local communication, agents select the role to play in the organisation and can then establish leader-follower relationships. The establishment of these peer-to-peer relationships is based on two relational functions and a negotiation protocol that lays down the norms of this co-ordination. Agents join in groups in order to trade off the accuracy of the sensed data and their energy consumption. As a consequence, COSA endows the network with self-organisation capacity. This ability is used to adapt energy consumption to changes in the environment and, at the same time, to fulfil sampling objectives in terms of the quality of the information reported to the sink. The results derived from experimentation support preliminary hypotheses about COSA good performance. They also provide insights on the relationship between local co-ordination and the gains obtained from COSA’s use.
Hasan, Khondokar Fida. „GNSS time synchronisation in co-operative vehicular networks“. Thesis, Queensland University of Technology, 2018. https://eprints.qut.edu.au/120849/1/Khondokar%20Fida_Hasan_Thesis.pdf.
Der volle Inhalt der QuelleMutwil, Marek. „Integrative transcriptomic approaches to analyzing plant co-expression networks“. Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2011/5075/.
Der volle Inhalt der QuelleEs ist bereits ausgiebig gezeigt worden, dass Gene, deren Expression auf Transkriptionsebene koordiniert ist, häufig auch funktional in verwandten Stoffwechselwegen vorkommen, und dass sich dies wahrscheinlich auch Spezies- und sogar Reichübergreifend sagen lässt (Ihmels et al., 2004). Anfänglich wurden solche Beziehungen verwendet, um sogenannte Genfunktionsmodule in Hefe und Säugern aufzudecken (Ihmels et al., 2004), um dann orthologe Genfunktionen zwischen verschiedene Spezies und Reichen zu entdecken (Stuart et al., 2003; Bergmann et al., 2004). Modellorganismen wie Arabidopsis werden bevorzugt in der Forschung verwendet, weil man durch die schnelle Generationszeit in kurzer Zeit viele Daten erheben kann und aufgrund dessen die Ressourcen- und Informationsvielfalt um ein Vielfaches größer ist. Ein Hauptziel ist der Wissenstransfer von Modellorganismen auf Spezies, die gesellschaftlich von höherer Bedeutung sind wie z.B. Getreidearten oder andere Feldfrüchte. Pflanzen besitzen oft große Genfamilien und die eindeutige Identifizierung von gut charakterisierten Arabidopsisorthologen in besagten Nutzpflanzen ist kein triviales Vorhaben. In der vorliegenden Arbeit werden Konzepte zur Nutzung von Co-expressionsnetzwerken beschrieben, die helfen sollen (i) Genfunktionen zu identifizieren, (ii) die Organisation von biologischen Prozessen aufzuklären und (iii) das erworbene Wissen auf andere Spezies übertragbar zu machen. Ein häufig von Bioinformatikern übersehender Umstand ist, dass bioinformatische Methoden nur so sinnvoll sind wie ihre Zugänglichkeit. Deshalb basiert der Großteil dieser Arbeit auf freiverfügbaren und vor allem für Biologen nutzerfreundlichen Webtools.
Ziebell, Sara E. „A Powerful Correlation Method for Microbial Co-Occurrence Networks“. Thesis, The University of Arizona, 2015. http://hdl.handle.net/10150/595812.
Der volle Inhalt der QuelleRoth, Camille. „Co-evolution in epistemic networks : reconstructing social complex systems“. Palaiseau, Ecole polytechnique, 2005. http://www.theses.fr/2005EPXX0057.
Der volle Inhalt der QuelleAgents producing and exchanging knowledge are forming as a whole a socio-semantic complex system. Studying such knowledge communities offers theoretical challenges, with the perspective of naturalizing further social sciences, as well as practical challenges, with potential applications enabling agents to know the dynamics of the system they are participating in. The present thesis lies within the framework of this research program. Alongside and more broadly, we address the question of reconstruction in social science. Reconstruction is a reverse problem consisting of two issues: (i) deduce a given high-level observation for a considered system from low-level phenomena; and (ii) reconstruct the evolution of high-level observations from the dynamics of lower-level objects. In this respect, we argue that several significant aspects of the structure of a knowledge community are primarily produced by the co-evolution between agents and concepts, i. E. The evolution of an epistemic network. In particular, we address the first reconstruction issue by using Galois lattices to rebuild taxonomies of knowledge communities from low-level observation of relationships between agents and concepts; achieving ultimately an historical description (inter alia field progress, decline, specialization, interaction - merging or splitting). We then micro-found various stylized facts regarding this particular structure, by exhibiting processes at the level of agents accounting for the emergence of epistemic community structure. After assessing the empirical interaction and growth processes, and assuming that agents and concepts are co-evolving, we successfully propose a morphogenesis model rebuilding relevant high-level stylized facts. We finally defend a general epistemological point related to the methodology of complex system reconstruction, eventually supporting our choice of a co-evolutionary framework
Connor, Nora, Albert Barberán und Aaron Clauset. „Using null models to infer microbial co-occurrence networks“. PUBLIC LIBRARY SCIENCE, 2017. http://hdl.handle.net/10150/624498.
Der volle Inhalt der QuellePhlippen, Sandra. „Come close and co-create : proximities in pharmaceutical innovation networks /“. Rotterdam : Erasmus Universiteit, 2008. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=9789051709186.
Der volle Inhalt der QuelleLebo, Timothy M. „Guiding object recognition : a shape model with co-activation networks /“. Link to online version, 2005. http://hdl.handle.net/1850/993.
Der volle Inhalt der QuelleLuoto, P. (Petri). „Co-primary multi-operator resource sharing for small cell networks“. Doctoral thesis, Oulun yliopisto, 2017. http://urn.fi/urn:isbn:9789526214979.
Der volle Inhalt der QuelleTiivistelmä Tämä väitöskirja keskittyy kehittämään uusia menetelmiä, joilla jaetaan taajuuksia useiden operaattoreiden kesken tulevista viidennen sukupolven verkoista alkaen. Päätavoite on parantaa tiedonsiirtonopeuksia sellaisissa piensoluverkoissa, joissa matkapuhelinoperaattorit jakavat joko heidän omia taajuusalueitaan tai heillä yhteisomistuksessa olevia taajuuksia. Kehitettyjen menetelmien suorituskykyä arvioidaan mittavien järjestelmätason simulointien avulla. Matkapuhelinoperaattorit tyypillisesti omistavat yksin tietyt taajuusalueet, eivätkä ole valmiita jakamaan niitä. On kuitenkin oletettu, että tulevaisuudessa matkapuhelinoperaattorit joutuvat jakamaan taajuuksia, koska taajuusalueet ovat kalliita ja niukkoja erityisesti matalilla taajuusalueilla. Korkeammat taajuusalueet (> 6 GHz) puolestaan muodostavat otollisen alustan tehokkaalle spektrin jaetulle käytölle, koska niillä ei ole vielä olemassa olevaa taajuussääntelyä. Väitöskirjan ensimmäisessä osassa keskitytään kasvattamaan tiedonsiirtonopeuksia kun jokainen matkapuhelinoperaattori omistaa oman taajuuskaistansa ja matkapuhelinoperaattorit määrittävät kuinka suuren prosentuaalisen osuuden ovat valmiita jakamaan. Esitettyjen algoritmien päätavoite on jakaa taajuuksia dynaamisesti matkapuhelinoperaattoreiden kesken. Algoritmeissa hyödynnetään tietoa matkapuhelinoperaattoreiden taajuuden käyttöasteesta, jonka matkapuhelinoperaattoritkommunikoivat toisilleen. Näin häiriö voidaan välttää ja taajuuden käyttö maksimoidaan. Käyttämättömät taajuudet jaetaan tasaisesti matkapuhelinoperaattorien kesken tietyllä ajanhetkellä. Näin voidaan taata lyhytaikainen oikeudenmukainen taajuuksien käyttö, mutta ei pitkäaikaista oikeudenmukaista taajuuksien käyttöä. Väitöskirjan toisessa osassa matkapuhelinoperaattorit jakavat yhteisomistuksessa olevia taajuuksia. Tavoitteena on saavuttaa pitkäaikainen taajuuksien oikeudenmukainen käyttö, kun piensoluverkot eivät kommunikoi keskenään. Työssä kehitetään piensoluverkoille hajautettu algoritmi, joka perustuu oppimistyökaluun Gibbs-näytteistys. Näin saadaan allokoitua jokaiselle tukiasemalle tarvittava määrä taajuusresursseja niin, että häiriö tukiasemien välillä minimoidaan ja koko piensoluverkon suorituskyky maksimoidaan. Tutkituissa skenaarioissa osoitetaan matkapuhelinoperaattoreiden välisen koordinaation tärkeys, kun jaetaan omia taajuusalueita. Toisaalta kun operaattorit jakavat yhteisomistuksessa olevia taajuuksia on mahdollista käyttää algoritmeja, joissa ei ole koordinaatiota matkapuhelinoperaattoreiden kesken. Väitöskirjassa vahvistetaan kehitettyjen algoritmien olevan tehokkaita ja sopivan monenlaisiin verkkoympäristöihin saavuttaen merkittäviä parannuksia tiedonsiirtonopeuteen ilman suuria kustannuksia
Song, Haoran. „MMSP : an alternative transport protocol for multiple co-existing networks“. Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/5417.
Der volle Inhalt der QuelleRupp, Thomas Manfred. „Supply information provision for co-operation in complex production networks“. Thesis, Imperial College London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270502.
Der volle Inhalt der QuelleKhare, Vineet R. „Automatic problem decomposition using co-evolution and modular neural networks“. Thesis, University of Birmingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435412.
Der volle Inhalt der QuelleZhang, Jingyao. „Hardware-Software Co-Design for Sensor Nodes in Wireless Networks“. Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/50972.
Der volle Inhalt der QuelleSUNSHINE is the first sensornet simulator that effectively supports joint evaluation and design of sensor hardware and software performance in a networked context. SUNSHINE captures the performance of network protocols, software and hardware up to cycle-level accuracy through its seamless integration of three existing sensornet simulators: a network simulator TOSSIM, an instruction-set simulator SimulAVR and a hardware simulator
GEZEL. SUNSHINE solves several sensornet simulation challenges, including data exchanges and time synchronization across different simulation domains and simulation accuracy levels. SUNSHINE also provides hardware specification scheme for simulating flexible and customized hardware designs. Several experiments are given to illustrate SUNSHINE\'s simulation capability. Evaluation results are provided to demonstrate that SUNSHINE is an efficient tool for software-hardware co-design in sensornet research.
Even though SUNSHINE can simulate flexible sensor nodes (nodes contain FPGA chips as coprocessors) in wireless networks, it does not estimate power/energy consumption of sensor nodes. So far, no simulators have been developed to evaluate the performance of such flexible nodes in wireless networks. In second section, we present PowerSUNSHINE, a power- and energy-estimation tool that fills the void. PowerSUNSHINE is the first scalable power/energy estimation tool for WSNs that provides an accurate prediction for both fixed and flexible sensor nodes. In the section, we first describe requirements and challenges of building PowerSUNSHINE. Then, we present power/energy models for both fixed and flexible sensor nodes. Two testbeds, a MicaZ platform and a flexible node consisting of a microcontroller, a radio and a FPGA based co-processor, are provided to demonstrate the simulation fidelity of PowerSUNSHINE. We also discuss several evaluation results based on simulation and testbeds to show that PowerSUNSHINE is a scalable simulation tool that provides accurate estimation of power/energy consumption for both fixed and flexible sensor nodes.
Since the main components of sensor nodes include a microcontroller and a wireless transceiver (radio), their real-time performance may be a bottleneck when executing computation-intensive tasks in sensor networks. A coprocessor can alleviate the burden of microcontroller from multiple tasks and hence decrease the probability of dropping packets from wireless channel. Even though adding a coprocessor would gain benefits for sensor networks, designing applications for sensor nodes with coprocessors from scratch is challenging due to the consideration of design details in multiple domains, including software, hardware, and network. To solve this problem, we propose a hardware-software co-design framework for network applications that contain multiprocessor sensor nodes. The framework includes a three-layered architecture for multiprocessor sensor nodes and application interfaces under the framework. The layered architecture is to make the design of multiprocessor nodes\' applications flexible and efficient. The application interfaces under the framework are implemented for deploying reliable applications of multiprocessor sensor nodes. Resource sharing technique is provided to make processor, coprocessor and radio work coordinately via communication bus. Several testbeds containing multiprocessor sensor nodes are deployed to evaluate the effectiveness of our framework. Network experiments are executed in SUNSHINE emulator to demonstrate the benefits of using multiprocessor sensor nodes in many network scenarios.
Ph. D.
Philippen, Sandra Magdalena Wilhelmina. „Come close and co-create proximities in pharmaceutical innovation networks /“. [Amsterdam] : Rotterdam : Thela Thesis ; Erasmus University [Host], 2008. http://hdl.handle.net/1765/13754.
Der volle Inhalt der QuelleAli, Mohamad Jaafar. „Wireless body area networks : co-channel interference mitigation & avoidance“. Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCB252/document.
Der volle Inhalt der QuelleA Wireless Body Area Network (WBAN) is a short-range network that consists of a coordinator (Crd) and a collection of low-power sensors that can be implanted in or attached to the human body. Basically, WBANs can provide real-time patient monitoring and serve in various applications such as ubiquitous health-care, consumer electronics, military, sports, etc. [1]. As the license-free 2.4 GHz ISM band is widely used among WBANs and across other wireless technologies, the fundamental problem is to mitigate the resulting co-channel interference. Other serious problems are to extend the network lifetime and to ensure reliable transmission within WBANs, which is an urgent requirement for health-care applications. Therefore, in this thesis, we conduct a systematic research on a few number of research problems related to radio co-channel interference, energy consumption, and network reliability. Specifically, we address the following problems ranging from theoretical modeling and analysis to practical protocol design: • Intra-WBAN interference mitigation and avoidance • Cooperative inter-WBAN interference mitigation and avoidance • Non-cooperative inter-WBAN interference mitigation and avoidance • Interference mitigation and avoidance in WBANs with IoT Firstly, to mitigate the intra-WBAN interference, we present two mechanisms for a WBAN. The first is called CSMA to Flexible TDMA combination for Interference Mitigation, namely, CFTIM, which dynamically allocates time-slots and stable channels to lower the intra-WBAN interference. The second is called Interference Avoidance Algorithm, namely IAA that dynamically adjusts the superframe length and limits the number of channels to 2 to lower the intra-WBAN interference and save energy. Theoretically, we derive a probabilistic model that proves the SINR outage probability is lowered. Simulation results demonstrate the effectiveness and the efficiency of CFTIM and IAA in terms of lowering the probability of interference, extending network lifetime, improving throughput and reliability. Secondly, we address the problem of interference among cooperative WBANs through using orthogonal codes. Motivated by distributed time provisioning supported in IEEE 802.15.6 standard [2], we propose two schemes. The first is called Distributed Time Correlation Reference, namely, DTRC that provides each WBAN with the knowledge about which superframes overlap with each other. The second is called Orthogonal Code Allocation Algorithm for Interference Mitigation, namely, OCAIM, that allocates orthogonal codes to interfering sensors belonging to sensor interference lists (SILs), which are generated based on the exchange of power-based information among WBANs. Mathematically, we derive the successful and collision probabilities of frames transmissions. Extensive simulations are conducted and the results demonstrate that OCAIM can diminish the interference, improve the throughput and save the power resource. Thirdly, we address the problem of co-channel interference among non-cooperative WBANs through time-slot and channel hopping. Specifically, we propose two schemes that are based on Latin rectangles. The first is called Distributed Algorithm for Interference mitigation using Latin rectangles, namely, DAIL that allocates a single channel to a timeslot combination to each sensor to diminish inter-WBAN interference and to yield better schedules of the medium access within each WBAN. The second is called Channel Hopping for Interference Mitigation, namely, CHIM, which generates a predictable interference free transmission schedule for all sensors within a WBAN. CHIM applies the channel switching only when a sensor experiences interference to save the power resource. Furthermore, we present an analytical model that derives bounds on collision probability and throughput for sensors transmissions. (...)
MORICI, ANDREA. „HW/SW Co-Design of low-power wireless sensor networks“. Doctoral thesis, Università Politecnica delle Marche, 2009. http://hdl.handle.net/11566/242271.
Der volle Inhalt der QuelleYasmeen, Gisèle. „Mutual aid networks in two feminist housing co-operatives in Montreal“. Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=60577.
Der volle Inhalt der QuelleMembers of each co-op were interviewed using a semi-directed interview guide. Social interaction is analysed qualitatively and focuses on the content of exchanges between co-op residents and patterns of socialising. The study concludes with an analysis of spatial micropolitics in terms of conflict and co-operation.
Petigara, Noshirwan Kavas 1979. „CRAM : co-operative routing and memory for networks of embedded sensors“. Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87284.
Der volle Inhalt der QuelleIncludes bibliographical references (leaves 66-69).
by Noshirwan Kavas Petigara.
M.Eng.
Marshall, Paul. „Inventing television : transnational networks of co-operation and rivalry, 1870-1936“. Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/inventing-television-transnational-networks-ofcooperation-and-rivalry-18701936(3b368b90-9755-4511-9b77-7edc9644f91f).html.
Der volle Inhalt der QuelleGeorge, Karina Anne. „Synthesis, characterisation and invitro evaluation of PLLA-co-succinic anhydride networks“. Thesis, Queensland University of Technology, 2006. https://eprints.qut.edu.au/16494/1/Karina_Anne_George_Thesis.pdf.
Der volle Inhalt der QuelleGeorge, Karina Anne. „Synthesis, characterisation and invitro evaluation of PLLA-co-succinic anhydride networks“. Queensland University of Technology, 2006. http://eprints.qut.edu.au/16494/.
Der volle Inhalt der QuelleNorling, Kristoffer. „A Performance Evaluation of Secure Distributed Co-Simulation over Wide Area Networks“. Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15786.
Der volle Inhalt der QuelleDifferent types of models often require different tools and environments to be modeled and simulated. These tools and environments are specialized to handle specific purposes. The models created for these special purposes can then be included in the modeling and simulation of large complex systems. This scenario increases the motivation to use a co-simulation technique. Co-simulation allows for coupling of different simulators into one coherent simulation. Different parts of a system are often modeled by different departments within an enterprise or by subcontractors. Since the models often are describing enterprises’ primary know-how they become important business assets. This raises the need for a secure modeling and simulation approach. This thesis discusses different approaches regarding how to securely simulate and distribute models. We focus on a distributed co-simulation approach over wide area networks (WANs), using transmission line modeling (TLM). The approach is tested in an experimental environment at Linköping University, Sweden, and by real condition co-simulations between Sweden and Australia. A series of experiments are conducted using a simulated WAN environment and the results are put in relation to the real encrypted simulations between Sweden and Australia. We measure the performance during the simulations and evaluate the results. We observe that by distributing the co-simulation we suffer from performance losses. These losses and what parameters cause them is our primary emphasis in the evaluation. We also see that there are two types of parameters that affect the total simulation time in the distributed environment. First there are parameters that belong to the models, and then there are parameters that belong to the WAN environment. We conclude that several of the parameters have effect on the total simulation time. Especially the network delay (latency) has a significant impact.
Azimi, Reza. „Co-operative Driving at Intersections using Vehicular Networks and Vehicle-Resident Sensing“. Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/584.
Der volle Inhalt der QuelleMarcos, Carla Abregú, Abraham Sopla Maslucán, Miguel Cano Lengua und José C. Alvarez. „Co-authors Networks in Adsorption Refrigeration and Air-Conditioning with Solar Energy“. Universidad Peruana de Ciencias Aplicadas (UPC), 2021. http://hdl.handle.net/10757/653778.
Der volle Inhalt der QuelleThe refrigeration and air conditioning systems by adsorption with solar energy are a very interesting option to replace the conventional compression systems because they save energy, are noiseless and use non-aggressive ozone layer refrigerants; however, there are scarcities of studies at this topic. The acquisition of knowledge and positioning in research on this topic by new research groups could be facilitated by knowing the context, trends, and collaborations that emerge in the subject. A map of collaborative co-authors between the greatest authors on the subject was drawn up, the same one that is done using Gephi software. From the analysis of these maps, the centrality degree and collaboration between the authors were determined.
Revisión por pares
Manepalli, Sarika. „Enhanced handoff algorithm for the co-existence of mobile IPV4 and IPV6 networks“. Thesis, Wichita State University, 2009. http://hdl.handle.net/10057/2423.
Der volle Inhalt der QuelleThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
Karamanos, Anastasios. „Co-operative networks and the value of the firm : a structural embeddedness perspective“. Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289613.
Der volle Inhalt der QuelleChen, Kan. „Physical layer security in co-operative MIMO networks - key generation and reliability evaluation“. Diss., Kansas State University, 2016. http://hdl.handle.net/2097/32839.
Der volle Inhalt der QuelleDepartment of Electrical and Computer Engineering
Balasubramaniam Natarajan
Widely recognized security vulnerabilities in current wireless radio access technologies undermine the benefits of ubiquitous mobile connectivity. Security strategies typically rely on bit-level cryptographic techniques and associated protocols at various levels of the data processing stack. These solutions have drawbacks that have slowed down the progress of new wireless services. Physical layer security approaches derived from an information theoretic framework have been recently proposed with secret key generation being the primary focus of this dissertation. Previous studies of physical layer secret key generation (PHY-SKG) indicate that a low secret key generation rate (SKGR) is the primary limitation of this approach. To overcome this drawback, we propose novel SKG schemes to increase the SKGR as well as improve the security strength of generated secret keys by exploiting multiple input and multiple output (MIMO), cooperative MIMO (co-op MIMO) networks. Both theoretical and numerical results indicate that relay-based co-op MIMO schemes, traditionally used to enhance LTE-A network throughput and coverage, can also increase SKGR. Based on the proposed SKG schemes, we introduce innovative power allocation strategies to further enhance SKGR. Results indicate that the proposed power allocation scheme can offer 15% to 30% increase in SKGR relative to MIMO/co-op MIMO networks with equal power allocation at low-power region, thereby improving network security. Although co-op MIMO architecture can offer significant improvements in both performance and security, the concept of joint transmission and reception with relay nodes introduce new vulnerabilities. For example, even if the transmitted information is secured, it is difficult but essential to monitor the behavior of relay nodes. Selfish or malicious intentions of relay nodes may manifest as non-cooperation. Therefore, we propose relay node reliability evaluation schemes to measure and monitor the misbehavior of relay nodes. Using a power-sensing based reliability evaluation scheme, we attempt to detect selfish nodes thereby measuring the level of non-cooperation. An overall node reliability evaluation, which can be used as a guide for mobile users interested in collaboration with relay nodes, is performed at the basestation. For malicious behavior, we propose a network tomography technique to arrive at node reliability metrics. We estimate the delay distribution of each internal link within a co-op MIMO framework and use this estimate as an indicator of reliability. The effectiveness of the proposed node reliability evaluations are demonstrated via both theoretical analysis and simulations results. The proposed PHY-SKG strategies used in conjunction with node reliability evaluation schemes represent a novel cross-layer approach to enhance security of cooperative networks.
SABATINI, ANDREA. „Analysing new Product Development and Co-creation in Industrial Networks: Pathways and Capabilities“. Doctoral thesis, Università Politecnica delle Marche, 2019. http://hdl.handle.net/11566/263656.
Der volle Inhalt der QuelleThe aim of the research is to analyse new product development co-creation processes within industrial networks. The research is focused on the way actors of the business network co-create new products and on which co-creation capabilities these firm should use in order to succeed in these NPD processes. The manuscript aims to contribute to the IMP theory in industrial marketing, that is currently lacking empirical studies which provide thorough understanding of the interaction processes among firms within the industrial network in order to co-create new products. The studies conducted by IMP researchers represent also the main literature forming the theoretical background of the study, together with the NPD conceptualization and co-creation capabilities descriptions. The study adopts a single longitudinal case study methodology with systematic combining for depicting the findings. The case study analyses Hyperlean, which is an academic spin-off whose growth over time, in terms of product capabilities and revenues, is strongly tied to customers’ collaboration. Hyperlean has been chosen because of its potential uniqueness, that relies on the collaborations established with several big firms in order to develop the software by exploiting customers’ resources in terms of knowledge and technical information. This dissertation contributes to the literature by exploring the processes of new product development in co-creation between the case company and several actors of the business network and by identifying several different new product development co-creation pathways and co-creation capabilities deployed by Hyperlean in order to sustain commercialization activities. These findings revealed also several dark sides and critical issues within the processes under investigation.
Ho, Elly Yi-Hsuan. „Impact of embeddedness in co-ethnic & non co-ethnic networks on business performance : evidence from Chinese immigrant entrepreneurs in Australia“. Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/39146/1/Elly_Ho_Thesis.pdf.
Der volle Inhalt der QuellePetereit, Julia. „Petal - A New Approach to Construct and Analyze Gene Co-Expression Networks in R“. Thesis, University of Nevada, Reno, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10248467.
Der volle Inhalt der Quellepetal is a network analysis method that includes and takes advantage of precise Mathematics, Statistics, and Graph Theory, but remains practical to the life scientist. petal is built upon the assumption that large complex systems follow a scale-free and small-world network topology. One main intention of creating this program is to eliminate unnecessary noise and imprecision introduced by the user. Consequently, no user input parameters are required, and the program is designed to allow the two structural properties, scale-free and small-world, to govern the construction of network models.
The program is implemented in the statistical language R and is freely available as a package for download. Its package includes several simple R functions that the researcher can use to construct co-expression networks and extract gene groupings from a biologically meaningful network model. More advanced R users may use other functions for further downstream analyses, if desired.
The petal algorithm is discussed and its application demonstrated on several datasets. petal results show that the technique is capable of detecting biologically meaningful network modules from co-expression networks. That is, scientists can use this technique to identify groups of genes with possible similar function based on their expression information.
While this approach is motivated by whole-system gene expression data, the fundamental components of the method are transparent and can be applied to large datasets of many types, sizes, and stemming from various fields.
Dillenburg, Fabiane Cristine. „An approach for analyzing and classifying microarray data using gene co-expression networks cycles“. reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/171353.
Der volle Inhalt der QuelleOne of the main research areas in Systems Biology concerns the discovery of biological networks from microarray datasets. These networks consist of a great number of genes whose expression levels affect each other in various ways. We present a new way of analyzing microarray datasets, based on the different kind of cycles found among genes of the co-expression networks constructed using quantized data obtained from the microarrays. The input of the analysis method is formed by raw data, a set of interest genes (for example, genes from a known pathway) and a function (activator or inhibitor) of these genes. The output of the method is a set of cycles. A cycle is a closed walk, in which all vertices (except the first and last) are distinct. Thanks to the new way of finding relations among genes, a more robust interpretation of gene correlations is possible, because cycles are associated with feedback mechanisms that are very common in biological networks. Our hypothesis is that negative feedbacks allow finding relations among genes that may help explaining the stability of the regulatory process within the cell. Positive feedback cycles, on the other hand, may show the amount of imbalance of a certain cell in a given time. The cycle-based analysis allows identifying the stoichiometric relationship between the genes of the network. This methodology provides a better understanding of the biology of tumors. As a consequence, it may enable the development of more effective treatment therapies. Furthermore, cycles help differentiate, measure and explain the phenomena identified in healthy and diseased tissues. Cycles may also be used as a new method for classification of samples of a microarray (cancer diagnosis). Compared to other classification methods, cycle-based classification provides a richer explanation of the proposed classification, that can give hints on the possible therapies. Therefore, the main contributions of this thesis are: (i) a new cycle-based analysis method; (ii) a new microarray samples classification method; (iii) and, finally, application and achievement of practical results. We use the proposed methodology to analyze the genes of four networks closely related with cancer - apoptosis, glucolysis, cell cycle and NF B - in tissues of the most aggressive type of brain tumor (Gliobastoma multiforme – GBM) and in healthy tissues. Because most patients with GBMs die in less than a year, and essentially no patient has long-term survival, these tumors have drawn significant attention. Our main results show that the stoichiometric relationship between genes involved in apoptosis, glucolysis, cell cycle and NF B pathways is unbalanced in GBM samples versus control samples. This dysregulation can be measured and explained by the identification of a higher percentage of positive cycles in these networks. This conclusion helps to understand more about the biology of this tumor type. The proposed cycle-based classification method achieved the same performance metrics as a neural network, a classical classification method. However, our method has a significant advantage with respect to neural networks. The proposed classification method not only classifies samples, providing diagnosis, but also explains why samples were classified in a certain way in terms of the feedback mechanisms that are present/absent. This way, the method provides hints to biochemists about possible laboratory experiments, as well as on potential drug target genes.
GARAU, MICHELE. „DEVELOPMENT OF CO-SIMULATION PLATFORMS FOR STATIC AND DYNAMIC ANALYSIS OF SMART DISTRIBUTION NETWORKS“. Doctoral thesis, Università degli Studi di Cagliari, 2018. http://hdl.handle.net/11584/255955.
Der volle Inhalt der QuelleJohansson, Peter. „Dynamic Co-authorship Network Analysis with Applications to Survey Metadata“. Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-96794.
Der volle Inhalt der QuellePerez, Sarah Isa Esther. „Exploring microbial community structure and resilience through visualization and analysis of microbial co-occurrence networks“. Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/53928.
Der volle Inhalt der QuelleScience, Faculty of
Graduate
Arciniegas-Lopez, Maria Cristina. „Exploring scientific collaborations in geographical information science (GIScience) : a study of its co-authorship networks“. Thesis, City University London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440678.
Der volle Inhalt der QuelleCharalabopoulos, Grigorios. „Radial basis function neural networks for channel equalization and co-channel interference cancellation in OFDM“. Thesis, King's College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416116.
Der volle Inhalt der QuelleKwon, Woo Cheol. „Co-design of on-chip caches and networks for scalable shared-memory many-core CMPs“. Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118084.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (pages 169-180).
Chip Multi-Processors(CMPs) have become mainstream in recent years, providing increased parallelism as core counts scale. While a tiled CMP is widely accepted to be a scalable architecture for the many-core era, on-chip cache organization and coherence are far from solved problems. As the on-chip interconnect directly influences the latency and bandwidth of on-chip cache, scalable interconnect is an essential part of on-chip cache design. On the other hand, optimal design of interconnect can be determined by the traffic forms that it should handle. Thus, on-chip cache organization is inherently interleaved with on-chip interconnect design and vice versa. This dissertation aims to motivate the need for re-organization of on-chip caches to leverage the advancement of on-chip network technology to harness the full potential of future many-core CMPs. Conversely, we argue that on-chip network should also be designed to support specific functionalities required by the on-chip cache. We propose such co-design techniques to offer significant improvement of on-chip cache performance, and thus to provide scalable CMP cache solutions towards future many-core CMPs. The dissertation starts with the problem of remote on-chip cache access latency. Prior locality-aware approaches fundamentally attempt to keep data as close as possible to the requesting cores. In this dissertation, we challenge this design approach by introducing new cache organization that leverages a co-designed on-chip network that allows multi-hop single-cycle traversals. Next, the dissertation moves to cache coherence request ordering. Without built-in ordering capability within the interconnect, cache coherence protocols have to rely on external ordering points. This dissertation proposes a scalable ordered Network-on-Chip which supports ordering of requests for snoopy cache coherence. Lastly, we describe development of a 36-core research prototype chip to demonstrate that the proposed Network-on-Chip enables shared-memory CMPs to be readily scalable to many-core platforms.
by Woo Cheol Kwon.
Ph. D.
Hatem, Ayat. „Active Module Discovery: Integrated Approaches of Gene Co-Expression and PPI Networks and MicroRNA Data“. The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1398949621.
Der volle Inhalt der QuelleKar, Ar. „Corporate Co-evolution in State-Dominant Business Networks: the Case of the Myanmar Port Authority“. Thesis, Curtin University, 2020. http://hdl.handle.net/20.500.11937/81385.
Der volle Inhalt der QuelleSilva, Maximiliano Barbosa da. „Redes sociais de colaboração acadêmica: tendências, determinantes e fricções do processo de formação de coautorias entre pesquisadores no Brasil“. Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/12/12138/tde-07112013-205540/.
Der volle Inhalt der QuelleThis dissertation studies the trends, determinants and frictions of the formation of coauthorship links among researchers in Brazil for the production of academic articles. This task is divided into three papers. The first paper studies the evolution over time of the incidence and extension of coauthorship among researchers in various fields of knowledge. The results confirm the trend of growth, reported in the literature, in the percentage of coauthored papers and in the average number of authors per paper. Next, the determinants of formal collaboration among academics are investigated. It is found that women are more inclined to collaborate than men, that non-purely theoretic papers are more collaboration prone and that the probability of collaboration is increasing with the number of hours devoted by an individual to research in some fields of knowledge. The second paper studies the evolution of the coauthorship network in nine broad fields of knowledge over the last four decades. It is shown that in four of the nine broad fields of knowledge analyzed, the coauthorship network can be considered a small world. In addition to that, by decomposing the network formation process into its random and social components, it can be concluded that there exist significant matching frictions among researchers and that they differ across fields, time and population. The third paper investigates how the distance and the number of shortest paths between two researchers in a coauthorship network affect the probability that they initiate a collaboration. Eight broad fields of knowledge are studied. The results show that in four of them there are social network proximity effects on the probability of the emergence of a new coauthorship link and that these effects are strong. Moreover, the econometric strategy permits to conclude that the effects result from the flow of information about individual attributes and about past matching quality through the links of the network of academic collaboration. In addition to these three main contributions, the introductory chapter presents an extensive review of the social and economic networks literature with the purpose of motivating the great interest on this subject.
Zenoni, Beatrice. „Evaluating a co-creation model for social businesses: The case of ‘Linhas sobre rodas’“. Master's thesis, NSBE - UNL, 2013. http://hdl.handle.net/10362/9785.
Der volle Inhalt der QuelleThe following research is a critical evaluation of „Linhas sobre Rodas‟ co-creation process, since during my internship, from August to November 2012, I had the opportunity of directly and daily collaborate with the entities involved on the operationalization and implementation of this social business. The research analyses the key success factors of the „Linhas sobre Rodas‟ model during its initial stage, focusing on the stakeholders‟ relations and on the strategic alliance between the two co-creators. Through the evaluation of both strengths and weaknesses of this case study, the research provides recommendations and findings for similar cases.
Kale, Mehmet Cemil. „Multispectral co-occurence analysis for medical image processing“. The Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=osu1195500453.
Der volle Inhalt der QuelleCampbell, Carlene. „An efficient multichannel wireless sensor networks MAC protocol based on IEEE 802.11 distributed co-ordinated function“. Thesis, Middlesex University, 2011. http://eprints.mdx.ac.uk/7913/.
Der volle Inhalt der QuelleDouam, Florian. „Hepatitis C Virus E1E2 co-evolving networks unveil their functional dialogs and highlight original therapeutic strategies“. Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2013. http://tel.archives-ouvertes.fr/tel-00946592.
Der volle Inhalt der QuelleTang, Yi. „SUNSHINE: Integrate TOSSIM and P-Sim“. Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/40721.
Der volle Inhalt der QuelleMaster of Science
Uppalapati, Praneeth. „Network Mining Approach to Cancer Biomarker Discovery“. The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275405677.
Der volle Inhalt der Quelle