Bibliografías temáticas / Networks

Literatura académica sobre el tema "Networks"

Autor: Grafiati
Publicado: 4 de junio de 2021
Última modificación: 7 de julio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Índice

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Networks".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Networks"

1

Kim, Junki. "Networks, Network Governance, and Networked Networks". International Review of Public Administration 11, n.º 1 (julio de 2006): 19–34. http://dx.doi.org/10.1080/12294659.2006.10805075.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

PELLEGRINI, Lilla, Monica LEBA y Alexandru IOVANOVICI. "CHARACTERIZATION OF URBAN TRANSPORTATION NETWORKS USING NETWORK MOTIFS". Acta Electrotechnica et Informatica 20, n.º 4 (21 de enero de 2020): 3–9. http://dx.doi.org/10.15546/aeei-2020-0019.

Texto completo
Resumen
We use tools and techniques specific to the field of complex networks analysis for the identification and extraction of key parameters which define ”good” patterns and practices for designing public transportation networks. Using network motifs we analyze a set of 18 cities using public data sets regarding the topology of network and discuss each of the identified motifs using the concepts and tools of urban planning.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Shydlovskyi, P. y Ya Morozova. "FOREWORD: Network Approach for Studying the Prehistoric Networks". Vita Antiqua 1, n.º 10 (2018): 6–12. http://dx.doi.org/10.37098/2519-4542-2018-1-10-6-12.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

THATIPAMULA RAJU, THATIPAMULA RAJU y D. DEEPIKA RANI D. DEEPIKA RANI. "Achieving Network Level Privacy in Wireless Sensor Networks". International Journal of Scientific Research 2, n.º 8 (1 de junio de 2012): 183–87. http://dx.doi.org/10.15373/22778179/aug2013/61.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Yiyuan Xie, Yiyuan Xie y Zhu Yang Zhu Yang. "All-optical network interface from backbone networks to local area networks based on semiconductor optical amplifiers". Chinese Optics Letters 11, n.º 11 (2013): 110605–8. http://dx.doi.org/10.3788/col201311.110605.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Tarapata, Zbigniew. "Modelling and analysis of transportation networks using complex networks: Poland case study". Archives of Transport 36, n.º 4 (31 de diciembre de 2015): 55–65. http://dx.doi.org/10.5604/08669546.1185207.

Texto completo
Resumen
In the paper a theoretical bases and empirical results deal with analysis and modelling of transportation networks in Poland using complex networks have been presented. Properties of complex networks (Scale Free and Small World) and network's characteristic measures have been described. In this context, results of empirical researches connected with characteristics of passenger air links network, express railway links network (EuroCity and InterCity) and expressways/highways network in Poland have been given. For passenger air links network in Poland results are compared with the same networks in USA, China, India, Italy and Spain. In the conclusion some suggestions, observations and perspective dealing with complex network in transportation networks have been presented.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Yi-Wei Ma, Yi-Wei Ma, Jiann-Liang Chen Yi-Wei Ma, Yu-Liang Tang Jiann-Liang Chen y Kuan-Hung Lai Yu-Liang Tang. "Towards Adaptive Network Resource Orchestration for Cognitive Radio Networks". 網際網路技術學刊 23, n.º 5 (septiembre de 2022): 1087–97. http://dx.doi.org/10.53106/160792642022092305017.

Texto completo
Resumen
<p>This work proposes an adaptive resource orchestration system for a Wireless Local Area Network (WLAN) that is based on the operating principle of Cognitive Radio (CR) technology. By collecting environmental parameters, including the retransmission rate and the channel occupancy rate, the proposed system has &ldquo;knowledge&rdquo; of overall transmission behavior and can regulate transmission resources. An Adaptive Connection Assignment (ACA) mechanism is proposed for end devices; it find out target end devices with poor transmission performance, analyzes their alternative Access Point (AP) availability and causes them to change connections to improve transmission performance. An Adaptive Channel Utilization (ACU) mechanism is designed for APs to identify a target AP that is suffering from interference, to analyze its alternative channel availability and to require it to change its working channel to improve transmission efficiency. Results of simulations of various scenarios indicate that the throughput of end devices is increased by 15 to 24%, the throughput of APs is increased by 6 to 47% and the retransmission rate of APs is reduced by 0.4 to 5.3%.</p> <p>&nbsp;</p>
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

HRABCAK, David y Lubomir DOBOS. "THE CONCEPT OF MULTILAYERED NETWORK MODEL FOR 5G NETWORKS". Acta Electrotechnica et Informatica 19, n.º 3 (4 de diciembre de 2019): 39–43. http://dx.doi.org/10.15546/aeei-2019-0022.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Zhang, Chengjun, Yi Lei, Xinyu Shen, Qi Li, Hui Yao, Di Cheng, Yifan Xie y Wenbin Yu. "Fragility Induced by Interdependency of Complex Networks and Their Higher-Order Networks". Entropy 25, n.º 1 (23 de diciembre de 2022): 22. http://dx.doi.org/10.3390/e25010022.

Texto completo
Resumen
The higher-order structure of networks is a hot research topic in complex networks. It has received much attention because it is closely related to the functionality of networks, such as network transportation and propagation. For instance, recent studies have revealed that studying higher-order networks can explore hub structures in transportation networks and information dissemination units in neuronal networks. Therefore, the destruction of the connectivity of higher-order networks will cause significant damage to network functionalities. Meanwhile, previous works pointed out that the function of a complex network depends on the giant component of the original(low-order) network. Therefore, the network functionality will be influenced by both the low-order and its corresponding higher-order network. To study this issue, we build a network model of the interdependence of low-order and higher-order networks (we call it ILH). When some low-order network nodes fail, the low-order network’s giant component shrinks, leading to changes in the structure of the higher-order network, which further affects the low-order network. This process occurs iteratively; the propagation of the failure can lead to an eventual network crash. We conducted experiments on different networks based on the percolation theory, and our network percolation results demonstrated a first-order phase transition feature. In particular, we found that an ILH is more fragile than the low-order network alone, and an ILH is more likely to be corrupted in the event of a random node failure.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Kudĕlka, Miloš, Šárka Zehnalová, Zdenĕk Horák, Pavel Krömer y Václav Snášel. "Local dependency in networks". International Journal of Applied Mathematics and Computer Science 25, n.º 2 (1 de junio de 2015): 281–93. http://dx.doi.org/10.1515/amcs-2015-0022.

Texto completo
Resumen
Abstract Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network’s nodes from the structure in local surroundings of individual nodes. For the tasks we deal with in this article, the key technical parameter is locality. Since only the surroundings of the examined nodes are used in computations, there is no need to analyze the entire network. This allows the application of our approach in the area of large-scale networks. We present several experiments using small networks as well as large-scale artificial and real world networks. The results of the experiments show high effectiveness due to the locality of our approach and also high quality node ranking comparable to PageRank.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Networks"

1

Rivas, Antonio Canales. "Network management using active networks". Thesis, De Montfort University, 2006. http://hdl.handle.net/2086/4781.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Wells, Daniel David. "Network management for community networks". Thesis, Rhodes University, 2010. http://hdl.handle.net/10962/d1006587.

Texto completo
Resumen
Community networks (in South Africa and Africa) are often serviced by limited bandwidth network backhauls. Relative to the basic needs of the community, this is an expensive ongoing concern. In many cases the Internet connection is shared among multiple sites. Community networks may also have a lack of technical personnel to maintain a network of this nature. Hence, there is a demand for a system which will monitor and manage bandwidth use, as well as network use. The proposed solution for community networks and the focus within this dissertation, is a system of two parts. A Community Access Point (CAP) is located at each site within the community network. This provides the hosts and servers at that site with access to services on the community network and the Internet, it is the site's router. The CAP provides a web based interface (CAPgui) which allows configuration of the device and viewing of simple monitoring statistics. The Access Concentrator (AC) is the default router for the CAPs and the gateway to the Internet. It provides authenticated and encrypted communication between the network sites. The AC performs several monitoring functions, both for the individual sites and for the upstream Internet connection. The AC provides a means for centrally managing and effectively allocating Internet bandwidth by using the web based interface (ACgui). Bandwidth use can be allocated per user, per host and per site. The system is maintainable, extendable and customisable for different network architectures. The system was deployed successfully to two community networks. The Centre of Excellence (CoE) testbed network is a peri-urban network deployment whereas the Siyakhula Living Lab (SLL) network is a rural deployment. The results gathered conclude that the project was successful as the deployed system is more robust and more manageable than the previous systems.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Gaddam, Nishanth. "Network coding in wireless networks". [Ames, Iowa : Iowa State University], 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1468982.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Jiang, Shu. "Efficient network camouflaging in wireless networks". Texas A&M University, 2005. http://hdl.handle.net/1969.1/3067.

Texto completo
Resumen
Camouflaging is about making something invisible or less visible. Network camouflaging is about hiding certain traffic information (e.g. traffic pattern, traffic flow identity, etc.) from internal and external eavesdroppers such that important information cannot be deduced from it for malicious use. It is one of the most challenging security requirements to meet in computer networks. Existing camouflaging techniques such as traffic padding, MIX-net, etc., incur significant performance degradation when protected networks are wireless networks, such as sensor networks and mobile ad hoc networks. The reason is that wireless networks are typically subject to resource constraints (e.g. bandwidth, power supply) and possess some unique characteristics (e.g. broadcast, node mobility) that traditional wired networks do not possess. This necessitates developing new techniques that take account of properties of wireless networks and are able to achieve a good balance between performance and security. In this three-part dissertation we investigate techniques for providing network camouflaging services in wireless networks. In the first part, we address a specific problem in a hierarchical multi-task sensor network, i.e. hiding the links between observable traffic patterns and user interests. To solve the problem, a temporally constant traffic pattern, called cover traffic pattern, is needed. We describe two traf- fic padding schemes that implement the cover traffic pattern and provide algorithms for achieving the optimal energy efficiencies with each scheme. In the second part, we explore the design of a MIX-net based anonymity system in mobile ad hoc networks. The objective is to hide the source-destination relationship with respect to each connection. We survey existing MIX route determination algorithms that do not account for dynamic network topology changes, which may result in high packet loss rate and large packet latency. We then introduce adaptive algorithms to overcome this problem. In the third part, we explore the notion of providing anonymity support at MAC layer in wireless networks, which employs the broadcast property of wireless transmission. We design an IEEE 802.11-compliant MAC protocol that provides receiver anonymity for unicast frames and offers better reliability than pure broadcast protocol.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Bhatia, Anuj. "Voice network for aviation data networks". Thesis, Wichita State University, 2007. http://hdl.handle.net/10057/1500.

Texto completo
Resumen
Airline companies are always looking for various services they can offer to differentiate them from others and increase there market share. On the other hand passengers in the aircraft always want to be in touch with the rest of the world through phone or internet to make there time more productive. The drive of gaining market share by airline companies and advances in wireless and internet technology has made voice communication possible from the aircraft. Present technologies offer cell phone access or allow voice communication over internet through satellite link. The major disadvantage they pose is the interference of cell phone transmission with navigational system of aircraft and the cost of implementation. Present research work attempts to address the above problem by designing an IP based network which is capable of connecting travelers from aircraft to the rest of the world.
Thesis (M.S)-- Wichita State University, College of Engineering, Dept. of Electrical and Computer Engineering
"July 2007."
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Somalingam, Ramesh Ramvel. "Network performance monitoring for multimedia networks". Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23939.

Texto completo
Resumen
Multimedia applications require certain guarantees from the underlying system concerning quality of various parameters, such as the throughput, delay, loss rate etc. We assume that such quality of service (QoS) parameters are normally agreed upon for the duration of a session, and should be maintained throughout that session. If a QoS violation occurs, possibly due to the temporary overload of one of the system components, either the user will notice this and may request a renegotiation of the quality and cost parameters, or the system will automatically do some internal reconfiguration in order to recover from the problem. In the latter case, the system needs to continuously monitor the relevant performance parameters. In this thesis, we develop means for performing such monitoring in the context of a News-on-Demand application. We have designed and implemented a distributed QoS monitoring facility that can be used by distributed multimedia applications for QoS monitoring and QoS violation detection. The system consists of a measurement component and an administrative component. The measurement component is responsible for continuously measuring the end-to-end QoS parameters of connections between the server and client application, while the administrative component is responsible for the overall administration of the monitoring system, which includes raising QoS violation notifications if the quality of service is violated.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Alkhawlani, Mohammed Mohssen. "Access network selection in heterogeneous networks". Thesis, De Montfort University, 2008. http://hdl.handle.net/2086/5217.

Texto completo
Resumen
The future Heterogeneous Wireless Network (HWN) is composed of multiple Radio Access Technologies (RATs), therefore new Radio Resource Management (RRM) schemes and mechanisms are necessary to benefit from the individual characteristics of each RAT and to exploit the gain resulting from jointly considering the whole set of the available radio resources in each RAT. These new RRM schemes have to support mobile users who can access more than one RAT alternatively or simultaneously using a multi-mode terminal. An important RRM consideration for overall HWN stability, resource utilization, user satisfaction, and Quality of Service (QoS) provisioning is the selection of the most optimal and promising Access Network (AN) for a new service request. The RRM mechanism that is responsible for selecting the most optimal and promising AN for a new service request in the HWN is called the initial Access Network Selection (ANS). This thesis explores the issue of ANS in the HWN. Several ANS solutions that attempt to increase the user satisfaction, the operator benefits, and the QoS are designed, implemented, and evaluated. The thesis first presents a comprehensive foundation for the initial ANS in the H\VN. Then, the thesis analyses and develops a generic framework for solving the ANS problem and any other similar optimized selection problem. The advantages and strengths of the developed framework are discussed. Combined Fuzzy Logic (FL), Multiple Criteria Decision Making (MCDM) and Genetic Algorithms (GA) are used to give the developed framework the required scalability, flexibility, and simplicity. The developed framework is used to present and design several novel ANS algorithms that consider the user, the operator, and the QoS view points. Different numbers of RATs, MCDM tools, and FL inference system types are used in each algorithm. A suitable simulation models over the HWN with a new set of performance evolution metrics for the ANS solution are designed and implemented. The simulation results show that the new algorithms have better and more robust performance over the random, the service type, and the terminal speed based selection algorithms that are used as reference algorithms. Our novel algorithms outperform the reference algorithms in- terms of the percentage of the satisfied users who are assigned to the network of their preferences and the percentage of the users who are assigned to networks with stronger signal strength. The new algorithms maximize the operator benefits by saving the high cost network resources and utilizing the usage of the low cost network resources. Usually better results are achieved by assigning the weights using the GA optional component in the implemented algorithms.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Jannotti, John 1974. "Network layer support for overlay networks". Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29274.

Texto completo
Resumen
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Includes bibliographical references (p. 98-103).
Overlay networks are virtual networks formed by cooperating nodes that share an underlying physical network. They represent a flexible and deployable approach for applications to obtain new network semantics without modification of the underlying network, but they suffer from efficiency concerns. This thesis presents two new primitives for implementation in the network layer (i.e., the routers of the physical network). These primitives support the efficient operation and construction of overlay networks. Packet Reflection allows end hosts to request that routers perform specialized routing and duplication for certain packets. Path Painting allows multiple end hosts to determine where their disparate paths to a rendezvous point meet, in order to facilitate overlay topology building that reflects the topology of the underlying network. Both primitives can be incrementally deployed for incremental benefit. This thesis describes a variety applications of these primitives: application level multicast systems with various semantics, an extended Internet Indirect Infrastructure with latency benefits over the original proposal, and an extension to Chord which would allows faster lookups. Experimental results on simulated topologies indicate that when all routers support the proposed primitives, less that 5% overhead (in terms of link usage and latency) remains in two common overlay network usage scenarios. In addition, the benefits gained from deployment are significant even at low deployment levels. At approximately 25% deployment, the primitives have reduced overhead by over 50%. When intelligent deployment strategies are used, link usage overhead is less than 30% at less than 10% deployment. Finally, the results indicate that these benefits affect the area local to the deployed routers, providing a deployment incentive to independent networks.
by John Jannotti.
Ph.D.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Kim, MinJi Ph D. Massachusetts Institute of Technology. "Network coding for robust wireless networks". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71276.

Texto completo
Resumen
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 157-167).
Wireless networks and communications promise to allow improved access to services and information, ubiquitous connectivity, and mobility. However, current wireless networks are not well-equipped to meet the high bandwidth and strict delay requirements of future applications. Wireless networks suffer from frequent losses and low throughput. We aim to provide designs for robust wireless networks. This dissertation presents protocols and algorithms that significantly improve wireless network performance and effectively overcome interference, erasures, and attacks. The key idea behind this dissertation is in understanding that wireless networks are fundamentally different from wired networks, and recognizing that directly applying techniques from wired networks to wireless networks limits performance. The key ingredient underlying our algorithms and protocols is network coding. By recognizing the algebraic nature of information, network coding breaks the convention of routing networks, and allows mixing of information in the intermediate nodes and routers. This mixing has been shown to have numerous performance benefits, e.g. increase in throughput and robustness against losses and failures. We present three protocols and algorithms, each using network coding to harness a different characteristic of the wireless medium. We address the problem of interference, erasures, and attacks in wireless networks with the following network coded designs. -- Algebraic NC exploits strategic interference to provide a distributed, randomized code construction for multi-user wireless networks. Network coding framework simplifies the multi-user wireless network model, and allows us to describe the multi-user wireless networks in an algebraic framework. This algebraic framework provides a randomized, distributed code construction, which we show achieves capacity for multicast connections as well as a certain set of non-multicast connections. -- TCP/NC efficiently and reliably delivers data over unreliable lossy wireless networks. TCP, which was designed for reliable transmission over wired networks, often experiences severe performance degradation in wireless networks. TCP/NC combines network coding's erasure correction capabilities with TCP's congestion control mechanism and reliability. We show that TCP/NC achieves significantly higher throughput than TCP in lossy networks; therefore, TCP/NC is well suited for reliable communication in lossy wireless networks. -- Algebraic Watchdog takes advantage of the broadcast nature of wireless networks to provide a secure global self-checking network. Algebraic Watchdog allows nodes to detect malicious behaviors probabilistically, and police their neighbors locally using overheard messages. Unlike traditional detection protocols which are receiver-based, this protocol gives the senders an active role in checking the nodes downstream. We provide a trellis-based inference algorithm and protocol for detection, and analyze its performance. The main contribution of this dissertation is in providing algorithms and designs for robust wireless networks using network coding. We present how network coding can be applied to overcome the challenges of operating in wireless networks. We present both analytical and simulation results to support that network coded designs, if designed with care, can bring forth significant gains, not only in terms of throughput but also in terms of reliability, security, and robustness.
by MinJi Kim.
Ph.D.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Attar, Hani Hasan. "Cooperative Network Coding for wireless networks". Thesis, University of Strathclyde, 2011. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=16782.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Libros sobre el tema "Networks"

1

Dean, Tamara. Network+ guide to networks. Cambridge, MA: Course Technology, Thomson Learning, 2000.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Network+ guide to networks. Cambridge, MA: Course Technology, Thomson Learning, 2000.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Network+ guide to networks. 4a ed. Boston, Mass: Thomson/Course Technology, 2006.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Jeroen, Van Schaick, Klaasen, I. T. (Ina T.) y Technische Universiteit Delft. Faculteit der Bouwkunde, eds. Urban networks: Network urbanism. Amsterdam, The Netherlands: Techne Press, 2008.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Network+ guide to networks. 3a ed. Boston, Mass: Thomson/Course Technology, 2004.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Dean, Tamara. Enhanced Network+ guide to networks. Boston, Mass: Thomson/Course Technology, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

R, Coover Edwin, ed. Systems network architecture (SNA) networks. Los Alamitos, Calif: IEEE Computer Society Press, 1992.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Coover, Edwin R. Systems network architecture (SNA) networks. Los Alamitos, Calif: IEEE Computer Society Press, 1992.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Evans, Markuson Barbara, Network Advisory Committee y Educom, eds. Networks for Networkers II Conference. Washington, D.C: Library of Congress, 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Reichl, Peter, Burkhard Stiller y Bruno Tuffin, eds. Network Economics for Next Generation Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01796-4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Capítulos de libros sobre el tema "Networks"

1

de Jesús Cruz Guzmán, José y Zbigniew Oziewicz. "Network of Networks",. En Computational Science - ICCS 2004, 602–5. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24687-9_82.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Lovell, Heather. "Networks". En Understanding Energy Innovation, 17–36. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6253-9_2.

Texto completo
Resumen
AbstractSocial scientists study many different types of networks, from policy networks to sociotechnical networks, in order to better understand processes of change. These diverse networks have a number of characteristics in common, including interconnectedness, flows, and fragility. Exploring these characteristics in relation to smart grids helps us to better understand the social nature of energy sector innovation. In this chapter, I use these themes and concepts to assess three examples: international smart grid policy networks; a local community network on Bruny Island, Australia; and a fragile network, the digital metering programme in the State of Victoria, Australia.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Walrand, Jean. "Networks: A". En Probability in Electrical Engineering and Computer Science, 71–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_5.

Texto completo
Resumen
AbstractSocial networks connect people and enable them to exchange information. News and rumors spread through these networks. We explore models of such propagations. The technology behind social networks is the internet where packets travel from queue to queue. We explain some key results about queueing networks.Section 5.1 explores a model of how rumors spread in a social network. Epidemiologists use similar models to study the spread of viruses. Section 5.2 explains the cascade of choices in a social network where one person’s choice is influenced by those of people she knows. Section 5.3 shows how seeding the market with advertising or free products affects adoptions. Section 5.4 studies a model of how media can influence the eventual consensus in a social network. Section 5.5 explores the randomness of the consensus in a group. Sections 5.6 and 5.7 present a different class of network models where customers queue for service. Section 5.6 studies a single queue and Sect. 5.7 analyzes a network of queues. Section 5.8 explains a classical optimization problem in a communication network: how to choose the capacities of different links. Section 5.9 discusses the suitability of queueing networks as models of the internet. Section 5.10 presents a classical result about a class of queueing networks known as product-form networks.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Pyka, Andreas y Andrea Scharnhorst. "Introduction: Network Perspectives on Innovations: Innovative Networks – Network Innovation". En Innovation Networks, 1–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-92267-4_1.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Tschudin, Christian. "An Active Networks Overlay Network (ANON)". En Active Networks, 156–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-540-48507-0_14.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Barthelemy, Marc. "Optimal Transportation Networks and Network Design". En Spatial Networks, 373–405. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94106-2_19.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Flores-Márquez, Dorismilda. "Networks and networked society". En The Routledge Encyclopedia of Citizen Media, 269–73. London: Routledge, 2020. http://dx.doi.org/10.4324/9781315619811-45.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Assens, Christophe y Aline Courie Lemeur. "From Network to “Network of Networks”". En Networks Governance, Partnership Management and Coalitions Federation, 26–37. London: Palgrave Macmillan UK, 2016. http://dx.doi.org/10.1057/9781137566638_4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Gopinath, Divya, Luca Lungeanu, Ravi Mangal, Corina Păsăreanu, Siqi Xie y Huanfeng Yu. "Feature-Guided Analysis of Neural Networks". En Fundamental Approaches to Software Engineering, 133–42. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30826-0_7.

Texto completo
Resumen
AbstractApplying standard software engineering practices to neural networks is challenging due to the lack of high-level abstractions describing a neural network’s behavior. To address this challenge, we propose to extract high-level task-specific features from the neural network internal representation, based on monitoring the neural network activations. The extracted feature representations can serve as a link to high-level requirements and can be leveraged to enable fundamental software engineering activities, such as automated testing, debugging, requirements analysis, and formal verification, leading to better engineering of neural networks. Using two case studies, we present initial empirical evidence demonstrating the feasibility of our ideas.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Ivanov, Plamen Ch y Ronny P. Bartsch. "Network Physiology: Mapping Interactions Between Networks of Physiologic Networks". En Understanding Complex Systems, 203–22. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-03518-5_10.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Networks"

1

Krishnamoorthy, Ashok V., Fouad Kiamilev y Sadik Esener. "A class of packet-switched extended generalized shuffle networks". En OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/oam.1992.wv4.

Texto completo
Resumen
Extended generalized shuffle (EGS) networks1 have recently been proposed as a broad class of multistage interconnection networks (MINs) that include strictly non-blocking networks as well as networks with finite blocking probabilities. These networks can be viewed as extensions to generalized shuffle networks2 (GSNs) that include the facility to fan-out and fan-in at the input and output stages, respectively, of the interconnection network. We present a new class of packets-witched EGS networks. At the heart of these networks is a unipath EGS network that allows a continuous tradeoff between a crossbar and a traditional MIN in terms of fan-out and fan-in versus number of stages. We show how switching networks with self-routing capability and arbitrarily low packet contention rates can be achieved by replicating the unipath network. We also compare the performance and cost of such networks with those of the GSN. Finally, we discuss the utility of these new packet-switched networks for photonic switching using smart pixels.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Shi, Min, Yu Huang, Xingquan Zhu, Yufei Tang, Yuan Zhuang y Jianxun Liu. "GAEN: Graph Attention Evolving Networks". En Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/213.

Texto completo
Resumen
Real-world networked systems often show dynamic properties with continuously evolving network nodes and topology over time. When learning from dynamic networks, it is beneficial to correlate all temporal networks to fully capture the similarity/relevance between nodes. Recent work for dynamic network representation learning typically trains each single network independently and imposes relevance regularization on the network learning at different time steps. Such a snapshot scheme fails to leverage topology similarity between temporal networks for progressive training. In addition to the static node relationships within each network, nodes could show similar variation patterns (e.g., change of local structures) within the temporal network sequence. Both static node structures and temporal variation patterns can be combined to better characterize node affinities for unified embedding learning. In this paper, we propose Graph Attention Evolving Networks (GAEN) for dynamic network embedding with preserved similarities between nodes derived from their temporal variation patterns. Instead of training graph attention weights for each network independently, we allow model weights to share and evolve across all temporal networks based on their respective topology discrepancies. Experiments and validations, on four real-world dynamic graphs, demonstrate that GAEN outperforms the state-of-the-art in both link prediction and node classification tasks.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Shi, Weijia, Andy Shih, Adnan Darwiche y Arthur Choi. "On Tractable Representations of Binary Neural Networks". En 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/91.

Texto completo
Resumen
We consider the compilation of a binary neural network’s decision function into tractable representations such as Ordered Binary Decision Diagrams (OBDDs) and Sentential Decision Diagrams (SDDs). Obtaining this function as an OBDD/SDD facilitates the explanation and formal verification of a neural network’s behavior. First, we consider the task of verifying the robustness of a neural network, and show how we can compute the expected robustness of a neural network, given an OBDD/SDD representation of it. Next, we consider a more efficient approach for compiling neural networks, based on a pseudo-polynomial time algorithm for compiling a neuron. We then provide a case study in a handwritten digits dataset, highlighting how two neural networks trained from the same dataset can have very high accuracies, yet have very different levels of robustness. Finally, in experiments, we show that it is feasible to obtain compact representations of neural networks as SDDs.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Najmon, Joel C. y Andres Tovar. "Comparing Derivatives of Neural Networks for Regression". En ASME 2023 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/detc2023-117571.

Texto completo
Resumen
Abstract In the past decades, neural networks have rapidly grown in popularity as a way to model complex non-linear relationships. The computational efficiently and flexibility of neural networks has made them popular for machine learning-based optimization methods. As such the derivative of a neural network’s output is required for gradient-based optimization algorithms. Recently, there have been several works towards improving derivatives of neural network targets, however there is yet to be done a comparative study on the different derivation methods for the derivative of a neural network’s targets with respect to its input features. Consequently, this paper’s objective is to implement and compare common methods for obtaining or approximating the derivative of neural network targets with respect to their inputs. The methods studied include analytical derivatives, finite differences, complex step approximation, and automatic differentiation. The methods are tested by training deep multilayer perceptrons for regression with several analytical functions. The derivatives of the neural network-derived methods are evaluated against the exact derivative of the test functions. Results show that all of the derivation methods provide the same derivative approximation to near working precision of the computer. Implementation of the study is done using the TensorFlow library in a provided Python code.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Lian, F. L., J. R. Moyne y D. M. Tilbury. "Performance Evaluation of Control Networks for Manufacturing Systems". En ASME 1999 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/imece1999-0116.

Texto completo
Resumen
Abstract There are many different networks which have been promoted for use in manufacturing control systems. In this paper, we discuss the features of three candidates: Ethernet (CSMA/CD), ControlNet (Token Bus) and DeviceNet (CAN Bus). We consider how each of these control networks could be used as a communication backbone for a networked control system. A detailed discussion of the medium access control protocol for each network is provided. The medium access control protocol is responsible for providing both the satisfaction of the time-critical/real-time response requirement over the network and the quality and reliability of the communication between devices on the network. For each protocol, we derive the key parameters of the corresponding network when used in a control situation, including bandwidth, magnitude of the expected time delay, and variation in time delays. Simulation results are presented for several different scenarios, and the advantages and disadvantages of each network are summarized.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Alabbasi, Yahia, Khaled Aboelenen y Mohammed Sadeq. "New Technique for Flood Risk Assessment of Sub-Networks in Large Networks Using InfoWorks ICM: A Case Study of Qatar's Full Storm Water Network". En The 2nd International Conference on Civil Infrastructure and Construction. Qatar University Press, 2023. http://dx.doi.org/10.29117/cic.2023.0189.

Texto completo
Resumen
The elements of the storm water network are made to safely drain most water during a heavy rainstorm. Flood risk modelling (mathematical modelling) with hydraulic software is a good way to check the network's level of service, especially now that technology has changed. Flood risk modelling is an essential method for checking the network sufficiency and adequacy for different kinds of rain. Modelling flood risk should be done for the whole network to ensure that flows are connected and get accurate results. In this study, one-dimensional flood risk modelling is needed for a sub-network that is part of Qatar's full storm water network. The flood risk modelling is conducted using InfoWorks ICM software. Running the whole model takes a lot of computational data processing. Splitting the entire stormwater network to the concerned sub-network without considering the hydraulic effects of upstream and downstream flows at the boundary conditions of the sub-network will lead to erroneous conclusions. In this research, a new method for hydraulically dividing the network into sub-networks is presented, taking into account the characteristics of the boundaries. This method increases the efficiency and viability of hydraulic modelling for sub-networks in big networks. For purposes of validation, the results of the reduced model in terms of flood depths and volumes are compared with those of the full model. The results of the split model are in good agreement with the entire model.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Yang, Zhun, Adam Ishay y Joohyung Lee. "NeurASP: Embracing Neural Networks into Answer Set Programming". En Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/243.

Texto completo
Resumen
We present NeurASP, a simple extension of answer set programs by embracing neural networks. By treating the neural network output as the probability distribution over atomic facts in answer set programs, NeurASP provides a simple and effective way to integrate sub-symbolic and symbolic computation. We demonstrate how NeurASP can make use of a pre-trained neural network in symbolic computation and how it can improve the neural network's perception result by applying symbolic reasoning in answer set programming. Also, NeurASP can make use of ASP rules to train a neural network better so that a neural network not only learns from implicit correlations from the data but also from the explicit complex semantic constraints expressed by the rules.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Roland, C. M., P. G. Santangelo y P. H. Mott. "Elastic Response of Rubber Double Networks". En ASME 1999 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/imece1999-0933.

Texto completo
Resumen
Abstract Double network elastomers are formed by twice-curing rubber, the second time while the material is deformed. When measured parallel to the curing deformation, the equilibrium modulus of a double network exceeds that of an isotropic elastomer of equal crosslink density. This difference increases with increasing strain. Despite the higher modulus, the mechanical fatigue lifetimes of double networks of natural rubber were found to be as much as a factor of ten higher than for the conventionally crosslinked rubber. The double network’s tensile strength, on the other hand, was slightly lower. Such results suggest that the conventional compromise between modulus and failure properties can be circumvented using double network rubbers. Their utilization can yield elastomers of better mechanical properties.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Hadi, Mohammad F. y Victor H. Barocas. "Generating Random Fiber Network Topologies That Mimic Previously Characterized Networks". En ASME 2013 Summer Bioengineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/sbc2013-14615.

Texto completo
Resumen
Fibrous proteins, such as collagen and elastin, form the underlying structure of many soft tissues. These proteins form micrometer-scale networks of varying topology that play a role in governing the mechanics of tissues at larger length scales [1]. The relationship between a network’s topology and its mechanics, however, are poorly understood. This disconnect presents an important challenge in constructing realistic multiscale models of tissues informed by collagen network micrographs and subsequently reconstructed networks [2]. Accurate multiscale simulations may require thousands to millions of such unique networks. It is imperative that a method be developed to generate random networks that are functionally similar to ones derived experimentally. In the current study, we present a probabilistic method for generating de novo networks that mimic the mechanical properties of previously characterized networks. We chose Delaunay and Voronoi networks as model targets because they have been used successfully to model the mechanics of collagenous tissues [3] and since their topologies are well characterized. Understanding the role of topology in network mechanics is fundamental to building improved models of the mechanics of fibrous soft tissues — models that can aid in the rational design of engineered tissues or that can help assess the mechanical impact of damage or disease on native tissues.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Louri, Ahmed, Hongki Sung, Yoonkeon Moon y Bernard P. Zeigler. "An Efficient Signal Distinction Scheme for Large-scale Free-space Optical Networks Using Genetic Algorithms". En Photonics in Switching. Washington, D.C.: Optica Publishing Group, 1995. http://dx.doi.org/10.1364/ps.1995.pthc5.

Texto completo
Resumen
Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance [1]. The degree of space variance determines the network’s complexity and regularity. A totally space variant network allows a completely arbitrary interconnection between nodes, whereas a totally space invariant network has a definite, regular structure with all the nodes having the same connection patterns. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. In other words, all nodes in a totally space-invariant network can share a single beam steering optics (considering multiple fanouts as one steering optics) to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. This is one of the reasons why space variant networks require complex optical implementations that often result in low interconnection density and high cost.
Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Networks"

1

Sentz, Kari y Jacob Green. Threat Network: Network of Networks Graphic. Office of Scientific and Technical Information (OSTI), octubre de 2014. http://dx.doi.org/10.2172/1162150.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Gont, F. y T. Chown. Network Reconnaissance in IPv6 Networks. RFC Editor, marzo de 2016. http://dx.doi.org/10.17487/rfc7707.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Kornell, James. Network of Networks Final Report 2016. Office of Scientific and Technical Information (OSTI), julio de 2017. http://dx.doi.org/10.2172/1755855.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Kornell, James. Network of Networks Final Report 2016. Office of Scientific and Technical Information (OSTI), julio de 2017. http://dx.doi.org/10.2172/1755855.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Lin, Mengjou, Jenwei Hsieh, David H. Du, Joseph P. Thomas y James A. MacDonald. Distributed Network Computing Over Local ATM Networks. Fort Belvoir, VA: Defense Technical Information Center, enero de 1995. http://dx.doi.org/10.21236/ada388752.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Sutton, Jeffrey P. Reconfigurable Network of Networks for Multiscale Computing. Fort Belvoir, VA: Defense Technical Information Center, abril de 2001. http://dx.doi.org/10.21236/ada389675.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Stanley, H. E. Threats Networks and Threatened Networks. Fort Belvoir, VA: Defense Technical Information Center, noviembre de 2004. http://dx.doi.org/10.21236/ada428870.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Zhang, Junshan. Networked Information Gathering in Stochastic Sensor Networks: Compressive Sensing, Adaptive Network Coding and Robustness. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 2013. http://dx.doi.org/10.21236/ada590144.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Sutton, Jeffrey. Reconfigurable Network of Networks for Multi-Scale Computing. Fort Belvoir, VA: Defense Technical Information Center, agosto de 2002. http://dx.doi.org/10.21236/ada405332.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Mansfield, S., E. Gray y K. Lam, eds. Network Management Framework for MPLS-based Transport Networks. RFC Editor, septiembre de 2010. http://dx.doi.org/10.17487/rfc5950.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías ampliadas sobre el tema "Networks" para tipos de fuentes particulares:
Artículos de revistas Tesis Libros
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía