We are proudly a Ukrainian website. Our country was attacked by Russian Armed Forces on Feb. 24, 2022.
You can support the Ukrainian Army by following the link: https://u24.gov.ua/.
Even the smallest donation is hugely appreciated!
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Network convergence" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2
Bao, Chunhui, Yifei Pu und Yi Zhang. „Fractional-Order Deep Backpropagation Neural Network“. Computational Intelligence and Neuroscience 2018 (03.07.2018): 1–10. http://dx.doi.org/10.1155/2018/7361628.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In recent years, the research of artificial neural networks based on fractional calculus has attracted much attention. In this paper, we proposed a fractional-order deep backpropagation (BP) neural network model with L2 regularization. The proposed network was optimized by the fractional gradient descent method with Caputo derivative. We also illustrated the necessary conditions for the convergence of the proposed network. The influence of L2 regularization on the convergence was analyzed with the fractional-order variational method. The experiments have been performed on the MNIST dataset to demonstrate that the proposed network was deterministically convergent and can effectively avoid overfitting.
3
Li, Jun Yi. „Bp Neural Network Optimized by PSO and its Application in Function Approximation“. Advanced Materials Research 945-949 (Juni 2014): 2413–16. http://dx.doi.org/10.4028/www.scientific.net/amr.945-949.2413.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
BP network is one of the most popular artificial neural networks because of its special advantage such as simple structure, distributed storage, parallel processing, high fault-tolerance performance, etc. However, with its extensive use in recent years, it is discovered that BP algorithm has the defects on slow convergent speed and easy convergence to a local minimum point. The paper proposes a method of BP Neural Network improved by Particle Swarm Optimization (PSO). The hybrid algorithm can not only avoid local minimum, but also raise the speed of network training and reduce the convergence time.
4
Jamalipour, Abbas, Nei Kato, Hsiao-Hwa Chen und Kyung Pyo Jun. „Broadband convergence Network (BcN)“. Journal of Communications and Networks 8, Nr. 4 (Dezember 2006): 363–68. http://dx.doi.org/10.1109/jcn.2006.6182784.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5
Liu, Qingshan, Jinde Cao und Guanrong Chen. „A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming“. Neural Computation 22, Nr. 11 (November 2010): 2962–78. http://dx.doi.org/10.1162/neco_a_00029.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.
6
Šíma, Jiří, Pekka Orponen und Teemu Antti-Poika. „On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets“. Neural Computation 12, Nr. 12 (01.12.2000): 2965–89. http://dx.doi.org/10.1162/089976600300014791.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this problem in the case of binary nets. Finally, we show that symmetric analog nets with an external clock are computationally Turing universal.
7
Whigham, P. A., G. Dick und M. Parry. „Network rewiring dynamics with convergence towards a star network“. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 472, Nr. 2194 (Oktober 2016): 20160236. http://dx.doi.org/10.1098/rspa.2016.0236.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440–442. ( doi:10.1038/30918 )). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.
8
Kobayakawa, Shunsuke, und Hirokazu Yokoi. „Predictor Using an Error-Convergence Neuron Network and its Application to Electrocardiograms“. Journal of Advanced Computational Intelligence and Intelligent Informatics 15, Nr. 1 (20.01.2011): 21–33. http://dx.doi.org/10.20965/jaciii.2011.p0021.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The output error of a neuron network cannot converge at zero, even if the training for a neuron network is iterated many times. “Error-convergence neuron network” in which the output error of a singleoutput system uses neuron networks with multiplestep convergence, has been designed to resolve this problem. The output error is converged at zero by setting infinite steps of the neuron network. Three types of neuron network systems also have been designed. They are “Error-convergence parallel neuron network,” “Error-convergence recurrent neuron network,” and “Error-convergence parallel recurrent neuron network.” A subsequent prediction can be obtained by recurring the prediction of a predictor to its input if the predictor is free of prediction error. An error-convergence neuron network can be applied to realize this predictor. “Error-convergence neuron network predictor” has been proposed as such a predictor. In this study, its feasibility is investigated by performing prediction training for the errorconvergence neuron network predictor constructed of second-order Volterra neuron networks with two steps, using the nonlinear time series signal of a normal sinus rhythm electrocardiogram. Predictions without any error were obtained.
9
Ahmed Ali, Adel, und Ahmed M. Al-Naamany. „Converged Networking: A Review of Concepts and Technologies“. Sultan Qaboos University Journal for Science [SQUJS] 5 (01.12.2000): 209. http://dx.doi.org/10.24200/squjs.vol5iss0pp209-225.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Converged networking is an emerging technology thrust that integrates voice, video, and data traffic on a single network. Converged networking encompasses several aspects, all of which are related to the aggregation of networking activity. Such aspects include, Payload convergence, Protocol convergence, Physical convergence, Device convergence, Application convergence, Technology convergence, etc. In recent years the Internet has developed into a global data network that is highly accepted as a multimedia information platform, which has the potential to develop into an alternative carrier network in the future. Several convergence scenarios have been recently proposed, ranging from integrating communication services and computer application into two separate networks, to building a seamless multimedia network, which converges the Central Office based network and the Internet in a single network, thereby enabling telecommunications operators and service provider's tremendous investment in existing network infrastructure to be fully utilized. This paper offers introduction and review of the networking technologies. The paper presents the existing multiple networks into two infrastructures: an ATM/Frame Relay (Ethernet)- based corporate network with integrated voice, video, and data traffic and an Internet-based network for secure intranet, extranet and remote access. This work is aimed at summarizing the internetworking basics and technologies which are essential for the emerging converged networking systems. The specific areas addressed here are networking basics, networking technologies, types of traffic, and convergence of computer and communication networks.
10
Cao, Xun. „Global Networks and Domestic Policy Convergence: A Network Explanation of Policy Changes“. World Politics 64, Nr. 3 (27.06.2012): 375–425. http://dx.doi.org/10.1017/s0043887112000081.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
National economies are embedded in complex networks such as trade, capital flows, and intergovernmental organizations (IGOs). These globalization forces impose differential impacts on national economies depending on a country's network positions. This article addresses the policy convergence-divergence debate by focusing on how networks at the international level affect domestic fiscal, monetary, and regulatory policies. The author presents two hypotheses: first, similarity in network positions induces convergence in domestic economic policies as a result of peer competitive pressure. Second, proximity in network positions facilitates policy learning and emulation, which result in policy convergence. The empirical analysis applies a latent-space model for relational/dyadic data and indicates that position similarity in the network of exports induces convergence in fiscal and regulatory policies; position similarity in the network of transnational portfolio investments induces convergence in fiscal policies; and position proximity in IGO networks is consistently associated with policy convergence in fiscal, monetary, and regulatory policies.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In a multicarrier communication system with known channel state information at transmitter (CSIT), it is well-known that the water-filling power allocation scheme is optimal in achieving the Shannon capacity. However, in a multicarrier broadcast network (e.g. over-the-air TV network) without CSIT, the optimal power allocation among subcarriers is still unknown, largely due to the heterogeneity of the channel conditions associated with different receivers. In the first part of the thesis, the performance of a generic multicarrier broadcast network is thoroughly studied by exploiting the frequency diversity over subcarriers. In particular, the performance metric is first defined based on the relationship among broadcast transmission rate, coverage area and outage probability. In order to maximize the network performance, closed form expressions of the instantaneous mutual information (IMI) and the optimal power allocation schemes are derived for both low SNR and high SNR cases; upper and lower bounds are also provided to estimate broadcast coverage area in general SNR regime. Also we extend our discussion to the broadcast network with multiple collaborative transmitters. Extensive simulation results are provided to validate our analysis. In the second part of the thesis, we discuss the optimal performance of a generic broadcast cellular hybrid network. It is well known that the Dirty Paper Coding (DPC) achieves the channel capacity for multiuser degraded channels. However, the optimality of DPC remains unknown for non-degraded channel. Specifically, we derive the optimal interference pre-cancellation order for a DPC based broadcast and unicast hybrid network. Different DPC cancellation schemes are studied to maximize the hybrid capacity region. The conditions for each scheme being optimal are analytically derived. Both ergodic and outage capacity are considered as our performance metric. Our results show that the optimal interference pre-cancellation order varies with SNR and broadcast and unicast channel conditions. Moreover, in low SNR condition, the optimal power allocation scheme is derived to reach the maximal sum rate.
2
VAFA, FARZAM. „M2M AND LTE-A NETWORK CONVERGENCE“. OpenSIUC, 2012. https://opensiuc.lib.siu.edu/theses/988.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In this thesis we provide a feasible solution for converging Machine to machine (M2M) networks and 3gpp Long Term Evolution advanced (LTE-A) Network. As a M2M network, a Wireless Sensor Network (WSN) is chosen. In order to overcome the power consumption restriction in M2M communication, IPv6 Low Power Personal Area Network (6LoWPAN) standard is used over IEEE 802.15.4 interface. A dual mode gateway structure is proposed for integration of two networks. One side of the gateway is connected to the M2M network, and the other side is the User Equipment (UE) which is the last node of LTE access layer. In term of Network convergence, Tight Coupling is preferred to decrease the expected end to end latency. The proposed structure is implemented in OMNET++ simulator.
3
Sridharan, Vidhumana. „Enterprise network convergence : path to cost optimization /“. Online version of thesis, 2007. http://hdl.handle.net/1850/4393.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4
LeBlanc, Robert-Lee Daniel. „Analysis of Data Center Network Convergence Technologies“. BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/4150.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The networks in traditional data centers have remained unchanged for decades and have grown large, complex and costly. Many data centers have a general purpose Ethernet network and one or more additional specialized networks for storage or high performance low latency applications. Network convergence promises to lower the cost and complexity of the data center network by virtualizing the different networks onto a single wire. There is little evidence, aside from vendors' claims, that validate network convergence actually achieves these goals. This work defines a framework for creating a series of unbiased tests to validate converged technologies and compare them to traditional configurations. A case study involving two different network converged technologies was developed to validate the defined methodology and framework. The study also shows that these two technologies do indeed perform similarly to non-virtualized network, reduce costs, cabling, power consumption and are easy to operate.
5
Danielsson, Jakob, und Tobias Andersson. „Investigating Methods For Measuring Network Convergence Times“. Thesis, Mälardalens högskola, Inbyggda system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-31822.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This thesis investigates different methods that can be used for analyzing network performance and,ultimately, can be used for measuring the convergence time of ring coupled networks. As of today,many networks are often run with extra links, serving as backup links in case any that of the mainlinks would go down. To operate networks with backup links in layer 2 and layer 3, specific re-routing protocols such as RIP and OSPF are used in order to calculate a feasible path through anetwork when a network state changes. Depending on different implementations of the protocolsand the hardware used, the convergence times can vary substantially, which means measuring thenetwork performance is a very important part when developing a network solution. To executenetwork tests, a packet engine suite is used consisting of a network traffic generator that is used forcreating a packet stream, as well as a traffic receiver that fetches the packets sent. Various types ofengines can be used including Linux based, real-time operating systems based and bare-metal basedsolutions. From these different types of engines, a few tools are chosen and investigated on differentproperties including performance and usability. It was found that Tshark (Linux, RT-Linux based),USPI (Raspberry Pi bare metal), FreeRTOS (Raspberry Pi based), Arduino and PKTgen (Linuxkernel based) were the most suitable approaches to be used for testing. The test parameters includetesting the gaps between packets, maximum jitter, average jitter and packets sent per second. Thesetests revealed that an IXIA solution was slightly more accurate when used as a receiving end sinceit produced less jitter, however this difference could only be noticed in a micro second range. Itwas also revealed that it produced slightly less jitter than the other packet generators, also here onlynoticeable in a microsecond range. Thus it can be concluded that IXIA is not much superior any ofthe close to hardware solutions. The executed network tests revealed that the Westermo developedlayer 2 protocol FRNT generated less network convergence time and less packet losses than thecommonly used RSTP protocol. Similar tests against the layer 3 protocols revealed that RIP wasmuch faster than OSPF and it also lost less packets. Finally it is concluded that there is no needto buy an expensive network testing suite to test the convergence time of a network. Instead, anetwork testing suite can be developed with minimal funding.
6
Possne, Jacob. „Network Convergence or Divergence? : A service perspective on the underlying requirements of future handsets“. Thesis, KTH, Kommunikationssystem, CoS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92182.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Network Convergence or Divergence, what is it, and which are the most likely developments? Today, a much talked about area of telecommunications is the move toward the IP Multimedia Subsystem (IMS), and with it the introduction of IP-based communication in both Public Land Mobile Networks and Public Switched Telephony Networks. This thesis attempts to show whether these two networks will converge with each other and with the Internet in the future - based upon the existence of a few important prerequisites in terms of standards and protocols, whilst divergence in the networks could result if technical and economical obstacles are difficult to circumvent or to exclude from future networks. The major drivers for convergence include the existence of standards for packet-based transmission over a wide variety of underlying networks, the existence of services that make use of these underlying networking protocols, and ultimately also the existence of devices that can use the new features of a converged network architecture. The focus is on the impact convergence services or offerings may have on handsets; specifically which protocols need to be supported, as well as those hardware and software requirements that need to be catered for to enable convergence in the handset sector. The thesis concludes with a summary of the most important factors for convergence in future mobile handsets. Nätkonvergens eller divergens, vad är det egentligen, och var är utvecklingen på väg? Idag talas det mycket om inom telekommunikationsbranchen om steget till IMS (IP Multimedia Subsystem), och i med det övergången till uteslutande IP-baserad kommunikation i både Public Land Mobile Networks och Public Switched Telephony Networks. Jag ämnar i den här framställningen visa att konvergens mellan dessa två nät samt ett tredje; Internet är avhängigt av ett par viktiga grundförutsättningar, som existensen av protokoll och standarder som främjar konvergens, medan en divergerande utveckling är resultatet av tekniska och ekonomiska förutsättningar som är svåra att kringgå i framtida nät. De stora drivkrafterna för konvergens är existensen av standarder och protokoll för paketbaserad överföring av data över skiftande nätarkitekturer, existensen av tjänster som stödjer dessa protokoll, och slutligen användarterminaler som förmår utnyttja dessa tjänster utvecklade för en konvergerande nättopologi. Fokus för min rapport är på det stöd som behövs i terminalerna för att en sådan här utveckling ska kunna äga rum. Kapaciteten i form av protokoll som dessa terminaler måste stödja, samt vilka hård- och mjukvarukrav som måste uppfyllas kommer också att behandlas. Slutligen kommer jag att framställa en sammanfattning av vad jag anser vara de viktigaste faktorerna i framtida terminaler för att driva den här utvecklingen.
7
Weir, Malcolm. „TECHNOLOGY CONVERGENCE: OBSERVATIONS ON TRANSITIONAL APPROACHES FOR DATA ACQUISITION IN A TCP/IP ENVIRONMENT“. International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604539.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada This paper discusses how IRIG 106 Chapter 10 recording techniques could be employed in a network-centric environment, while maintaining as many of the strengths of the traditional approach. In the course of that discussion, aspects of the published standard which would have to be disregarded or reinterpreted for a network-centric approach to be adopted are illustrated.
8
Terelius, Håkan, Guodong Shi, Jim Dowling, Amir Payberah, Ather Gattami und Karl Henrik Johansson. „Converging an Overlay Network to a Gradient Topology“. KTH, Reglerteknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-46515.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors containing higher utility values, such that paths of increasing utilities emerge in the network topology. The Gradient overlay network is built using gossiping and a preference function that samples from nodes using a uniform random peer sampling service. We analyze it using tools from matrix analysis, and we prove both the necessary and sufficient conditions for convergence to a complete gradient structure, as well as estimating the convergence time. Finally, we show in simulations the potential of the Gradient overlay, by building a more efficient live-streaming peer-to-peer (P2P) system than one built using uniform random peer sampling.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This thesis poses and solves a distribution free learning problem with consensus that arises in the study of estimation and control strategies for distributed sensor networks. Each node i for i = 1, . . . , n of the sensor network collects independent and identically distributed local measurements {z i} := {z i j}j∈N := {(x i j , yi j )}j∈N ⊆ X × Y := Z that are generated by the probability measure ρ i on Z. Each node i for i = 1, . . . , n of the network constructs a sequence of estimates {f i k }k∈N from its local measurements {z i} and from information functionals whose values are exchanged with other nodes as specified by the communication graph G for the network. The optimal estimate of the distribution free learning problem with consensus is cast as a saddle point problem which characterizes the consensus-constrained optimal estimate. This thesis introduces a two stage learning dynamic wherein local estimation is carried out via local least square approximations based on wavelet constructions and information exchange is associated with the Lagrange multipliers of the saddle point problem. Rates of convergence for the two stage learning dynamic are derived based on certain recent probabilistic bounds derived for wavelet approximation of regressor functions. Master of Science
10
Frank, Florian. „Hybrid analogue & digital access network architectures for the mobile/fixe infrastructure convergence“. Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00665650.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In order to realize the convergence of the optical infrastructure of fixed and mobile access networks, the objective of this thesis is to study the solutions for distributing native radio carriers through typical optical access networks.The first Part describes the contexts and the main physical properties of the optical and radio access networks: from nowadays deployed Fiber To The Home (FTTH) systems, and their expected evolutions, to the current radio system Universal Mobile Telecommunications System (UMTS) towards the expected requirements of modern mobile radio systems. This allows to settle the optical environment in which the Radio over Fiber(RoF)-functionalities will have to be integrated, and to know on which radio systems'figures of merits to focus on when implementing it. The second Part shows the benefit and possibilities of re-using the optical infrastructure of the fixed access networks for distributed radio systems. Then a review of the analog and digital RoF techniques is proposed, and their feasibility of integration into legacy FTTH systems is discussed. The third part deals with the computing and simulations of an analog RoF-system where the optical link is either passive or optically pre-amplified, and even boosted. The goal is to provide numerical results to the practical lab. results of the second half of the fourth part where the Signal to Noise Ratio (SNR) matters. Therefore successively formal expressions, numerical results for simple 2-tone signals and more realistic UMTS signals are considered. The fourth and last part deals with the obtained practical results. These can be split into two main categories : Error Vector Magnitude (EVM)-oriented results where an Avalanche Photo-Detector (APD) is used for legacy and extended-reach PON architectures using a direction shared Semiconductor Optical Amplifier (SOA) ; and an Adjacent/Alternate Channel power Leakage Ratio (ACLR)-driven part where the focus is seton a very critical figure of merit of radio systems, especially in the downlink. The latter part turned out to be mandatory and prevailing over the initially considered EVM concerns. Hence several RoF architectures, compatible with PONs, are introduced in order to overcome the non-linearities undergone by the RoF-signals, induced by the chromatic dispersion of the PON's fiber and the laser chirp, and degrading the ACLR performances
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7
Schneider, Nadja-Christina, und Bettina Gräf. Social dynamics 2.0: researching change in times of media convergence: Case studies from the Middle East and Asia. Berlin: Frank & Timme, 2011.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2
Vázquez, Enrique, Manuel Álvarez-Campana und Ana B. García. „Network Convergence over MPLS“. In Lecture Notes in Computer Science, 290–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25969-5_26.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3
Liu, Hong-tao, Dong Pei und Yu Wu. „A Novel Evolution Model of Collaboration Network Based on Scale-Free Network“. In Convergence and Hybrid Information Technology, 148–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32692-9_20.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4
Li, Shu, und Jeong Geun Kim. „Inter-session and Intra-session Network Coding for Wireless Sensor Networks“. In Convergence and Hybrid Information Technology, 33–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32645-5_5.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5
Yim, Hong-bin, Pyung-sun Park, Hee-seok Moon und Jae-il Jung. „An Efficient Sensor Network Architecture Using Open Platform in Vehicle Environment“. In Ubiquitous Convergence Technology, 232–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71789-8_24.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6
Lee, IlJin, OkJo Jeong und ShinGak Kang. „Study on Emergency Services for VoIP Based on IP Network vs. Domestic Emergency Network“. In Convergence and Hybrid Information Technology, 31–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24106-2_5.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7
Sembiring, Irwan, und Yonathan Satrio Nugroho. „Network Forensics Investigation for Botnet Attack“. In IT Convergence and Security 2017, 228–36. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-6454-8_29.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8
Long, Hao. „Packet Backhaul Network“. In Convergence of Mobile and Stationary Next-Generation Networks, 141–62. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2010. http://dx.doi.org/10.1002/9780470630976.ch5.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Konferenzberichte zum Thema "Network convergence":
1
Fonteijn, Chris. „Convergence: challenges in regulation“. In 2008 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2008. http://dx.doi.org/10.1109/netwks.2008.4763745.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2
Fonteijn, Chris. „Convergence: Challenges in regulation“. In 2008 13th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). IEEE, 2008. http://dx.doi.org/10.1109/netwks.2008.6231375.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3
Singh, Jatinder Pal, Tansu Alpcan, Xiaoqing Zhu und Piyush Agrawal. „Towards heterogeneous network convergence“. In the 2007 Workshop. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1376878.1376879.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4
Abdallah, Sarah, Ayman Kayssi, Imad H. Elhajj und Ali Chehab. „Network convergence in SDN versus OSPF networks“. In 2018 Fifth International Conference on Software Defined Systems (SDS). IEEE, 2018. http://dx.doi.org/10.1109/sds.2018.8370434.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5
Carpenter, P. „Fixed mobile convergence“. In IEE Colloquium on Shaping Tomorrow's Networks: Trends in Network Architectures for Delivering Present and Future Services. IEE, 1998. http://dx.doi.org/10.1049/ic:19980503.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6
Zhanbin, Li, Liu Feng und Wang Xiting. „Design of Multi-Network Convergence for Complex Networks“. In 2018 IEEE 9th International Conference on Software Engineering and Service Science (ICSESS). IEEE, 2018. http://dx.doi.org/10.1109/icsess.2018.8663949.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8
Iovanna, Paola, Stefano Stracca, Fabio Ubaldi, Fabio Cavaliere, Gemma Vall-llosera und Luis Miguel Contreras. „Network Convergence in 5G Transport“. In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2019. http://dx.doi.org/10.1364/ofc.2019.m1g.3.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10
Klimovich, M. „Network Genesis Of Technological Convergence“. In WELLSO 2017 - IV International Scientific Symposium Lifelong wellbeing in the World. Cognitive-Crcs, 2018. http://dx.doi.org/10.15405/epsbs.2018.04.27.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Berichte der Organisationen zum Thema "Network convergence":
1
Gharesifard, B., und J. Cortes. Distributed Convergence to Nash Equilibria in Two-Network Zero-Sum Games. Fort Belvoir, VA: Defense Technical Information Center, Februar 2013. http://dx.doi.org/10.21236/ada579430.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2
Eldridge, J. M. Voice and Data Network of Convergence and the Application of Voice over IP. Office of Scientific and Technical Information (OSTI), November 2000. http://dx.doi.org/10.2172/769028.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3
De Martini, Paul, und Jeffrey D. Taft. Value Creation Through Integrated Networks and Convergence. Office of Scientific and Technical Information (OSTI), Februar 2015. http://dx.doi.org/10.2172/1244820.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4
Miklaucic, Michael, und Jacqueline Brewer. Convergence: Illicit Networks and National Security in the Age of Globalization. Fort Belvoir, VA: Defense Technical Information Center, Januar 2013. http://dx.doi.org/10.21236/ada590461.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5
Patil, B., F. Xia, B. Sarikaya und S. Madanapalli. Transmission of IPv6 via the IPv6 Convergence Sublayer over IEEE 802.16 Networks. RFC Editor, Februar 2008. http://dx.doi.org/10.17487/rfc5121.
