CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: bipartite networks</title> <meta name="description" content="Search results for: bipartite networks"> <meta name="keywords" content="bipartite networks"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="bipartite networks" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="bipartite networks"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 2820</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bipartite networks</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2820</span> Comparing Community Detection Algorithms in Bipartite Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehsan%20Khademi">Ehsan Khademi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Jalili"> Mahdi Jalili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Despite the special features of bipartite networks, they are common in many systems. Real-world bipartite networks may show community structure, similar to what one can find in one-mode networks. However, the interpretation of the community structure in bipartite networks is different as compared to one-mode networks. In this manuscript, we compare a number of available methods that are frequently used to discover community structure of bipartite networks. These networks are categorized into two broad classes. One class is the methods that, first, transfer the network into a one-mode network, and then apply community detection algorithms. The other class is the algorithms that have been developed specifically for bipartite networks. These algorithms are applied on a model network with prescribed community structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=community%20detection" title="community detection">community detection</a>, <a href="https://publications.waset.org/abstracts/search?q=bipartite%20networks" title=" bipartite networks"> bipartite networks</a>, <a href="https://publications.waset.org/abstracts/search?q=co-clustering" title=" co-clustering"> co-clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=modularity" title=" modularity"> modularity</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20projection" title=" network projection"> network projection</a>, <a href="https://publications.waset.org/abstracts/search?q=complex%20networks" title=" complex networks"> complex networks</a> </p> <a href="https://publications.waset.org/abstracts/14451/comparing-community-detection-algorithms-in-bipartite-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14451.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">625</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2819</span> Literature Review and Biomechanical Findings in Patients with Bipartite Medial Cuneiforms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aliza%20Lee">Aliza Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20Wilt"> Mark Wilt</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Bonk"> John Bonk</a>, <a href="https://publications.waset.org/abstracts/search?q=Scott%20Floyd"> Scott Floyd</a>, <a href="https://publications.waset.org/abstracts/search?q=Bradley%20Hoffman"> Bradley Hoffman</a>, <a href="https://publications.waset.org/abstracts/search?q=Karen%20Uchmanowicz"> Karen Uchmanowicz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bipartite medial cuneiforms are relatively rare but may play a significant role in biomechanical and gait abnormalities. It is believed that a bipartite medial cuneiform may alter the available range of motion due to its larger morphological variant, thus limiting the metatarsal plantarflexion needed to achieve adequate hallux dorsiflexion for normal gait. Radiographic and clinical assessments were performed on 2 patients who reported foot pain along the first ray. Both patients had visible bipartite medial cuneiforms on MRI. Using gait plate and Metascan™ analysis, both were noted to have four measurements far beyond the expected range. Medial and lateral heel peak pressure, hallux peak pressure, and 1st metatarsal peak pressure were all noted to be increased. These measurements are believed to be increased due to the hindrance placed on the available ROM of the 1st ray by the increased size of the medial cuneiform. A larger patient population would be needed to fully understand this developmental anomaly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20medial%20cuneiforms" title="bipartite medial cuneiforms">bipartite medial cuneiforms</a>, <a href="https://publications.waset.org/abstracts/search?q=cuneiform" title=" cuneiform"> cuneiform</a>, <a href="https://publications.waset.org/abstracts/search?q=developmental%20anomaly" title=" developmental anomaly"> developmental anomaly</a>, <a href="https://publications.waset.org/abstracts/search?q=gait%20abnormality" title=" gait abnormality"> gait abnormality</a> </p> <a href="https://publications.waset.org/abstracts/136991/literature-review-and-biomechanical-findings-in-patients-with-bipartite-medial-cuneiforms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136991.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">156</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2818</span> Maximizing Coverage with Mobile Crime Cameras in a Stochastic Spatiotemporal Bipartite Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%28Ted%29%20Edward%20Holmberg">(Ted) Edward Holmberg</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Abdelguerfi"> Mahdi Abdelguerfi</a>, <a href="https://publications.waset.org/abstracts/search?q=Elias%20Ioup"> Elias Ioup</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research details a coverage measure for evaluating the effectiveness of observer node placements in a spatial bipartite network. This coverage measure can be used to optimize the configuration of stationary or mobile spatially oriented observer nodes, or a hybrid of the two, over time in order to fully utilize their capabilities. To demonstrate the practical application of this approach, we construct a SpatioTemporal Bipartite Network (STBN) using real-time crime center (RTCC) camera nodes and NOPD calls for service (CFS) event nodes from New Orleans, La (NOLA). We use the coverage measure to identify optimal placements for moving mobile RTCC camera vans to improve coverage of vulnerable areas based on temporal patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coverage%20measure" title="coverage measure">coverage measure</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20node%20dynamics" title=" mobile node dynamics"> mobile node dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo%20simulation" title=" Monte Carlo simulation"> Monte Carlo simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=observer%20nodes" title=" observer nodes"> observer nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=observable%20nodes" title=" observable nodes"> observable nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=spatiotemporal%20bipartite%20knowledge%20graph" title=" spatiotemporal bipartite knowledge graph"> spatiotemporal bipartite knowledge graph</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20spatial%20analysis" title=" temporal spatial analysis"> temporal spatial analysis</a> </p> <a href="https://publications.waset.org/abstracts/161229/maximizing-coverage-with-mobile-crime-cameras-in-a-stochastic-spatiotemporal-bipartite-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161229.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">114</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2817</span> Detecting Port Maritime Communities in Spain with Complex Network Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nicanor%20Garcia%20Alvarez">Nicanor Garcia Alvarez</a>, <a href="https://publications.waset.org/abstracts/search?q=Belarmino%20Adenso-Diaz"> Belarmino Adenso-Diaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Laura%20Calzada%20Infante"> Laura Calzada Infante</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, researchers have shown an interest in modelling maritime traffic as a complex network. In this paper, we propose a bipartite weighted network to model maritime traffic and detect port maritime communities. The bipartite weighted network considers two different types of nodes. The first one represents Spanish ports, while the second one represents the countries with which there is major import/export activity. The flow among both types of nodes is modeled by weighting the volume of product transported. To illustrate the model, the data is segmented by each type of traffic. This will allow fine tuning and the creation of communities for each type of traffic and therefore finding similar ports for a specific type of traffic, which will provide decision-makers with tools to search for alliances or identify their competitors. The traffic with the greatest impact on the Spanish gross domestic product is selected, and the evolution of the communities formed by the most important ports and their differences between 2019 and 2009 will be analyzed. Finally, the set of communities formed by the ports of the Spanish port system will be inspected to determine global similarities between them, analyzing the sum of the membership of the different ports in communities formed for each type of traffic in particular. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20networks" title="bipartite networks">bipartite networks</a>, <a href="https://publications.waset.org/abstracts/search?q=competition" title=" competition"> competition</a>, <a href="https://publications.waset.org/abstracts/search?q=infomap" title=" infomap"> infomap</a>, <a href="https://publications.waset.org/abstracts/search?q=maritime%20traffic" title=" maritime traffic"> maritime traffic</a>, <a href="https://publications.waset.org/abstracts/search?q=port%20communities" title=" port communities"> port communities</a> </p> <a href="https://publications.waset.org/abstracts/128267/detecting-port-maritime-communities-in-spain-with-complex-network-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128267.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2816</span> Matching on Bipartite Graphs with Applications to School Course Registration Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhihan%20Li">Zhihan Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, most universities use the course enrollment system considering students’ registration orders. However, the students’ preference level to certain courses is also one important factor to consider. In this research, the possibility of applying a preference-first system has been discussed and analyzed compared to the order-first system. A bipartite graph is applied to resemble the relationship between students and courses they tend to register. With the graph set up, we apply Ford-Fulkerson (F.F.) Algorithm to maximize parings between two sets of nodes, in our case, students and courses. Two models are proposed in this paper: the one considered students’ order first, and the one considered students’ preference first. By comparing and contrasting the two models, we highlight the usability of models which potentially leads to better designs for school course registration systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20graph" title="bipartite graph">bipartite graph</a>, <a href="https://publications.waset.org/abstracts/search?q=Ford-Fulkerson%20%28F.F.%29%20algorithm" title=" Ford-Fulkerson (F.F.) algorithm"> Ford-Fulkerson (F.F.) algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20matching" title=" maximum matching"> maximum matching</a> </p> <a href="https://publications.waset.org/abstracts/128624/matching-on-bipartite-graphs-with-applications-to-school-course-registration-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128624.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">111</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2815</span> Improoving Readability for Tweet Contextualization Using Bipartite Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amira%20Dhokar">Amira Dhokar</a>, <a href="https://publications.waset.org/abstracts/search?q=Lobna%20Hlaoua"> Lobna Hlaoua</a>, <a href="https://publications.waset.org/abstracts/search?q=Lotfi%20Ben%20Romdhane"> Lotfi Ben Romdhane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tweet contextualization (TC) is a new issue that aims to answer questions of the form 'What is this tweet about?' The idea of this task was imagined as an extension of a previous area called multi-document summarization (MDS), which consists in generating a summary from many sources. In both TC and MDS, the summary should ideally contain the most relevant information of the topic that is being discussed in the source texts (for MDS) and related to the query (for TC). Furthermore of being informative, a summary should be coherent, i.e. well written to be readable and grammatically compact. Hence, coherence is an essential characteristic in order to produce comprehensible texts. In this paper, we propose a new approach to improve readability and coherence for tweet contextualization based on bipartite graphs. The main idea of our proposed method is to reorder sentences in a given paragraph by combining most expressive words detection and HITS (Hyperlink-Induced Topic Search) algorithm to make up a coherent context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20graphs" title="bipartite graphs">bipartite graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=readability" title=" readability"> readability</a>, <a href="https://publications.waset.org/abstracts/search?q=summarization" title=" summarization"> summarization</a>, <a href="https://publications.waset.org/abstracts/search?q=tweet%20contextualization" title=" tweet contextualization"> tweet contextualization</a> </p> <a href="https://publications.waset.org/abstracts/87337/improoving-readability-for-tweet-contextualization-using-bipartite-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87337.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">194</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2814</span> A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hui-Chuan%20Lu">Hui-Chuan Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret-sharing%20scheme" title="secret-sharing scheme">secret-sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20information%20ratio" title=" average information ratio"> average information ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=star%20covering" title=" star covering"> star covering</a>, <a href="https://publications.waset.org/abstracts/search?q=deduction" title=" deduction"> deduction</a>, <a href="https://publications.waset.org/abstracts/search?q=core%20cluster" title=" core cluster"> core cluster</a> </p> <a href="https://publications.waset.org/abstracts/9671/a-new-bound-on-the-average-information-ratio-of-perfect-secret-sharing-schemes-for-access-structures-based-on-bipartite-graphs-of-larger-girth" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9671.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">362</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2813</span> Web Proxy Detection via Bipartite Graphs and One-Mode Projections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhipeng%20Chen">Zhipeng Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Peng%20Zhang"> Peng Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qingyun%20Liu"> Qingyun Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Guo"> Li Guo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the Internet becoming the dominant channel for business and life, many IPs are increasingly masked using web proxies for illegal purposes such as propagating malware, impersonate phishing pages to steal sensitive data or redirect victims to other malicious targets. Moreover, as Internet traffic continues to grow in size and complexity, it has become an increasingly challenging task to detect the proxy service due to their dynamic update and high anonymity. In this paper, we present an approach based on behavioral graph analysis to study the behavior similarity of web proxy users. Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of web proxy users. Based on the similarity matrices of end-users from the derived one-mode projection graphs, we apply a simple yet effective spectral clustering algorithm to discover the inherent web proxy users behavior clusters. The web proxy URL may vary from time to time. Still, the inherent interest would not. So, based on the intuition, by dint of our private tools implemented by WebDriver, we examine whether the top URLs visited by the web proxy users are web proxies. Our experiment results based on real datasets show that the behavior clusters not only reduce the number of URLs analysis but also provide an effective way to detect the web proxies, especially for the unknown web proxies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20graph" title="bipartite graph">bipartite graph</a>, <a href="https://publications.waset.org/abstracts/search?q=one-mode%20projection" title=" one-mode projection"> one-mode projection</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20proxy%20detection" title=" web proxy detection"> web proxy detection</a> </p> <a href="https://publications.waset.org/abstracts/87483/web-proxy-detection-via-bipartite-graphs-and-one-mode-projections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87483.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">245</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2812</span> Impact of FACTS Devices on Power Networks Reliability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alireza%20Alesaadi">Alireza Alesaadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Flexible AC transmission system (FACTS) devices have an important rule on expnded electrical transmission networks. In this paper, the effect of these diveces on reliability of electrical networks is studied and it is shown that using of FACTS devices can improve the relibiability of power networks, significantly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FACTS%20devices" title="FACTS devices">FACTS devices</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20networks" title=" power networks"> power networks</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability "> reliability </a> </p> <a href="https://publications.waset.org/abstracts/14821/impact-of-facts-devices-on-power-networks-reliability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14821.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">428</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2811</span> A Bibliographical Research on the Use of Social Media Websites by the Deaf in Brazil</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Juliana%20Guimar%C3%A3es%20Faria">Juliana Guimarães Faria</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article focus on social networks and deaf people. It aims to analyze the studies done about this topic published in journals, as well as the ones done through dissertations and theses. It also aims to identify the thematic focus of the studies produced and to identify how the deaf relates to social networks, more specifically, trying to identify, starting with those productions, what are the benefits, or not, of social networks for the deaf and if there is some reflection about the way the deaf community has been organizing politically in search of bilingual education and inclusion, making use of the softwares of social networks. After reading, description and analysis of the eleven works identified about social networks and the deaf, we detected three thematic groups: four studies presented discussions about social networks and the socialization of the deaf; four works presented discussions about the contribution of social networks to the linguistic and cognitive development of the deaf; and three works presented discussions about the political bias of the use of social networks in favor of the deaf. We also identified that the works presented an optimistic view of social networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=social%20networks" title="social networks">social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=deaf" title=" deaf"> deaf</a>, <a href="https://publications.waset.org/abstracts/search?q=internet" title=" internet"> internet</a>, <a href="https://publications.waset.org/abstracts/search?q=Brazil" title=" Brazil"> Brazil</a> </p> <a href="https://publications.waset.org/abstracts/69113/a-bibliographical-research-on-the-use-of-social-media-websites-by-the-deaf-in-brazil" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69113.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">408</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2810</span> Implementation of Distributed Randomized Algorithms for Resilient Peer-to-Peer Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Richard%20Tanaka">Richard Tanaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhu"> Ying Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a few randomized algorithms in application-layer peer-to-peer networks. The significant gain in scalability and resilience that peer-to-peer networks provide has made them widely used and adopted in many real-world distributed systems and applications. The unique properties of peer-to-peer networks make them particularly suitable for randomized algorithms such as random walks and gossip algorithms. Instead of simulations of peer-to-peer networks, we leverage the Docker virtual container technology to develop implementations of the peer-to-peer networks and these distributed randomized algorithms running on top of them. We can thus analyze their behaviour and performance in realistic settings. We further consider the problem of identifying high-risk bottleneck links in the network with the objective of improving the resilience and reliability of peer-to-peer networks. We propose a randomized algorithm to solve this problem and evaluate its performance by simulations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20randomized%20algorithms" title="distributed randomized algorithms">distributed randomized algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=peer-to-peer%20networks" title=" peer-to-peer networks"> peer-to-peer networks</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20container%20technology" title=" virtual container technology"> virtual container technology</a>, <a href="https://publications.waset.org/abstracts/search?q=resilient%20networks" title=" resilient networks"> resilient networks</a> </p> <a href="https://publications.waset.org/abstracts/133527/implementation-of-distributed-randomized-algorithms-for-resilient-peer-to-peer-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133527.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">216</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2809</span> Communication in a Heterogeneous Ad Hoc Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Benjbara">C. Benjbara</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Habbani"> A. Habbani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless networks are getting more and more used in every new technology or feature, especially those without infrastructure (Ad hoc mode) which provide a low cost alternative to the infrastructure mode wireless networks and a great flexibility for application domains such as environmental monitoring, smart cities, precision agriculture, and so on. These application domains present a common characteristic which is the need of coexistence and intercommunication between modules belonging to different types of ad hoc networks like wireless sensor networks, mesh networks, mobile ad hoc networks, vehicular ad hoc networks, etc. This vision to bring to life such heterogeneous networks will make humanity duties easier but its development path is full of challenges. One of these challenges is the communication complexity between its components due to the lack of common or compatible protocols standard. This article proposes a new patented routing protocol based on the OLSR standard in order to resolve the heterogeneous ad hoc networks communication issue. This new protocol is applied on a specific network architecture composed of MANET, VANET, and FANET. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ad%20hoc" title="Ad hoc">Ad hoc</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous" title=" heterogeneous"> heterogeneous</a>, <a href="https://publications.waset.org/abstracts/search?q=ID-Node" title=" ID-Node"> ID-Node</a>, <a href="https://publications.waset.org/abstracts/search?q=OLSR" title=" OLSR"> OLSR</a> </p> <a href="https://publications.waset.org/abstracts/105018/communication-in-a-heterogeneous-ad-hoc-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105018.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">215</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2808</span> Impact of Social Media on Content of Saudi Television News Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majed%20Alshaibani">Majed Alshaibani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social media has emerged as a serious contender to TV news networks in Saudi Arabia. The growing usage of social media as a source of news and information has led to significant impact on the content presented by the news networks in Saudi Arabia. This study explored the various ways in which social media has influenced content aired on Saudi news networks. Data were collected by using semi structured interviews with 13 journalists and content editors working for four Saudi TV news networks and six senior academic experts on TV and media teaching in Saudi universities. The findings of the study revealed that social media has affected four aspects of the content on Saudi TV news networks. As a result the content aired on Saudi news networks is more neutral, real time, diverse in terms of sources and includes content on broader subjects and from different parts of the world. This research concludes that social media has contributed positively and significantly to improving the content on Saudi TV news networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=TV%20news%20networks" title="TV news networks">TV news networks</a>, <a href="https://publications.waset.org/abstracts/search?q=Saudi%20Arabia" title=" Saudi Arabia"> Saudi Arabia</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20media" title=" social media"> social media</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20content" title=" media content"> media content</a> </p> <a href="https://publications.waset.org/abstracts/125622/impact-of-social-media-on-content-of-saudi-television-news-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125622.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">237</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2807</span> Dynamic Bandwidth Allocation in Fiber-Wireless (FiWi) Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eman%20I.%20Raslan">Eman I. Raslan</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitham%20S.%20Hamza"> Haitham S. Hamza</a>, <a href="https://publications.waset.org/abstracts/search?q=Reda%20A.%20El-Khoribi"> Reda A. El-Khoribi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fiber-Wireless (FiWi) networks are a promising candidate for future broadband access networks. These networks combine the optical network as the back end where different passive optical network (PON) technologies are realized and the wireless network as the front end where different wireless technologies are adopted, e.g. LTE, WiMAX, Wi-Fi, and Wireless Mesh Networks (WMNs). The convergence of both optical and wireless technologies requires designing architectures with robust efficient and effective bandwidth allocation schemes. Different bandwidth allocation algorithms have been proposed in FiWi networks aiming to enhance the different segments of FiWi networks including wireless and optical subnetworks. In this survey, we focus on the differentiating between the different bandwidth allocation algorithms according to their enhancement segment of FiWi networks. We classify these techniques into wireless, optical and Hybrid bandwidth allocation techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fiber-wireless%20%28FiWi%29" title="fiber-wireless (FiWi)">fiber-wireless (FiWi)</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20bandwidth%20allocation%20%28DBA%29" title=" dynamic bandwidth allocation (DBA)"> dynamic bandwidth allocation (DBA)</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20optical%20networks%20%28PON%29" title=" passive optical networks (PON)"> passive optical networks (PON)</a>, <a href="https://publications.waset.org/abstracts/search?q=media%20access%20control%20%28MAC%29" title=" media access control (MAC)"> media access control (MAC)</a> </p> <a href="https://publications.waset.org/abstracts/43649/dynamic-bandwidth-allocation-in-fiber-wireless-fiwi-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43649.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">531</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2806</span> On the Performance Analysis of Coexistence between IEEE 802.11g and IEEE 802.15.4 Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chompunut%20Jantarasorn">Chompunut Jantarasorn</a>, <a href="https://publications.waset.org/abstracts/search?q=Chutima%20Prommak"> Chutima Prommak </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an intensive measurement studying of the network performance analysis when IEEE 802.11g Wireless Local Area Networks (WLAN) coexisting with IEEE 802.15.4 Wireless Personal Area Network (WPAN). The measurement results show that the coexistence between both networks could increase the Frame Error Rate (FER) of the IEEE 802.15.4 networks up to 60% and it could decrease the throughputs of the IEEE 802.11g networks up to 55%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20performance%20analysis" title="wireless performance analysis">wireless performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=coexistence%20analysis" title=" coexistence analysis"> coexistence analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=IEEE%20802.11g" title=" IEEE 802.11g"> IEEE 802.11g</a>, <a href="https://publications.waset.org/abstracts/search?q=IEEE%20802.15.4" title=" IEEE 802.15.4"> IEEE 802.15.4</a> </p> <a href="https://publications.waset.org/abstracts/9834/on-the-performance-analysis-of-coexistence-between-ieee-80211g-and-ieee-802154-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9834.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">552</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2805</span> A Review of Security Attacks and Intrusion Detection Schemes in Wireless Sensor Networks: A Survey</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maleh%20Yassine">Maleh Yassine</a>, <a href="https://publications.waset.org/abstracts/search?q=Ezzati%20Abdellah"> Ezzati Abdellah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless Sensor Networks (WSNs) are currently used in different industrial and consumer applications, such as earth monitoring, health related applications, natural disaster prevention, and many other areas. Security is one of the major aspects of wireless sensor networks due to the resource limitations of sensor nodes. However, these networks are facing several threats that affect their functioning and their life. In this paper we present security attacks in wireless sensor networks, and we focus on a review and analysis of the recent Intrusion Detection schemes in WSNs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title="wireless sensor networks">wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20attack" title=" security attack"> security attack</a>, <a href="https://publications.waset.org/abstracts/search?q=denial%20of%20service" title=" denial of service"> denial of service</a>, <a href="https://publications.waset.org/abstracts/search?q=IDS" title=" IDS"> IDS</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster-based%20model" title=" cluster-based model"> cluster-based model</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20based%20IDS" title=" signature based IDS"> signature based IDS</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20IDS" title=" hybrid IDS"> hybrid IDS</a> </p> <a href="https://publications.waset.org/abstracts/5249/a-review-of-security-attacks-and-intrusion-detection-schemes-in-wireless-sensor-networks-a-survey" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">385</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2804</span> Influence Maximization in Dynamic Social Networks and Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gkolfo%20I.%20Smani">Gkolfo I. Smani</a>, <a href="https://publications.waset.org/abstracts/search?q=Vasileios%20Megalooikonomou"> Vasileios Megalooikonomou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social influence and influence diffusion have been studied in social networks. However, most existing tasks on this subject focus on static networks. In this paper, the problem of maximizing influence diffusion in dynamic social networks, i.e., the case of networks that change over time, is studied. The DM algorithm is an extension of the MATI algorithm and solves the influence maximization (IM) problem in dynamic networks and is proposed under the linear threshold (LT) and independent cascade (IC) models. Experimental results show that our proposed algorithm achieves a diffusion performance better by 1.5 times than several state-of-the-art algorithms and comparable results in diffusion scale with the Greedy algorithm. Also, the proposed algorithm is 2.4 times faster than previous methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=influence%20maximization" title="influence maximization">influence maximization</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20social%20networks" title=" dynamic social networks"> dynamic social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=diffusion" title=" diffusion"> diffusion</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20influence" title=" social influence"> social influence</a>, <a href="https://publications.waset.org/abstracts/search?q=graphs" title=" graphs"> graphs</a> </p> <a href="https://publications.waset.org/abstracts/142457/influence-maximization-in-dynamic-social-networks-and-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142457.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2803</span> Factorization of Computations in Bayesian Networks: Interpretation of Factors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Linda%20Smail">Linda Smail</a>, <a href="https://publications.waset.org/abstracts/search?q=Zineb%20Azouz"> Zineb Azouz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given a Bayesian network relative to a set I of discrete random variables, we are interested in computing the probability distribution P(S) where S is a subset of I. The general idea is to write the expression of P(S) in the form of a product of factors where each factor is easy to compute. More importantly, it will be very useful to give an interpretation of each of the factors in terms of conditional probabilities. This paper considers a semantic interpretation of the factors involved in computing marginal probabilities in Bayesian networks. Establishing such a semantic interpretations is indeed interesting and relevant in the case of large Bayesian networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bayesian%20networks" title="Bayesian networks">Bayesian networks</a>, <a href="https://publications.waset.org/abstracts/search?q=D-Separation" title=" D-Separation"> D-Separation</a>, <a href="https://publications.waset.org/abstracts/search?q=level%20two%20Bayesian%20networks" title=" level two Bayesian networks"> level two Bayesian networks</a>, <a href="https://publications.waset.org/abstracts/search?q=factorization%20of%20computation" title=" factorization of computation"> factorization of computation</a> </p> <a href="https://publications.waset.org/abstracts/18829/factorization-of-computations-in-bayesian-networks-interpretation-of-factors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">529</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2802</span> Experimental Study of Hyperparameter Tuning a Deep Learning Convolutional Recurrent Network for Text Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bharatendra%20Rai">Bharatendra Rai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The sequence of words in text data has long-term dependencies and is known to suffer from vanishing gradient problems when developing deep learning models. Although recurrent networks such as long short-term memory networks help to overcome this problem, achieving high text classification performance is a challenging problem. Convolutional recurrent networks that combine the advantages of long short-term memory networks and convolutional neural networks can be useful for text classification performance improvements. However, arriving at suitable hyperparameter values for convolutional recurrent networks is still a challenging task where fitting a model requires significant computing resources. This paper illustrates the advantages of using convolutional recurrent networks for text classification with the help of statistically planned computer experiments for hyperparameter tuning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=long%20short-term%20memory%20networks" title="long short-term memory networks">long short-term memory networks</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20recurrent%20networks" title=" convolutional recurrent networks"> convolutional recurrent networks</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20classification" title=" text classification"> text classification</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperparameter%20tuning" title=" hyperparameter tuning"> hyperparameter tuning</a>, <a href="https://publications.waset.org/abstracts/search?q=Tukey%20honest%20significant%20differences" title=" Tukey honest significant differences"> Tukey honest significant differences</a> </p> <a href="https://publications.waset.org/abstracts/169795/experimental-study-of-hyperparameter-tuning-a-deep-learning-convolutional-recurrent-network-for-text-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169795.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">129</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2801</span> VANETs Geographic Routing Protocols: A survey</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Karimi">Ramin Karimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of common highly mobile wireless ad hoc networks is Vehicular Ad Hoc Networks. Hence routing in vehicular ad hoc network (VANET) has attracted much attention during the last few years. VANET is characterized by its high mobility of nodes and specific topology patterns. Moreover these networks encounter a significant loss rate and a very short duration of communication. In vehicular ad hoc networks, one of challenging is routing of data due to high speed mobility and changing topology of vehicles. Geographic routing protocols are becoming popular due to advancement and availability of GPS devices. Delay Tolerant Networks (DTNs) are a class of networks that enable communication where connectivity issues like sparse connectivity, intermittent connectivity; high latency, long delay, high error rates, asymmetric data rate, and even no end-to-end connectivity exist. In this paper, we review the existing Geographic Routing Protocols for VANETs and also provide a qualitative comparison of them. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicular%20ad%20hoc%20networks" title="vehicular ad hoc networks">vehicular ad hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=mobility" title=" mobility"> mobility</a>, <a href="https://publications.waset.org/abstracts/search?q=geographic%20routing" title=" geographic routing"> geographic routing</a>, <a href="https://publications.waset.org/abstracts/search?q=delay%20tolerant%20networks" title=" delay tolerant networks"> delay tolerant networks</a> </p> <a href="https://publications.waset.org/abstracts/34821/vanets-geographic-routing-protocols-a-survey" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34821.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">520</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2800</span> Study of the Vertical Handoff in Heterogeneous Networks and Implement Based on Opnet</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%20Benaatou">Wafa Benaatou</a>, <a href="https://publications.waset.org/abstracts/search?q=Adnane%20Latif"> Adnane Latif </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this document we studied more in detail the Performances of the vertical handover in the networks WLAN, WiMAX, UMTS before studying of it the Procedure of Handoff Vertical, the whole buckled by simulations putting forward the performances of the handover in the heterogeneous networks. The goal of Vertical Handover is to carry out several accesses in real-time in the heterogeneous networks. This makes it possible a user to use several networks (such as WLAN UMTS and WiMAX) in parallel, and the system to commutate automatically at another basic station, without disconnecting itself, as if there were no cut and with little loss of data as possible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertical%20handoff" title="vertical handoff">vertical handoff</a>, <a href="https://publications.waset.org/abstracts/search?q=WLAN" title=" WLAN"> WLAN</a>, <a href="https://publications.waset.org/abstracts/search?q=UMTS" title=" UMTS"> UMTS</a>, <a href="https://publications.waset.org/abstracts/search?q=WIMAX" title=" WIMAX"> WIMAX</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous" title=" heterogeneous"> heterogeneous</a> </p> <a href="https://publications.waset.org/abstracts/12140/study-of-the-vertical-handoff-in-heterogeneous-networks-and-implement-based-on-opnet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12140.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">394</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2799</span> Security Threats on Wireless Sensor Network Protocols</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Gorine">H. Gorine</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Ramadan%20Elmezughi"> M. Ramadan Elmezughi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate security issues and challenges facing researchers in wireless sensor networks and countermeasures to resolve them. The broadcast nature of wireless communication makes Wireless Sensor Networks prone to various attacks. Due to resources limitation constraint in terms of limited energy, computation power and memory, security in wireless sensor networks creates different challenges than wired network security. We will discuss several attempts at addressing the issues of security in wireless sensor networks in an attempt to encourage more research into this area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title="wireless sensor networks">wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/abstracts/search?q=light%20weight%20encryption" title=" light weight encryption"> light weight encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=threats" title=" threats"> threats</a> </p> <a href="https://publications.waset.org/abstracts/51644/security-threats-on-wireless-sensor-network-protocols" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51644.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">526</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2798</span> Reliable Multicast Communication in Next Generation Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muazzam%20Ali%20Khan%20Khattak">Muazzam Ali Khan Khattak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Next Generation Network is combination of different networks having different technologies. Due to mobile nature of nodes the movement of nodes occurs from one network to another network. Multicasting in such networks is still a hot issue of research because the user in today's world wants reliable communication wherever it lies. Due to heterogeneity of NGN it is very difficult to handle reliable multicast communication. In this paper we proposed an improved scheme for reliable multicast communication in next generation networks. Because multicast communication is very important to deliver same data packets to multiple receivers and minimize the network traffic. This new scheme will make the multicast communication in NGN more reliable and efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=next%20generation%20networks" title="next generation networks">next generation networks</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20request" title=" route request"> route request</a>, <a href="https://publications.waset.org/abstracts/search?q=IPT" title=" IPT"> IPT</a>, <a href="https://publications.waset.org/abstracts/search?q=NACK" title=" NACK"> NACK</a>, <a href="https://publications.waset.org/abstracts/search?q=ARQ" title=" ARQ"> ARQ</a>, <a href="https://publications.waset.org/abstracts/search?q=DTN" title=" DTN"> DTN</a> </p> <a href="https://publications.waset.org/abstracts/1931/reliable-multicast-communication-in-next-generation-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1931.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">503</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2797</span> Delay-Dependent Passivity Analysis for Neural Networks with Time-Varying Delays</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Y.%20Jung">H. Y. Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Jing%20Wang"> Jing Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20H.%20Park"> J. H. Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Hao%20Shen"> Hao Shen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This brief addresses the passivity problem for neural networks with time-varying delays. The aim is focus on establishing the passivity condition of the considered neural networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title="neural networks">neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=passivity%20analysis" title=" passivity analysis"> passivity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=time-varying%20delays" title=" time-varying delays"> time-varying delays</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20matrix%20inequality" title=" linear matrix inequality"> linear matrix inequality</a> </p> <a href="https://publications.waset.org/abstracts/3026/delay-dependent-passivity-analysis-for-neural-networks-with-time-varying-delays" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3026.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">570</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2796</span> IACOP - Route Optimization in Wireless Networks Using Improved Ant Colony Optimization Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Vasundra">S. Vasundra</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Venkatesh"> D. Venkatesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless networks have gone through an extraordinary growth in the past few years, and will keep on playing a crucial role in future data communication. The present wireless networks aim to make communication possible anywhere and anytime. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Since an ad hoc network may consist of a large number of mobile hosts, this imposes a significant challenge on the design of an effective and efficient routing protocol that can work well in an environment with frequent topological changes. This paper proposes improved ant colony optimization (IACO) technique. It also maintains load balancing in wireless networks. The simulation results show that the proposed IACO performs better than existing routing techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20networks" title="wireless networks">wireless networks</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title=" ant colony optimization"> ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=architecture" title=" architecture"> architecture</a> </p> <a href="https://publications.waset.org/abstracts/43366/iacop-route-optimization-in-wireless-networks-using-improved-ant-colony-optimization-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43366.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">422</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2795</span> An Overview of Privacy and Security Issues in Social Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Ibrahim%20Al%20Ladan">Mohamad Ibrahim Al Ladan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social networks, such as Facebook, Myspace, LinkedIn, Google+, and Twitter have experienced exponential growth and a remarkable adoption rate in recent years. They provide attractive means of online social interactions and communications with family, friends, and colleagues from around the corner or across the globe, and they have become an important part of daily digital interactions for more than one and a half billion users around the world. The various personal information sharing practices that social network providers encourage have led to their success as innovative social interaction platforms. However, these practices have resulted in ample concerns with respect to privacy and security from different stakeholders. Addressing these privacy and security concerns in social networks is a must for these networks to be sustainable. Existing security and privacy tools may not be enough to address existing concerns. Some guidelines should be followed to protect users from the existing risks. In this paper, we have investigated and discussed the various privacy and security issues and concerns pertaining to social networks. Moreover, we have classified these privacy and security issues and presented a thorough discussion of the implications of these issues and concerns on the future of the social networks. In addition, we have presented a set of guidelines as precaution measures that users can consider to address these issues and concerns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=social%20networks%20privacy%20issues" title="social networks privacy issues">social networks privacy issues</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks%20security%20issues" title=" social networks security issues"> social networks security issues</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks%20privacy%20precautions%20measures" title=" social networks privacy precautions measures"> social networks privacy precautions measures</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20networks%20security%20precautions%20measures" title=" social networks security precautions measures"> social networks security precautions measures</a> </p> <a href="https://publications.waset.org/abstracts/74547/an-overview-of-privacy-and-security-issues-in-social-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74547.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">307</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2794</span> Performance Study of ZigBee-Based Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Afif%20Saleh%20Abugharsa">Afif Saleh Abugharsa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The IEEE 802.15.4 standard is designed for low-rate wireless personal area networks (LR-WPAN) with focus on enabling wireless sensor networks. It aims to give a low data rate, low power consumption, and low cost wireless networking on the device-level communication. The objective of this study is to investigate the performance of IEEE 802.15.4 based networks using simulation tool. In this project the network simulator 2 NS2 was used to several performance measures of wireless sensor networks. Three scenarios were considered, multi hop network with a single coordinator, star topology, and an ad hoc on demand distance vector AODV. Results such as packet delivery ratio, hop delay, and number of collisions are obtained from these scenarios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ZigBee" title="ZigBee">ZigBee</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=IEEE%20802.15.4" title=" IEEE 802.15.4"> IEEE 802.15.4</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20power" title=" low power"> low power</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20data%20rate" title=" low data rate"> low data rate</a> </p> <a href="https://publications.waset.org/abstracts/4239/performance-study-of-zigbee-based-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4239.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">433</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2793</span> 6G: Emerging Architectures, Technologies and Challenges</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulrahman%20Yarali">Abdulrahman Yarali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advancement of technology never stops because the demands for improved internet and communication connectivity are increasing. Just as 5G networks are rolling out, the world has begun to talk about the sixth-generation networks (6G). The semantics of 6G are more or less the same as 5G networks because they strive to boost speeds, machine-to-machine (M2M) communication, and latency reduction. However, some of the distinctive focuses of 6G include the optimization of networks of machines through super speeds and innovative features. This paper discusses many aspects of the technologies, architectures, challenges, and opportunities of 6G wireless communication systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=6G" title="6G">6G</a>, <a href="https://publications.waset.org/abstracts/search?q=characteristics" title=" characteristics"> characteristics</a>, <a href="https://publications.waset.org/abstracts/search?q=infrastructures" title=" infrastructures"> infrastructures</a>, <a href="https://publications.waset.org/abstracts/search?q=technologies" title=" technologies"> technologies</a>, <a href="https://publications.waset.org/abstracts/search?q=AI" title=" AI"> AI</a>, <a href="https://publications.waset.org/abstracts/search?q=ML" title=" ML"> ML</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=applications" title=" applications"> applications</a> </p> <a href="https://publications.waset.org/abstracts/191246/6g-emerging-architectures-technologies-and-challenges" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191246.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">25</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2792</span> Improve of Power Quality in Electrical Network Using STATCOM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20R.%20Alesaadi">A. R. Alesaadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Flexible AC transmission system (FACTS) devices have an important rule on expended electrical transmission networks. These devices can provide control of one or more AC transmission system parameters to enhance controllability and increase power transfer capability. In this paper the effect of these devices on reliability of electrical networks is studied and it is shown that using of FACTS devices can improve the reliability of power networks and power quality in electrical networks, significantly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FACTS%20devices" title="FACTS devices">FACTS devices</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20networks" title=" power networks"> power networks</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20quality" title=" power quality"> power quality</a>, <a href="https://publications.waset.org/abstracts/search?q=STATCOM" title=" STATCOM"> STATCOM</a> </p> <a href="https://publications.waset.org/abstracts/33525/improve-of-power-quality-in-electrical-network-using-statcom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33525.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">668</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2791</span> Governance Networks of China’s Neighborhood Micro-Redevelopment: The Case of Haikou</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lin%20Zhang">Lin Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Neighborhood redevelopment is vital to improve residents’ living environment, and there has been a national neighborhood micro-redevelopment initiative in China since 2020, which is largely different from the previous large-scale demolition and reconstruction projects. Yet, few studies systematically examine the new interactions of multiple actors in this initiative. China’s neighborhood (micro-) redevelopment is a kind of governance network, and the complexity perspective could reflect the dynamic nature of multiple actors and their relationships in governance networks. In order to better understand the fundamental shifts of governance networks in China’s neighborhood micro-redevelopment, this paper adopted a theoretical framework of complexity in governance networks and analyzed the new governance networks of neighborhood micro-redevelopment projects in Haikou accordingly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neighborhood%20redevelopment" title="neighborhood redevelopment">neighborhood redevelopment</a>, <a href="https://publications.waset.org/abstracts/search?q=governance" title=" governance"> governance</a>, <a href="https://publications.waset.org/abstracts/search?q=networks" title=" networks"> networks</a>, <a href="https://publications.waset.org/abstracts/search?q=Haikou" title=" Haikou"> Haikou</a> </p> <a href="https://publications.waset.org/abstracts/172025/governance-networks-of-chinas-neighborhood-micro-redevelopment-the-case-of-haikou" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172025.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">89</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=93">93</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=94">94</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bipartite%20networks&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>