Relevant bibliographies by topics / Scale-free

Academic literature on the topic 'Scale-free'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Scale-free.'

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.

Journal articles on the topic "Scale-free"

1

Zhang, Linjun, Michael Small, and Kevin Judd. "Exactly scale-free scale-free networks." Physica A: Statistical Mechanics and its Applications 433 (September 2015): 182–97. http://dx.doi.org/10.1016/j.physa.2015.03.074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Barabási, Albert-László, and Eric Bonabeau. "Scale-Free Networks." Scientific American 288, no. 5 (May 2003): 60–69. http://dx.doi.org/10.1038/scientificamerican0503-60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

R., Cesar, and Albert-Laszlo Barabasi. "Scale-free networks." Scholarpedia 3, no. 1 (2008): 1716. http://dx.doi.org/10.4249/scholarpedia.1716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Deijfen, Maria, Remco van der Hofstad, and Gerard Hooghiemstra. "Scale-free percolation." Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 49, no. 3 (August 2013): 817–38. http://dx.doi.org/10.1214/12-aihp480.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hein, Oliver, Michael Schwind, and Wolfgang König. "Scale-free networks." WIRTSCHAFTSINFORMATIK 48, no. 4 (August 2006): 267–75. http://dx.doi.org/10.1007/s11576-006-0058-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Dong, Viktoria Fodor, and Lars Kildehoj Rasmussen. "Will Scale-Free Popularity Develop Scale-Free Geo-Social Networks?" IEEE Transactions on Network Science and Engineering 6, no. 3 (July 1, 2019): 587–98. http://dx.doi.org/10.1109/tnse.2018.2841942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lehnert, R., P. Novák, F. Macieira, M. Kuřec, J. a. Teixeira, and T. Branyik. "Optimisation of lab-scale continuous alcohol-free beer production." Czech Journal of Food Sciences 27, No. 4 (September 9, 2009): 267–75. http://dx.doi.org/10.17221/128/2009-cjfs.

Full text
Abstract:
In order to study the formation and conversion of the most important flavour compounds, the real wort used in alcohol-free beer fermentation was mimicked by a complex model medium containing glucose, yeast extract, and selected aldehydes. The fermentation experiments were carried out in a continuously operating gas-lift reactor with brewing yeast immobilised on spent grains (brewing by-product). During the continuous experiment, parameters such as oxygen supply, residence time (Rt), and temperature (T) were varied to find the optimal conditions for the alcohol-free beer production. The formation of ethanol, higher alcohols (HA), esters (ES), as well as the reduction of aldehydes and consumption of glucose were observed. The results suggest that the process parameters represent a powerful tool in controlling the degree of fermentation and flavour formation brought about by immobilised biocatalyst. Subsequently, the optimised process parameters were used to produce real alcohol-free beer during continuous fermentation. The final product was compared with batch fermented alcohol-free beers using the methods of instrumental and sensorial analysis.
APA, Harvard, Vancouver, ISO, and other styles
8

WOERLEE, GEERT FEYE. "Water-Free Dyeing of Textiles from Lab to Industrial Scale." Sen'i Gakkaishi 69, no. 10 (2013): P_341—P_342. http://dx.doi.org/10.2115/fiber.69.p_341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Graña, Matías, and Juan Pablo Pinasco. "Discrete scale invariance in scale free graphs." Physica A: Statistical Mechanics and its Applications 380 (July 2007): 601–10. http://dx.doi.org/10.1016/j.physa.2007.02.047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pasetto, Stefano, Cesare Chiosi, Mark Cropper, and Eva K. Grebel. "Scale-free convection theory." Proceedings of the International Astronomical Union 11, A29B (August 2015): 747. http://dx.doi.org/10.1017/s1743921316006700.

Full text
Abstract:
AbstractConvection is one of the fundamental mechanisms to transport energy, e.g., in planetology, oceanography, as well as in astrophysics where stellar structure is customarily described by the mixing-length theory, which makes use of the mixing-length scale parameter to express the convective flux, velocity, and temperature gradients of the convective elements and stellar medium. The mixing-length scale is taken to be proportional to the local pressure scale height of the star, and the proportionality factor (the mixing-length parameter) must be determined by comparing the stellar models to some calibrator, usually the Sun. No strong arguments exist to claim that the mixing-length parameter is the same in all stars and all evolutionary phases. Because of this, all stellar models in the literature are hampered by this basic uncertainty. In a recent paper (Pasetto et al. 2014) we presented the first fully analytical scale-free theory of convection that does not require the mixing-length parameter. Our self-consistent analytical formulation of convection determines all the properties of convection as a function of the physical behaviour of the convective elements themselves and the surrounding medium (be it a star, an ocean, or a primordial planet). The new theory of convection is formulated starting from a conventional solution of the Navier-Stokes/Euler equations, i.e. the Bernoulli equation for a perfect fluid, but expressed in a non-inertial reference frame co-moving with the convective elements. In our formalism, the motion of convective cells inside convective-unstable layers is fully determined by a new system of equations for convection in a non-local and time dependent formalism. We obtained an analytical, non-local, time-dependent solution for the convective energy transport that does not depend on any free parameter. The predictions of the new theory in astrophysical environment are compared with those from the standard mixing-length paradigm in stars with exceptional results for atmosphere models of the Sun and all the stars in the Hertzsprung-Russell diagram.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Scale-free"

1

Ang, Wee Horng. "Scale-free information systems networks." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34554.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, 2006.
Includes bibliographical references (leaves 77-79).
Many real, complex networks have been shown to be scale-free. Scale-free in networks mean that their degree distribution is independent of the network size, have short path lengths and are highly clustered. We identify the qualities of scale-free networks, and discuss the mathematical derivations and numerically simulated outcomes of various deterministic scale-free models. Information Systems networks are a set of individual Information Systems that exchange meaningful data among themselves. However, for various reasons, they do not naturally grow in a scale-free manner. In this topic, we will specifically examine a technique proposed by MITRE that allows information to be exchanged in an efficient manner between Information System nodes. With this technique, we will show that a scale-free Information System Network is sound in theory and practice, state the characteristics of such networks and demonstrate how such a system can be constructed.
by Wee Hong Ang.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
2

Xulvi-Brunet, Ramon. "Structural properties of scale-free networks." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=984083197.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brockmann, Dirk. "Superdiffusion in scale-free inhomogeneous environments." Doctoral thesis, [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969638884.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xulvi-Brunet, Ramon. "Structural properties of scale-free networks." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät I, 2007. http://dx.doi.org/10.18452/15608.

Full text
Abstract:
Netzwerke sind überall, von der elektrischen Stromversorgung über die Biochemie der Zellen, das Internet bis hin zu sozialen Netzen. Netzwerke als mathematisches Konzept haben sich in den letzten Jahren zu einem wichtigen Werkzeug der Beschreibung komplexer Systeme entwickelt. Ihre grundlegende Eigenschaft ist, dass sie aus einer grö{ss}en Anzahl dynamischer Elemente bestehen, die sich gegenseitig beeinflussen und dabei nicht linear gekoppelt sind. Die moderne Netzwerkwissenschaft will die Wechselwirkung zwischen den einzelnen Untereinheiten erklären und davon ausgehend verständlich machen, auf welche Weise Prozesse auf einem Netzwerk stattfinden können. Zum Beispiel wird untersucht, wie die Struktur sozialer Netze die Ausbreitung von Information oder von Krankheiten beeinflusst, wie die Topologie des World Wide Web das Surf-Verhalten oder die Funktionalität von Suchmaschinen beeinträchtigt oder welche Auswirkungen die Hierarchie in ökologischen Nischen auf die Populationsdynamik der einzelnen Spezies hat. Darüber hinaus gilt es herauszufinden, welche grundlegenden Prinzipien der Evolution realer Netzwerke zugrunde liegen, das heißt nach welchen Regeln sich einerseits die Untereinheiten entwickeln und welchen Einfluss andererseits deren Vernetzung hat. Die vorliegende Dissertation beschäftigt sich sowohl mit der Topologie verschiedener Netzwerke als auch mit den der Evolution zugrunde liegenden Prinzipien. Schwerpunkte liegen dabei auf den folgenden zwei Aspekten: erstens dem Einfluss von so gennanten ``vertex-pair correlations'''', das heißt Korrelationen zwischen den Untereinheiten, auf die Topologie und zweitens der Auswirkung der Geographie auf die Netzwerkentwicklung. Es wird der bedeutende Einfluss aufgezeigt, den die Korrelationen auf wichtige statistische Größen der Netzwerke haben. Weiterhin analysieren wir die Perkolationseigenschaften, die Aufschluss über die Empfindlichkeit gegenüber Störungen in der Vernetzung geben. Damit können zum Beispiel Fragen aus der Epidemiologie diskutiert werden. Es zeigt sich, dass die Topologie vieler Netzwerke und ihre Perkolationseigenschaften deutlich von Korrelationen beeinflusst werden. Schließlich untersuchen wir im letzten Teil dieser Arbeit, wie die Einbettung von Netzwerken in eine endlich-dimensionale Geographie auf die Modellierung und Entwicklung Web-ähnlicher Systeme Einfluss nimmt.
Networks are all around us, from electrical power grids to the biochemistry of cells, from the Internet to social webs. The mathematical concept of network has recently been turned into an important tool for describing complex systems, whose principal characteristic is that they consist of a large number of mutually interacting dynamical parts which are coupled in a nonlinear fashion. Modern network science attempts to explain the structure of interactions between the subunits of a system in order to understand their functioning and the processes taking place in them. It tries, for instance, to grasp how the structure of social networks affects the spread of information or human diseases, how the structure of the World Wide Web influences the search engines and surfing behavior, or how the hierarchy of ecological niches affects population dynamics. Beyond this, the ultimate goal of network science is to discover what generating principles exist behind the evolution of real systems. It tries to find the fundamental principles under which the subunits evolve, and the wiring of interactions. This thesis centres both on the study of the topological structure of networks and the analysis of the underlying principles responsible for their evolution. More specifically, it concentrates on the following aspects: the influence of vertex-pair correlations on network topology, the network percolation problem, which is closely related to the spreading of epidemics and the robustness of networks, and the effects of geography as a generating element. We show that important topological and percolation properties change considerably when modifying the connection probabilities between vertices, and that geography as well plays a crucial role in the modeling of evolving real web-like systems.
APA, Harvard, Vancouver, ISO, and other styles
5

Martin, Nicolas. "Network partitioning algorithms with scale-free objective." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALT001.

Full text
Abstract:
En raison de la complexité inhérente à l’analyse de réseau de très grande taille, l’élaboration d’algorithmes de partitionnement et diverses problématiques connexes sont traitées au long de cette thèse. Dans un premier temps, une question préliminaire est traitée: puisque les nœuds au sein d’une partie ne sont pas nécessairement connexes, comment quantifier l’impact d’une contrainte de connexité ? Nous proposons ensuite un algorithme de partitionnement assurant que le réseau réduit soit scale-free. Ceci permet de tirer profit des propriétés intrinsèques de ce type de réseaux. Nous nous intéressons également aux propriétés à préserver pour respecter la nature physique et dynamique du réseau initial. Dans une troisième partie, nous proposons une méthode pour identifier les nœuds à mesurer dans un réseau pour garantir une reconstruction efficace de la valeur moyenne des autre nœuds. Finalement, nous proposons trois applications: la première concerne le trafic routier et nous montrons que notre premier algorithme de partitionnement permet d’obtenir un réseau réduit émulant efficacement le réseau initial. Les deux autres applications concernent les réseaux d’épidémiologie. Dans la première nous montrons qu’un réseau réduit scale-free permet de construire une stratégie efficace d’attribution de soin au sein d’une population. Dans la dernière application, nous tirons profit des résultats sur la reconstruction de moyenne pour estimer l’évolution d’une épidémie dans un réseau de grande taille
In light of the complexity induced by large-scale networks, the design of network partitioning algorithms and related problematics are at the heart of this thesis. First, we raise a preliminary question on the structure of the partition itself: as the parts may includes disconnected nodes, we want to quantify the drawbacks to impose the nodes inside each part to be connected. Then we study the design of a partitioning algorithm inducing a reduced scale-free network. This allows to take advantage of the inherent features of this type of network. We also focus on the properties to preserve to respect the physical and dynamical profile of the initial network. We investigate then how to partition a network between measured and unmeasured nodes ensuring that the average of the unmeasured nodes can be efficiently reconstructed. In particular we show that, under hypothesis, this problem can be reduced to a problem of detection of subgraph with particular properties. Methods to achieve this detection are proposed. Finally, three applications are presented: first we apply the partitioning algorithm inducing scale-freeness to a large-scale urban traffic network. We show then that, thanks to the properties preserved through the partition, the reduced network can be used as an abstraction of the initial network. The second and third applications deal with network epidemics. First, we show that the scale-freeness of the abstracting network can be used to build a cure-assignation strategy. In the last application, we take advantage of the result on average reconstruction to estimate the evolution of a disease on a large-scale network
APA, Harvard, Vancouver, ISO, and other styles
6

Rodrigues, Pedro Miguel Fonseca. "Scale-free networks and scalable interdomain routing." Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/4336.

Full text
Abstract:
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática
The exponential growth of the Internet, due to its tremendous success, has brought to light some limitations of the current design at the routing and arquitectural level, such as scalability and convergence as well as the lack of support for traffic engineering, mobility, route differentiation and security. Some of these issues arise from the design of the current architecture, while others are caused by the interdomain routing scheme - BGP. Since it would be quite difficult to add support for the aforementioned issues, both in the interdomain architecture and in the in the routing scheme, various researchers believe that a solution can only achieved via a new architecture and (possibly) a new routing scheme. A new routing strategy has emerged from the studies regarding large-scale networks, which is suitable for a special type of large-scale networks which characteristics are independent of network size: scale-free networks. Using the greedy routing strategy a node routes a message to a given destination using only the information regarding the destination and its neighbours, choosing the one which is closest to the destination. This routing strategy ensures the following remarkable properties: routing state in the order of the number of neighbours; no requirements on nodes to exchange messages in order to perform routing; chosen paths are the shortest ones. This dissertation aims at: studying the aforementioned problems, studying the Internet configuration as a scale-free network, and defining a preliminary path onto the definition of a greedy routing scheme for interdomain routing.
APA, Harvard, Vancouver, ISO, and other styles
7

Kent, Stuart Thomas. "Multi-Scale Conformal Maps and Free Boundary Problems." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/301534.

Full text
Abstract:
In this dissertation, we study free boundary problems that describe equilibrium configurations of electromechanical systems consisting of a conducting elastic sheet deflected by an external charge distribution. Such systems are non-local in nature - the electrostatic pressure experienced by any individual point on the sheet depends on the entire deflection profile (as a result of the requirement that the deflected sheet must remain an equipotential). The magnitude of the electrostatic pressure varies quadratically with the magnitude of the local electric field. Similar non-local free boundary problems arise in two-layer fluid systems forced by withdrawal flows, but the normal viscous stress experienced by the fluid-fluid interface instead varies linearly with the local velocity gradients. The analysis presented focuses on two configurations in particular: the electromechanical system described above, forced by a point charge, and an artificially modified version of the same electromechanical system in which the induced electrostatic pressure varies linearly with the local electric field and the forcing is provided by an electric dipole. This second model is constructed as a crude approximation of the two-layer fluid flow forced by a point sink, and is primarily used to explore the influence of the forcing exponent on the bifurcation structure and solution types of the associated system. Our main contribution is the development of new techniques for the analysis and efficient numerical computation of large-deflection profiles for the true electromechanical system. The induced charge on such profiles accumulates near the interface tip, so that the geometry there is primarily determined by a balance between elastic and electrostatic forces. Away from the tip, the electrostatic pressure is low and the interface relaxes under the influences of gravity and elasticity only. Such interfaces exhibit features on widely disparate length scales. We exploit this separation of the interface into two regions dominated by different force balances to create a separate representation of each region (in appropriately rescaled coordinates), and then match the two representations together while ensuring that the relationship between local induced stress and global interface geometry is respected. This is achieved by combining tools and results from complex analysis and the method of matched asymptotic expansions.
APA, Harvard, Vancouver, ISO, and other styles
8

Guadamuz, Andres. "Networks, complexity and internet regulation scale-free law." Thesis, University of Edinburgh, 2013. http://hdl.handle.net/1842/7795.

Full text
Abstract:
This book, then, starts with a general statement: that regulators should try, wherever possible, to use the physical methodological tools presently available in order to draft better legislation. While such an assertion may be applied to the law in general, this work will concentrate on the much narrower area of Internet regulation and the science of complex networks The Internet is the subject of this book not only because it is my main area of research, but also because –without over-emphasising the importance of the Internet to everyday life– one cannot deny that the growth and popularisation of the global communications network has had a tremendous impact on the way in which we interact with one another. The Internet is, however, just one of many interactive networks. One way of looking at the complex and chaotic nature of society is to see it as a collection of different nodes of interaction. Humans are constantly surrounded by networks: the social network, the financial network, the transport network, the telecommunications network and even the network of our own bodies. Understanding how these systems operate and interact with one another has been the realm of physicists, economists, biologists and mathematicians. Until recently, the study of networks has been mainly theoretical and academic, because it is difficult to gather data about large and complex systems that is sufficiently reliable to support proper empirical application. In recent years, though, the Internet has given researchers the opportunity to study and test the mathematical descriptions of these vast complex systems. The growth rate and structure of cyberspace has allowed researchers to map and test several previously unproven theories about how links and hubs within networks interact with one another. The Web now provides the means with which to test the organisational structures, architecture and growth of networks, and even permits some limited prediction about their behaviour, strengths and vulnerabilities. The main objective of this book is first and foremost to serve as an introduction to the wider legal audience to some of the theories of complexity and networks. The second objective is more ambitious. By looking at the application of complexity theory and network science in various areas of Internet regulation, it is hoped that there will be enough evidence to postulate a theory of Internet regulation based on network science. To achieve these two goals, Chapter 2 will look in detail at the science of complex networks to set the stage for the legal and regulatory arguments to follow. With the increase in reliability of the descriptive (and sometimes predictive) nature of network science, a logical next step for legal scholars is to look at the legal implications of the characteristics of networks. Chapter 3 highlights the efforts of academics and practitioners who have started to find potential uses for network science tools. Chapter 4 takes this idea further, and explores how network theory can shape Internet regulation. The following chapters will analyse the potential for application of the tools described in the previous chapters, applying complexity theory to specific areas of study related to Internet Law. Chapter 5 deals with the subject of copyright in the digital world. Chapter 6 explores the issue of peer-production and user-generated content using network science as an analytical framework. Chapter 7 finishes the evidence section of the work by studying the impact of network architecture in the field of cybercrime, and asks whether the existing architecture hinders or assists efforts to tackle those problems. It is clear that these are very disparate areas of study. It is not the intention of this book to be overreaching in its scope, although I am mindful that it covers a lot of ground and attempts to study and describe some disciplines that fall outside of my intellectual comfort zone. While the focus of the work is the Internet, its applications may extend beyond mere electronic bits. Without trying to be over-ambitious, it is my strong belief that legal scholarship has been neglectful in that it has been slow to respond to the wealth of research into complexity. That is not to say that there has been no legal research on the topic, but it would seem that lawyers, legislators and policy-makers are reluctant to consider technical solutions to legal problems. It is hoped then that this work will serve as a stepping stone that will lead to new interest in some of the theories that I describe.
APA, Harvard, Vancouver, ISO, and other styles
9

Weinstein, Lee. "Scale free networks and their power law distribution." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/3880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hollingshad, Nicholas W. "A Non-equilibrium Approach to Scale Free Networks." Thesis, University of North Texas, 2012. https://digital.library.unt.edu/ark:/67531/metadc149609/.

Full text
Abstract:
Many processes and systems in nature and society can be characterized as large numbers of discrete elements that are (usually non-uniformly) interrelated. These networks were long thought to be random, but in the late 1990s, Barabási and Albert found that an underlying structure did in fact exist in many natural and technological networks that are now referred to as scale free. Since then, researchers have gained a much deeper understanding of this particular form of complexity, largely by combining graph theory, statistical physics, and advances in computing technology. This dissertation focuses on out-of-equilibrium dynamic processes as they unfold on these complex networks. Diffusion in networks of non-interacting nodes is shown to be temporally complex, while equilibrium is represented by a stable state with Poissonian fluctuations. Scale free networks achieve equilibrium very quickly compared to regular networks, and the most efficient are those with the lowest inverse power law exponent. Temporally complex diffusion also occurs in networks with interacting nodes under a cooperative decision-making model. At a critical value of the cooperation parameter, the most efficient scale free network achieves consensus almost as quickly as the equivalent all-to-all network. This finding suggests that the ubiquity of scale free networks in nature is due to Zipf's principle of least effort. It also suggests that an efficient scale free network structure may be optimal for real networks that require high connectivity but are hampered by high link costs.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Scale-free"

1

Guadamuz, Andrés. Networks, complexity and internet regulation: Scale-free law. Cheltenham, UK: Edward Elgar, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guadamuz, Andrés. Networks, complexity and internet regulation: Scale-free law. Cheltenham, UK: Edward Elgar, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Koonin, Eugene V., Yuri I. Wolf, and Georgy P. Karev. Power Laws, Scale-Free Networks and Genome Biology. Boston, MA: Springer US, 2006. http://dx.doi.org/10.1007/0-387-33916-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Canada, Economic Council of. U. S.-Canada productivity gap, scale economies, and the gains from freer trade. Ottawa: Economic Council of Canada, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rao, P. Someshwar. U.S.-Canada productivity gap, scale economies, and the gains from freer trade. Ottawa: Economic Council of Canada, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hoad, Danny R. Helicopter blade-vortex interaction locations - scale-model acoustics and free-wake analysis results. Hampton, Va: Langley Research Center, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Foster, J. A. The use of foam against large-scale petroleum fires involving lead-free petrol. London: Home Office, Fire Research and Development Group, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ch'oe, Nak-kyun. Kukche muyŏk ŭi pigyo uwi p'aet'ŏn punsŏk kwa chŏngch'aek sisachŏm. Sŏul T'ŭkpyŏlsi: Taeoe Kyŏngje Chŏngch'aek Yŏn'guwŏn, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

P, Yip Long. Wind-tunnel free-flight investigation of a 0.15-scale model of the F-106B airplane with vortex flaps. Hampton, Va: Langley Research Center, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kamada, Ray. Amending the w* velocity scale for surface layer, entrainment zone, and baroclinic shear in mixed forced/free turbulent convection. Monterey, Calif: Naval Postgraduate School, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Scale-free"

1

Lenaerts, Tom. "Scale-Free Networks." In Encyclopedia of Astrobiology, 1–2. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-27833-4_1405-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lenaerts, Tom. "Scale Free Networks." In Encyclopedia of Astrobiology, 1492–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-11274-4_1405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

DelRe, E., and C. Conti. "Scale-Free optics." In Springer Series in Optical Sciences, 207–30. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3538-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lenaerts, Tom. "Scale-Free Networks." In Encyclopedia of Astrobiology, 2234–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-44185-5_1405.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Freeman, Walter J., Robert Kozma, Béla Bollobá, and Oliver Riordan. "Scale-Free Cortical Planar Networks." In Bolyai Society Mathematical Studies, 277–324. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69395-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Enachescu, Mihaela, Ashish Goel, Ramesh Govindan, and Rajeev Motwani. "Scale Free Aggregation in Sensor Networks." In Algorithmic Aspects of Wireless Sensor Networks, 71–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27820-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rozenfeld, Hernán D., Lazaros K. Gallos, Chaoming Song, and Hernán A. Makse. "Fractal and Transfractal Scale-Free Networks." In Mathematics of Complexity and Dynamical Systems, 637–56. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-1806-1_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Corominas-Murtra, Bernat, Sergi Valverde, and Ricard V. Solé. "Emergence of Scale-Free Syntax Networks." In Evolution of Communication and Language in Embodied Agents, 83–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01250-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chase, Melissa, Markulf Kohlweiss, Anna Lysyanskaya, and Sarah Meiklejohn. "Verifiable Elections That Scale for Free." In Public-Key Cryptography – PKC 2013, 479–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36362-7_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fronczak, Piotr. "Scale-Free Nature of Social Networks." In Encyclopedia of Social Network Analysis and Mining, 1616–26. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4614-6170-8_248.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Scale-free"

1

Cai, Hong. "Scale-Free Web Services." In IEEE International Conference on Web Services (ICWS 2007). IEEE, 2007. http://dx.doi.org/10.1109/icws.2007.156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hayashi, Yukio. "Geographical scale-free triangulation." In MODELING COOPERATIVE BEHAVIOR IN THE SOCIAL SCIENCES. AIP, 2005. http://dx.doi.org/10.1063/1.2008621.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lu, Xin, Xiao Wang, and Jin Fang. "Consensus in Scale-free Networks." In 2006 International Conference on Communications, Circuits and Systems. IEEE, 2006. http://dx.doi.org/10.1109/icccas.2006.285214.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dorogovtsev, S. N. "Evolving Weighted Scale-Free Networks." In SCIENCE OF COMPLEX NETWORKS: From Biology to the Internet and WWW: CNET 2004. AIP, 2005. http://dx.doi.org/10.1063/1.1985375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hua Wang and Yi Guo. "Consensus on scale-free network." In 2008 American Control Conference (ACC '08). IEEE, 2008. http://dx.doi.org/10.1109/acc.2008.4586582.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ruela, Andre Siqueira, and Karina Valdivia Delgado. "Scale-Free Evolutionary Level Generation." In 2018 IEEE Conference on Computational Intelligence and Games (CIG). IEEE, 2018. http://dx.doi.org/10.1109/cig.2018.8490366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jing, Liu, He Keqing, Ma Yutao, and Peng Rong. "Scale Free in Software Metrics." In 30th Annual International Computer Software and Applications Conference (COMPSAC'06). IEEE, 2006. http://dx.doi.org/10.1109/compsac.2006.75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

D’Angelo, Gabriele, and Stefano Ferretti. "Simulation of scale-free networks." In 2nd International ICST Conference on Simulation Tools and Techniques. ICST, 2009. http://dx.doi.org/10.4108/icst.simutools2009.5672.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lili Wang, Jianxun Dang, Yi Jin, and Huihua Jin. "Scale-free topology for large-scale wireless sensor networks." In 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet. IEEE, 2007. http://dx.doi.org/10.1109/canet.2007.4401663.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Smith, Guy, and Paul Jackway. "A Scale-Free and Parameter-Free Image Edge Strength Measure." In 2018 Digital Image Computing: Techniques and Applications (DICTA). IEEE, 2018. http://dx.doi.org/10.1109/dicta.2018.8615813.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Scale-free"

1

Wiles, Janet. Bio-Inspired Computation: Clock-Free, Grid-Free, Scale-Free and Symbol Free. Fort Belvoir, VA: Defense Technical Information Center, June 2015. http://dx.doi.org/10.21236/ada626811.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bromberger, Seth A., Christine F. Klymko, Keith A. Henderson, Roger Pearce, and Geoff Sanders. Improving Estimation of Betweenness Centrality for Scale-Free Graphs. Office of Scientific and Technical Information (OSTI), November 2017. http://dx.doi.org/10.2172/1409962.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

León-Rincón, Carlos Eduardo. Scale-free tails in colombian financial indexes : a primer. Bogotá, Colombia: Banco de la República, March 2014. http://dx.doi.org/10.32468/be.812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Link, Hamilton E., Randall A. LaViolette, Terran Lane, and Jared Saia. Parameters affecting the resilience of scale-free networks to random failures. Office of Scientific and Technical Information (OSTI), September 2005. http://dx.doi.org/10.2172/974397.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Santos, Sandra A., and Danny C. Sorensen. A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem. Fort Belvoir, VA: Defense Technical Information Center, July 1995. http://dx.doi.org/10.21236/ada445632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bazilevs, Yuri. Free-Surface Fluid-Object Interaction for the Large-Scale Computation of Ship Hydrodynamics Phenomena. Fort Belvoir, VA: Defense Technical Information Center, May 2014. http://dx.doi.org/10.21236/ada606379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Moody, A. Contention-free Routing for Shift-based Communication in MPI Applications on Large-scale Infiniband Clusters. Office of Scientific and Technical Information (OSTI), October 2009. http://dx.doi.org/10.2172/967277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

León-Rincón, Carlos Eduardo, and Ron J. Berndsen. Modular scale-free architecture of Colombian financial networks : evidence and challenges with financial stability in view. Bogotá, Colombia: Banco de la República, December 2013. http://dx.doi.org/10.32468/be.799.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Perumalla, Kalyan S., and Maksudul Alam. Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model. Office of Scientific and Technical Information (OSTI), October 2017. http://dx.doi.org/10.2172/1399438.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kamada, R. F. Amending the W* Velocity Scale for Surface Layer, Entrainment Zone, and Baroclinic Shear in Mixed Forced/Free Turbulent Convection. Fort Belvoir, VA: Defense Technical Information Center, March 1992. http://dx.doi.org/10.21236/ada250389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Scale-free' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography