Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Dynamic link networks“
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 "Dynamic link networks" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Dynamic link networks"
1
Latif, Atefeh, Alireza Hedayati und Vahe Aghazarian. „Improving Link Prediction in Dynamic Co-authorship Social Networks“. International Academic Journal of Science and Engineering 05, Nr. 01 (01.06.2018): 222–40. http://dx.doi.org/10.9756/iajse/v5i1/1810020.
Der volle Inhalt der Quelle
2
Choudhury, Nazim. „Community-Aware Evolution Similarity for Link Prediction in Dynamic Social Networks“. Mathematics 12, Nr. 2 (15.01.2024): 285. http://dx.doi.org/10.3390/math12020285.
Der volle Inhalt der QuelleAnnotation:
The link prediction problem is a time-evolving model in network science that has simultaneously abetted myriad applications and experienced extensive methodological improvement. Inferring the possibility of emerging links in dynamic social networks, also known as the dynamic link prediction task, is complex and challenging. In contrast to the link prediction in cross-sectional networks, dynamic link prediction methods need to cater to the actor-level temporal changes and associated evolutionary information regarding their micro- (i.e., link formation/deletion) and mesoscale (i.e., community formation) network structure. With the advent of abundant community detection algorithms, the research community has examined community-aware link prediction strategies in static networks. However, the same task in dynamic networks where, apart from the actors and links among them, their community pattern is also dynamic, is yet to be explored. Evolutionary community-aware information, including the associated link structure and temporal neighborhood changes, can effectively be mined to build dynamic similarity metrics for dynamic link prediction. This study aims to develop and integrate such dynamic features with machine learning algorithms for link prediction tasks in dynamic social networks. It also compares the performances of these features against well-known similarity metrics (i.e., ResourceAllocation) for static networks and a time series-based link prediction strategy in dynamic networks. These proposed features achieved high-performance scores, representing them as prospective candidates for both dynamic link prediction tasks and modeling the network growth.
3
Sun, Mengdi, und Minghu Tang. „A Review of Link Prediction Algorithms in Dynamic Networks“. Mathematics 13, Nr. 5 (28.02.2025): 807. https://doi.org/10.3390/math13050807.
Der volle Inhalt der QuelleAnnotation:
Dynamic network link prediction refers to the prediction of possible future links or the identification of missing links on the basis of historical information of dynamic networks. Link prediction aids people in exploring and analyzing complex change patterns in the real world and it could be applied in personalized recommendation systems, intelligence analysis, anomaly detection, and other fields. This paper aims to provide a comprehensive review of dynamic network link prediction. Firstly, dynamic networks are categorized into dynamic univariate networks and dynamic multivariate networks according to the changes in their sets. Furthermore, dynamic network link prediction algorithms are classified into regular sampling and irregular sampling by the method of network sampling. After summarizing and comparing the common datasets and evaluation indicators for dynamic network link prediction, we briefly review classic related algorithms in recent years, and classify them according to the network changes, sampling methods, underlying principles of algorithms, and other classification methods. Meanwhile, the basic ideas, advantages, and disadvantages of these algorithms are discussed in detail. The application fields and challenges in this area are also summarized. In the final summary of the paper, the future research directions such as link prediction in dynamic heterogeneous weighted networks and the security issues brought about by link prediction are discussed.
4
Sheng-Guo Wang, Sheng-Guo Wang, Yong-Gang Liu Sheng-Guo Wang und Tian-Wei Bai Yong-Gang Liu. „Dynamic Node Link Model of Hierarchical Edge Computing“. 電腦學刊 32, Nr. 5 (Oktober 2021): 222–32. http://dx.doi.org/10.53106/199115992021103205019.
Der volle Inhalt der QuelleAnnotation:
With the rise of the Internet of Things, edge computing has become one of the key technologies in Internet of Things solutions. In the context of the Industrial Internet of Things, hierarchical edge computing shows its advantages. This article focuses on hierarchical edge computing in the industrial Internet of Things scene, and studies the dynamic resource allocation of hierarchical edge computing networks. When using a hierarchical edge computing network with existing equipment, it is difficult to make changes to existing equipment. Therefore, this article uses queuing theory modeling analysis and proposes Dynamic Link Model based on Nodes Relation. Aiming at the hierarchical edge computing network, this model uses a method based on node connection relationship transfer to achieve load balancing of task flow and completes the dynamic allocation of computing resources in the network, and proposes a time experienced priority queue offloading strategy. The paper uses Java to achieve a dynamic link model experiment based on the connection relationship between nodes. The results show that this scheme has significant advantages in the global average delay of the system, and ensure the loss probability is reasonable within a certain limit.
5
Choudhury, Nazim, und Shahadat Uddin. „Evolutionary Features for Dynamic Link Prediction in Social Networks“. Applied Sciences 13, Nr. 5 (24.02.2023): 2913. http://dx.doi.org/10.3390/app13052913.
Der volle Inhalt der QuelleAnnotation:
One of the inherent characteristics of dynamic networks is the evolutionary nature of their constituents (i.e., actors and links). As a time-evolving model, the link prediction mechanism in dynamic networks can successfully capture the underlying growth mechanisms of social networks. Mining the temporal patterns of dynamic networks has led researchers to utilise dynamic information for dynamic link prediction. Despite several methodological improvements in dynamic link prediction, temporal variations of actor-level network structure and neighbourhood information have drawn little attention from the network science community. Evolutionary aspects of network positional changes and associated neighbourhoods, attributed to non-connected actor pairs, may suitably be used for predicting the possibility of their future associations. In this study, we attempted to build dynamic similarity metrics by considering temporal similarity and correlation between different actor-level evolutionary information of non-connected actor pairs. These metrics then worked as dynamic features in the supervised link prediction model, and performances were compared against static similarity metrics (e.g., AdamicAdar). Improved performance is achieved by the metrics considered in this study, representing them as prospective candidates for dynamic link prediction tasks and to help understand the underlying evolutionary mechanism.
6
Safdari, Hadiseh, Martina Contisciani und Caterina De Bacco. „Reciprocity, community detection, and link prediction in dynamic networks“. Journal of Physics: Complexity 3, Nr. 1 (28.02.2022): 015010. http://dx.doi.org/10.1088/2632-072x/ac52e6.
Der volle Inhalt der QuelleAnnotation:
Abstract Many complex systems change their structure over time, in these cases dynamic networks can provide a richer representation of such phenomena. As a consequence, many inference methods have been generalized to the dynamic case with the aim to model dynamic interactions. Particular interest has been devoted to extend the stochastic block model and its variant, to capture community structure as the network changes in time. While these models assume that edge formation depends only on the community memberships, recent work for static networks show the importance to include additional parameters capturing structural properties, as reciprocity for instance. Remarkably, these models are capable of generating more realistic network representations than those that only consider community membership. To this aim, we present a probabilistic generative model with hidden variables that integrates reciprocity and communities as structural information of networks that evolve in time. The model assumes a fundamental order in observing reciprocal data, that is an edge is observed, conditional on its reciprocated edge in the past. We deploy a Markovian approach to construct the network’s transition matrix between time steps and parameters’ inference is performed with an expectation-maximization algorithm that leads to high computational efficiency because it exploits the sparsity of the dataset. We test the performance of the model on synthetic dynamical networks, as well as on real networks of citations and email datasets. We show that our model captures the reciprocity of real networks better than standard models with only community structure, while performing well at link prediction tasks.
7
Li, Huikang, Yi Gao, Wei Dong und Chun Chen. „Preferential Link Tomography in Dynamic Networks“. IEEE/ACM Transactions on Networking 27, Nr. 5 (Oktober 2019): 1801–14. http://dx.doi.org/10.1109/tnet.2019.2931047.
Der volle Inhalt der Quelle
8
Song, Y. M., C. Zhang und Y. Q. Yu. „Neural Networks Based Active Vibration Control of Flexible Linkage Mechanisms“. Journal of Mechanical Design 123, Nr. 2 (01.05.2000): 266–71. http://dx.doi.org/10.1115/1.1348269.
Der volle Inhalt der QuelleAnnotation:
An investigation is presented into the neural networks based active vibration control of flexible linkage mechanisms. A smart mechanism featuring piezoceramic actuators and strain gauge sensors is designed. A nonlinear adaptive control strategy named Neural Networks based Direct Self-Tuning Control (NNBDSC) is employed to suppress the elastodynamic responses of the smart mechanism. To improve the initial robustness of the NNBDSC, the Dynamic Recurrent Neural Network (DRNN) controllers are designed off-line to approximate the inverse dynamics of the smart mechanism. Through on-line control, the strain crest of the flexible link is reduced 60 percent or so and the dynamic performance of the smart mechanism is improved significantly.
9
Kiss, Istvan Z., Luc Berthouze, Timothy J. Taylor und Péter L. Simon. „Modelling approaches for simple dynamic networks and applications to disease transmission models“. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 468, Nr. 2141 (18.01.2012): 1332–55. http://dx.doi.org/10.1098/rspa.2011.0349.
Der volle Inhalt der QuelleAnnotation:
In this paper a random link activation–deletion (RLAD) model is proposed that gives rise to a stochastically evolving network. This dynamic network is then coupled to a simple susceptible-infectious-suceptible ( SIS ) dynamics on the network, and the resulting spectrum of model behaviour is explored via simulation and a novel pairwise model for dynamic networks. First, the dynamic network model is systematically analysed by considering link-type independent and dependent network dynamics coupled with globally constrained link creation. This is done rigorously with some analytical results and we highlight where such analysis can be performed and how these simpler models provide a benchmark to test and validate full simulations. The pairwise model is used to study the interplay between SIS -type dynamics on the network and link-type-dependent activation–deletion. Assumptions of the pairwise model are identified and their implications interpreted in a way that complements our current understanding. Furthermore, we also discuss how the strong assumptions of the closure relations can lead to disagreement between the simulation and pairwise model. Unlike on a static network, the resulting spectrum of behaviour is more complex with the prevalence of infections exhibiting not only a single steady state, but also bistability and oscillations.
10
Chen, Lei, Jing Zhang und Li-Jun Cai. „Overlapping community detection based on link graph using distance dynamics“. International Journal of Modern Physics B 32, Nr. 03 (22.01.2018): 1850015. http://dx.doi.org/10.1142/s0217979218500157.
Der volle Inhalt der QuelleAnnotation:
The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.
Dissertationen zum Thema "Dynamic link networks"
1
Petersen, Erick. „Dynamic link networks : Emulation and validation“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAS028.
Der volle Inhalt der QuelleAnnotation:
À mesure que la demande de services interactifs, de multimédia et de capacités de réseau augmente dans les réseaux modernes, de nouveaux logiciels et/ou composants matériels devraient être intégrés. Par conséquent, le processus d'évaluation et de validation de ces nouvelles solutions est essentiel pour déterminer si elles sont performantes, fiables et robustes avant d'être déployées dans un réseau réel. L'émulation de réseau est de plus en plus utilisée pour répliquer le comportement de réseau réel à faible coût d'infrastructure et avec un niveau de réalisme plus élevé que les simulations. Cette approche permet de tester en continu la solution finale sans nécessiter de modifications après le déploiement. Cependant, l'émulation de réseaux avec des paramètres de liaison qui peuvent changer au fil du temps en raison de facteurs internes et externes, comme dans les communications par satellite, complique l'architecture d'émulation, faisant des tests exhaustifs dans diverses conditions une tâche difficile. De plus, s'assurer que l'émulateur est adéquat pour le contexte donné et qu'il est conçu correctement est crucial pour obtenir des résultats fiables. Cela inclut la vérification que l'émulateur peut répliquer avec précision les conditions et les scénarios spécifiques du réseau pour lesquels il est destiné. Dans cette thèse, nous abordons les défis de l'émulation et de la validation des réseaux à liens dynamiques. Nous proposons un modèle pour ce type de réseaux et leurs paramètres, en tenant compte des limitations dans la description et l'exécution du comportement dynamique. Nous avons développé une plateforme d'émulation qui intègre notre modèle proposé et permet de tester et d'évaluer différents scénarios de réseau dans un environnement contrôlé. Pour assurer une émulation correcte et combler l'écart entre l'émulation et les scénarios réels, la vérification de modèle et la vérification d'exécution ont été proposées. De plus, l'exécution de l'émulation a été vérifiée en extrayant un jeu de données de paramètres réseau et en vérifiant qu'il respecte certaines propriétés d'intérêt au fil du temps. Enfin, nous introduisons une nouvelle méthode utilisant le modèle d'automate cellulaire pour simuler avec précision l'évolution des paramètres du réseau en garantissant que certaines propriétés soient maintenues pendant cette évolution, de sorte qu'il est possible de les transférer rapidement vers une configuration d'émulation où les paramètres du réseau atteignent des valeurs critiquesAs the demand for interactive services, multimedia, and network capabilities grows in modern networks, novel software and/or hardware components should be incorporated. As a consequence, the assessment and validation process of these newly developed solutions is critical to determining whether they perform well, are reliable, and are robust before being deployed in a real network.Network emulation is increasingly used to replicate real-world network behavior at low infrastructure costs and with a higher level of realism than simulations. This approach allows for continuous testing of the final solution without requiring changes after deployment. However, emulating networks with link parameters that may change over time due to internal and external factors, as in satellite communications, complicates the emulation architecture, making thorough testing under various conditions a challenging task. Moreover, ensuring that the emulator is adequate for the given context and is designed correctly is crucial for obtaining reliable results. This includes verifying that the emulator can accurately replicate the specific network conditions and scenarios for which it is intended.In this thesis, we address the challenges of dynamic-link network emulation and validation. We propose a model for dynamic-link networks and their parameters, considering the limitations in describing and executing dynamic behavior. We have developed an emulation platform that incorporates our proposed model and allows to test and evaluate various network scenarios in a controlled environment. To ensure proper emulation and bridge the gap between emulation and real-world scenarios, both model checking and run-time verification have been proposed. Additionally, the emulation execution has been verified by extracting a dataset of network parameters and checking it respects certain properties of interest over time. Finally, we have introduced a novel method using the Cellular Automaton model to accurately simulate the evolution of network parameters while ensuring that certain properties are maintained throughout this evolution, thereby potentially fast transfer to an emulation configuration where network parameters reach critical values
2
Stapelberg, Dieter. „Link failure recovery among dynamic routes in telecommunication networks“. Thesis, Stellenbosch : University of Stellenbosch, 2009. http://hdl.handle.net/10019.1/2591.
Der volle Inhalt der QuelleAnnotation:
Thesis (MSc (Mathematical Sciences. Computer Science))--University of Stellenbosch, 2009.ENGLISH ABSTRACT: Since 2002 data tra c has overtaken voice tra c in volume [1]. Telecom / Network operators still generate most of their income carrying voice tra c. There is however a huge revenue potential in delivering reliable guaranteed data services. Network survivability and recovery from network failures are integral to network reliability. Due to the nature of the Internet, recovery from link failures needs to be distributed and dynamic in order to be scalable. Link failure recovery schemes are evaluated in terms of the survivability of the network, the optimal use of network resources, scalability, and the recovery time of such schemes. The need for recovery time to be improved is highlighted by real-time data tra c such as VoIP and video services carried over the Internet. The goal of this thesis is to examine existing link failure recovery schemes and evaluate the need for their extension, and to evaluate the performance of the proposed link failure recovery schemes. i
AFRIKAANSE OPSOMMING: Sedert 2002 het data verkeer die stem verkeer in volume verbygesteek [1]. Telekommunikasie / netwerk operateurs genereer egter steeds die meeste van hul inkomste met stem verkeer. Netwerk oorlewing en die herstel van netwerk mislukkings is integraal tot netwerk stabiliteit. Die samestelling van die Internet noodsaak dat die herstel van skakel mislukkings verspreid en dinamies van natuur moet wees. Die herstel-skema van skakel mislukkings word evalueer in terme van die oorleefbaarheid van die netwerk, die mees e ektiewe benutting van network bronne, aanpasbaarheid, en die herstel tydperk van die skema. Die vinnig moontlikste herstel tydperk word genoodsaak deur oombliklike data verkeer soos VoIP en beeld dienste wat oor die Internet gedra word. The doel van hierdie tesis is om bestaande skakel mislukking herstel skemas te evalueer, en dan verder ondersoek in te stel na hul uitbreiding. Daarna word die voorgestelde skakel mislukking skema se e ektiwiteit gemeet.
3
Zayani, Mohamed-Haykel. „Link prediction in dynamic and human-centered mobile wireless networks“. Phd thesis, Institut National des Télécommunications, 2012. http://tel.archives-ouvertes.fr/tel-00787564.
Der volle Inhalt der QuelleAnnotation:
During the last years, we have observed a progressive and continuous expansion of human-centered mobile wireless networks. The advent of these networks has encouraged the researchers to think about new solutions in order to ensure efficient evaluation and design of communication protocols. In fact, these networks are faced to several constraints as the lack of infrastructure, the dynamic topology, the limited resources and the deficient quality of service and security. We have been interested in the dynamicity of the network and in particular in human mobility. The human mobility has been widely studied in order to extract its intrinsic properties and to harness them to propose more accurate approaches. Among the prominent properties depicted in the literature, we have been specially attracted by the impact of the social interactions on the human mobility and consequently on the structure of the network. To grasp structural information of such networks, many metrics and techniques have been borrowed from the Social Network Analysis (SNA). The SNA can be seen as another network measurement task which extracts structural information of the network and provides useful feedback for communication protocols. In this context, the SNA has been extensively used to perform link prediction in social networks relying on their structural properties. Motivated by the importance of social ties in human-centered mobile wireless networks and by the possibilities that are brought by SNA to perform link prediction, we are interested by designing the first link prediction framework adapted for mobile wireless networks as Mobile Ad-hoc Networks (MANETs) and Delay/Disruption Tolerant Networks (DTN). Our proposal tracks the evolution of the network through a third-order tensor over T periods and computes the sociometric Katz measure for each pair of nodes to quantify the strength of the social ties between the network entities. Such quantification gives insights about the links that are expected to occur in the period T+1 and the new links that are created in the future without being observed during the tracking time. To attest the efficiency of our framework, we apply our link prediction technique on three real traces and we compare its performance to the ones of other well-known link prediction approaches. The results prove that our method reaches the highest level of accuracy and outperforms the other techniques. One of the major contributions behind our proposal highlights that the link prediction in such networks can be made in a distributed way. In other words, the nodes can predict their future links relying on the local information (one-hop and two-hop neighbors) instead of a full knowledge about the topology of the network. Furthermore, we are keen to improve the link prediction performance of our tensor-based framework. To quantify the social closeness between the users, we take into consideration two aspects of the relationships: the recentness of the interactions and their frequency. From this perspective, we wonder if we can consider a third criterion to improve the link prediction precision. Asserting the heuristic that stipulates that persistent links are highly predictable, we take into account the stability of the relationships (link and proximity stabilities). To measure it, we opt for the entropy estimation of a time series proposed in the Lempel-Ziv data compression algorithm. As we think that our framework measurements and the stability estimations complement each other, we combine them in order to provide new link prediction metrics. The simulation results emphasize the pertinence of our intuition. Providing a tensor-based link prediction framework and proposing relative enhancements tied to stability considerations represent the main contributions of this thesis. Along the thesis, our concern was also focused on mechanisms and metrics that contribute towards improving communication protocols in these mobile networks [...]
4
Zayani, Mohamed-Haykel. „Link prediction in dynamic and human-centered mobile wireless networks“. Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2012. http://www.theses.fr/2012TELE0031.
Der volle Inhalt der QuelleAnnotation:
Durant ces dernières années, nous avons observe une expansion progressive et continue des réseaux mobile sans-fil centres sur l’être humain. L’apparition de ces réseaux a encouragé les chercheurs à réfléchir à de nouvelles solutions pour assurer une évaluation efficace et une conception adéquate des protocoles de communication. En effet, ces réseaux sont sujets à de multiples contraintes telles que le manque d’infrastructure, la topologie dynamique, les ressources limitées ainsi que la qualité de service et la sécurité des informations précaires. Nous nous sommes spécialement intéressés à l’aspect dynamique du réseau et en particulier à la mobilité humaine. La mobilité humaine a été largement étudiée pour pouvoir extraire ses propriétés intrinsèques et les exploiter pour des approches plus adaptées à cette mobilité. Parmi les propriétés les plus intéressantes soulevées dans la littérature, nous nous sommes focalisés sur l’impact des interactions sociales entre les entités du réseau sur la mobilité humaine et en conséquence sur la structure du réseau. Pour recueillir des informations structurelles sur le réseau, plusieurs métriques et techniques ont été empruntées de l’analyse des réseaux sociaux (SNA). Cet outil peut être assimilé à une autre alternative pour mesurer des indicateurs de performance du réseau. Plus précisément, il extrait des informations structurelles du réseau et permet aux protocoles de communication de bénéficier d’indications utiles telles que la robustesse du réseau, les nœuds centraux ou encore les communautés émergentes. Dans ce contexte, la SNA a été largement utilisée pour prédire les liens dans les réseaux sociaux en se basant notamment sur les informations structurelles. Motivés par l’importance des liens sociaux dans les réseaux mobiles sans-fil centres sur l’être humain et par les possibilités offertes par la SNA pour prédire les liens, nous nous proposons de concevoir la première méthode capable de prédire les liens dans les réseaux sans-fil mobiles tels que les réseaux ad-hoc mobiles (MANETs) et les réseaux tolérants aux délais (DTNs). Notre proposition suit l’évolution de la topologie du réseau sur T périodes à travers un tenseur (en ensemble de matrices d’adjacence et chacune des matrices correspond aux contacts observés durant une période bien spécifique). Ensuite, elle s’appuie sur le calcul de la mesure sociométrique de Katz pour chaque paire de nœuds pour mesurer l’étendue des relations sociales entre les différentes entités du réseau. Une telle quantification donne un aperçu sur les liens dont l’occurrence est fortement pressentie à la période T+1 et les nouveaux liens qui se créent dans le futur sans pour autant avoir été observés durant le temps de suivi. Pour attester l’efficacité de notre proposition, nous l’appliquons sur trois traces réelles et nous comparons sa performance à celles d’autres techniques de prédiction de liens présentées dans la littérature. Les résultats prouvent que notre méthode est capable d’atteindre le meilleur niveau d’efficacité et sa performance surpasse celles des autres techniques. L’une des majeures contributions apportées par cette proposition met en exergue la possibilité de prédire les liens d’une manière décentralisée. En d’autres termes, les nœuds sont capables de prédire leurs propres liens dans le futur en se basant seulement sur la connaissance du voisinage immédiat (voisins à un et deux sauts). En outre, nous sommes désireux d’améliorer encore plus la performance de notre méthode de prédiction de liens. Pour quantifier la force des relations sociales entre les entités du réseau, nous considérons deux aspects dans les relations : la récence des interactions et leur fréquence. À partir de là, nous nous demandons s’il est possible de prendre en compte un troisième critère pour améliorer la précision des prédictions […]During the last years, we have observed a progressive and continuous expansion of human-centered mobile wireless networks. The advent of these networks has encouraged the researchers to think about new solutions in order to ensure efficient evaluation and design of communication protocols. In fact, these networks are faced to several constraints as the lack of infrastructure, the dynamic topology, the limited resources and the deficient quality of service and security. We have been interested in the dynamicity of the network and in particular in human mobility. The human mobility has been widely studied in order to extract its intrinsic properties and to harness them to propose more accurate approaches. Among the prominent properties depicted in the literature, we have been specially attracted by the impact of the social interactions on the human mobility and consequently on the structure of the network. To grasp structural information of such networks, many metrics and techniques have been borrowed from the Social Network Analysis (SNA). The SNA can be seen as another network measurement task which extracts structural information of the network and provides useful feedback for communication protocols. In this context, the SNA has been extensively used to perform link prediction in social networks relying on their structural properties. Motivated by the importance of social ties in human-centered mobile wireless networks and by the possibilities that are brought by SNA to perform link prediction, we are interested by designing the first link prediction framework adapted for mobile wireless networks as Mobile Ad-hoc Networks (MANETs) and Delay/Disruption Tolerant Networks (DTN). Our proposal tracks the evolution of the network through a third-order tensor over T periods and computes the sociometric Katz measure for each pair of nodes to quantify the strength of the social ties between the network entities. Such quantification gives insights about the links that are expected to occur in the period T+1 and the new links that are created in the future without being observed during the tracking time. To attest the efficiency of our framework, we apply our link prediction technique on three real traces and we compare its performance to the ones of other well-known link prediction approaches. The results prove that our method reaches the highest level of accuracy and outperforms the other techniques. One of the major contributions behind our proposal highlights that the link prediction in such networks can be made in a distributed way. In other words, the nodes can predict their future links relying on the local information (one-hop and two-hop neighbors) instead of a full knowledge about the topology of the network. Furthermore, we are keen to improve the link prediction performance of our tensor-based framework. To quantify the social closeness between the users, we take into consideration two aspects of the relationships: the recentness of the interactions and their frequency. From this perspective, we wonder if we can consider a third criterion to improve the link prediction precision. Asserting the heuristic that stipulates that persistent links are highly predictable, we take into account the stability of the relationships (link and proximity stabilities). To measure it, we opt for the entropy estimation of a time series proposed in the Lempel-Ziv data compression algorithm. As we think that our framework measurements and the stability estimations complement each other, we combine them in order to provide new link prediction metrics. The simulation results emphasize the pertinence of our intuition. Providing a tensor-based link prediction framework and proposing relative enhancements tied to stability considerations represent the main contributions of this thesis. Along the thesis, our concern was also focused on mechanisms and metrics that contribute towards improving communication protocols in these mobile networks […]
5
Hoang, Hai Nguyen. „A dynamic link speed mechanism for energy saving in interconnection networks“. Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284439.
Der volle Inhalt der QuelleAnnotation:
El crecimiento de la potencia de procesamiento de los sistemas de computación paralelos requiere redes de interconexión de mayor nivel de complejidad y un mayor rendimiento, por lo que consumen más energía. Mayor cantidad de energía consumida conduce a muchos problemas relacionados con los costos, la infraestructura y la estabilidad del sistema de refrigeración. Los enlaces de la red contribuyen en una proporción sustancial al consumo total de energía de dichas redes.
Varias propuestas se han ido acercando a una mejor administración de la energía de los enlaces. En esta tesis, aprovechamos ciertas características integradas en la tecnología actual de los enlaces para ajustar dinámicamente la velocidad de los mismos en función del tráfico. De esta manera, la red de interconexión consume menos energía cuando el tráfico es ligero. También proponemos una política de enrutamiento que tiene en cuenta la velocidad del enlace que favorece las conexiones de alta velocidad en el proceso de enrutamiento de paquetes para aumentar el rendimiento de la red cuando se despliega el mecanismo de ahorro de energía.
Los resultados de la evaluación muestran que las redes que usan el mecanismo de ahorro de energía aquí propuesto, reducen el consumo de energía a expensas de un aumento en el promedio de latencia de paquetes. Sin embargo, con la propuesta de política de enrutamiento que tiene en cuenta la velocidad del enlace, nuestro mecanismo incurre en un menor aumento en el promedio de la latencia de paquetes mientras se logra un ahorro de energía similar, en comparación con otros enfoques convencionales de la literatura.The growing processing power of parallel computing systems requires interconnection networks a higher level of complexity and higher performance, thus they consume more energy. A larger amount of energy consumed leads to many problems related to cost, cooling infrastructure and system stability. Link components contribute a substantial proportion of the total energy consumption of the networks. Several proposals have been approaching a better link power management. In this thesis, we leverage built-in features of current link technology to dynamically adjust the link speed as a function of traffic. By doing this, the interconnection network consumes less energy when traffic is light. We also propose a link speed aware routing policy that favors high-speed links in the process of routing packets to boost the performance of the network when the energy saving mechanism is deployed. The evaluation results show that the networks deploying our energy saving mechanism reduce the amount of energy consumption with the expense of an increase in the average packet latency. However, with the link speed aware routing policy proposal, our mechanism incurs a less increase in the average packet latency while achieving similar energy saving, compared with other conventional approaches in literature.
6
Choudhury, Nazim Ahmed. „Mining Time-aware Actor-level Evolution Similarity for Link Prediction in Dynamic Network“. Thesis, The University of Sydney, 2018. http://hdl.handle.net/2123/18640.
Der volle Inhalt der QuelleAnnotation:
Topological evolution over time in a dynamic network triggers both the addition and deletion of actors and the links among them. A dynamic network can be represented as a time series of network snapshots where each snapshot represents the state of the network over an interval of time (for example, a minute, hour or day). The duration of each snapshot denotes the temporal scale/sliding window of the dynamic network and all the links within the duration of the window are aggregated together irrespective of their order in time. The inherent trade-off in selecting the timescale in analysing dynamic networks is that choosing a short temporal window may lead to chaotic changes in network topology and measures (for example, the actors’ centrality measures and the average path length); however, choosing a long window may compromise the study and the investigation of network dynamics. Therefore, to facilitate the analysis and understand different patterns of actor-oriented evolutionary aspects, it is necessary to define an optimal window length (temporal duration) with which to sample a dynamic network. In addition to determining the optical temporal duration, another key task for understanding the dynamics of evolving networks is being able to predict the likelihood of future links among pairs of actors given the existing states of link structure at present time. This phenomenon is known as the link prediction problem in network science. Instead of considering a static state of a network where the associated topology does not change, dynamic link prediction attempts to predict emerging links by considering different types of historical/temporal information, for example the different types of temporal evolutions experienced by the actors in a dynamic network due to the topological evolution over time, known as actor dynamicities. Although there has been some success in developing various methodologies and metrics for the purpose of dynamic link prediction, mining actor-oriented evolutions to address this problem has received little attention from the research community. In addition to this, the existing methodologies were developed without considering the sampling window size of the dynamic network, even though the sampling duration has a large impact on mining the network dynamics of an evolutionary network. Therefore, although the principal focus of this thesis is link prediction in dynamic networks, the optimal sampling window determination was also considered.
7
Junuthula, Ruthwik Reddy. „Modeling, Evaluation and Analysis of Dynamic Networks for Social Network Analysis“. University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1544819215833249.
Der volle Inhalt der Quelle
8
Arastuie, Makan. „Generative Models of Link Formation and Community Detection in Continuous-Time Dynamic Networks“. University of Toledo / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1596718772873086.
Der volle Inhalt der Quelle
9
Tibhirt, Amel. „Mitigation of Cross-link Interference for MIMO TDD Dynamic Systems in 5G+ Networks“. Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS017.pdf.
Der volle Inhalt der QuelleAnnotation:
Le TDD dynamique joue un rôle crucial dans les réseaux 5G, adaptant les ressources aux besoins variés. Il améliore l'efficacité spectrale en allouant dynamiquement des créneaux horaires pour les transmissions montantes et descendantes en fonction de la demande de trafic et des conditions de canal. Cette allocation dynamique de fréquence assure une utilisation efficace du spectre et prend en charge une connectivité massive, une latence faible et les exigences de la qualité de service. Son rôle dans l'agrégation de porteuses maximise les débits de données et la capacité du réseau, soulignant son importance dans les technologies de communication sans fil avancées.Cependant, le TDD dynamique est confronté à un défi majeur : l'Interférence des liens croisés. Ce type d'interférence se produit lorsque les transmissions montantes et descendantes partagent les mêmes bandes de fréquences, provoquant des interférences.Cette interférence comprend l'interférence de Station de Base à Station de Base (BS-to-BS) ou du lien descendant au lien montant (DL-to-UL) ainsi que l'interférence d'Équipement Utilisateur à Équipement Utilisateur (UE-to-UE) ou du lien montant vers le lien descendant (UL- to-DL). Dans l'interférence DL-to-UL, les transmissions descendantes débordent dans les bandes des transmissions montantes, dégradant la communication montante. À l'inverse, l'interférence UL-to-DL se produit lorsque les transmissions montantes interfèrent avec la réception des transmissions descendantes.Gérer efficacement ces interférences est crucial pour la performance et la fiabilité d'un système TDD dynamique.Ce mémoire vise à libérer tout le potentiel du TDD dynamique en surmontant les défis posés par les interférences des liens croisés grâce à une analyse rigoureuse et des méthodologies innovantes. La recherche ne se contente pas de faire progresser la technologie TDD dynamique, elle pionnière des solutions applicables à divers contextes de communication, stimulant des stratégies innovantes d'alignement d'interférence dans des scénarios variés.Le mémoire se divise en plusieurs parties. La première pose les bases avec la définition du problème et les concepts théoriques essentiels. La deuxième partie examine les conditions de faisabilité de l'alignement des interférences. Ces conditions sont exprimées en fonction de la dimension du problème et établissent le degré de liberté (DoF) atteignable, représentant le nombre de flux de données possibles. Elle explore l'alignement d'interférence dans des scénarios centralisés, en considérant à la fois les canaux MIMO en rang complet et réduit, et aborde des complexités du monde réel. De plus, elle étend l'exploration à un scénario distribué, offrant une compréhension réaliste des complexités de la communication. La troisième partie se concentre sur les techniques d'optimisation, en particulier le beamforming. Elle introduit le Zero Forcing (ZF) beamforming pour les utilisateurs, alignant l'interférence dans les systèmes TDD dynamique. Elle met l'accent sur l'impact de l'interférence des liens croisés entre utilisateurs et présente les améliorations apportées par les algorithmes WMMSE. De plus, elle explore l'optimisation de l'allocation de puissance en utilisant l'algorithme Water-Filling, évaluant la performance du Zero Forcing Beamforming et de l'algorithme WMMSE en fonction de cette approche d'optimisation de puissanceDynamic Time Division Duplexing (DynTDD) is pivotal in 5th generation (5G) networks, adapting resources to diverse needs. It enhances Spectral Efficiency (SE) by dynamically allocating time slots for Uplink (UL) and Downlink (DL) transmissions based on traffic demand and channel conditions. This dynamic frequency allocation ensures efficient spectrum use and supports massive connectivity, low latency, and Quality-of-Service (QoS) requirements. Its role in carrier aggregation maximizes data rates and capacity, highlighting its importance in advanced wireless communication technologies.However, DynTDD faces a significant challenge: cross-link interference (CLI). CLI occurs when UL and DL transmissions share the same frequency bands, leading to interference.CLI comprises base station to base station (BS-to-BS) or downlink to uplink (DL-to-UL) interference and user equipment to user equipment (UE-to-UE) or uplink to downlink (UL-to-DL) interference. In DL-to-UL interference, DL transmissions spill into UL bands, degrading UL communication. Conversely, UL-to-DL interference occurs when UL transmissions interfere with DL reception.Effectively managing CLI is crucial for DynTDD's performance and reliability.This thesis aims to unleash the full potential of DynTDD by overcoming CLI challenges through rigorous analysis and innovative methodologies. The research not only advances DynTDD technology but also pioneers solutions applicable to various communication contexts, driving innovative interference alignment strategies across diverse scenarios.The study in this thesis is divided into multiple segments. The first part establishes the foundation with the problem definition and essential theoretical concepts. The second part delves into the conditions determining the feasibility of interference alignment. These conditions are expressed in terms of the problem dimension and establish the achievable Degree of Freedom (DoF), representing the number of data streams. It explores interference alignment in centralized scenarios, considering both full-rank and reduced-rank Multiple-Input Multiple-Output (MIMO) Interference Broadcast Multiple Access Channel-Interference Channel (IBMAC-IC), addressing real-world complexities. Additionally, it extends the exploration to a distributed scenario, providing a realistic understanding of communication complexities. The third part focuses on optimization techniques, specifically beamforming. It introduces Zero Forcing (ZF) beamforming for both DL and UL User Equipment (UE)s to align CLI in DynTDD systems. It emphasizes the impact of UE-to-UE interference and presents improvements brought by the Weighted Minimum Mean Square Error (WMMSE) algorithms. Furthermore, it explores power allocation optimization using the water-filling algorithm
10
Ahmad, Syed Amaar. „Autonomous Link-Adaptive Schemes for Heterogeneous Networks with Congestion Feedback“. Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/46725.
Der volle Inhalt der QuelleAnnotation:
LTE heterogeneous wireless networks promise significant increase in data rates and improved coverage through (i) the deployment of relays and cell densification, (ii) carrier aggregation to enhance bandwidth usage and (iii) by enabling nodes to have dual connectivity. These emerging cellular networks are complex and large systems which are difficult to optimize with centralized control and where mobiles need to balance spectral efficiency, power consumption and fairness constraints.
In this dissertation we focus on how decentralized and autonomous mobiles in multihop cellular systems can optimize their own local objectives by taking into account end-to-end or network-wide conditions. We propose several link-adaptive schemes where nodes can adjust their transmit power, aggregate carriers and select points of access to the network (relays and/or macrocell base stations) autonomously, based on both local and global conditions. Under our approach, this is achieved by disseminating the dynamic congestion level in the backhaul links of the points of access. As nodes adapt locally, the congestion levels in the backhaul links can change, which can in turn induce them to also change their adaptation objectives. We show that under our schemes, even with this dynamic congestion feedback, nodes can distributedly converge to a stable selection of transmit power levels and points of access. We also analytically derive the transmit power levels at the equilibrium points for certain cases. Moreover, through numerical results we show that the corresponding system throughput is significantly higher than when nodes adapt greedily following traditional link layer optimization objectives.
Given the growing data rate demand, increasing system complexity and the difficulty of implementing centralized cross-layer optimization frameworks, our work simplifies resource allocation in heterogeneous cellular systems. Our work can be extended to any multihop wireless system where the backhaul link capacity is limited and feedback on the dynamic congestion levels at the access points is available.Ph. D.
Bücher zum Thema "Dynamic link networks"
1
Pikelis, Winfred Prescott. Dynamic reconfiguration and link fault tolerance in a Transputer network. Monterey, Calif: Naval Postgraduate School, 1989.
Den vollen Inhalt der Quelle finden
2
Morles, E. Colina. On-line control of dynamic systems using feedforward neural networks. Sheffield: University of Sheffield, Dept. of Automatic Control and Systems Engineering, 1992.
Den vollen Inhalt der Quelle finden
3
Jorgensen, Charles C. Direct adaptive aircraft control using dynamic cell structure neural networks. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1997.
Den vollen Inhalt der Quelle finden
4
Heyde, Chris Oliver. Dynamic voltage security assessment for on-line control room application =: (Dynamische Spannungsstabilitätsrechnungen als online Entscheidungsgrundlage für die Leitwarte). Magdeburg: Otto-von-Guericke-Universität Magdeburg, 2010.
Den vollen Inhalt der Quelle finden
5
Flapan, Erica. Knots, molecules, and the universe: An introduction to topology. Providence, Rhode Island: American Mathematical Society, 2015.
Den vollen Inhalt der Quelle finden
6
Graen, George B. The “Missing Link” in Managerial Network Dynamics. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780195398793.013.0021.
Der volle Inhalt der Quelle
7
Hong, Yu. Making a Home-Base Strategy. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252040917.003.0005.
Der volle Inhalt der QuelleAnnotation:
This chapter traces the evolution of mobile communications as a site of China’s “home-base” industrial strategy and, after the 2008 global economic crisis, as part of intensified geopolitical struggle in the techno-economic realm. This chapter, first, historicizes telecom development through successive network generations, starting from fixed-line networks to second-generation and then third-generation mobile networks. As the business ecosystem includes network-equipment production, handset production, and content development and distribution, this chapter, then, explores market-specific trajectories, dynamics, and challenges so as to make sense of varying state actions and the obstacles they faced under the general 3G developmental framework. Lastly, to underscore the state’s diluted interventionist capacity, the coda explores how the 3G mobile communications development has affected state strategies and competitive structures in the 4G era.
8
Matthews, Joseph, und Carson Block. Library Information Systems. 2. Aufl. Libraries Unlimited, 2019. http://dx.doi.org/10.5040/9798400679124.
Der volle Inhalt der QuelleAnnotation:
Information systems are central to libraries, and managing information systems is critical to serving library communities. Both a textbook for LIS courses and a handbook for practitioners, this volume thoroughly addresses modern libraries' challenges of integrating information technology. Written by Joseph R. Matthews and Carson Block, both experts on library information systems, this book describes the evolution of library information systems, their enabling technologies, and today's dynamic IT marketplace. It explains specific technologies and related topics, including standards and standards organizations, telecommunications and networks, integrated library systems, electronic resource management systems, repositories, authentication and link verification, electronic resources, and nextgen library systems. Readers will also learn the latest about information systems management, covering technology planning, basic technology axioms, the impact of technology on library services, system selection and implementation, system usability, and general technology management. The final section considers current trends and future developments in LIS, including those related to mobile devices and apps as well as the growth of digital libraries.
9
Gabrielsen, Vincent, und Mario C. D. Paganini, Hrsg. Private Associations in the Ancient Greek World. Cambridge University Press, 2021. http://dx.doi.org/10.1017/9781108979344.
Der volle Inhalt der QuelleAnnotation:
Private associations abounded in the ancient Greek world and beyond, and this volume provides the first large-scale study of the strategies of governance which they employed. Emphasis is placed on the values fostered by the regulations of associations, the complexities of the private-public divide (and that divide's impact on polis institutions) and the dynamics of regional and global networks and group identity. The attested links between rules and religious sanctions also illuminate the relationship between legal history and religion. Moreover, possible links between ancient associations and the early Christian churches will prove particularly valuable for scholars of the New Testament. The book concludes by using the regulations of associations to explore a novel and revealing aspect of the interaction between the Mediterranean world, India and China.
10
Triggianese, Manuela, Olindo Caso und Yagiz Söylev, Hrsg. LIVING STATIONS: The Design of Metro Stations in the (east flank) metropolitan areas of Rotterdam. TU Delft Bouwkunde, 2021. http://dx.doi.org/10.47982/bookrxiv.3.
Der volle Inhalt der QuelleAnnotation:
Due to the growing demand for mobility (as a primary need for people to get to work, to obtain personal care or to go travelling), cities continue to be faced with new urban challenges. Stations represent, along mobility networks, not only transportation nodes (transfer points) but also architectural objects which connect an area to the city’s territorial plane and which have the potential to generate new urban dynamics. In the ‘compact city’ the station is simply no longer the space to access mobility networks, as informed by their dry pragmatism, but becomes an urban place of sociality and encounter - an extended public space beyond mobility itself. Which relationships and cross-fertilizations can be significant for the design of the future living stations in the Municipality of Rotterdam? How ought these stations to be conceived in order to act as public places for collective action? Which (archetypical) devices can be designed to give a shape to the ambitions for these stations? The station as a public space and catalyzer for urban interventions in the metropolitan area of Rotterdam is the focus of the research initiative presented in this publication. City of Innovations Project – Living Stations is organized around speculating and forecasting on future scenarios for the city of Rotterdam. ‘What is the future of Rotterdam with the arrival of a new metro circle line system?’ In the past fifty years, every decade of Rotterdam urban planning has seen its complementary metro strategy, with profound connections with the spatial planning and architectural themes. Considering the urban trends of densification and the new move to the city, a new complementary strategy is required. The plans to realize 50.000 new homes between the city center and the suburban residential districts in the next 20 years go together with the development of a new metro circle line consisting of 16 new stations; 6 of which will connect the new metro line to the existing network. Students of the elective City of Innovations Project (AR0109) have been asked to develop ambitious but plausible urban and architectural proposals for selected locations under the guidance of tutors from the Municipality of Rotterdam and Complex Projects. The Grand Paris Express metro project in France has inspired the course’s approach. Following the critical essays on the strategic role of the infrastructural project for city development interventions, the ‘10 Visions X 5 Locations’ chapter is a systematization of the work of 35 master’s students with input from designers of the City of Rotterdam and experts and academic from the University of Gustave Eiffel in Paris. The research-through-design process conducted in the City of Innovations project - Living Stations consists of documenting and analyzing the present urban conditions of selected station locations in the City of Rotterdam and proposing design solutions and visualizations of the predicted development of these locations.
Buchteile zum Thema "Dynamic link networks"
1
Pezaros, D. P., M. Sifalakis, S. Schmid und D. Hutchison. „Dynamic Link Measurements Using Active Components“. In Active Networks, 188–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-71500-9_14.
Der volle Inhalt der Quelle
2
Ran, Bin, und David Boyce. „Link Travel Time Functions for Dynamic Network Models“. In Modeling Dynamic Transportation Networks, 291–309. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-80230-0_13.
Der volle Inhalt der Quelle
3
Kong, Chao, Hao Li, Liping Zhang, Haibei Zhu und Tao Liu. „Link Prediction on Dynamic Heterogeneous Information Networks“. In Computational Data and Social Networks, 339–50. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34980-6_36.
Der volle Inhalt der Quelle
4
Hisano, Ryohei. „Semi-supervised Graph Embedding Approach to Dynamic Link Prediction“. In Complex Networks IX, 109–21. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73198-8_10.
Der volle Inhalt der Quelle
5
Choudhury, Nazim, und Shahadat Uddin. „Evolution Similarity for Dynamic Link Prediction in Longitudinal Networks“. In Complex Networks VIII, 109–18. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-54241-6_9.
Der volle Inhalt der Quelle
6
Rahman, Mahmudur, und Mohammad Al Hasan. „Link Prediction in Dynamic Networks Using Graphlet“. In Machine Learning and Knowledge Discovery in Databases, 394–409. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46128-1_25.
Der volle Inhalt der Quelle
7
Divakaran, Aswathy, und Anuraj Mohan. „A Network Embedding Approach for Link Prediction in Dynamic Networks“. In Communications in Computer and Information Science, 18–28. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-9700-8_2.
Der volle Inhalt der Quelle
8
Fish, Benjamin, und Rajmonda S. Caceres. „Handling Oversampling in Dynamic Networks Using Link Prediction“. In Machine Learning and Knowledge Discovery in Databases, 671–86. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23525-7_41.
Der volle Inhalt der Quelle
9
Nguyen, Viet-An, Cane Wing-Ki Leung und Ee-Peng Lim. „Modeling Link Formation Behaviors in Dynamic Social Networks“. In Social Computing, Behavioral-Cultural Modeling and Prediction, 349–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19656-0_48.
Der volle Inhalt der Quelle
10
Ngonmang, Blaise, Emmanuel Viennet, Maurice Tchuente und Vanessa Kamga. „Community Analysis and Link Prediction in Dynamic Social Networks“. In Computing in Research and Development in Africa, 83–101. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08239-4_5.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Dynamic link networks"
1
Zhu, Xiaobo, Yan Wu, Qinhu Zhang, Zhanheng Chen und Ying He. „Dynamic Link Prediction for New Nodes in Temporal Graph Networks“. In 2024 International Joint Conference on Neural Networks (IJCNN), 1–8. IEEE, 2024. http://dx.doi.org/10.1109/ijcnn60899.2024.10650904.
Der volle Inhalt der Quelle
2
Daurembekova, Ainur, und Hans D. Schotten. „Unified 3D Networks: Dynamic RAN Functions Placement and Link Challenges“. In 2024 International Symposium on Networks, Computers and Communications (ISNCC), 1–6. IEEE, 2024. http://dx.doi.org/10.1109/isncc62547.2024.10759056.
Der volle Inhalt der Quelle
3
Hou, Xiaojie, Peizhang Liu, Zhichun Sun, Chao Xi, Bo Yang und Ruijie Zhu. „Link State Aware Dynamic Service Function Chains Deployment in Satellite Optical Networks“. In 2024 Asia Communications and Photonics Conference (ACP) and International Conference on Information Photonics and Optical Communications (IPOC), 1–5. IEEE, 2024. https://doi.org/10.1109/acp/ipoc63121.2024.10809794.
Der volle Inhalt der Quelle
4
Yu, Wenchao, Wei Cheng, Charu C. Aggarwal, Haifeng Chen und Wei Wang. „Link Prediction with Spatial and Temporal Consistency in Dynamic Networks“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/467.
Der volle Inhalt der QuelleAnnotation:
Dynamic networks are ubiquitous. Link prediction in dynamic networks has attracted tremendous research interests. Many models have been developed to predict links that may emerge in the immediate future from the past evolution of the networks. There are two key factors: 1) a node is more likely to form a link in the near future with another node within its close proximity, rather than with a random node; 2) a dynamic network usually evolves smoothly. Existing approaches seldom unify these two factors to strive for the spatial and temporal consistency in a dynamic network. To address this limitation, in this paper, we propose a link prediction model with spatial and temporal consistency (LIST), to predict links in a sequence of networks over time. LIST characterizes the network dynamics as a function of time, which integrates the spatial topology of network at each timestamp and the temporal network evolution. Comparing to existing approaches, LIST has two advantages: 1) LIST uses a generic model to express the network structure as a function of time, which makes it also suitable for a wide variety of temporal network analysis problems beyond the focus of this paper; 2) by retaining the spatial and temporal consistency, LIST yields better prediction performance. Extensive experiments on four real datasets demonstrate the effectiveness of the LIST model.
5
Li, Huikang, Yi Gao, Wei Dong und Chun Chen. „Preferential link tomography in dynamic networks“. In 2017 IEEE 25th International Conference on Network Protocols (ICNP). IEEE, 2017. http://dx.doi.org/10.1109/icnp.2017.8117552.
Der volle Inhalt der Quelle
6
Lindstrom, M., und J. Zander. „Dynamic link asymmetry in 'bunched' wireless networks“. In Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324). IEEE, 1999. http://dx.doi.org/10.1109/vetecf.1999.797155.
Der volle Inhalt der Quelle
7
Aggarwal, Cham, Yan Xie und Philip S. Yu. „On Dynamic Link Inference in Heterogeneous Networks“. In Proceedings of the 2012 SIAM International Conference on Data Mining. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611972825.36.
Der volle Inhalt der Quelle
8
Li, Jundong, Kewei Cheng, Liang Wu und Huan Liu. „Streaming Link Prediction on Dynamic Attributed Networks“. In WSDM 2018: The Eleventh ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3159652.3159674.
Der volle Inhalt der Quelle
9
Yang, Cheng, Chunchen Wang, Yuanfu Lu, Xumeng Gong, Chuan Shi, Wei Wang und Xu Zhang. „Few-shot Link Prediction in Dynamic Networks“. In WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3488560.3498417.
Der volle Inhalt der Quelle
10
Arun Kumar, S. P., und Mukul Golash. „Efficient flow-aware dynamic link load balancing“. In 2009 First International Communication Systems and Networks and Workshops (COMSNETS). IEEE, 2009. http://dx.doi.org/10.1109/comsnets.2009.4808841.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Dynamic link networks"
1
Neiderer, Andrew M. Dynamically Generated Nodes and Links for a Dynamic Network Structure Using X3D. Fort Belvoir, VA: Defense Technical Information Center, Mai 2009. http://dx.doi.org/10.21236/ada501121.
Der volle Inhalt der Quelle
2
Chen, Yongzhou, Ammar Tahir und Radhika Mittal. Controlling Congestion via In-Network Content Adaptation. Illinois Center for Transportation, September 2022. http://dx.doi.org/10.36501/0197-9191/22-018.
Der volle Inhalt der QuelleAnnotation:
Realizing that it is inherently difficult to match precisely the sending rates at the endhost with the available capacity on dynamic cellular links, we built a system, Octopus, that sends real-time data streams over cellular networks using an imprecise controller (that errs on the side of overestimating network capacity) and then drops appropriate packets in the cellular-network buffers to match the actual capacity. We designed parameterized primitives for implementing the packet-dropping logic, which the applications at the endhost can configure differently to express various content-adaptation policies. Octopus transport encodes the app-specified parameters in packet header fields, which the routers can parse to execute the desired dropping behavior. Our evaluation shows how real-time applications involving standard and volumetric videos can be designed to exploit Octopus for various requirements and achieve a performance that is 1.5 to 18 times better than state-of-the-art schemes.
3
Droogan, Julian, Lise Waldek, Brian Ballsun-Stanton und Jade Hutchinson. Mapping a Social Media Ecosystem: Outlinking on Gab & Twitter Amongst the Australian Far-right Milieu. RESOLVE Network, September 2022. http://dx.doi.org/10.37805/remve2022.6.
Der volle Inhalt der QuelleAnnotation:
Attention to the internet and the online spaces in which violent extremists interact and spread content has increased over the past decades. More recently, that attention has shifted from understanding how groups like the self-proclaimed Islamic State use the internet to spread propaganda to understanding the broader internet environment and, specifically, far-right violent extremist activities within it. This focus on how far right violent extremist—including far-right racially and ethnically motivated violent extremists (REMVEs) within them—create, use, and exploit the online networks in which they exist to promote their hateful ideology and reach has largely focused on North America and Europe. However, in recent years, examinations of those online dynamics elsewhere, including in Australia, is increasing. Far right movements have been active in Australia for decades. While these movements are not necessarily extremist nor violent, understanding how violent far right extremists and REMVEs interact within or seek to exploit these broader communities is important in further understanding the tactics, reach, and impact of REMVEs in Australia. This is particularly important in the online space access to broader networks of individuals and ideas is increasingly expanding. Adding to a steadily expanding body of knowledge examining online activities and networks of both broader far right as well as violent extremist far right populations in Australia, this paper presents a data-driven examination of the online ecosystems in which identified Australian far-right violent extremists exist and interact,1 as mapped by user generated uniform resource locators (URL), or ‘links’, to internet locations gathered from two online social platforms—Twitter and Gab. This link-based analysis has been used in previous studies of online extremism to map the platforms and content shared in online spaces and provide further detail on the online ecosystems in which extremists interact. Data incorporating the links was automatically collected from Twitter and Gab posts from users existing within the online milieu in which those identified far right extremists were connected. The data was collected over three discrete one-month periods spanning 2019, the year in which an Australian far right violent extremist carried out the Christchurch attack. Networks of links expanding out from the Twitter and Gab accounts were mapped in two ways to explore the extent and nature of the online ecosystems in which these identified far right Australian violent extremists are connected, including: To map the extent and nature of these ecosystems (e.g., the extent to which other online platforms are used and connected to one another), the project mapped where the most highly engaged links connect out to (i.e., website domain names), and To explore the nature of content being spread within those ecosystems, what sorts of content is found at the end of the most highly engaged links. The most highly engaged hashtags from across this time are also presented for additional thematic analysis. The mapping of links illustrated the interconnectedness of a social media ecosystem consisting of multiple platforms that were identified as having different purposes and functions. Importantly, no links to explicitly violent or illegal activity were identified among the top-most highly engaged sites. The paper discusses the implications of the findings in light of this for future policy, practice, and research focused on understanding the online ecosystems in which identified REMVE actors are connected and the types of thematic content shared and additional implications in light of the types of non-violent content shared within them.
4
Engel, Bernard, Yael Edan, James Simon, Hanoch Pasternak und Shimon Edelman. Neural Networks for Quality Sorting of Agricultural Produce. United States Department of Agriculture, Juli 1996. http://dx.doi.org/10.32747/1996.7613033.bard.
Der volle Inhalt der QuelleAnnotation:
The objectives of this project were to develop procedures and models, based on neural networks, for quality sorting of agricultural produce. Two research teams, one in Purdue University and the other in Israel, coordinated their research efforts on different aspects of each objective utilizing both melons and tomatoes as case studies. At Purdue: An expert system was developed to measure variances in human grading. Data were acquired from eight sensors: vision, two firmness sensors (destructive and nondestructive), chlorophyll from fluorescence, color sensor, electronic sniffer for odor detection, refractometer and a scale (mass). Data were analyzed and provided input for five classification models. Chlorophyll from fluorescence was found to give the best estimation for ripeness stage while the combination of machine vision and firmness from impact performed best for quality sorting. A new algorithm was developed to estimate and minimize training size for supervised classification. A new criteria was established to choose a training set such that a recurrent auto-associative memory neural network is stabilized. Moreover, this method provides for rapid and accurate updating of the classifier over growing seasons, production environments and cultivars. Different classification approaches (parametric and non-parametric) for grading were examined. Statistical methods were found to be as accurate as neural networks in grading. Classification models by voting did not enhance the classification significantly. A hybrid model that incorporated heuristic rules and either a numerical classifier or neural network was found to be superior in classification accuracy with half the required processing of solely the numerical classifier or neural network. In Israel: A multi-sensing approach utilizing non-destructive sensors was developed. Shape, color, stem identification, surface defects and bruises were measured using a color image processing system. Flavor parameters (sugar, acidity, volatiles) and ripeness were measured using a near-infrared system and an electronic sniffer. Mechanical properties were measured using three sensors: drop impact, resonance frequency and cyclic deformation. Classification algorithms for quality sorting of fruit based on multi-sensory data were developed and implemented. The algorithms included a dynamic artificial neural network, a back propagation neural network and multiple linear regression. Results indicated that classification based on multiple sensors may be applied in real-time sorting and can improve overall classification. Advanced image processing algorithms were developed for shape determination, bruise and stem identification and general color and color homogeneity. An unsupervised method was developed to extract necessary vision features. The primary advantage of the algorithms developed is their ability to learn to determine the visual quality of almost any fruit or vegetable with no need for specific modification and no a-priori knowledge. Moreover, since there is no assumption as to the type of blemish to be characterized, the algorithm is capable of distinguishing between stems and bruises. This enables sorting of fruit without knowing the fruits' orientation. A new algorithm for on-line clustering of data was developed. The algorithm's adaptability is designed to overcome some of the difficulties encountered when incrementally clustering sparse data and preserves information even with memory constraints. Large quantities of data (many images) of high dimensionality (due to multiple sensors) and new information arriving incrementally (a function of the temporal dynamics of any natural process) can now be processed. Furhermore, since the learning is done on-line, it can be implemented in real-time. The methodology developed was tested to determine external quality of tomatoes based on visual information. An improved model for color sorting which is stable and does not require recalibration for each season was developed for color determination. Excellent classification results were obtained for both color and firmness classification. Results indicted that maturity classification can be obtained using a drop-impact and a vision sensor in order to predict the storability and marketing of harvested fruits. In conclusion: We have been able to define quantitatively the critical parameters in the quality sorting and grading of both fresh market cantaloupes and tomatoes. We have been able to accomplish this using nondestructive measurements and in a manner consistent with expert human grading and in accordance with market acceptance. This research constructed and used large databases of both commodities, for comparative evaluation and optimization of expert system, statistical and/or neural network models. The models developed in this research were successfully tested, and should be applicable to a wide range of other fruits and vegetables. These findings are valuable for the development of on-line grading and sorting of agricultural produce through the incorporation of multiple measurement inputs that rapidly define quality in an automated manner, and in a manner consistent with the human graders and inspectors.
5
Lai, Chin-Ta, und Joel Conte. Dynamic Modeling of the UC San Diego NHERI Six-Degree-of-Freedom Large High-Performance Outdoor Shake Table. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, August 2024. http://dx.doi.org/10.55461/jsds5228.
Der volle Inhalt der QuelleAnnotation:
The UC San Diego Large High-Performance Outdoor Shake Table (LHPOST), which was commissioned on October 1, 2004 as a shared-use experimental facility of the National Science Foundation (NSF) Network for Earthquake Engineering Simulation (NEES) program, was upgraded from its original one degree-of-freedom (LHPOST) to a six degree-of-freedom configuration (LHPOST6) between October 2019 and April 2022. The LHPOST6 is a shared-use experimental facility of the NSF Natural Hazard Engineering Research Infrastructure (NHERI) program. A mechanics-based numerical model of the LHPOST6 able to capture the dynamics of the upgraded 6-DOF shake table system under bare table condition is presented in this report. The model includes: (i) a rigid body kinematic model that relates the platen motion to the motions of components attached to the platen, (ii) a hydraulic dynamic model that calculates the hydraulic actuator forces based on all fourth-stage servovalve spool positions, (iii) a hold-down strut model that determines the pull-down forces produced by the three hold-down struts, (iv) a 2-D and various 1-D Bouc-Wen models utilized to represent the dissipative forces in the shake table system, and (v) a 6-DOF rigid body dynamic model governing the translational and rotational motions of the platen subjected to the forces from the various components attached to the platen. In this report, the rigid body dynamics is studied utilizing the platen twist (combination of platen translational and rotational velocities) and wrench (combination of force and moment resultants acting on the platen) following principles from the robotic analysis literature. The numerical model of the LHPOST6 is validated extensively using experimental data from the acceptance tests performed following the shake table upgrade, and the model predictions of the shake table system response are found to be consistently in very good agreement with the experimental results for tri-axial and six-axial earthquake shake table tests. The validated mechanics-based numerical model of the LHPOST6 presented in this study can be coupled with finite element models of shake table test specimens installed on the rigid platen to study the dynamic interaction between the shake table system and the specimens. Another important potential use of the model is to improve the motion tracking performance of the LHPOST6 through either off-line tuning of the shake table controller and/or development of more advanced shake table controllers.
6
She, Ruifeng, und Yanfeng Ouyang. Generalized Link-Cost Function and Network Design for Dedicated Truck-Platoon Lanes to Improve Energy, Pavement Sustainability, and Traffic Efficiency. Illinois Center for Transportation, November 2021. http://dx.doi.org/10.36501/0197-9191/21-037.
Der volle Inhalt der QuelleAnnotation:
Recent development of autonomous and connected trucks (ACT) has provided the freight industry with the option of using truck platooning to improve fuel efficiency, traffic throughput, and safety. However, closely spaced and longitudinally aligned trucks impose frequent and concentrated loading on pavements, which often accelerates pavement deterioration and increases the life cycle costs for the highway agency. Also, effectiveness of truck platooning can be maximized only in dedicated lanes; and its benefits and costs need to be properly balanced between stakeholders. This paper proposes a network-design model to optimize (i) placement of dedicated truck-platoon lanes and toll price in a highway network, (ii) pooling and routing of ACT traffic from multiple origins and destinations to utilize these lanes, and (iii) configuration of truck platoons within these lanes (e.g., lateral displacements and vehicle separations). The problem is formulated as an integrated bi-level optimization model. The upper level makes decisions on converting existing highway lanes into dedicated platoon lanes, as well as setting user fees. The lower-level decisions are made by independent shippers regarding the choice of routes and use of platoon lanes vs. regular lanes; and they collectively determine truck traffic in all lanes. Link-cost functions for platoon lanes are obtained by simultaneously optimizing, through dynamic programming, pavement-rehabilitation activities and platoon configuration in the pavement's life cycle. A numerical case study is used to demonstrate the applicability and performance of the proposed model framework over the Illinois freeway system. It is shown that the freight traffic is effectively channelized on a few corridors of platoon lanes and, by setting proper user fees to cover pavement-rehabilitation costs, systemwide improvements for both freight shippers and highway agencies can be achieved.
7
Koechlin, Valerie, und Gianmarco León. International Remittances and Income Inequality: An Empirical Investigation. Inter-American Development Bank, Oktober 2006. http://dx.doi.org/10.18235/0010865.
Der volle Inhalt der QuelleAnnotation:
The aim of this paper is to provide comprehensive empirical evidence on the relationship between international remittances and income inequality. In simple cross-country regressions we find a non-monotonic link between these two variables when using ordinary least squares, instrumental variables; we also test our hypothesis using dynamic panel data methods. We provide evidence in support of existing theoretical work that accounts for network effects that describe how, in the first stages of migration history, there is an inequality-increasing effect of remittances on income inequality. Then, as the opportunity cost of migrating is lowered due to these effects, remittances sent to those households have a negative impact on inequality. We also show how education and the development of the financial sector can help countries to reach the inequality-decreasing section of the curve more quickly. Our results are robust to several empirical specifications, as well as for a wide variety of inequality measures.
8
Pinson, Lauren. Addressing the Linkages Between Illicit Arms, Organized Crime and Armed Conflict. UNIDIR, September 2022. http://dx.doi.org/10.37559/caap/22/pacav/10.
Der volle Inhalt der QuelleAnnotation:
Illicit arms and ammunition link conflict to crime as well as crime to conflict. Illicit arms can both enable and fuel an armed conflict, while different conflict phases provide opportunities for the diversion of arms and a potentially lucrative income source for organized arms trafficking networks. To date, there has been limited research examining the linkages between all three of these security challenges. In response to this knowledge gap, this issue brief – produced in collaboration with the United Nations Office on Drugs and Crime (UNODC) – explores the multiple connections between illicit arms, organized crime and armed conflict in relation to (1) the source of illicit arms supply, (2) the process of illicit arms acquisition, and (3) shifts in the dynamics of armed conflict and organized crime. It also provides key considerations to help inform responses to address these interrelated challenges by integrating conventional arms control measures, conflict prevention strategies, and criminal justice responses.
9
Schmidt, Elizabeth. Shoreline change at Fort Matanzas National Monument: 2020–2021 data summary. National Park Service, Januar 2022. http://dx.doi.org/10.36967/nrds-2290193.
Der volle Inhalt der QuelleAnnotation:
In 2020 and 2021 the Southeast Coast Network (SECN) collected shoreline data at Fort Matanzas National Monument as a part of the NPS Vital Signs Monitoring Program. Monitoring was conducted following methods developed by the National Park Service Northeast Barrier Coast Network and consisted of mapping the high tide swash line using a global positioning system (GPS) unit in the spring of each year (Psuty et al. 2010). Shoreline change was calculated using the Digital Shoreline Analysis System (DSAS) developed by USGS (Theiler et al. 2008). Key findings from this effort: A mean of 2,255.23 meters (7,399 feet [ft]) of shoreline were mapped from 2020 to 2021 with a mean horizontal precision of 10.73 centimeters (4.2 inches [in]) at Fort Matanzas National Monument from 2020 to 2021. In the annual shoreline change analysis, the mean shoreline distance change from spring 2020 to spring 2021 was -7.40 meters (-24.3 ft) with a standard deviation of 20.24 meters (66.40 ft). The shoreline change distance ranged from -124.73 to 35.59 meters (-409.1 to 116.7 ft). Two erosion areas and one accretion area were identified in the study area beyond the uncertainty of the data (± 10 meters [32.8 ft]). The annual shoreline change from 2020 to 2021 showed erosion on the east and west sides of A1A where the Matanzas Inlet is located. Overall, the most dynamic area of shoreline change within Fort Matanzas National Monument appeared to be on the east and west side of A1A, along the Matanzas River inlet.
10
Walmsley, Terrie, Angel Aguiar und Badri Narayanan. Introduction to the Global Trade Analysis Project and the GTAP Data Base. GTAP Working Paper, Mai 2012. http://dx.doi.org/10.21642/gtap.wp67.
Der volle Inhalt der QuelleAnnotation:
The Global Trade Analysis Project (GTAP) is a global network of researchers and policy makers conducting quantitative analysis of international policy issues. The motivation and ultimate success of the Project stems from the fact that collaboration is essential for detailed analysis of the global economy. The importance of collaboration to improve the quality of policy analysis world-wide is most clearly seen in the development of the GTAP Data Base. The GTAP Data Base is the centerpiece of the Global Trade Analysis Project. It records the annual flows of goods and services for the entire world economy in the benchmark year(s). It consists of bilateral trade, transport, and protection matrices that link individual country/regional economic data bases. The production of the GTAP Data Base relies on the valuable contributions of many individuals and organizations throughout the world. Individuals contribute the best available input-output table for their country, while other experts contribute the macro, trade, protection and other data required. The Center for Global Trade Analysis, the home of GTAP, then brings these contributions together into one useable, globally consistent, database. The result is a fully documented , publicly available and regularly updated global database. This year (2012), the eighth version of the GTAP Data Base was released, covering 129 countries, 57 sectors, 5 factors and two base years (2004 and 2007). The GTAP Data Base is utilized in a suite of comparative static and dynamic computable general equilibrium models and underlies most contemporary economic analysis of global policy issues related to trade, energy and the environment.