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: human gathering scheme</title> <meta name="description" content="Search results for: human gathering scheme"> <meta name="keywords" content="human gathering scheme"> <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="human gathering scheme" 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="human gathering scheme"> <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> 9997</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: human gathering scheme</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9997</span> A Virtual Grid Based Energy Efficient Data Gathering Scheme for Heterogeneous Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siddhartha%20Chauhan">Siddhartha Chauhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Nitin%20Kumar%20Kotania"> Nitin Kumar Kotania</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditional Wireless Sensor Networks (WSNs) generally use static sinks to collect data from the sensor nodes via multiple forwarding. Therefore, network suffers with some problems like long message relay time, bottle neck problem which reduces the performance of the network. Many approaches have been proposed to prevent this problem with the help of mobile sink to collect the data from the sensor nodes, but these approaches still suffer from the buffer overflow problem due to limited memory size of sensor nodes. This paper proposes an energy efficient scheme for data gathering which overcomes the buffer overflow problem. The proposed scheme creates virtual grid structure of heterogeneous nodes. Scheme has been designed for sensor nodes having variable sensing rate. Every node finds out its buffer overflow time and on the basis of this cluster heads are elected. A controlled traversing approach is used by the proposed scheme in order to transmit data to sink. The effectiveness of the proposed scheme is verified by simulation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buffer%20overflow%20problem" title="buffer overflow problem">buffer overflow problem</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20sink" title=" mobile sink"> mobile sink</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20grid" title=" virtual grid"> virtual grid</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title=" wireless sensor networks"> wireless sensor networks</a> </p> <a href="https://publications.waset.org/abstracts/11672/a-virtual-grid-based-energy-efficient-data-gathering-scheme-for-heterogeneous-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11672.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">391</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">9996</span> Optimization of the Control Scheme for Human Extremity Exoskeleton</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yang%20Li">Yang Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaorong%20Guan"> Xiaorong Guan</a>, <a href="https://publications.waset.org/abstracts/search?q=Cheng%20Xu"> Cheng Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to design a suitable control scheme for human extremity exoskeleton, the interaction force control scheme with traditional PI controller was presented, and the simulation study of the electromechanical system of the human extremity exoskeleton was carried out by using a MATLAB/Simulink module. By analyzing the simulation calculation results, it was shown that the traditional PI controller is not very suitable for every movement speed of human body. So, at last the fuzzy self-adaptive PI controller was presented to solve this problem. Eventually, the superiority and feasibility of the fuzzy self-adaptive PI controller was proved by the simulation results and experimental results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=human%20extremity%20exoskeleton" title="human extremity exoskeleton">human extremity exoskeleton</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction%20force%20control%20scheme" title=" interaction force control scheme"> interaction force control scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20study" title=" simulation study"> simulation study</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20self-adaptive%20pi%20controller" title=" fuzzy self-adaptive pi controller"> fuzzy self-adaptive pi controller</a>, <a href="https://publications.waset.org/abstracts/search?q=man-machine%20coordinated%20walking" title=" man-machine coordinated walking"> man-machine coordinated walking</a>, <a href="https://publications.waset.org/abstracts/search?q=bear%20payload" title=" bear payload"> bear payload</a> </p> <a href="https://publications.waset.org/abstracts/53441/optimization-of-the-control-scheme-for-human-extremity-exoskeleton" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53441.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">9995</span> Advanced CoMP Scheme for LTE-based V2X System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Su-Hyun%20Jung">Su-Hyun Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Young-Su%20Ryu"> Young-Su Ryu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim"> Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a highly efficient coordinated multiple-point (CoMP) scheme for vehicular communication is proposed. The proposed scheme controls the transmit power and applies proper transmission scheme for the various situations. The proposed CoMP scheme provides comparable performance to the conventional dynamic cell selection (DCS) scheme. Moreover, this scheme provides improved power efficiency compared with the conventional joint transmission (JT) scheme. Simulation results show that the proposed scheme can achieve more enhanced performance with the high power efficiency and improve the cell capacity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CoMP" title="CoMP">CoMP</a>, <a href="https://publications.waset.org/abstracts/search?q=LTE-A" title=" LTE-A"> LTE-A</a>, <a href="https://publications.waset.org/abstracts/search?q=V2I" title=" V2I"> V2I</a>, <a href="https://publications.waset.org/abstracts/search?q=V2V" title=" V2V"> V2V</a>, <a href="https://publications.waset.org/abstracts/search?q=V2X." title=" V2X."> V2X.</a> </p> <a href="https://publications.waset.org/abstracts/32520/advanced-comp-scheme-for-lte-based-v2x-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32520.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">583</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">9994</span> Generalization of Blom Key Predistribution Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Cheraghi">Abbas Cheraghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A key predistribution scheme provides one method to distribute secret ahead of time. Blom’s scheme is a symmetric threshold key exchange protocol in cryptography. The scheme was proposed by the Swedish cryptographer Rolf Blom. In this kind of scheme, trusted authority gives each user a secret key and a public identifier, which enables any two users to create independently a shared key for communicating between each other. However, if an attacker can compromise the keys of at least Known numbers of users, he can break the scheme and reconstruct every shared key. In this paper generalized Blom’s Scheme by multivariate Lagrange interpolation formula. This scheme is a form of threshold secret sharing scheme. In this new scheme, the amount of information transmitted by the trusted authority is independent of the numbers of users. In addition, this scheme is unconditionally secure against any individual user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=key%20predistribution" title="key predistribution">key predistribution</a>, <a href="https://publications.waset.org/abstracts/search?q=blom%E2%80%99s%20scheme" title=" blom’s scheme"> blom’s scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=unconditional%20secure" title=" unconditional secure"> unconditional secure</a> </p> <a href="https://publications.waset.org/abstracts/39358/generalization-of-blom-key-predistribution-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39358.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">437</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">9993</span> Requirements Gathering for Improved Software Usability and the Potential for Usage-Centred Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kholod%20J.%20Alotaibi">Kholod J. Alotaibi</a>, <a href="https://publications.waset.org/abstracts/search?q=Andrew%20M.%20Gravell"> Andrew M. Gravell</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Usability is an important software quality that is often neglected at the design stage. Although methods exist to incorporate elements of usability engineering, there is a need for more balanced usability focused methods that can enhance the experience of software usability for users. In this regard, the potential for Usage-Centered Design is explored with respect to requirements gathering and is shown to lead to high software usability besides other benefits. It achieves this through its focus on usage, defining essential use cases, by conducting task modeling, encouraging user collaboration, refining requirements, and so on. The requirements gathering process in UgCD is described in detail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=requirements%20gathering" title="requirements gathering">requirements gathering</a>, <a href="https://publications.waset.org/abstracts/search?q=usability" title=" usability"> usability</a>, <a href="https://publications.waset.org/abstracts/search?q=usage-centred%20design" title=" usage-centred design"> usage-centred design</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title=" computer science"> computer science</a> </p> <a href="https://publications.waset.org/abstracts/2468/requirements-gathering-for-improved-software-usability-and-the-potential-for-usage-centred-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2468.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">358</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">9992</span> Study on the Central Differencing Scheme with the Staggered Version (STG) for Solving the Hyperbolic Partial Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Narumol%20Chintaganun">Narumol Chintaganun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present the second-order central differencing scheme with the staggered version (STG) for solving the advection equation and Burger's equation. This scheme based on staggered evolution of the re-constructed cell averages. This scheme results in the second-order central differencing scheme, an extension along the lines of the first-order central scheme of Lax-Friedrichs (LxF) scheme. All numerical simulations presented in this paper are obtained by finite difference method (FDM) and STG. Numerical results are shown that the STG gives very good results and higher accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20differencing%20scheme" title="central differencing scheme">central differencing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=STG" title=" STG"> STG</a>, <a href="https://publications.waset.org/abstracts/search?q=advection%20equation" title=" advection equation"> advection equation</a>, <a href="https://publications.waset.org/abstracts/search?q=burgers%20equation" title=" burgers equation"> burgers equation</a> </p> <a href="https://publications.waset.org/abstracts/23076/study-on-the-central-differencing-scheme-with-the-staggered-version-stg-for-solving-the-hyperbolic-partial-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23076.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">557</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">9991</span> Adaptive Cooperative Scheme Considering the User Location</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bit-Na%20Kwon">Bit-Na Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyun-Jee%20Yang"> Hyun-Jee Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Dong-Hyun%20Ha"> Dong-Hyun Ha</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, an adaptive cooperative scheme in the cell edge is proposed. The proposed scheme considers the location of a user and applies the suitable cooperative scheme. In cellular systems, the performance of communication is degraded if the user is located in the cell edge. In conventional scheme, two base stations are used in order to obtain diversity gain. However, the performance of communication is not sufficiently improved since the distance between each base station and a user is still distant. Therefore, we propose a scheme that the relays are used and the cooperative scheme is adaptively applied according to the user location. Through simulation results, it is confirmed that the proposed scheme has better performance than the conventional scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20transmission" title="adaptive transmission">adaptive transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title=" cooperative communication"> cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity%20gain" title=" diversity gain"> diversity gain</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a> </p> <a href="https://publications.waset.org/abstracts/32518/adaptive-cooperative-scheme-considering-the-user-location" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32518.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">572</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">9990</span> Social Media, Society, and Criminal Victimization: A Qualitative Study on University Students of Bangladesh </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md.%20Tawohidul%20Haque">Md. Tawohidul Haque</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main objective of this study is to explore the nature, types and, causes of the involvement of criminal activities of the university students using social media namely Social Networking Sites (SNS). The evidence shows that the students have greater chance to involve such criminal activities during sharing their personal messages, photos, and even sharing their academic works. Used qualitative case studies with six students from two universities, this study provides a detail information about the processes how this media provokes the students to commit to the criminal activities such as unethical pose, naked picture, post against persona’s prestige and dignity as well as social position, phone call at midnight, personal threats, sexual offer, kidnapping attitude, and so on. This finding would be an important guideline for the media persons, policy makers, restorative justice, and human rights workers. <p class="card-text"><strong>Keywords:</strong> <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=criminal%20victimization" title=" criminal victimization"> criminal victimization</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme" title=" human gathering scheme"> human gathering scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20code%20of%20ethics" title=" social code of ethics"> social code of ethics</a> </p> <a href="https://publications.waset.org/abstracts/93599/social-media-society-and-criminal-victimization-a-qualitative-study-on-university-students-of-bangladesh" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93599.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">9989</span> Improved Performance Using Adaptive Pre-Coding in the Cellular Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim">Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Hyun%20Ro"> Jae-Hyun Ro</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang-Bin%20Ha"> Chang-Bin Ha</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes the cooperative transmission scheme with pre-coding because the cellular communication requires high reliability. The cooperative transmission scheme uses pre-coding method with limited feedback information among small cells. Particularly, the proposed scheme has adaptive mode according to the position of mobile station. Thus, demand of recent wireless communication is resolved by this scheme. From the simulation results, the proposed scheme has better performance compared to the conventional scheme in the cellular network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CDD" title="CDD">CDD</a>, <a href="https://publications.waset.org/abstracts/search?q=cellular%20network" title=" cellular network"> cellular network</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-coding" title=" pre-coding"> pre-coding</a>, <a href="https://publications.waset.org/abstracts/search?q=SPC" title=" SPC"> SPC</a> </p> <a href="https://publications.waset.org/abstracts/42216/improved-performance-using-adaptive-pre-coding-in-the-cellular-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42216.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">569</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">9988</span> Curve Designing Using an Approximating 4-Point C^2 Ternary Non-Stationary Subdivision Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Younis">Muhammad Younis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A ternary 4-point approximating non-stationary subdivision scheme has been introduced that generates the family of $C^2$ limiting curves. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the scheme. The comparison of the proposed scheme has been demonstrated using different examples with the existing 4-point ternary approximating schemes, which shows that the limit curves of the proposed scheme behave more pleasantly and can generate conic sections as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ternary" title="ternary">ternary</a>, <a href="https://publications.waset.org/abstracts/search?q=non-stationary" title=" non-stationary"> non-stationary</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation%20subdivision%20scheme" title=" approximation subdivision scheme"> approximation subdivision scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20and%20smoothness" title=" convergence and smoothness"> convergence and smoothness</a> </p> <a href="https://publications.waset.org/abstracts/24448/curve-designing-using-an-approximating-4-point-c2-ternary-non-stationary-subdivision-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24448.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">477</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">9987</span> Omni-Relay (OR) Scheme-Aided LTE-A Communication Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Mahasneh">Hassan Mahasneh</a>, <a href="https://publications.waset.org/abstracts/search?q=Abu%20Sesay"> Abu Sesay</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose the use of relay terminals at the cell edge of an LTE-based cellar system. Each relay terminal is equipped with an omni-directional antenna. We refer to this scheme as the Omni-Relay (OR) scheme. The OR scheme coordinates the inter-cell interference (ICI) stemming from adjacent cells and increases the desired signal level at cell-edge regions. To validate the performance of the OR scheme, we derive the average signal-to-interference plus noise ratio (SINR) and the average capacity and compare it with the conventional universal frequency reuse factor (UFRF). The results show that the proposed OR scheme provides higher average SINR and average capacity compared to the UFRF due to the assistance of the distributed relay nodes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=the%20UFRF%20scheme" title="the UFRF scheme">the UFRF scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20OR%20scheme" title=" the OR scheme"> the OR scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=ICI" title=" ICI"> ICI</a>, <a href="https://publications.waset.org/abstracts/search?q=relay%20terminals" title=" relay terminals"> relay terminals</a>, <a href="https://publications.waset.org/abstracts/search?q=SINR" title=" SINR"> SINR</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20efficiency" title=" spectral efficiency"> spectral efficiency</a> </p> <a href="https://publications.waset.org/abstracts/42422/omni-relay-or-scheme-aided-lte-a-communication-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42422.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">341</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">9986</span> Efficient Iterative V-BLAST Detection Technique in Wireless Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hwan-Jun%20Choi">Hwan-Jun Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi"> Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, among the MIMO-OFDM detection techniques, a lot of papers suggested V-BLAST scheme which can achieve high data rate. Therefore, the signal detection of MIMOOFDM system is important issue. In this paper, efficient iterative VBLAST detection technique is proposed in wireless communication system. The proposed scheme adjusts the number of candidate symbol and iterative scheme based on channel state. According to the simulation result, the proposed scheme has better BER performance than conventional schemes and similar BER performance of the QRD-M with iterative scheme. Moreover complexity of proposed scheme has 50.6 % less than complexity of QRD-M detection with iterative scheme. Therefore the proposed detection scheme can be efficiently used in wireless communication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=V-BLAST" title=" V-BLAST"> V-BLAST</a>, <a href="https://publications.waset.org/abstracts/search?q=QR-decomposition" title=" QR-decomposition"> QR-decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=QRDM" title=" QRDM"> QRDM</a>, <a href="https://publications.waset.org/abstracts/search?q=DFE" title=" DFE"> DFE</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20condition" title=" channel condition"> channel condition</a> </p> <a href="https://publications.waset.org/abstracts/3522/efficient-iterative-v-blast-detection-technique-in-wireless-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3522.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">530</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">9985</span> Redefining "Dedhee" in Terms of Knowledge Gathering and Conserving Hazara Literature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Urooj%20Shafique">Urooj Shafique</a>, <a href="https://publications.waset.org/abstracts/search?q=Salman%20Jamil"> Salman Jamil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the context of an urban human life, city requires to meeting some standards which, at a glance are called the standards of a quality life. Measuring the quality of life according to particular social, economic and cultural conditions of a country and also the emphasis of a country twenty years visions on this issue has special importance. Cultural gathering spaces improve social and economic vitality on one side and on the other side provide favorable conditions for citizen leisure. But unfortunately these cultural gathering spaces in our society are losing their meaning and importance with time. Like coffee houses and libraries. Dedhee was the most prominent place among the cultural gathering spaces in Hazara division. People used to visit them in order to get something out of these spaces. At present they lie in our cities as places of no interest. Libraries are converted into storage houses where books lie untouched for years and years. The aim of my project is to create unique space that engage community members in the learning and creation process, where people can share their knowledge with others as well as enjoy their personal space. The spaces are flexible enough to accommodate people of different moods and interests, with the purpose of helping communities to become aware of their own cultures and to be socially engaged. The site for this specific project has been selected near Cantonment Park Abbottabad, Pakistan. The city of Abbottabad is famous for its writers, poets and storytellers. The site is selected next to the Cantonment Park, at a central location in the whole city so that it can attract users from almost every point of the city. The project provides a cultural gathering space for the people of the city where they can sit and discuss their ideas within a creative and expressive environment, which can represent the cultures of a community. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cultural%20gathering%20space" title="cultural gathering space">cultural gathering space</a>, <a href="https://publications.waset.org/abstracts/search?q=Dedhee" title=" Dedhee"> Dedhee</a>, <a href="https://publications.waset.org/abstracts/search?q=Hazara%20literature" title=" Hazara literature"> Hazara literature</a>, <a href="https://publications.waset.org/abstracts/search?q=intellectuals%E2%80%99%20hub" title=" intellectuals’ hub"> intellectuals’ hub</a> </p> <a href="https://publications.waset.org/abstracts/34719/redefining-dedhee-in-terms-of-knowledge-gathering-and-conserving-hazara-literature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34719.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">392</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">9984</span> Efficient Variable Modulation Scheme Based on Codebook in the MIMO-OFDM System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim">Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Hyun%20Ro"> Jae-Hyun Ro</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang-Bin%20Ha"> Chang-Bin Ha</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Because current wireless communication requires high reliability in a limited bandwidth environment, this paper proposes the variable modulation scheme based on the codebook. The variable modulation scheme adjusts transmission power using the codebook in accordance with hannel state. Also, if the codebook is composed of many bits, the reliability is more improved by the proposed scheme. The simulation results show that the performance of proposed scheme has better reliability than the the performance of conventional scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20modulation" title=" variable modulation"> variable modulation</a>, <a href="https://publications.waset.org/abstracts/search?q=codebook" title=" codebook"> codebook</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20state" title=" channel state"> channel state</a> </p> <a href="https://publications.waset.org/abstracts/33079/efficient-variable-modulation-scheme-based-on-codebook-in-the-mimo-ofdm-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33079.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">587</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">9983</span> A Cooperative Space-Time Transmission Scheme Based On Symbol Combinations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keunhong%20Chae">Keunhong Chae</a>, <a href="https://publications.waset.org/abstracts/search?q=Seokho%20Yoon"> Seokho Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a cooperative Alamouti space time transmission scheme with low relay complexity for the cooperative communication systems. In the proposed scheme, the source node combines the data symbols to construct the Alamouti-coded form at the destination node, while the conventional scheme performs the corresponding operations at the relay nodes. In simulation results, it is shown that the proposed scheme achieves the second order cooperative diversity while maintaining the same bit error rate (BER) performance as that of the conventional scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Space-time%20transmission" title="Space-time transmission">Space-time transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication%20system" title=" cooperative communication system"> cooperative communication system</a>, <a href="https://publications.waset.org/abstracts/search?q=MIMO." title=" MIMO."> MIMO.</a> </p> <a href="https://publications.waset.org/abstracts/14616/a-cooperative-space-time-transmission-scheme-based-on-symbol-combinations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14616.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">352</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">9982</span> Probabilistic Gathering of Agents with Simple Sensors: Distributed Algorithm for Aggregation of Robots Equipped with Binary On-Board Detectors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ariel%20Barel">Ariel Barel</a>, <a href="https://publications.waset.org/abstracts/search?q=Rotem%20Manor"> Rotem Manor</a>, <a href="https://publications.waset.org/abstracts/search?q=Alfred%20M.%20Bruckstein"> Alfred M. Bruckstein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a probabilistic gathering algorithm for agents that can only detect the presence of other agents in front of or behind them. The agents act in the plane and are identical and indistinguishable, oblivious, and lack any means of direct communication. They do not have a common frame of reference in the plane and choose their orientation (direction of possible motion) at random. The analysis of the gathering process assumes that the agents act synchronously in selecting random orientations that remain fixed during each unit time-interval. Two algorithms are discussed. The first one assumes discrete jumps based on the sensing results given the randomly selected motion direction, and in this case, extensive experimental results exhibit probabilistic clustering into a circular region with radius equal to the step-size in time proportional to the number of agents. The second algorithm assumes agents with continuous sensing and motion, and in this case, we can prove gathering into a very small circular region in finite expected time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=control" title="control">control</a>, <a href="https://publications.waset.org/abstracts/search?q=decentralized" title=" decentralized"> decentralized</a>, <a href="https://publications.waset.org/abstracts/search?q=gathering" title=" gathering"> gathering</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent" title=" multi-agent"> multi-agent</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20sensors" title=" simple sensors"> simple sensors</a> </p> <a href="https://publications.waset.org/abstracts/115199/probabilistic-gathering-of-agents-with-simple-sensors-distributed-algorithm-for-aggregation-of-robots-equipped-with-binary-on-board-detectors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/115199.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">164</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">9981</span> Efficient Relay Selection Scheme Utilizing OVSF Code in Cooperative Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yeong-Seop%20Ahn">Yeong-Seop Ahn</a>, <a href="https://publications.waset.org/abstracts/search?q=Myoung-Jin%20Kim"> Myoung-Jin Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Young-Min%20Ko"> Young-Min Ko</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a relay selection scheme utilizing an orthogonal variable spreading factor (OVSF) code in a cooperative communication. The relay selection scheme influences on the communication performance in the cooperative communication. Conventional relay selection schemes such as the best harmonic mean relay selection scheme or the threshold-based relay selection scheme should know information such as channel state information (CSI) in advance. The proposed relay selection scheme does not require information in advance by using a reference signal utilizing the OVSF code. The simulation result shows that bit error rate (BER) performance of proposed relay selection scheme is similar to the best harmonic mean relay selection scheme that is known as one of the optimal relay selection schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title="cooperative communication">cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=relay%20selection" title=" relay selection"> relay selection</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=OVSF%20code" title=" OVSF code"> OVSF code</a> </p> <a href="https://publications.waset.org/abstracts/32268/efficient-relay-selection-scheme-utilizing-ovsf-code-in-cooperative-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32268.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">637</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">9980</span> Economic Analysis of the Impact of Commercial Agricultural Credit Scheme (CACS) on Farmers Income in Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Titus%20Wuyah%20Yunana">Titus Wuyah Yunana </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study analyzed the impact of commercial agricultural credit scheme on income of beneficiary farmers in Kaduna State using the Net farm income and double difference method. A questionnaire was used to source the data from 306 farmers comprising of 153 beneficiaries and 153 non-beneficiaries. The results indicated that the net farm income of the commercial agricultural credit scheme beneficiaries increases from N15,006,352.00 before scheme to N24,862,585.00 after the first and the second phases of the scheme. There was also an increase in the net farm income of the non-beneficiaries from N9, 670,385.40 to N14, 391,469.00 during the scheme. The double difference method analysis indicated a positive mean income difference value between beneficiaries and nonbeneficiaries after the first and the second phases of the scheme. The study recommends expansion in the number of beneficiaries and efficient allocation and utilization of the resources. The government should also introduce more programs that will assist the farmers to increase their productivity, income and the economy as a whole. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agriculture" title="agriculture">agriculture</a>, <a href="https://publications.waset.org/abstracts/search?q=credit%20scheme" title=" credit scheme"> credit scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=farmers" title=" farmers"> farmers</a>, <a href="https://publications.waset.org/abstracts/search?q=income" title=" income"> income</a>, <a href="https://publications.waset.org/abstracts/search?q=beneficiary" title=" beneficiary"> beneficiary</a> </p> <a href="https://publications.waset.org/abstracts/49104/economic-analysis-of-the-impact-of-commercial-agricultural-credit-scheme-cacs-on-farmers-income-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49104.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">338</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">9979</span> Efficient Signal Detection Using QRD-M Based on Channel Condition in MIMO-OFDM System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae-Jeong%20Kim">Jae-Jeong Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Ki-Ro%20Kim"> Ki-Ro Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an efficient signal detector that switches M parameter of QRD-M detection scheme is proposed for MIMO-OFDM system. The proposed detection scheme calculates the threshold by 1-norm condition number and then switches M parameter of QRD-M detection scheme according to channel information. If channel condition is bad, the parameter M is set to high value to increase the accuracy of detection. If channel condition is good, the parameter M is set to low value to reduce complexity of detection. Therefore, the proposed detection scheme has better trade off between BER performance and complexity than the conventional detection scheme. The simulation result shows that the complexity of proposed detection scheme is lower than QRD-M detection scheme with similar BER performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=QRD-M" title=" QRD-M"> QRD-M</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20condition" title=" channel condition"> channel condition</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a> </p> <a href="https://publications.waset.org/abstracts/3518/efficient-signal-detection-using-qrd-m-based-on-channel-condition-in-mimo-ofdm-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3518.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">370</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">9978</span> Common Fixed Point Results and Stability of a Modified Jungck Iterative Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we introduce a modified Jungck (Dual Jungck) iterative scheme and use the scheme to approximate the unique common fixed point of a pair of generalized contractive-like operators in a Banach space. The iterative scheme is also shown to be stable with respect to the maps (S,T). An example is taken to justify the convergence of the scheme. Our result is a generalization and improvement of several results in the literature on single map T. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20contractive-like%20operators" title="generalized contractive-like operators">generalized contractive-like operators</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20Jungck%20iterative%20scheme" title=" modified Jungck iterative scheme"> modified Jungck iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20results" title=" stability results"> stability results</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20compatible%20maps" title=" weakly compatible maps"> weakly compatible maps</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20common%20fixed%20point" title=" unique common fixed point"> unique common fixed point</a> </p> <a href="https://publications.waset.org/abstracts/68459/common-fixed-point-results-and-stability-of-a-modified-jungck-iterative-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68459.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">348</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">9977</span> The Role Of Data Gathering In NGOs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussaini%20Garba%20Mohammed">Hussaini Garba Mohammed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background/Significance: The lack of data gathering is affecting NGOs world-wide in general to have good data information about educational and health related issues among communities in any country and around the world. For example, HIV/AIDS smoking (Tuberculosis diseases) and COVID-19 virus carriers is becoming a serious public health problem, especially among old men and women. But there is no full details data survey assessment from communities, villages, and rural area in some countries to show the percentage of victims and patients, especial with this world COVID-19 virus among the people. These data are essential to inform programming targets, strategies, and priorities in getting good information about data gathering in any society. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliable%20information" title="reliable information">reliable information</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20assessment" title=" data assessment"> data assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20communication" title=" data communication"> data communication</a> </p> <a href="https://publications.waset.org/abstracts/142105/the-role-of-data-gathering-in-ngos" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142105.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">179</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">9976</span> An Improved Transmission Scheme in Cooperative Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seung-Jun%20Yu">Seung-Jun Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Young-Min%20Ko"> Young-Min Ko</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently developed cooperative diversity scheme enables a terminal to get transmit diversity through the support of other terminals. However, most of the introduced cooperative schemes have a common fault of decreased transmission rate because the destination should receive the decodable compositions of symbols from the source and the relay. In order to achieve high data rate, we propose a cooperative scheme that employs hierarchical modulation. This scheme is free from the rate loss and allows seamless cooperative communication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title="cooperative communication">cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20modulation" title=" hierarchical modulation"> hierarchical modulation</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20data%20rate" title=" high data rate"> high data rate</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission%20scheme" title=" transmission scheme"> transmission scheme</a> </p> <a href="https://publications.waset.org/abstracts/43021/an-improved-transmission-scheme-in-cooperative-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43021.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">425</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">9975</span> Flood Modeling in Urban Area Using a Well-Balanced Discontinuous Galerkin Scheme on Unstructured Triangular Grids</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rabih%20Ghostine">Rabih Ghostine</a>, <a href="https://publications.waset.org/abstracts/search?q=Craig%20Kapfer"> Craig Kapfer</a>, <a href="https://publications.waset.org/abstracts/search?q=Viswanathan%20Kannan"> Viswanathan Kannan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20Hoteit"> Ibrahim Hoteit</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Urban flooding resulting from a sudden release of water due to dam-break or excessive rainfall is a serious threatening environment hazard, which causes loss of human life and large economic losses. Anticipating floods before they occur could minimize human and economic losses through the implementation of appropriate protection, provision, and rescue plans. This work reports on the numerical modelling of flash flood propagation in urban areas after an excessive rainfall event or dam-break. A two-dimensional (2D) depth-averaged shallow water model is used with a refined unstructured grid of triangles for representing the urban area topography. The 2D shallow water equations are solved using a second-order well-balanced discontinuous Galerkin scheme. Theoretical test case and three flood events are described to demonstrate the potential benefits of the scheme: (i) wetting and drying in a parabolic basin (ii) flash flood over a physical model of the urbanized Toce River valley in Italy; (iii) wave propagation on the Reyran river valley in consequence of the Malpasset dam-break in 1959 (France); and (iv) dam-break flood in October 1982 at the town of Sumacarcel (Spain). The capability of the scheme is also verified against alternative models. Computational results compare well with recorded data and show that the scheme is at least as efficient as comparable second-order finite volume schemes, with notable efficiency speedup due to parallelization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dam-break" title="dam-break">dam-break</a>, <a href="https://publications.waset.org/abstracts/search?q=discontinuous%20Galerkin%20scheme" title=" discontinuous Galerkin scheme"> discontinuous Galerkin scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=flood%20modeling" title=" flood modeling"> flood modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=shallow%20water%20equations" title=" shallow water equations"> shallow water equations</a> </p> <a href="https://publications.waset.org/abstracts/99241/flood-modeling-in-urban-area-using-a-well-balanced-discontinuous-galerkin-scheme-on-unstructured-triangular-grids" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99241.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">175</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">9974</span> Improved Performance of Cooperative Scheme in the Cellular and Broadcasting System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyun-Jee%20Yang">Hyun-Jee Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Bit-Na%20Kwon"> Bit-Na Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim"> Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the cooperative transmission scheme, both the cellular system and broadcasting system are composed. Two cellular base stations (CBSs) communicating with a user in the cell edge use cooperative transmission scheme in the conventional scheme. In the case that the distance between two CBSs and the user is distant, the conventional scheme does not guarantee the quality of the communication because the channel condition is bad. Therefore, if the distance between CBSs and a user is distant, the performance of the conventional scheme is decreased. Also, the bad channel condition has bad effects on the performance. The proposed scheme uses two relays to communicate well with CBSs when the channel condition between CBSs and the user is poor. Using the relay in the high attenuation environment can obtain both advantages of the high bit error rate (BER) and throughput performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communications" title="cooperative communications">cooperative communications</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity%20gain" title=" diversity gain"> diversity gain</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=interworking%20system" title=" interworking system"> interworking system</a> </p> <a href="https://publications.waset.org/abstracts/32055/improved-performance-of-cooperative-scheme-in-the-cellular-and-broadcasting-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32055.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">576</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">9973</span> Addressing Scheme for IOT Network Using IPV6 </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Zormati">H. Zormati</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Chebil"> J. Chebil</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Bel%20Hadj%20Taher"> J. Bel Hadj Taher</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this paper is to present an addressing scheme that allows for assigning a unique IPv6 address to each node in the Internet of Things (IoT) network. This scheme guarantees uniqueness by extracting the clock skew of each communication device and converting it into an IPv6 address. Simulation analysis confirms that the presented scheme provides reductions in terms of energy consumption, communication overhead and response time as compared to four studied addressing schemes Strong DAD, LEADS, SIPA and CLOSA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=addressing" title="addressing">addressing</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=IPv6" title=" IPv6"> IPv6</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a>, <a href="https://publications.waset.org/abstracts/search?q=nodes" title=" nodes"> nodes</a> </p> <a href="https://publications.waset.org/abstracts/64383/addressing-scheme-for-iot-network-using-ipv6" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64383.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">293</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">9972</span> An Improved Cooperative Communication Scheme for IoT System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eui-Hak%20Lee">Eui-Hak Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Hyun%20Ro"> Jae-Hyun Ro</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In internet of things (IoT) system, the communication scheme with reliability and low power is required to connect a terminal. Cooperative communication can achieve reliability and lower power than multiple-input multiple-output (MIMO) system. Cooperative communication increases the reliability with low power, but decreases a throughput. It has a weak point that the communication throughput is decreased. In this paper, a novel scheme is proposed to increase the communication throughput. The novel scheme is a transmission structure that increases transmission rate. And a decoding scheme according to the novel transmission structure is proposed. Simulation results show that the proposed scheme increases the throughput without bit error rate (BER) performance degradation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title="cooperative communication">cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=STBC" title=" STBC"> STBC</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission%20rate" title=" transmission rate"> transmission rate</a> </p> <a href="https://publications.waset.org/abstracts/32937/an-improved-cooperative-communication-scheme-for-iot-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32937.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">396</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">9971</span> Efficient Single Relay Selection Scheme for Cooperative Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi">Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyun-Jun%20Shin"> Hyun-Jun Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a single relay selection scheme in cooperative communication. Decode and forward scheme is considered when a source node wants to cooperate with a single relay for data transmission. To use the proposed single relay selection scheme, the source node make a little different pattern signal which is not complex pattern and broadcasts it. The proposed scheme does not require the channel state information between the source node and candidates of the relay during the relay selection. Therefore, it is able to be used in many fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relay%20selection" title="relay selection">relay selection</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20communication" title=" cooperative communication"> cooperative communication</a>, <a href="https://publications.waset.org/abstracts/search?q=df" title=" df"> df</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20codes" title=" channel codes"> channel codes</a> </p> <a href="https://publications.waset.org/abstracts/3523/efficient-single-relay-selection-scheme-for-cooperative-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3523.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">670</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">9970</span> A Laser Transmitter Scheme with a Right Angled Mirror</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaemyoung%20Lee">Jaemyoung Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a stable laser scanning leveler transmitter scheme. In the proposed scheme, the transmitter has a right angled mirror which can eliminates the mechanical up and down vibration from scanning the mirror of the transmitter. In this paper, the mathematical proof for the proposed scheme which is not disturbed by the swivel movement of the right angled mirror is derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=leveler" title="leveler">leveler</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20angled%20mirror" title=" right angled mirror"> right angled mirror</a>, <a href="https://publications.waset.org/abstracts/search?q=sweeping" title=" sweeping"> sweeping</a>, <a href="https://publications.waset.org/abstracts/search?q=laser" title=" laser"> laser</a> </p> <a href="https://publications.waset.org/abstracts/18199/a-laser-transmitter-scheme-with-a-right-angled-mirror" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18199.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">375</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">9969</span> Dimensions of Public Spaces: Feelings through Human Senses</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Piyush%20Hajela">Piyush Hajela</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The significance of public spaces is on a rise in Indian cities as a strong interaction space across cultures and community. It is a pertinent gathering space for people across age and gender, where the face keeps changing with time. A public space is directly related to the social dimension, people, comfort, safety, and security, that, it proposes to provide, as inherent qualities. The presence of these and other dimensions of space, together with related equitable environments, impart certain quality to a public space. The higher the optimum contents of these dimensions, the better the quality of public space. Public is represented by PEOPLE through society and community, and space is created by dimensions. Society contains children, women and the elderly, community is composed of social, and religious groups. These behave differently in a different setting and call for varied quality of spaces, created and generated. Public spaces are spread across a city and have more or less established their existence and prominence in a social set up. While few of them are created others are discovered by the people themselves in their constant search for desirable interactive public spaces. These are the most sought after gathering spaces that have the quality of promoting social interaction, providing free accessibility, provide desirable scale etc. The emergence of public space dates back to the times when people started forming communities, display cultures and traditions publicly, gathered for religious observations and celebrations, and address the society. Traditional cities and societies in India were feudal and orthodox in their nature and yet had public spaces. When the gathering of people at one point in a city became more frequent the point became more accessible and occupied. Baras (large courts, Chowks (public squares) and Maidans (large grounds) became well-known gathering spaces in the towns and cities. As the population grew such points grew in number, each becoming a public space in itself and with a different and definite social character. The author aims at studying the various dimensions of public spaces with which a public space has power to hold people for a significant period of time. The human senses here are note referred to as taste, sight, hearing, touch or smell, but how human senses collectively respond to when stationed in a given public space. The collectives may reflect in dimensions like comfort, safety, environment, freedom etc. Various levels of similar other responses would be studied through interviews, observations and other scientific methods for both qualitative and quantitative analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=society" title="society">society</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction" title=" interaction"> interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=people" title=" people"> people</a>, <a href="https://publications.waset.org/abstracts/search?q=accessibility" title=" accessibility"> accessibility</a>, <a href="https://publications.waset.org/abstracts/search?q=comfort" title=" comfort"> comfort</a>, <a href="https://publications.waset.org/abstracts/search?q=enclosure" title=" enclosure"> enclosure</a> </p> <a href="https://publications.waset.org/abstracts/17928/dimensions-of-public-spaces-feelings-through-human-senses" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17928.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">456</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">9968</span> Compact Finite Difference Schemes for Fourth Order Parabolic Partial Differential Equations </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sufyan%20Muhammad">Sufyan Muhammad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, in achieving highly efficient but at the same time highly accurate solutions has become the major target of numerical analyst community. The concept is termed as compact schemes and has gained great popularity and consequently, we construct compact schemes for fourth order parabolic differential equations used to study vibrations in structures. For the superiority of newly constructed schemes, we consider range of examples. We have achieved followings i.e. (a) numerical scheme utilizes minimum number of stencil points (which means new scheme is compact); (b) numerical scheme is highly accurate (which means new scheme is reliable) and (c) numerical scheme is highly efficient (which means new scheme is fast). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20finite%20differences" title="central finite differences">central finite differences</a>, <a href="https://publications.waset.org/abstracts/search?q=compact%20schemes" title=" compact schemes"> compact schemes</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernoulli%27s%20equations" title=" Bernoulli's equations"> Bernoulli's equations</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20differences" title=" finite differences"> finite differences</a> </p> <a href="https://publications.waset.org/abstracts/55343/compact-finite-difference-schemes-for-fourth-order-parabolic-partial-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55343.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">288</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=human%20gathering%20scheme&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&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=human%20gathering%20scheme&page=333">333</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&page=334">334</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=human%20gathering%20scheme&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>