Dissertations / Theses on the topic 'Small-world'
To see the other types of publications on this topic, follow the link: Small-world.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Small-world.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Zhang, Xingjun. "Critical Properties of Small World Ising Models." MSSTATE, 2005. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11102005-220554/.
Full textAbstract:
In this dissertation, the critical scaling behavior of magnetic Ising models with long range interactions is studied. These long range interactions, when imposed in addition to interactions on a regular lattice, lead to small-world graphs. By using large-scale Monte Carlo simulations, together with finite-size scaling, the critical behavior of a number of different models is obtained. The Ising models studied in this dissertation include the z-model introduced by Scalettar, standard small-world bonds superimposed on a square lattice, and physical small-world bonds superimposed on a square lattice. From the scaling results of the Binder 4th order cumulant, the order parameter, and the susceptibility, the long-range interaction is found to drive the systems behavior from Ising-like to mean field, and drive the critical point to a higher temperature. It is concluded that with a large amount of strong long-range connections (compared to the interactions on regular lattices), so the long-range connection density is non-vanishing, systems have mean field behavior. With a weak interaction that vanishes for an infinite system size or for vanishing density of long-range connections the systems have Ising-like critical behavior. The crossover from Ising-like to mean-field behavior due to weak long-range interactions for systems with a large amount of long-range connections is also discussed. These results provide further evidence to support the existence of physical (quasi-) small-world nanomaterials.
2
Wu, Da. "Small world, not small competition: does spatial distance among audit partners matter?" Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1505193/.
Full textAbstract:
The purpose of my dissertation is to examine whether competition among audit partners affects audit quality. While prior research on audit market competition focuses on audit firm-level or office-level analyses, I argue that audit partners, as the primary decision makers in providing audit services, are likely to engage in competitive actions in the audit market. Further, I use spatial distance among audit partners to measure partner-level competition. I conjecture that spatial distance could better reflect the dynamics of audit market competition than the Herfindahl index, the traditional proxy for competition used in most extant studies. Drawing on the spatial economics theory and the social comparison theory, I hypothesize a negative association between competition measured by spatial distance and the quality level delivered by the incumbent audit partner. Using newly available data of U.S. audit partners, this study provides evidence that audit quality is higher (lower) when the spatial distance between the incumbent partner and the closest competing partner is larger (smaller). In addition, the results reveal that the effects of competition measured by spatial distance on audit quality is mainly a partner-level phenomenon rather than an office-level one. Overall, this study highlights the importance of studying competitive dynamics among audit partners.
3
VanderMeulen, Matt. "Small people want a big world (collected stories)." Morgantown, W. Va. : [West Virginia University Libraries], 2006. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=4725.
Full text
4
Dubreus, Terrance Maurice. "Monte Carlo simulations for small-world stochastic processes." Diss., Mississippi State : Mississippi State University, 2005. http://library.msstate.edu/content/templates/?a=72.
Full text
5
Lei, Tao. "The mixing time of Newman-Watts small world." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=110738.
Full textAbstract:
"Small worlds" are large networks in which any given node has only a few connections to other nodes, but possessing the property that all pairs of nodes are connected by a short path, typically logarithmic in the number of nodes. Small-world models are widely used in the physics literature for modeling various "real-world" networks, such as World Wide Web, power grid and neural network. When the network is too big to model completely, which is often the case for "real-world" network, we need other approaches which yield information about its typical or approximate structure. One such approach is to use random walks for sampling a uniform element from a large state space; to prove that such a technique works for a given network, a bound on the mixing time is required. However, little detailed information is known about the behavior of random walks on small-world models, though many predictions can be found in the physics literature. We survey the range of small-world models, existing information about them, introduce Markov chains, mixing times and a variety of techniques for bounding mixing times. Finally, the principal contribution of this thesis is to show that for a famous small-world random graph model known as the Newman--Watts small world, the mixing time is of order $\log^2 n$. This confirms a prediction of Richard Durrett, whoproved a lower bound of order $\log^2 n$ and an upper bound of order $\log^3 n$."De petits mondes" sont de larges réseaux au sein desquels chaque noeud donné n'a qu'un nombre limité de connexions à d'autres noeuds, mais ayant la propriété selon laquelle chaque paire de noeuds est connectée par un court parcours, typiquement de longueur logarithmique par rapport au nombre de noeuds du réseau. Les modèles de "petits mondes" sont couramment utilisés dans la littérature de physique pour modéliser divers réseaux de "mondes réels" tels que le réseau internet, le réseau électrique ainsi que les réseaux neuronaux. Lorsque le réseau est trop complexe pour être modélisé complètement, ce qui est souvent le cas des réseaux de "mondes réels", il nous faut d'autres approches qui nous renseignent sur sa structure typique ou approximative. Une telle approche consiste à utiliser la marche aléatoire pour échantillonner un élément uniforme d'un espace plus vaste. Afin de démontrer qu'une telle méthode convient pour un réseau donné, un seuil sur le temps de mélange est nécessaire. Toutefois, peu de détails sont connus quant ou comportement des marches aléatoires dans les modèles des "petits mondes" alors que de nombreuses prévisions peuvent être trouvées dans la littérature de physique. Nous citons une multitude de modèles de "petits mondes", les informations disponibles à leur égard, introduisons les chaines de Markov, temps de mélange et une variété de techniques pour les bornes des temps de mélange. Enfin, la principale contribution de cette thèse est de montrer qu'un modèle connu de graphe de "petit monde", connu sous le nom de Newman-Watts, le temps de mélange est de l'ordre de $\log^2 n$. Ceci confirme une prévision de Richard Durrett, qui a prouvé une borne inférieure de l'ordre de $\log^2 n$ et une borne supérieure de l'ordre de $\log^3 n$.
6
Johnstone, S. "Peer to peer information retrieval in a small world." Thesis, Queen's University Belfast, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.437430.
Full text
7
Rodríguez, Salazar Fernando. "Small-world interconnection networks for large parallel computer systems." Thesis, University of Glasgow, 2004. http://theses.gla.ac.uk/6740/.
Full textAbstract:
The use of small-world graphs as interconnection networks of multicomputers is proposed and analysed in this work. Small-world interconnection networks are constructed by adding (or modifying) edges to an underlying local graph. Graphs with a rich local structure but with a large diameter are shown to be the most suitable candidates for the underlying graph. Generation models based on random and deterministic wiring processes are proposed and analysed. For the random case basic properties such as degree, diameter, average length and bisection width are analysed, and the results show that a fast transition from a large diameter to a small diameter is experienced when the number of new edges introduced is increased. Random traffic analysis on these networks is undertaken, and it is shown that although the average latency experiences a similar reduction, networks with a small number of shortcuts have a tendency to saturate as most of the traffic flows through a small number of links. An analysis of the congestion of the networks corroborates this result and provides away of estimating the minimum number of shortcuts required to avoid saturation. To overcome these problems deterministic wiring is proposed and analysed. A Linear Feedback Shift Register is used to introduce shortcuts in the LFSR graphs. A simple routing algorithm has been constructed for the LFSR and extended with a greedy local optimisation technique. It has been shown that a small search depth gives good results and is less costly to implement than a full shortest path algorithm. The Hilbert graph on the other hand provides some additional characteristics, such as support for incremental expansion, efficient layout in two dimensional space (using two layers), and a small fixed degree of four. Small-world hypergraphs have also been studied. In particular incomplete hypermeshes have been introduced and analysed and it has been shown that they outperform the complete traditional implementations under a constant pinout argument. Since it has been shown that complete hypermeshes outperform the mesh, the torus, low dimensional m-ary d-cubes (with and without bypass channels), and multi-stage interconnection networks (when realistic decision times are accounted for and with a constant pinout), it follows that incomplete hypermeshes outperform them as well.
8
Taha, Samah M. Osman. "Small-world network models and their average path length." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/95834.
Full textAbstract:
Thesis (MSc)--Stellenbosch University, 2014.ENGLISH ABSTRACT: Socially-based networks are of particular interest amongst the variety of communication networks arising in reality. They are distinguished by having small average path length and high clustering coefficient, and so are examples of small-world networks. This thesis studies both real examples and theoretical models of small-world networks, with particular attention to average path length. Existing models of small-world networks, due to Watts and Strogatz (1998) and Newman and Watts (1999a), impose boundary conditions on a one dimensional lattice, and rewire links locally and probabilistically in the former or probabilistically adding extra links in the latter. These models are investigated and compared with real-world networks. We consider a model in which randomness is provided by the Erdos-Rényi random network models superposed on a deterministic one dimensional structured network. We reason about this model using tools and results from random graph theory. Given a disordered network C(n, p) formed by adding links randomly with probability p to a one dimensional network C(n). We improve the analytical result regarding the average path length by showing that the onset of smallworld behaviour occurs if pn is bounded away from zero. Furthermore, we show that when pn tends to zero, C(n, p) is no longer small-world. We display that the average path length in this case approaches infinity with the network order. We deduce that at least εn (where ε is a constant bigger than zero) random links should be added to a one dimensional lattice to ensure average path length of order log n.
AFRIKAANSE OPSOMMING: Sosiaal-baseerde netwerke is van besondere belang onder die verskeidenheid kommunikasie netwerke. Hulle word onderskei deur ’n klein gemiddelde skeidingsafstand en hoë samedrommingskoëffisiënt, en is voorbeelde van kleinwêreld netwerke. Hierdie verhandeling bestudeer beide werklike voorbeelde en teoretiese modelle van klein-wêreld netwerke, met besondere aandag op die gemiddelde padlengte. Bestaande modelle van klein-wêreld netwerke, te danke aan Watts en Strogatz (1998) en Newman en Watts (1999a), voeg randvoorwaardes by tot eendimensionele roosters, en herbedraad nedwerkskakels gebaseer op lokale kennis in die eerste geval en voeg willekeurig ekstra netwerkskakels in die tweede. Hierdie modelle word ondersoek en vergelyk met werklike-wêreld netwerke. Ons oorweeg ’n prosedure waarin willekeurigheid verskaf word deur die Erdös- Renyi toevalsnetwerk modelle wat op ’n een-dimensionele deterministiese gestruktureerde netwerk geimposeer word. Ons redeneer oor hierdie modelle deur gebruik te maak van gereedskap en resultate toevalsgrafieke teorie. Gegewe ’n wanordelike netwerk wat gevorm word deur skakels willekeurig met waarskynlikheid p tot ‘n een-dimensionele netwerk C(n) toe te voeg, verbeter ons die analitiese resultaat ten opsigte van die gemiddelde padlengte deur te wys dat die aanvang van klein-wêreld gedrag voorkom wanneer pn weg van nul begrens is. Verder toon ons dat, wanneer pn neig na nul, C(n, p) nie meer klein-wêreld is nie. Ons toon dat die gemiddelde padlengte in hierdie geval na oneindigheid streef saam met die netwerk groote. Ons lei af dat ten minste εn (waar εn n konstante groter as nul is) ewekansige skakels bygevoeg moet word by ’n een-dimensionele rooster om ‘n gemiddelde padlengte van orde log n te verseker.
9
Ganney, Paul Sefton. "Using small world models to study infection communication and control." Thesis, University of Hull, 2011. http://hydra.hull.ac.uk/resources/hull:4696.
Full textAbstract:
The modelling of infection transmission has taken many forms: The simple Susceptible-Infected-Removed (SIR) model yields good epidemiological results, but is not well suited to the modelling of the application of interventions. Attention has focused in recent years on graph (network) models and especially on those exhibiting the small-world properties described by Watts and Strogatz in “Nature” in 1998. This thesis examines such graph models, discovering several attributes which may yield improved results. In order to quantify the effects of these proposals, a classification system was developed together with a Goodness-of-Fit (GoF) measure. Additionally, a questionnaire was developed to reveal the operational organisational structure of the NHS Trust being examined. The resultant theoretical model was implemented in software and seeded with a graph derived from this questionnaire. This model was then examined to determine the effectiveness of these proposals, as measured via the GoF. The additional features proving beneficial were shown to be: full directionality in the graphs; modelling unknown paths via a new concept termed an “external path”; the division of the probability of infection transmission into three components; the seeding of the model with one derived from an organizational questionnaire. The resulting model was shown to yield very good results and be applicable to modelling both infection propagation and control.
10
Bernard, Alaina Brooke. "EFFECTS OF ISOLATION ON METAPOPULATION DYNAMICS IN SMALL-WORLD NETWORKS." Master's thesis, University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2960.
Full textAbstract:
Simulation models are valuable for making predictions that may be tested in natural systems and for understanding observed patterns. The simulation model developed for this thesis evaluates the effects of spatial network architecture, including organism dispersal patterns and isolation of habitats, on metapopulations. Two fields were merged throughout this project: metapopulation biology and small-world network theory. Small-world networks are characterized in their extremes as scale-free or single-scale. These models potentially simulate the networks of habitats and corridors in which metapopulations operate. Small-world network theory has been used to describe systems as diverse as rivers, the world-wide-web, and protein interactions, but has not been used as an experimental treatment for metapopulation dynamics. I tested the effects of growth rate, dispersal pattern, network architecture (scale-free and single-scale), attack type (targeted or random), and attack severity (0, 5, 10, 20, or 40% attacked populations) on metapopulation size and inter-population variation in a simulated system designed to be relevant to conservation biology and ecology. Metapopulation size and inter-population variation changed due to combinations of dispersal pattern, growth rate, and attack severity. Specifically, metapopulations were most affected by a combination of unidirectional dispersal and low growth rate in both metapopulation number and inter-population variation. However, a significant difference between scale-free and single-scale metapopulations was not found due to a low connectivity in the modeled networks as well as limitations of experimental assumptions. However, future studies that alter the model's assumptions could improve understanding of the influence of landscape structure on at-risk metapopulations.M.S.
Department of Biology
Sciences
Biology MS
11
Vieira, Israel Teixeira. "Small world network models of the dynamics of HIV infection." Thesis, University of Southampton, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433933.
Full text
12
Allen, Andrea J. "Average Shortest Path Length in a Novel Small-World Network." Oberlin College Honors Theses / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1516362622694547.
Full text
13
Higashi, Susan. "MiRNA and co : methodologically exploring the world of small RNAs." Thesis, Lyon 1, 2014. http://www.theses.fr/2014LYO10252/document.
Full textAbstract:
La principale contribution de cette thèse est le développement d'une méthode fiable, robuste, et rapide pour la prédiction des pré-miARNs. Deux objectifs avaient été assignés : efficacité et flexibilité. L'efficacité a été rendue possible au moyen d'un algorithme quadratique. La flexibilité repose sur deux aspects, la nature des données expérimentales et la position taxonomique de l'organisme (en particulier plantes ou animaux). Mirinho accepte en entrée des séquences de génomes complets mais aussi les très nombreuses séquences résultant d'un séquençage massif de type NGS de “RNAseq”. “L'universalité” taxonomique est obtenu par la possibilité de modifier les contraintes sur les tailles de la tige (double hélice) et de la boule terminale. Dans le cas de la prédiction des miARN de plantes la plus grande longueur de leur pré-miARN conduit à des méthodes d'extraction de la structure secondaire en tige-boule moins précises. Mirinho prend en compte ce problème lui permettant de fournir des structures secondaires de pré-miARN plus semblables à celles de miRBase que les autres méthodes disponibles. Mirinho a été utilisé dans le cadre de deux questions biologiques précises l'une concernant des RNAseq l'autre de l'ADN génomique. La première question a conduit au traitement et l'analyse des données RNAseq de Acyrthosiphon pisum, le puceron du pois. L'objectif était d'identifier les miARN qui sont différentiellement exprimés au cours des quatre stades de développement de cette espèce et sont donc des candidats à la régulation des gènes au cours du développement. Pour cette analyse, nous avons développé un pipeline, appelé MirinhoPipe. La deuxieme question a permis d'aborder les problèmes liés à la prévision et l'analyse des ARN non-codants (ARNnc) dans la bactérie Mycoplasma hyopneumoniae. Alvinho a été développé pour la prédiction de cibles des miRNA autour d'une segmentation d'une séquence numérique et de la détection de la conservation des séquences entre ncRNA utilisant un graphe k-partite. Nous avons finalement abordé un problème lié à la recherche de motifs conservés dans un ensemble de séquences et pouvant ainsi correspondre à des éléments fonctionnelsThe main contribution of this thesis is the development of a reliable, robust, and much faster method for the prediction of pre-miRNAs. With this method, we aimed mainly at two goals: efficiency and flexibility. Efficiency was made possible by means of a quadratic algorithm. Flexibility relies on two aspects, the input type and the organism clade. Mirinho can receive as input both a genome sequence and small RNA sequencing (sRNA-seq) data of both animal and plant species. To change from one clade to another, it suffices to change the lengths of the stem-arms and of the terminal loop. Concerning the prediction of plant miRNAs, because their pre-miRNAs are longer, the methods for extracting the hairpin secondary structure are not as accurate as for shorter sequences. With Mirinho, we also addressed this problem, which enabled to provide pre-miRNA secondary structures more similar to the ones in miRBase than the other available methods. Mirinho served as the basis to two other issues we addressed. The first issue led to the treatment and analysis of sRNA-seq data of Acyrthosiphon pisum, the pea aphid. The goal was to identify the miRNAs that are expressed during the four developmental stages of this species, allowing further biological conclusions concerning the regulatory system of such an organism. For this analysis, we developed a whole pipeline, called MirinhoPipe, at the end of which Mirinho was aggregated. We then moved on to the second issue, that involved problems related to the prediction and analysis of non-coding RNAs (ncRNAs) in the bacterium Mycoplasma hyopneumoniae. A method, called Alvinho, was thus developed for the prediction of targets in this bacterium, together with a pipeline for the segmentation of a numerical sequence and detection of conservation among ncRNA sequences using a kpartite graph. We finally addressed a problem related to motifs, that is to patterns, that may be composed of one or more parts, that appear conserved in a set of sequences and may correspond to functional elements
14
Gerlofstig, Carl, and Joakim Lindstrand. "It's a small world after all : the internationalization of Swedish companies." Thesis, Kristianstad University College, School of Health and Society, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hkr:diva-5645.
Full textAbstract:
Today, the global market is a fast expanding environment. There are more and more companies that go abroad to compete with companies from all over the world. The barriers between countries have been lowered and trade is encouraged. Therefore, international expansion is an important factor for many companies. The purpose of this dissertation is to study the effect international expansion has on firm performance. Since there is limited previous research within the field of international expansion and performance done on Swedish companies this dissertation tries to fill that gap.
The study is performed on listed Swedish companies. Several factors are used to measure the international expansion and performance of the companies. The relationships between international expansion and firm performance were positive when international expansion was measured as Number of Countries and Market Commitment. When international expansion was measured as Foreign Assets and as the GL-Index (Gerlofstig-Lindstrand Index), support was given to a positive relationship. The relationship between Foreign Board and firm performance as well as Foreign HR (Human Resources) and firm performance was to some extent supported. The remaining two measures of international expansion were Foreign Assets and International ownership. These measures showed no supported relationships between international expansion and firm performance. To conclude, the results of the study indicated that there are some support for a relationship between international expansion and firm performance for listed Swedish companies.
This study contributes to the lack of research on the effect of international expansion on performance of Swedish companies. Swedish managers can use the conclusions drawn from the study as guidelines for international expansion.
15
Short, Heather Jane Blake. "The hidden world of e-learning in small and medium enterprises." Thesis, University of Portsmouth, 2016. https://researchportal.port.ac.uk/portal/en/theses/the-hidden-world-of-elearning-in-small-and-medium-enterprises(40b7dc9c-e0fb-4dc2-956e-a65a97dde7fa).html.
Full textAbstract:
This research explores the hidden world of e-learning in Small and Medium Enterprises (SMEs) through a social constructivist lens. A rigorous review of literature in the domains of both learning and e-learning in SMEs reveals these to be under-investigated areas with the majority of the scant previous research having been conducted from the perspective of owner-managers. The thesis reports an ethnographic study to enable a consideration of wider perspectives and therefore reveal more about such learning. Thematic analysis of the ethnographic fieldwork, which took place in three SMEs of varying sizes and in different industries/sectors in southern England during 2014 and 2015, suggests that more learning, e-learning and self-directed learning takes place in SMEs than indicated by previous research. My research indicates that employees’ e-learning, like their general learning, is influenced by owner-managers, resource constraints, issues of trust and their need for social interaction in their learning. However, it finds that while owner-managers’ influence on learning and e-learning in their organisations is significant, this is not always positive. Furthermore, owner-managers and employees have very different conceptualisations of e-learning with the latter using a diverse range of hitherto unconsidered media. This, coupled with the prevalence of previous research having been conducted from the perspective of owner-managers, has contributed to lack of acknowledgement of the extent of learning and e-learning occurring in SMEs. The terminology used by research participants, which can be specific to individual SMEs, has further hidden such learning, which has been exacerbated by some previous researchers using unsuitable research methods. Analysis of my data also suggests that the concept of Communities of Practice (CoPs) is relevant to the experience of e-learning in SMEs, but that Lave and Wenger’s (1991) CoP model must recognise technological and workplace developments to remain relevant to current practices. Consequently, my thesis contributes to academic knowledge, research methodology and policy and practice, most significantly by the development of the first known model of e-learning for workers in SMEs. My research not only adds to scant research in the domains of learning and e-learning in SMEs, but also indicates exciting possibilities for further research and the future of e-learning in SMEs by showing that SMEs are indeed undertaking, and benefiting from, e-learning.
16
Kotrla, Mike. "Volkswagen churches in a Cadillac world a manual for small church pastors /." Theological Research Exchange Network (TREN), 1997. http://www.tren.com.
Full text
17
Xu, Zengwang. "Small-world characteristics in geographic, epidemic, and virtual spaces : a comparative study." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5768.
Full textAbstract:
This dissertation focuses on a comparative study of small-world characteristics in
geographical, epidemic, and virtual spaces. Small-world network is the major
component of the âÂÂnew science of networksâ that emerged recently in research related to
complex networks. It has shown a great potential to model the complex networks
encountered in geographical studies. This dissertation, in an attempt to understand the
emergence of small-world phenomenon in spatial networks, has investigated the smallworld
properties in aforementioned three spaces.
Specifically, this dissertation has studied roadway transportation networks at national,
metropolitan, and intra-city scales via network autocorrelation methods to investigate the
distance effect on the emergence of small-world properties. This dissertation also
investigated the effect of small-world network properties on the epidemic diffusion and
different control strategies through agent-based simulation on social networks. The ASLevel
Internet in the contiguous U.S. has been studied in its relation between local and
global connections, and its correspondence with small-world characteristics. Through theoretical simulations and empirical studies on spatial networks, this
dissertation has contributed to network science with a new method â network
autocorrelation, and better understanding from the perspective of the relation between
local and global connections and the distance effect in networks. A small-world
phenomenon results from the interplay between the dynamics occurring on networks and
the structure of networks; when the influencing distance of the dynamics reaches to the
threshold of the network, the network will logically emerge as a small-world network.
With the aid of numerical simulation a small-world network has a large number of local
connections and a small number of global links. It is also found that the epidemics will
take shorter time period to reach largest size on a small-world network and only
particular control strategy, such as targeted control strategy, will be effective on smallworld
networks.
This dissertation bridges the gap between new science of networks and the network
study in geography. It potentially contributes to GIScience with new modeling strategy
for representing, analyzing, and modeling complexity in hazards prevention, landscape
ecology, and sustainability science from a network-centric perspective.
18
Broodbank, Cyprian. "This small world the great : an island archaeology of the early Cyclades." Thesis, University of Cambridge, 1995. https://www.repository.cam.ac.uk/handle/1810/271997.
Full text
19
Clinton, John Francis Hall John F. "Modern digital seismology : instrumentation, and small amplitude studies in the engineering world /." Diss., Pasadena, Calif. : California Institute of Technology, 2004. http://resolver.caltech.edu/CaltechETD:etd-05202004-225044.
Full text
20
Hayes, Charice. "Marketing Strategies of Small Traditional Travel Agencies in a Technology-Driven World." ScholarWorks, 2016. https://scholarworks.waldenu.edu/dissertations/3166.
Full textAbstract:
In 2012, there was a 70% increase in online travel booking, resulting in small traditional brick-and-mortar travel agencies having serious difficulties with obtaining and retaining customers. The purpose of this case study was to explore online marketing strategies that leaders of small traditional travel agencies have used to successfully obtain and retain customers. Technology disruption theory was the conceptual framework of this study. Using criterion sampling, the population for this study consisted of 3 leaders of small traditional travel agencies located in the state of Maryland. Data collection consisted of interviews, observations, and review of documentation, such as displays, websites, business cards, and email campaigns. Data were analyzed using methodological triangulation through inductive coding of phrases and words. The following 4 themes emerged: company threats, online marketing strategies, various marketing strategies for improvement, and ways to compete with Internet-based travel agencies. Results indicated that 66% of participants believed that Internet-based travel agencies were threats. All of the participants used a form of online marketing and believed that customer loyalty helped to compete with Internet-based travel agencies. Positive social change may result when leaders of small traditional travel agencies increase their knowledge of online marketing strategies to obtain and retain customers, thereby leading to greater access to online travel opportunities for all, including physically challenged individuals often confined to their living areas.
21
Van, der Pol Johannes. "Social network of firms, innovation and industrial performance." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0207/document.
Full textAbstract:
L’objectif de cette thèse est de répondre à trois questions principales ; commentexpliquer et interpréter un réseau de collaboration, est-ce que des firmes avec une positionparticulière dans un réseau bénéficient d’une performance accrue et enfin, existe-t-il desstructures de réseaux qui favorisent l’innovation ?Pour répondre à ces questions, la thèse est organisée en trois parties. La première partieprésente, dans un premier chapitre, une revue analytique de la littérature suivie d’un chapitrequi présente la théorie derrière une des méthodes d’analyse réseau utilisée dans cette thèse :les Exponential Random Graph Models (ERGM).La seconde partie présente trois analyses empiriques. Le premier chapitre empirique analysel’impact du cycle de vie de la technologie sur la dynamique du réseau de collaboration autourdes composites structuraux en aéronautique. Les deux chapitres suivants se concentrent sursecteur aéronautique et le secteur des biotechnologies respectivement. L’objectif de ceschapitres est d’analyser la dynamique structurelle et d’identifier s’il existe un lien entreposition dans le réseau et la performance de la firme.La dernière partie cherche à identifier des structures de réseaux qui favorisent l’innovation.Un modèle à base d’agents (ABM) est proposé pour répondre à cette questionThis thesis aims to answer three main questions ; how can one explain andinterpret the structure of an innovation network, are there positions in a network which allowfor an increased performance for firms and finally, are there network structures which favourinnovation ? In order to answer these questions, the thesis is organised in three parts.The first part presents, in a first chapter, an analytical review of the literature followed by achapter presenting the theory behind one of the network analysis methods: ExponentialRandom Graph Models (ERGM).The second part of the thesis presents three empirical analyses. The first empirical chapteranalyses the impact of the life-cycle of the technology on the structural dynamics of thecollaboration network for Structural Composite Materials. The following two chapters focuson two sectors, the aerospace and biotech sector. The aim of these chapters is to analyse thestructural dynamics of collaboration networks as well as identifying a link between networkposition and firm performance.The third and final part of this thesis searches for network structures which might favourinnovation. An Agent-Based Model is used to answer this final question
22
Callan, Tim. "International transmission of economic disturbances : modelling small countries in a floating rate world." Thesis, University of Oxford, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305669.
Full text
23
MacLagan, Ianthe Mary. "Freedom and constraints : the world of women in a small town in Yemen." Thesis, University of London, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.270252.
Full text
24
Reis, Saulo Davi Soares e. "Local and global effects on navigation in small-world networks and explosive percolation." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=9014.
Full textAbstract:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgicoUm nÃmero significativo de redes reais possui caracterÃsticas locais ou nÃo-locais bem definidas. NÃs estudamos como estas caracterÃsticas podem influenciar processos de navegaÃÃo e processos percolativos que venham a ocorrer nas mesmas. Primeiramente, estudamos o problema de navegaÃÃo em redes regulares com ligaÃÃes de longo alcance e sujeitas a um vÃnculo de custo. Neste caso, a rede à construÃda a partir de uma rede regular de dimensÃo d a ser melhorada por meio da adiÃÃo de ligaÃÃes de longo alcance (atalhos) com uma probabilidade $P_{ij} sim r_{ji}^{-alpha}$ , onde $r_{ij}$ à a distÃncia de Manhattan entre os sÃtios $i$ e $j$. Mostramos que a condiÃÃo de navegaÃÃo Ãtima, $alpha = d+1$, permanece Ãtima, independente da estratÃgia de navegaÃÃo utilizada, seja ela baseada em um conhecimento local ou global da estrutura da rede. Em seguida, apresentamos um processo de crescimento de agregados que fornece uma clara conexÃo entre a MecÃnica EstatÃstica no equilÃbrio e o processo percolativo nÃo-local conhecido como PercolaÃÃo Explosiva. Mostramos que dois ingredientes sÃo suficientes para obter uma transiÃÃo abrupta na fraÃÃo do sistema ocupada pelo maior agregado: (i) os tamanhos de todos os agregados devem ser mantidos aproximadamente iguais durante o processo percolativo e (ii) a inclusÃo de ligaÃÃes de fusÃo (i.e., ligaÃÃes que conectam agregados diferentes) deve dominar o processo em detrimento de ligaÃÃes redundantes (i.e., ligaÃÃes que conectam sÃtios em um mesmo agregado). Por Ãltimo, introduzimos um modelo que generaliza a regra do produto para PercolaÃÃo Explosiva que revela os efeitos da nÃo-localidade no comportamento crÃtico do processo de percolaÃÃo. Mais precisamente, pares de ligaÃÃes nÃo ocupadas sÃo escolhidos de acordo com uma probabilidade que decai em lei de potÃncia com sua distÃncia de Manhattan, e apenas a ligaÃÃo que conecta agregados para os quais o produto de seus tamanho à o menor, à ocupada. Nossos resultados para redes regulares finitas em diversas dimensÃes sugerem que, na criticalidade, o expoente da lei de potÃncia tem uma influÃncia significativa nos expoentes de escala, onde observa-se uma transiÃÃo nos expoentes da percolaÃÃo tradicional para os expoentes da percolaÃÃo explosiva (nÃo-local) em determinados casos.
A significant number of real networks have well-defined local and nonlocal features. We investigate the influence of these features in the navigation through small-world networks and in explosive percolation. First, we investigate the navigation problem in lattices with long-range connections and subject to a cost constraint. Our network is built from a regular d-dimensional lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij} sim r_{ij}^{-alpha}, where $r_{ij}$ is the Manhattan distance between nodes $i$ and $j$, and a is $alpha$ variable exponent. We find optimal transport in the system for $alpha = d+1$. Remarkably, this condition remains optimal, regardless of the strategy used for navigation being based on local or global knowledge of the network structure. Second, we present a cluster growth process that provides a clear connection between equilibrium statistical mechanics and the nonlocal explosive percolation process. We show that the following two ingredients are sufficient for obtaining an abrupt transition in the fraction of the system occupied by the largest cluster: (i) the size of all growing clusters should be kept approximately the same, and (ii) the inclusion of merging bonds (i.e., bonds connecting nodes in different clusters) should dominate with respect to the redundant bonds (i.e., bonds connecting nodes in the same cluster). Finally, we introduce a generalization of the product rule for explosive percolation that reveals the effect of nonlocality on the critical behavior of the percolation process. Precisely, pairs of unoccupied bonds are chosen according to a probability that decays as a power law of their Manhattan distance, and only that bond connecting clusters whose product of their sizes is the smallest becomes occupied. Our results for d-dimensional lattices at criticality shows that the power law exponent of the product rule has a significant influence on the finite-size scaling exponents for the spanning cluster, the conducting backbone, and the cutting bonds of the system. For all these types of clusters, we observe a clear transition from ordinary to (nonlocal) explosive percolation.
25
Borrello, Davide. "Interacting particle systems : stochastic order, attractiveness and random walk on small world grahs." Rouen, 2009. http://www.theses.fr/2009ROUES032.
Full textAbstract:
Le sujet principal de la thèse sont les systèmes de particules en interaction, qui sont des classes de processus spatio-temporels. Ces systèmes décrivent l'évolution de particules en interaction les unes avec les autres sur un espace discret fini ou infini. Dans la partie I, nous examinons l'ordre stochastique dans un système de particules avec multiples naissances, morts et sauts sur l'espace d-dimensionnel à coordonnées entières. Nous donnons des applications pour des modèles biologiques de diffusion d'épidémies et de systèmes de dynamiques de métapopulations. Dans la partie II, nous analysons la marche aléatoire coalescente dans une classe de graphes aléatoires finis qui modèlent les réseaux sociaux, les graphes "small word"The main subject of the thesis is concerned with interacting particle systems, which are classes of spatio-temporal stochastic processes describing the evolution of particles in interaction with each other on a finite or infinite discrete space. In part I we investigate the stochastic order in a particle system with multiple births, deaths and jumps on the d-dimensional lattice. We give applications on biological models of spread of epidemics and metapopulations dynamics systems. In part II we analyse the coalescing random walk in a class of finite random graphs modeling social networks, the small world graphs
26
Toropova, Anastasia, and Анастасія Торопова. "World experience of state support of small business in conditions of sustainable development." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/51251.
Full textAbstract:
1. Ekonomika malogo pidpriyemnicztva: navch. posib. / T.G. Vasilcziv, O.I. Ilyash, N.G. Mishhenko. – K.: Znannya. 2013. – 446 s.
2. Derzhavna pidtrimka malogo ta serednogo biznesu. Dosvid Nimechchini [Електронний ресурс]. − Режим доступу: https://lib.chmnu.edu.ua/pdf/naukstud/5/19.pdf
3. Entrepreneurship in Denmark [Electronic resource]. - Access mode:
https://denmark.dk/society-and-business/entrepreneurshipSmall business occupies an important place in developed countries. The development of small business in the country is evidence of the democratic foundations of its structure, a high level of investment attractiveness and other.
Малий бізнес займає важливе місце в розвинених країнах. Розвиток малого бізнесу в країні є свідченням демократичних основ його структури, високого рівня інвестиційної привабливості та іншого.
27
Garmann, Melissa M. "Social Fermentation: Sustaining the Identity of a Small Town in a Globalizing World." University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1277144191.
Full text
28
Reis, Saulo-Davi Soares e. "Local and global effects on navigation in small-world networks and explosive percolation." reponame:Repositório Institucional da UFC, 2012. http://www.repositorio.ufc.br/handle/riufc/12889.
Full textAbstract:
REIS, Saulo Davi Soares e. Local and global effects on navigation in small-world networks and explosive percolation. 2012. 86 f. Tese (Doutorado em Física) - Programa de Pós-Graduação em Física, Departamento de Física, Centro de Ciências, Universidade Federal do Ceará, Fortaleza, 2012.Submitted by Edvander Pires (edvanderpires@gmail.com) on 2015-06-16T20:35:22Z No. of bitstreams: 1 2012_tese_sdsreis.pdf: 3097854 bytes, checksum: 3798beb23c0415893113a8072fc802fe (MD5)
Approved for entry into archive by Edvander Pires(edvanderpires@gmail.com) on 2015-06-18T18:21:41Z (GMT) No. of bitstreams: 1 2012_tese_sdsreis.pdf: 3097854 bytes, checksum: 3798beb23c0415893113a8072fc802fe (MD5)
Made available in DSpace on 2015-06-18T18:21:41Z (GMT). No. of bitstreams: 1 2012_tese_sdsreis.pdf: 3097854 bytes, checksum: 3798beb23c0415893113a8072fc802fe (MD5) Previous issue date: 2012
A significant number of real networks have well-defined local and nonlocal features. We investigate the influence of these features in the navigation through small-world networks and in explosive percolation. First, we investigate the navigation problem in lattices with long-range connections and subject to a cost constraint. Our network is built from a regular d-dimensional lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij} sim r_{ij}^{-alpha}, where $r_{ij}$ is the Manhattan distance between nodes $i$ and $j$, and a is $alpha$ variable exponent. We find optimal transport in the system for $alpha = d+1$. Remarkably, this condition remains optimal, regardless of the strategy used for navigation being based on local or global knowledge of the network structure. Second, we present a cluster growth process that provides a clear connection between equilibrium statistical mechanics and the nonlocal explosive percolation process. We show that the following two ingredients are sufficient for obtaining an abrupt transition in the fraction of the system occupied by the largest cluster: (i) the size of all growing clusters should be kept approximately the same, and (ii) the inclusion of merging bonds (i.e., bonds connecting nodes in different clusters) should dominate with respect to the redundant bonds (i.e., bonds connecting nodes in the same cluster). Finally, we introduce a generalization of the product rule for explosive percolation that reveals the effect of nonlocality on the critical behavior of the percolation process. Precisely, pairs of unoccupied bonds are chosen according to a probability that decays as a power law of their Manhattan distance, and only that bond connecting clusters whose product of their sizes is the smallest becomes occupied. Our results for d-dimensional lattices at criticality shows that the power law exponent of the product rule has a significant influence on the finite-size scaling exponents for the spanning cluster, the conducting backbone, and the cutting bonds of the system. For all these types of clusters, we observe a clear transition from ordinary to (nonlocal) explosive percolation.
Um número significativo de redes reais possui características locais ou não-locais bem definidas. Nós estudamos como estas características podem influenciar processos de navegação e processos percolativos que venham a ocorrer nas mesmas. Primeiramente, estudamos o problema de navegação em redes regulares com ligações de longo alcance e sujeitas a um vínculo de custo. Neste caso, a rede é construída a partir de uma rede regular de dimensão d a ser melhorada por meio da adição de ligações de longo alcance (atalhos) com uma probabilidade $P_{ij} sim r_{ji}^{-alpha}$ , onde $r_{ij}$ é a distância de Manhattan entre os sítios $i$ e $j$. Mostramos que a condição de navegação ótima, $alpha = d+1$, permanece ótima, independente da estratégia de navegação utilizada, seja ela baseada em um conhecimento local ou global da estrutura da rede. Em seguida, apresentamos um processo de crescimento de agregados que fornece uma clara conexão entre a Mecânica Estatística no equilíbrio e o processo percolativo não-local conhecido como Percolação Explosiva. Mostramos que dois ingredientes são suficientes para obter uma transição abrupta na fração do sistema ocupada pelo maior agregado: (i) os tamanhos de todos os agregados devem ser mantidos aproximadamente iguais durante o processo percolativo e (ii) a inclusão de ligações de fusão (i.e., ligações que conectam agregados diferentes) deve dominar o processo em detrimento de ligações redundantes (i.e., ligações que conectam sítios em um mesmo agregado). Por último, introduzimos um modelo que generaliza a regra do produto para Percolação Explosiva que revela os efeitos da não-localidade no comportamento crítico do processo de percolação. Mais precisamente, pares de ligações não ocupadas são escolhidos de acordo com uma probabilidade que decai em lei de potência com sua distância de Manhattan, e apenas a ligação que conecta agregados para os quais o produto de seus tamanho é o menor, é ocupada. Nossos resultados para redes regulares finitas em diversas dimensões sugerem que, na criticalidade, o expoente da lei de potência tem uma influência significativa nos expoentes de escala, onde observa-se uma transição nos expoentes da percolação tradicional para os expoentes da percolação explosiva (não-local) em determinados casos.
29
Kizhakkethil, Priya. "Document and Information Experience in Virtual Zenanas: An Exploration of a Diaspora Small World." Thesis, University of North Texas, 2020. https://digital.library.unt.edu/ark:/67531/metadc1752398/.
Full textAbstract:
The word diaspora is currently understood as the large scale voluntary movement of people, along with capital and goods due to the mechanisms of globalization. Adopting a diaspora, gender and leisure perspective, this dissertation looked at the information and document experiences of a particular fan community of women belonging to the Indian diaspora and the online spaces created and occupied by them (fan fiction blogs which can be viewed as book clubs). The study also looked at memory making and documenting of the same as a part of document experience, resulting in what can be termed as "serendipitous memory archives." The blogs hosting fan fiction and the mediated practices they support were viewed as documents for the study. The online spaces were conceptualized as small worlds and the theoretical framework used for the study consisted of a preliminary model of a small world (based on literature review and my understanding of the world under study), information experience as a concept as well as document experience models. The results show that social ties play a big role in the information and document experience, while memory making and documenting of the same are also seen to happen as part of the document experience. The results also show that adopting a document perspective enables us to see the myriad ways in which information is experienced, freeing us from considering as information only that which helps us in meeting a purpose or which fills a gap. Implications and suggestions for future research are discussed.
30
Balakrishnan, Hemant. "ALGORITHMS FOR DISCOVERING COMMUNITIES IN COMPLEX NETWORKS." Doctoral diss., University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2478.
Full textAbstract:
It has been observed that real-world random networks like the WWW, Internet, social networks, citation networks, etc., organize themselves into closely-knit groups that are locally dense and globally sparse. These closely-knit groups are termed communities. Nodes within a community are similar in some aspect. For example in a WWW network, communities might consist of web pages that share similar contents. Mining these communities facilitates better understanding of their evolution and topology, and is of great theoretical and commercial significance. Community related research has focused on two main problems: community discovery and community identification. Community discovery is the problem of extracting all the communities in a given network, whereas community identification is the problem of identifying the community, to which, a given set of nodes belong. We make a comparative study of various existing community-discovery algorithms. We then propose a new algorithm based on bibliographic metrics, which addresses the drawbacks in existing approaches. Bibliographic metrics are used to study similarities between publications in a citation network. Our algorithm classifies nodes in the network based on the similarity of their neighborhoods. One of the drawbacks of the current community-discovery algorithms is their computational complexity. These algorithms do not scale up to the enormous size of the real-world networks. We propose a hash-table-based technique that helps us compute the bibliometric similarity between nodes in O(m ?) time. Here m is the number of edges in the graph and ?, the largest degree. Next, we investigate different centrality metrics. Centrality metrics are used to portray the importance of a node in the network. We propose an algorithm that utilizes centrality metrics of the nodes to compute the importance of the edges in the network. Removal of the edges in ascending order of their importance breaks the network into components, each of which represent a community. We compare the performance of the algorithm on synthetic networks with a known community structure using several centrality metrics. Performance was measured as the percentage of nodes that were correctly classified. As an illustration, we model the ucf.edu domain as a web graph and analyze the changes in its properties like densification power law, edge density, degree distribution, diameter, etc., over a five-year period. Our results show super-linear growth in the number of edges with time. We observe (and explain) that despite the increase in average degree of the nodes, the edge density decreases with time.Ph.D.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Science
31
Borrello, Davide. "Systèmes de particules en interaction: ordre stochastique, attractivité et marches aléatoires sur graphes small world." Phd thesis, Université de Rouen, 2009. http://tel.archives-ouvertes.fr/tel-00444577.
Full textAbstract:
Le sujet principal de la thèse sont les systèmes de particules en interaction sur des graphes soit deterministes soit aléatoires. Les systèmes de particules en interaction sont des processus de Markov qui décrivent l'évolution de particules indistingables en interaction forte les unes avec les autres qui sont utilisés pour modéliser des phénomènes d'épidémies, de dynamiques des populations ou des processus chimiques. Dans la première partie de la thèse nous avons analysé l'ordre stochastique et l'attractivité dans une classe de systèmes de particules avec des naissances, des morts et des sauts de plus d'une particule à la fois qui dépendent de la conguration de manière très générale: nous avons utilisé l'attractivité pour obtenir des resultats d'ergodicité pour des modèles d'epidemie et pour construire des mesures invariantes non-triviales pour des modèles de dinamiques de métapopulations. Dans la deuxième partie de la thèse nous avons analysé les marches aléatoires coalescentes sur des graphes aléatoires, les graphes small world. Nous avons montré que le nombre de particules d'un processus de n marches aléatoires coalescentes renormalisées qui partent d'une ensemble particulier sur le small world converge vers un processus coalescent de Kingman. Nous avons aussi obtenu des resultats detaillés sur le temps de rencontre de deux particules sur le small world.
32
Anstee, Cameron Alistair Owen. "Make Contact: Contributive Bookselling and the Small Press in Canada Following the Second World War." Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/36041.
Full textAbstract:
This dissertation examines booksellers in multiple roles as cultural agents in the small press field. It proposes various ways of understanding the work of booksellers as actively shaping the production, distribution, reception, and preservation of small press works, arguing that bookselling is a small press act unaccounted for in existing scholarship. It is structured around the idea of “contributive” bookselling from Nicky Drumbolis, wherein the bookseller “adds dimension to the cultural exchange […] participates as user, maker, transistor” (“this fiveyear list”). The questions at the heart of this dissertation are: How does the small press, in its material strategies of production and distribution, reshape the terms of reception for readers? How does the bookseller contribute to these processes? What does independent bookselling look like when it is committed to the cultural and aesthetic goals of the small press? And what is absent from literary and cultural records when the bookseller is not accounted for?
This dissertation covers a period from 1952 to the present day. I begin by positing Raymond Souster’s “Contact” labour as an influential model for small press publishing in which the writer must adopt multiple roles in the communications circuit in order to construct and educate a community of readers. I then examine the bookseller catalogue as a bibliographic, critical, and pedagogical genre of publication that mediates productive encounters between readers and books. I next position the material, affective, and effective labour of the bookseller within the small press gift economy. Finally, I theorize the bookstore as a potential small press archive that functions as a viable counterweight to institutional collection and preservation. My reconsideration of the labour of the bookseller realigns relations between production, distribution, reception, documentation, and preservation of small press publications, making possible a more complete accounting of the histories of the book and of the small press in Canada.
33
Muda, Mohd Shaladdin. "A new world class manufacturing model for small and medium sized make-to-order companies." Thesis, Lancaster University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274204.
Full text
34
Girard, Joshua James. "Feasibility of Wastewater Reuse for Fish Production in Small Communities in a Developing World Setting." Scholar Commons, 2011. http://scholarcommons.usf.edu/etd/3119.
Full textAbstract:
Eradicating poverty, malnutrition, and the burden of disease have been included as three of the major issues facing the world. The United Nation member countries, having set forth the Millennium Development Goals, have committed themselves to solving these problems. Two major factors which affect solutions to these problems are increasing water stress and implementing improved sanitation. Integration of tilapia aquaculture and reuse of wastewater has been suggested as a solution which addresses both of these factors. The objective of this study is to examine the feasibility, and explore the benefits and drawbacks, to implementing small community wastewater fed (WWF) aquaculture systems in the developing world.
The water quality characteristics of treated effluent from nine wastewater treatment (WWT) plants were compiled from other studies. The concentration of total nitrogen in the effluent and the flow rate were of most importance, as they were used to calculate the nitrogen loading at each WWT plant. The nitrogen loading was then used to estimate the total pond size which could be supported by each WWT plant, the expected yearly yield for tilapia, and the percentage of the population who would benefit from provision of protein associated with the integration a fish farming system with the WWT plant.
Results show that WWF, semi-intensive tilapia culture can provide 10 grams per day of dietary protein for 11% - 52% of the population of the communities in this study when integrated with a community managed wastewater treatment system. To assess potential risks to human health, associated with WWF aquaculture, the level of fecal coliform (FC) contamination was compared to the standard set by the World Health Organization; less than 105 FC per 100 mL for reuse in fish ponds. The level of FC contamination in the WWT plant effluents ranged from 653 to 1.78 × 105 FC per 100 mL, exceeding this standard.
Given the context, the level of fecal coliforms should not rule out integrated reuse and aquaculture as an option. The nutrients found in wastewater are valuable resources in tilapia culture; therefore, allowing their persistence through treatment for reuse, while optimizing wastewater treatment technologies for pathogen removal is an appropriate solution for small communities in developing countries for reducing poverty, malnutrition, and disease burden of waterborne illnesses.
35
Lindsay, Gavin J. "Legacies of conflict : a community-based approach to World War II archaeology on small islands." Thesis, University of Aberdeen, 2017. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=232403.
Full text
36
Ibrahim, Mahmood. "The construction of the speaker and fictional world in 'The Small Mirrors' : critical stylistic analysis." Thesis, University of Huddersfield, 2018. http://eprints.hud.ac.uk/id/eprint/34586/.
Full textAbstract:
This thesis conducts a Critical Stylistic Analysis of Sherko Bekas’ The Small Mirrors, with the help of metaphor analysis. Five textual conceptual functions (Jeffries, 2010): Naming and Describing; Equating and Contrasting; Representing Processes/Events/States of being; Assuming and Implying and Prioritizing are used to analyse the poems. I also analyse the connotations of metaphor. These functions and metaphor analysis show how the texts construct the speaker and the fictional world in Bekas’ The Small Mirrors and the ideologies behind such constructions. The ranges of ideation – ideology in Bekas’ poetry identified by these tools are: 1. Suffering and survival are inexorable 2. Martyrdom is positive 3. Valuing one’s nation and identity is positive 4. The speaker and the people lack control over the situation My thesis aims to create a version of the Critical Stylistic model that helps me to show the depiction of the speaker and the fictional world in The Small Mirrors. I argue that Critical Stylistics is applicable to the Kurdish poetry, but it needs modifications and that the tools might work in hierarchical ranks meaning that some tools are given primary focus over others because of the difference between English and Kurdish. I use Jeffries’ (2010) Critical Stylistics and add any required modification for the textual conceptual functions to get a complete model for the analysis of The Small Mirrors. The model can show how the speaker and the fictional world are constructed which I aim to reveal. The textual conceptual functions construct a coherent perspective of the reality of the fictional world in Bekas’ poetry. The linguistic images of the fictional world of Bekas’ poetry are repetitions that become part of the naturalised ideologies of the writer.
37
Damaj, Samer. "SWH, application "Small-world" à la génération des réseaux d'interconnexion pour les architectures massivement parallèles." Brest, 2011. http://www.theses.fr/2011BRES2076.
Full textAbstract:
Les possibilités d'intégration sont de plus en plus importantes et le nombre de transistors disponibles sur un composant n'est plus aussi critique que dans le passé. Cependant les structures de traitement du type monoprocesseur ne bénéficient plus de cette augmentation de ressources et on voit apparaître des composants du type MP Soc (multiprocessors on Chip) qui intègre plusieurs coeurs de processeur sur une même puce. Le problème consiste donc à faire passer à l'échelle des architectures systèmes du type MIMD (Multiple Instruction stream Multiple Data stream). Si on considère des coeurs de processeur complexe alors le problème reste actuellement assez maîtrisable car leur nombre reste limité (2 voit 4 processeurs). Par contre l'utilisation de noeuds de traitement de plus petite taille autorise l'intégration de dizaines voire de centaines de processeurs sur un même circuit. Les besoins en puissance de calcul ne se satisfont plus des limites rencontrées sur des processeurs complexes. La généralisation des composants du type MPSoC qui intègrent un nombre toujours plus important de processeurs sur une puce. Cependant, interconnecter un grand nombre de processeurs sur une puce est un délicat. Essentiellement, les structures adaptées aux contraintes de la puce sont trop peu générales, et les schémas de l’interconnexion plus globale engendrent des coûts de fabrication trop élevés. Ce problème se décompose en deux sous problèmes intimement liés qui sont la recherche d'une topologie permettant d'atteindre un niveau de connectivité acceptable et le coût matériel de sa réalisation. C'est dans ce dernier cas qui s'inscrit le contexte scientifique de ce mémoire. Les concepteurs se basent sur des différentes architectures pour réaliser des puces. Les architectures à mémoire partagée où il y a une saturation d’accès mémoire avec un grand nombre de PEs (Processeurs Élémentaires) comme par exemple TILERA Corporation. Les architectures à mémoire distribué où il se manifeste le problème des programmes fortement communicants. Ce type d'architecture est structuré autour d'un Noc (Network-on-Chip). De nombreuses études ont déjà été réalisées sur la problématique des architectures et de leurs réalisations avec pour motivations de trouver une manière élégante de supporter des Pes qui est de plus en plus nombreux et rapide en limitant le nombre de fils et pour obtenir des réseaux réguliers où le coût et le temps de développement du layout sont très court. Pour cette raison, nous sommes à la recherche d'une nouvelle plate-forme homogène avec des multicoeurs réguliers et massivement parallèles. C'est dans ce dernier cas qui s'inscrit le contexte industriel de ce mémoire de thèse. Pour des raisons techniques, il faut rendre les circuits homogènes, réguliers et denses parce que le coût et le temps de développement du layout d'un circuit non régulier sont très longs. Pour cette raison, il faut s'appuyer sur des architectures massivement parallèles. Les processeurs doivent communiquer entre eux, ils sont donc connectés via un réseau qui implémente une topologie. Pour une topologie donnée, on dispose de métriques grossières telles que le nombre de noeuds (le nombre de sommets dans un graphe donné), le degré (le nombre de liens entrants et sortants pour chaque sommet dans ce graphe donné) et le diamètre (la distance maximale entre deux noeuds ou sommets quelconques dans le graphe). Dans ce cas, comme on veut un circuit régulier, où les CPUs sont organisés en grille 2D pour les techniques actuels et éventuellement 3D pour les futurs techniques alors il faut obtenir le coût silicium pour mapper la topologie choisie sur cette grille. Le passage de la topologie (mapping) à la réalisation sera qualifié de placement-routage" physique (le terme "placement" veut dire de placer les sommets de ce graphe donné sur une grille 2D et le terme "routage" veut dire de faire communiquer ces sommets entre eux)Graphs with a minimum diameter have applications in the design of building-block switching systems, communication networks, and distributed computer systems. Several methods of constructing directed graphs with a small diameter are proposed. First, the dissertation presents as background several (delta, D) graphs including the Hypercube and de Bruijn. It shows the major disadvantages when implementing these topologies in practice for large scale. To achieve our goal, we propose a regular graph called Small World Heuristic (SWH) suitable for large parallel computers. This graph has a maximum degree ! and a small diameter D, while maintaining an acceptable level of connectivity. We show that this heuristic can connect on short distance thousands of nodes as little as 4 links per node. ̕Finally, we present a new integrated placement and routing algorithm to implement this heuristic on 2D VLSI
38
Turner, Angeline Biegler. "The WTO, tourism and small states : finding policy space to develop." Thesis, University of Exeter, 2010. http://hdl.handle.net/10036/3057.
Full textAbstract:
The WTO, tourism and small states: finding policy space to develop This study examines whether the General Agreement on Services (GATS) provides the necessary policy space for small states to pursue their development agendas. Small states in this study are defined in power terms. But the study also focuses on small states in a property sense--those with few diversification options, making the services sector potentially an important avenue for economic growth and diversification. The study seeks to examine critically the parameters that GATS places on policy-making of small states--whether governments are limited to providing a competitive business environment, or if they retain sufficient policy space to shape the development of a sector. The study also looks at the interplay between international and domestic factors in development of policy. The tourism industries of Oman and Qatar provide case studies to examine these issues. Tourism has the potential to contribute to the economies of small states generally, but debate exists as to whether GATS leaves small states with sufficient space to influence the direction of this sector. The similarities between Oman and Qatar in both power and property terms allow for a comparative examination of whether small states can find meaningful policy space. In addition, their domestic dynamics provide insight into the interplay between domestic and international pressures on policy choices. The experiences of Oman and Qatar suggest that there remains some policy space for states to develop their tourism industries in a manner compatible with local aspirations. Governments thus have some scope to direct the shape of the tourism sector beyond merely providing a competitive business environment. But policy direction is influenced by capacity, past experiences and existing norms, and these differences can result in varying outcomes. Additionally, small states must decide their priorities in on-going WTO negotiations in order to maintain existing policy space.
39
Cecot, Federico. "Un viaggio tra pallacanestro e cultura: proposta di traduzione di Big Game, Small World di Alexander Wolff." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018.
Find full textAbstract:
Negli ultimi secoli lo sport ha svolto un ruolo molto importante nella cultura di ciascun paese. La connessione tra sport e cultura è particolarmente evidente nel libro Big Game, Small World: A Basketball Adventure, scritto da Alexander Wolff. Il testo racconta del viaggio dell'autore in diciassette paesi del mondo e il resoconto di ogni tappa è finalizzato a scoprire cosa lega la cultura locale alla pallacanestro. Il legame tra basket, viaggio e cultura rende questo libro un’intersezione di generi, stili di scrittura e tematiche che di solito non caratterizzano i libri sportivi. La traduzione di un testo che presenta aspetti così diversi rappresenta pertanto una sfida interessante.
Questa tesi è suddivisa in sei capitoli. L'obiettivo del primo è fornire una panoramica del libro e osservare la sua ricezione da parte di critica e lettori. Il secondo si concentra sulla definizione del genere a cui l’opera potrebbe essere ascritta per mezzo dell’analisi di altri testi dedicati alla pallacanestro e della connessione del libro con il genere della letteratura di viaggio. Nel terzo capitolo vengono esaminati alcuni aspetti culturali riguardanti tre stati visitati dall'autore, mentre lo stile dello scrittore è il tema principale del quarto capitolo. In seguito all'analisi di genere, contenuto e lingua, il quinto e il sesto capitolo forniscono la traduzione di due sezioni di Big Game, Small World e un commento sui problemi riscontrati e le strategie adottate durante il processo di traduzione.
40
Wachanga, David Ndirangu O'Connor Brian C. "Sanctioned and controlled message propagation in a restrictive information environment the small world of clandestine radio broadcasting /." [Denton, Tex.] : University of North Texas, 2007. http://digital.library.unt.edu/permalink/meta-dc-5113.
Full text
41
Chawla, Lovelesh. "Use of IBM Collaborative Lifecycle Management Solution to Demonstrate Traceability for Small, Real-World Software Development Project." UNF Digital Commons, 2015. http://digitalcommons.unf.edu/etd/606.
Full textAbstract:
The Standish Group Study of 1994 showed that 53 percent of software projects failed outright and another 31 percent were challenged by extreme budget and/or time overrun. Since then different responses to the high rate of software project failures have been proposed. SEI’s CMMI, the ISO’s 9001:2000 for software development, and the IEEE’s JSTD-016 are some examples of such responses. Traceability is the one common feature that these software development standards impose.
Over the last decade, software and system engineering communities have been researching subjects such as developing more sophisticated tooling, applying information retrieval techniques capable of semi-automating the trace creation and maintenance process, developing new trace query languages and visualization techniques that use trace links, applying traceability in specific domains such as Model Driven Development, product line systems and agile project environment. These efforts have not been in vain. The 2012 CHAOS results show an increase in project success rate of 39% (delivered on time, on budget, with required features and functions), and a decrease of 18% in the number of failures (cancelled prior to completion or delivered and never used). Since research has shown traceability can improve a project’s success rate, the main purpose of this thesis is to demonstrate traceability for a small, real-world software development project using IBM Collaborative Lifecycle Management.
The objective of this research was fulfilled since the case study of traceability was described in detail as applied to the design and development of the Value Adjustment Board Project (VAB) of City of Jacksonville using the scrum development approach within the IBM Rational Collaborative Lifecycle Management Solution. The results may benefit researchers and practitioners who are looking for evidence to use the IBM CLM solution to trace artifacts in a small project.
42
Elmansori, E. "Fostering innovation and entrepreneurship in Small and Medium Enterprises (SMEs) through business incubators in the Arab world." Thesis, Nottingham Trent University, 2014. http://irep.ntu.ac.uk/id/eprint/135/.
Full textAbstract:
The Small and Medium Enterprises (SMEs) contribution to innovation and economic growth is part of the economic system, and in the light of this, SMEs policies are reviewed by countries throughout the world. In the Arab countries, which are in transition such as in particular, Egypt, Tunisia, Syria, Yemen and Libya, the SME policy rationale is strikingly consistent in its coherence and consideration of other social and economic issues. SMEs provide employment opportunities for the elderly, youth and women; the creation of new lifestyles and support the development of new forms of work organisation; new working arrangements, fostering innovation and entrepreneurship. Business incubation facilitates the development and growth of start-up companies by providing entrepreneurs with resources and services. Incubator management usually develops these services which are offered by its wide network of contacts. Therefore, the aim of this research to contribute to general knowledge about the economic growth and development impacts of business incubators, thereby assisting governments and policymakers in establishing environments that would facilitate entrepreneurship and national development. To meet this aim, both qualitative and quantitative research approaches were used. This exploratory research has used snowball sampling method, 91 responses were obtained out of the 400 questionnaires distributed to SMEs in Libya, leading to a response rate of 22.75%. In addition, 5 incubation units in Jordan and 4 in the United Arab Emirates were examined using questionnaires. Finally, interviews with 12 of Arab experts in this field were also conducted to understand how to establish and implement business incubation programmes. The results of this research show that businesses that have been through an incubator programme are far more likely to succeed in the long term. The research concluded by providing governments with guidelines for using incubators to foster technology transfer and commercialisation, which contributes to entrepreneurship and economic development in developing countries and other Arab countries, with particular consideration in Libya.
43
Lima, Nicholas Veloso. "Difusão competitiva de produtos e inovações: um modelo de duopólio em redes complexas do tipo small world." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/100/100132/tde-30032016-081314/.
Full textAbstract:
Nos últimos 60 anos, os modelos de difusão de produtos e de inovações tiveram penetração tão ampla nos mais diversos campos de investigação científica que se tornaram ubíquos, sendo empregados em contextos diversos como no marketing, na Medicina, na Antropologia, na Geografia, por exemplo. Essa abrangência é devido ao papel vital que produtos, inovações e novas tecnologias têm na vida dos indivíduos e no impacto que exercem nas dinâmicas e no desenvolvimento de comunidades, países e de suas economias. Porém, após os grandes saltos dados nas décadas de 1960 e 1970, os estudos em difusão de bens de consumo duráveis deram lugar a pesquisas em sistemas de inovação nas duas décadas seguintes, só voltando a gerar maior interesse acadêmico a partir da década de 2000, com o surgimento dos sistemas de Gestão de Relacionamento com Clientes Customer Relationship Management (CRM) , que tornou disponível um enorme volume de dados; e, também, com o desenvolvimento de novas técnicas de análise, como a modelagem de sistemas complexos. Tendo em vista a carência de estudos integrando modelos de difusão competitiva com modelos de redes usando topologias de redes parcialmente conectadas (small world e livres de escala), este estudo tem como objetivo geral caracterizar a dinâmica da difusão competitiva proposta em redes small world do tipo Watts-Strogatz. Foram realizadas simulações tanto da formulação clássica do modelo de difusão de produtos e de inovações, proposto por Bass (1969), como de proposições mais modernas para difusão competitiva, como os propostos por Libai, Muller e Peres (2009a; 2009b; 2009c) e por Peres, Muller e Mahajan (2010), além de desenvolver um novo modelo incorporando ao de Libai, Muller e Peres (2009c) a topologia de redes de pequeno mundo e outras características de difusão competitiva não presentes na formulação original , permitindo fazer inferências sobre o comportamento da difusão em diversos cenários que não são explicitamente previstos nas formulações clássicas. Por sua lógica intuitiva e simples, o modelo proposto neste trabalho é de valor significativo para o ensino e para a pesquisa da difusão competitivaIn the last 60 years, product and innovation models were so widespread in so many fields of study that they became ubiquitous, being employed in such diverse backgrounds like marketing, medicine, anthropology and geography. Such widespread influence arises from the fact that products, innovations and Technologies have a big role in any individuals daily lives and a huge impact on the development and dynamics of communities, countries and its economies. After huge leaps on this field of research during the 1960s and 1970s, its study faded away from mainstream research in the following two decades. Only regaining widespread academic interest in the beginning of 21st century, with the advent of Customer Relationship Management systems, which made available huge amounts of data, other factors that contributed to this resurgence in diffusion literature were the advancements on new tools for research, notably the developments in complex systems theory and network theory. In the view of the still small, but rapidly increasing, number of studies integrating competitive diffusion and network models of partially connected networks (such as small world networks and scale-free networks), this study aims to characterize the dynamics of competitive diffusion in small world networks with the Watts-Strogatz topology. For its intended purpose, simulations were created, both for the classical formulation of the Bass Diffusion Model, as well as more modern approaches for competitive diffusion, such as the models proposed by Libai, Muller and Peres and Peres, Muller and Mahajan. A new model was developed in order expand the model proposed by Libai et al (2009c) in order incorporate the small world network topology and other characteristics associated to competition that were not explicitly represented. Allowing the inference of behaviors in various scenarios that are not explicitly covered in the classical formulations. For intuitive logic and simplicity, it is believed that this model is of significant value for teaching and for the study of competitive diffusion
44
Ho, Jing-Mao, and 何經懋. "Small World Phenomenon." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/98348894721549760096.
Full textAbstract:
碩士國立臺灣大學
資訊工程學研究所
96
The small world phenomenon, the principle that most of people are linked by short chains of acquaintances, is first studied as a problem in social science. It is also a feature of a range of networks arising in nature and technology. Early experiments showed that it has two properties: first, short chains are widespread, and second, individuals with local information are able to find the chains. Kleinberg proposed a family of network models and a greedy algorithm, showing that there is a unique model within the family for which the greedy algorithm’s running time is O(log2 N). We study Kleinberg’s theorems and give some models based on Kleinberg’s family:torus, grids of high dimension, and cube.
45
Ho, Jing-Mao. "Small World Phenomenon." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2403200816472500.
Full text
46
"Small-world overlay P2P network." 2004. http://library.cuhk.edu.hk/record=b5892159.
Full textAbstract:
Hui Ying Kin.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.
Includes bibliographical references (leaves 62-64).
Abstracts in English and Chinese.
Chapter 1 --- Introduction --- p.10
Chapter 1.1 --- Motivation --- p.10
Chapter 1.2 --- P2P small-world solution --- p.11
Chapter 1.3 --- Balance of this thesis --- p.12
Chapter 2 --- Background --- p.13
Chapter 2.1 --- Small World phenomenon --- p.13
Chapter 2.2 --- Internet Flash Crowds --- p.16
Chapter 2.3 --- Dynamics in the small world network --- p.17
Chapter 3 --- Small-world Overlay Protocol --- p.19
Chapter 3.1 --- Overview --- p.23
Chapter 3.2 --- Join Cluster Protocol (JCP): --- p.25
Chapter 3.3 --- Leave Cluster Protocol (LCP): --- p.29
Chapter 3.4 --- Object Lookup Protocol (OLP): --- p.31
Chapter 3.5 --- Experimental Results Of Comparing with Other Structured P2P Networks --- p.33
Chapter 3.5.1 --- Performance of object lookup: --- p.33
Chapter 3.5.2 --- Effect of object lookup performance under different net- work sizes and number of long links: --- p.34
Chapter 3.5.3 --- Comparison of Clustering Coefficient: --- p.35
Chapter 4 --- Protocols for Handling Flash Crowd --- p.39
Chapter 4.1 --- Static Flash Crowd --- p.40
Chapter 4.2 --- Dynamic Flash Crowd --- p.44
Chapter 4.3 --- Experimental Results for Replicating Popular Object --- p.45
Chapter 4.3.1 --- Comparison between Chord and SWOP --- p.46
Chapter 4.3.2 --- Comparison on Queue Size --- p.48
Chapter 4.3.3 --- Variation on object request rate --- p.49
Chapter 4.3.4 --- Variation on Number of Long Link Neighbors (k) --- p.50
Chapter 4.4 --- Experiment Results for Examining the Effects on Traffic Loadings --- p.51
Chapter 5 --- Performance Analysis --- p.53
Chapter 5.1 --- Lookup complexity of SWOP --- p.53
Chapter 5.2 --- Average time used for replicating item to all clusters in SWOP --- p.56
Chapter 6 --- Related Work --- p.59
Chapter 7 --- Conclusion --- p.61
47
Vieira, José Vítor Correia Rendeiro. "Bipartition of small-world networks." Master's thesis, 2019. http://hdl.handle.net/10773/27755.
Full textAbstract:
We studied the bipartitioning of small-world networks. We generated small-world networks from a square lattice via a modified Watts-
Strogatz algorithm. We compared several partitioning algorithms, such as Monte Carlo with Kawasaki dynamics and Simulated Annealing, Extremal
Optimization and Multilevel K-way partitioning. We obtained the critical percolation values of the mean degree and the threshold partition values for several networks in the continuum between a square lattice and a random network. We obtained the exponents of the minimum partition cost as a function of the mean degree in the vicinity of the bipartition threshold, as well as the exponent of finite size scaling. To the best of our knowledge, this is the first work to tackle this issue. We observed that all small-world networks have the same exponents, different from those of the square lattice, regardless of the number of modified edges. The values for the exponents of the random network are in accordance with previous results.Neste estudo, investigámos a bipartição de redes de pequeno mundo. Utilizámos um modelo de Watts-Strogatz modificado para a geração de redes de pequeno mundo a partir de redes quadradas. Comparámos vários algoritmos de partição, tais como Monte Carlo com dinâmica Kawasaki e Simulated Annealing, Extremal Optimization e Multilevel K-way Based Partitioning. Obtivemos os valores críticos do grau médio das redes na transição de percolação e os valores limite na transição de partição para redes ao longo do espetro entre uma rede quadrada e uma rede aleatória. Obtivemos os expoentes de variação do custo de partição mínimo em função da grau médio da rede na proximidade do valor limite de partição, assim como o expoente de escalonamente em função do tamanho da rede. Este é o primeiro trabalho a estudar este problema, tanto quanto sabemos. Observou-se que as redes modificadas apresentam os mesmos expoente, independemente do número de arestas modificadas, enquanto que a rede quadrada tem um comportamento distinto de todas as redes de pequeno mundo. Os valores dos expoentes para a rede aleatória estão em concordância com resultados prévios.
Mestrado em Física
48
Kasturirangan, Rajesh. "Multiple Scales in Small-World Networks." 1999. http://hdl.handle.net/1721.1/5930.
Full textAbstract:
Small-world architectures may be implicated in a range of phenomena from networks of neurons in the cerebral cortex to social networks and propogation of viruses. Small-world networks are interpolations of regular and random networks that retain the advantages of both regular and random networks by being highly clustered like regular networks and having small average path length between nodes, like random networks. While most of the recent attention on small-world networks has focussed on the effect of introducing disorder/randomness into a regular network, we show that that the fundamental mechanism behind the small-world phenomenon is not disorder/ randomness, but the presence of connections of many different length scales. Consequently, in order to explain the small-world phenomenon, we introduce the concept of multiple scale networks and then state the multiple length scale hypothesis. We show that small-world behavior in randomly rewired networks is a consequence of features common to all multiple scale networks. To support the multiple length scale hypothesis, novel network architectures are introduced that need not be a result of random rewiring of a regular network. In each case it is shown that whenever the network exhibits small-world behavior, it also has connections of diverse length scales. We also show that the distribution of the length scales of the new connections is significantly more important than whether the new connections are long range, medium range or short range.
49
Lee, Po-Han. "The Small World of Ancient Chinese Characters." 2004. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2707200423260800.
Full text
50
Hsieh, Ji Lung, and 謝吉隆. "A Small-World Model for Epidemic Simulation." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/90320597604454327511.
Full textAbstract:
碩士國立交通大學
資訊科學系所
92
The author validates a new small world model consisting of cellular automata with mirror identities of daily-contact social networks for purposes of epidemiological simulations. The mirror identity concept was established to integrate human long-distance movement and daily visits to fixed locations into the model. After showing that the model is capable of displaying small-world effects (i.e., low degree of separation and relatively high degree of clustering) on a societal level, we offer proof of its ability to display R0 properties, which are considered central to epidemiological studies. A simulation of the 2003 SARS outbreak serves as our primary example of how the proposed model functions.